A MATHEMATICAL THEORY OF GLOBAL PROGRAM OPTIMIZATION

Contents:

Part I: Theoretical Foundations

1. Preliminary notation

2. Weak ordering associated with a graph

3. Dominance, partitions and intervals of graphs

4. Derived intervals, reducible and irreducible graphs

5. Vertex ordering algorithms

6. Lattice algebra and the reduction of irreducible graphs

7. The connectivity matrix and prime cycles

Part II: Applications to Global Program Analysis

8. Data flow analysis: Dependency and redundancy educations

9. Constant subsumption, common subexpression suppression, and code motion

10. Loop optimization: Invariant expression removal and reduction in strength of operators

11. Safety, profitability and execution frequency considerations

12. Subroutine linkages

13. The elimination of dead code and the allocation of storage and registers