A Completeness Theorem for Straight-Line Programs with Structured Variables

Authors:
Christoph M. Hoffmann;Lawrence H. Landweber
Affiliations:
Computer Science Department, University of Waterloo, Waterloo, Canada and University of Wisconsin, Madison, Wisconsin;Computer Science Department, University of Wisconsin, 1210 West Dayton Street, Madison, WI
Venue:
Journal of the ACM (JACM)
Year:
1976

Citing 7
Cited 1

The Generation of Optimal Code for Arithmetic Expressions

Journal of the ACM (JACM)
An axiomatic approach to code optimization for expressions

Journal of the ACM (JACM)
Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)
Testing for the Church-Rosser Property

Journal of the ACM (JACM)
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Complete register allocation problems

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Axiomatic code optimization in the presence of structured variables.

Axiomatic code optimization in the presence of structured variables.

Assignment Commands with Array References

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A program scheme which models straight-line code admitting structured variables such as arrays, lists, and queues is considered. A set of expressions is associated with a program reflecting the input-output transformations. A basic set of axioms is given and program equivalence is defined in terms of expression equivalence. Program transformations are then defined such that two programs are equivalent if and only if one program can be transformed to the other via the transformations. An application of these results to code optimization is then discussed.