The static analysis of imperative programs is made difficult by the unrestricted pointer structures which makes their analysis imprecise. A static analysis approach is proposed for a class of graph-like data structures, for which the programmer infuses extra structural information in their description using a Markov algorithm. The method is illustrated with an example.
|Title of host publication||Languages and Compilers for Parallel Computing|
|Subtitle of host publication||10th International Workshop, LCPC'97 Minneapolis, Minnesota, USA, August 7–9, 1997 Proceedings|
|Editors||Zhiyuan Li, Pen-Chung Yew, Siddharta Chatterjee, Chua-Huang Huang, P. Sadayappan, David Sehr|
|Place of Publication||Berlin, Heidelberg|
|Publisher||Springer Berlin Heidelberg|
|Number of pages||4|
|Publication status||Published - 1998|