Interprocedural optimization

Known as: Interprocedural analysis, LTO, Link-time optimization 
Interprocedural optimization (IPO) is a collection of compiler techniques used in computer programming to improve performance in programs containing… (More)
Wikipedia

Related topics

Related topics

26 relations
ALGOLAPLCentral processing unitClang
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Interprocedural analysis of asynchronous programs
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Interprocedural Optimization for Dynamic Hardware Configurations
Little research in compiler optimizations has been undertaken to eliminate or diminish the negative influence on performance of… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Precise interprocedural analysis through linear algebra
We apply linear algebra techniques to precise interprocedural dataflow analysis. Specifically, we describe analyses that… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Fast Interprocedural Class Analysis
Previous algorithms for interprocedural control flow analysis of higher-order and/or object-oriented languages have been… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Precise Interprocedural Chopping
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Demand Interprocedural Program Analysis Using Logic Databases
Interprocedural analysis concerns the static examination of a program that consists of multiple procedures. Its purpose is to… (More)
  • figure 1
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Interprocedural Slicing Using Dependence Graphs
The notion of a <italic>program slice</italic>, originally introduced by Mark Weiser, is useful in program debugging, automatic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
An Interval-Based Approach to Exhaustive and Incremental Interprocedural Data-Flow Analysis
We reformulate interval analysis so that it can he applied to any monotone data-flow problem, including the nonfast problems of… (More)
  • figure 1
  • figure 6
  • figure 10
  • figure 11
  • figure 13
Is this relevant?
1989
1989
Interprocedural Optimization: Experimental Results
The problem of tracking data flow across procedure boundaries has a long history of theoretical study by people who believed that… (More)
  • table I
  • table 11
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Interprocedural optimization: eliminating unnecessary recompilation
While efficient new algorithms for interprocedural data flow analysis have made these techniques practical for use in production… (More)
  • figure 1
Is this relevant?