article · 1993

Interprocedural optimization: eliminating unnecessary recompilation

Michael Burke

Cited by 0Abstract and details only

Abstract

While efficient new algorithms for interprocedural data-flow analysis have made these techniques practical for use in production compilation systems,a new problem has arisen: collecting and using interprocedural information in a compiler introduces subtle dependence among the proceduresof a program. If the compiler dependson interprocedural information to optimize a given module, a subsequentediting changeto another module in the program may changethe interprocedural information and necessitaterecompilation. To avoid having to recompile every module in a program in responseto a single editing changeto one module, we have developed techniquesto more precisely determine which compilations have actually beeninvalidated by a changeto the program’s source.This paper presents a general recoi-npzlatton test to determine which proceduresmust be compiled in responseto a series of editing changes.Three different implementation strategies, which demonstrate the fundamental tradeoff between the cost of analysis and the precision of the resulting test, are also discussed.

Cite this paper

APA 7

Burke, M. (1993). Interprocedural optimization: eliminating unnecessary recompilation.

MLA 9

Burke, Michael. “Interprocedural optimization: eliminating unnecessary recompilation.” 1993.

Chicago

Burke, Michael. 1993. “Interprocedural optimization: eliminating unnecessary recompilation.”

Harvard

Burke, M. (1993) ‘Interprocedural optimization: eliminating unnecessary recompilation’.

BibTeX

@article{burke1993interprocedural,
  title = {{Interprocedural optimization: eliminating unnecessary recompilation}},
  author = {Burke, Michael},
  year = {1993}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.