Global code motion/global value numbering
- 1 June 1995
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 30 (6) , 246-257
- https://doi.org/10.1145/207110.207154
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Partial dead code eliminationPublished by Association for Computing Machinery (ACM) ,1994
- Constant propagation with conditional branchesACM Transactions on Programming Languages and Systems, 1991
- The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languagesPublished by Association for Computing Machinery (ACM) ,1990
- An efficient method of computing static single assignment formPublished by Association for Computing Machinery (ACM) ,1989
- A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”ACM Transactions on Programming Languages and Systems, 1988
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987
- Register allocation & spilling via graph coloringPublished by Association for Computing Machinery (ACM) ,1982
- Global optimization by suppression of partial redundanciesCommunications of the ACM, 1979
- A fast algorithm for finding dominators in a flowgraphACM Transactions on Programming Languages and Systems, 1979
- Testing flow graph reducibilityJournal of Computer and System Sciences, 1974