Partial dead code elimination
- 1 June 1994
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 147-158
- https://doi.org/10.1145/178243.178256
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- A variation of Knoop, Rüthing, and Steffen's Lazy Code MotionACM SIGPLAN Notices, 1993
- 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 usually linear algorithm for register assignment using edge placement of load and store instructionsComputer Languages, 1990
- Register assignment using code placement techniquesComputer Languages, 1988
- 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
- Global optimization by suppression of partial redundanciesCommunications of the ACM, 1979
- On Live-Dead Analysis for Global Data Flow ProblemsJournal of the ACM, 1977
- Code Generation for Expressions with Common SubexpressionsJournal of the ACM, 1977
- Global Data Flow Analysis and Iterative AlgorithmsJournal of the ACM, 1976