Effective partial redundancy elimination
- 1 June 1994
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 29 (6) , 159-170
- https://doi.org/10.1145/178243.178257
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Partial dead code eliminationACM SIGPLAN Notices, 1994
- Lazy code motionACM SIGPLAN Notices, 1992
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- A data locality optimizing algorithmACM SIGPLAN Notices, 1991
- Practical adaption of the global optimization algorithm of Morel and RenvoiseACM Transactions on Programming Languages and Systems, 1991
- Constant propagation with conditional branchesACM Transactions on Programming Languages and Systems, 1991
- 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
- Multiplication by integer constantsSoftware: Practice and Experience, 1986
- Register allocation via coloringComputer Languages, 1981
- Global optimization by suppression of partial redundanciesCommunications of the ACM, 1979