A Program Data Flow Analysis Procedure

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.

CACM March, 1976

Allen, J. E.
Cocke, J.

program optimization, data flow analysis,
flow graphs, algorithms, compilers

4.12 5.24

CA760303 JB January 5, 1978  8:33 AM

2877	5	2877
2877	5	2877
2877	5	2877
3103	5	2877
1860	6	2877
2877	6	2877