Staging Static Analyses for Program Generation (Extended Version)

Kamin, Samuel; Aktemur, T. Baris; Katelman, Michael

Permalink

https://hdl.handle.net/2142/11252 Copy

Description

Title

Staging Static Analyses for Program Generation (Extended Version)

Author(s)

• Kamin, Samuel
• Aktemur, T. Baris
• Katelman, Michael

Issue Date

2006-09

Keyword(s)

computer science

Abstract

Program generators are most naturally specified using a quote/antiquote facility; the programmer writes programs with holes which are filled in, at program generation time, by other program fragments. If the programs are generated at compile-time, analysis and compilation follow generation, and no changes in the compiler are needed. However, if program generation is done at run time, compilation and analysis need to be optimized so that they will not overwhelm overall execution time. In this paper, we give a compositional framework for defining program analyses which leads directly to a method of staging these analyses. The staging allows the analysis of incomplete programs to be started at compile time; the residual work to be done at run time may be much less costly than the full analysis. We give frameworks for forward and backward analyses, present several examples of specific analyses, and give timing results showing significant speed-ups for the run-time portion of the analysis relative to the full analysis.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11252

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections