Transformations on Loop-Free Program Schemata.

摘要

A formal theoretical approach toward code optimization is considered. A program schema that models loop-free programs is presented and a complete set of equivalence preserving transformations on loop-free programs is found. A scheme for optimization is provided in which a sequence of these transformations is applied to get an optimal code. These results are extended to the model of loop-free programs which assumes that certain types of algebraic laws hold among the operators,and also to the case in which the tests are Boolean functions of elementary tests. (Author)