A new approach to data flow analysis of procedural pro-grams and programs with recursive data structures is described. The method depends on simulation of the in-terpreter for the subject programming language using a retrieval function to approximate a program’s data structures. 1