Transformations on straight line programs - (Preliminary Version)

Authors:
A. V. Aho;J. D. Ullman
Affiliations:
Bell Telephone Laboratories, Incorporated, Murray Hill, New Jersey;Princeton University, Princeton, New Jersey
Venue:
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Year:
1970

Citing 4
Cited 6

On Ianov's Program Schemata

Journal of the ACM (JACM)
Object code optimization

Communications of the ACM
Optimization of expressions in Fortran

Communications of the ACM
On the automatic simplification of computer programs

Communications of the ACM

Validating register allocations for straight line programs

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
A formal approach to code optimization

Proceedings of a symposium on Compiler optimization
Bibliography

Record of the Project MAC conference on concurrent systems and parallel computation
Multiple evaluators in an extensible programming system

AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
The computational complexity of program schemata

Journal of Computer and System Sciences
Equivalence of programs with structured variables

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a program schema that models straight line intermediate level code. A complete set of equivalence preserving transformations on programs is found for the case in which programs are equivalent if and only if their output functions are identical. This result is extended to the case in which programs are deemed equivalent if their output functions can be shown equivalent under a fixed set of algebraic laws. It is also shown that in the no algebra case and in cases where certain types of algebraic identities are allowed the problem of finding optimal code under a reasonable cost function can be reduced to finding a desired sequence of topological and algebraic transformations on programs.