The power of assignment motion
- 1 June 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 30 (6) , 233-245
- https://doi.org/10.1145/223428.207150
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Effective partial redundancy eliminationPublished by Association for Computing Machinery (ACM) ,1994
- A variation of Knoop, Rüthing, and Steffen's Lazy Code MotionACM SIGPLAN Notices, 1993
- An elimination algorithm for bidirectional data flow problems using edge placementACM Transactions on Programming Languages and Systems, 1993
- How to analyze large programs efficiently and informativelyACM SIGPLAN Notices, 1992
- Practical adaption of the global optimization algorithm of Morel and RenvoiseACM 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 fast algorithm for code movement optimisationACM SIGPLAN Notices, 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
- Code motion of control structures in high-level languagesPublished by Association for Computing Machinery (ACM) ,1986