Thumbnail
Access Restriction
Subscribed

Author Allen, F. E. ♦ Cocke, J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Algorithms ♦ Program optimization ♦ Data flow analysis ♦ Flow graphs ♦ Compilers
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.
Description Affiliation: IBM Thomas J. Watson Research Center, Yorktown Heights, NY (Allen, F. E.; Cocke, J.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 19
Issue Number 3


Open content in new tab

   Open content in new tab
Source: ACM Digital Library