Static Analysis of Recursive Data Structures

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.