-
- F. E. Allen
- IBM Thomas J. Watson Research Center, Yorktown Heights, NY
-
- J. Cocke
- IBM Thomas J. Watson Research Center, Yorktown Heights, NY
書誌事項
- 公開日
- 1976-03
- 権利情報
-
- https://www.acm.org/publications/policies/copyright_policy#Background
- DOI
-
- 10.1145/360018.360025
- 公開者
- Association for Computing Machinery (ACM)
この論文をさがす
説明
<jats:p>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.</jats:p>
収録刊行物
-
- Communications of the ACM
-
Communications of the ACM 19 (3), 137-, 1976-03
Association for Computing Machinery (ACM)
