A new algorithm for partial redundancy elimination based on SSA form
- 1 May 1997
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Global code motion/global value numberingPublished by Association for Computing Machinery (ACM) ,1995
- A linear time algorithm for placing φ-nodesPublished by Association for Computing Machinery (ACM) ,1995
- Beyond induction variablesACM Transactions on Programming Languages and Systems, 1995
- Partial dead code eliminationPublished by Association for Computing Machinery (ACM) ,1994
- A variation of Knoop, Rüthing, and Steffen's Lazy Code MotionACM SIGPLAN Notices, 1993
- How to analyze large programs efficiently and informativelyPublished by Association for Computing Machinery (ACM) ,1992
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- Constant propagation with conditional branchesACM Transactions on Programming Languages and Systems, 1991
- Detecting equality of variables in programsPublished by Association for Computing Machinery (ACM) ,1988
- Global optimization by suppression of partial redundanciesCommunications of the ACM, 1979