Finding effective compilation sequences
- 11 June 2004
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 39 (7), 231-239
- https://doi.org/10.1145/997163.997196
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Operator strength reductionACM Transactions on Programming Languages and Systems, 2001
- A fast Fourier transform compilerACM SIGPLAN Notices, 1999
- An approach for exploring code improving transformationsACM Transactions on Programming Languages and Systems, 1997
- Critical behavior in the computational cost of satisfiability testingArtificial Intelligence, 1996
- Effective partial redundancy eliminationACM SIGPLAN Notices, 1994
- Lazy code motionACM SIGPLAN Notices, 1992
- Constant propagation with conditional branchesACM Transactions on Programming Languages and Systems, 1991
- Spill code minimization techniques for optimizing compliersACM SIGPLAN Notices, 1989
- The Design and Application of a Retargetable Peephole OptimizerACM Transactions on Programming Languages and Systems, 1980
- Global optimization by suppression of partial redundanciesCommunications of the ACM, 1979