A program data flow analysis procedure
Communications of the ACM1976Vol. 19(3), pp. 137–137
Citations Over TimeTop 1% of 1976 papers
Abstract
The global data relationships in a program can be exposed and codified by the static analysis methods described in this paper. A procedure is given which determines all the definitions which can possibly “reach” each node of the control flow graph of the program and all the definitions that are “live” on each edge of the graph. The procedure uses an “interval” ordered edge listing data structure and handles reducible and irreducible graphs indistinguishably.
Related Papers
- → A program data flow analysis procedure(1976)406 cited
- → Structural analysis: A new approach to flow analysis in optimizing compilers(1980)73 cited
- → Static Control Flow Analysis of Binary Codes(2010)2 cited
- → Termination analysis and call graph construction for higher-order functional programs(2007)2 cited
- Method for Static Function Call Analysis with Control Flow(2011)