CS304: Compilers

9.4: Global Intermediate Code Optimizations: Definitions and Examples

• University of California, Berkeley: Paul Hilfinger's "Global Optimization" URL

  Read these slides. Global optimization uses forward analysis (e.g., constant propagation), which moves information forward, and backward analysis (e.g., liveness), which moves information backward. Note slide 5, which states that dynamic properties of a program are undecidable.

• Stanford University: Keith Schwarz's "Code Optimization", "Global Optimization", and "Global Optimization II" URL

  • Code Optimization
  • Global Optimization
  • Global Optimization II
    

  Read these pages, which cover the material in more detail and present it in a unified formal way using semilattices.
  

• Massachusetts Institute of Technology: S. Amarasinghe and M. Rinard's "Introduction to Dataflow Analysis" and "Foundations of Dataflow Analysis" URL

  • Introduction to Dataflow Analysis
  • Foundations of Dataflow Analysis
    

  Read these slides. They repeat some of the material from above readings. However, they are an excellent review, and go into detail on the formalism that underlies global optimizations.