An approach to ordering optimizing transformations
- 1 February 1990
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 25 (3), 137-146
- https://doi.org/10.1145/99163.99179
Abstract
As an approach to deriving an application order of optimizing transformations, a framework is developed for examining the interactions of the transformations. The framework is based on an axiomatic specification technique and includes both pre-conditions and post conditions that must exist before and after applying optimizations. For a selected set of optimizations, the framework is used to determine those interactions among the optimizations that can create conditions and those that can destroy conditions for applying other optimizations. From these interactions, an application order is derived to obtain the potential benefits of the optimizations that can be applied to a program. In some cases, the ordering of a pair of optimizations is unambiguous in that one optimization can either create or destroy the conditions for the other. In the few cases where there is a cyclic interaction, the ordering is resolved based on the perceived importance of the two optimizations.Keywords
This publication has 8 references indexed in Scilit:
- A development environment for horizontal microcodeIEEE Transactions on Software Engineering, 1988
- Integrating code generation and peephole optimizationActa Informatica, 1988
- Automatic translation of FORTRAN programs to vector formACM Transactions on Programming Languages and Systems, 1987
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987
- Data dependence and its application to parallel processingInternational Journal of Parallel Programming, 1987
- Advanced compiler optimizations for supercomputersCommunications of the ACM, 1986
- Program Improvement by Source-to-Source TransformationJournal of the ACM, 1977
- An axiomatic basis for computer programmingCommunications of the ACM, 1969