A program data flow analysis procedure
Frances E. Allen, John Cocke · Communications of the ACM · 1976
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.
Cited by 411 works. doi:10.1145/360018.360025 Open-access PDF
Authors
References
- Lecture Notes in Computer Science 1205
- An empirical study of FORTRAN programs
- The Theory of Parsing, Translation, and Compiling
- A unified approach to global program optimization
- Control flow analysis
- Programming languages and their compilers: Preliminary notes
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- Flow Graph Reducibility
- A global flow analysis algorithm
- Interprocedural Data Flow Analysis.