Precise interprocedural dataflow analysis via graph reachability

@inproceedings{Reps1995PreciseID,
  title={Precise interprocedural dataflow analysis via graph reachability},
  author={T. Reps and Susan Horwitz and S. Sagiv},
  booktitle={POPL '95},
  year={1995}
}
The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time by transforming them into a special kind of graph-reachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow functions must distribute over the confluence operator (either union or intersection). This class of probable problems includes—but is not limited to—the classical separable problems (also known as “gen… Expand
1,042 Citations
Bebop: a path-sensitive interprocedural dataflow engine
  • 79
  • Highly Influenced
  • PDF
Subcubic Certificates for CFL Reachability
  • 1
  • PDF
Demand-driven interprocedural analysis for map-based abstract domains
  • PDF
Context-sensitive data-dependence analysis via linear conjunctive language reachability
  • 30
  • PDF
Interprocedural data flow analysis in Soot using value contexts
  • 38
  • Highly Influenced
  • PDF
Optimal Interprocedural Program Optimization
  • J. Knoop
  • Computer Science
  • Lecture Notes in Computer Science
  • 1998
  • 7
Data flow frequency analysis
  • 74
Infeasible paths in object-oriented programs
  • F. Tip
  • Computer Science
  • Sci. Comput. Program.
  • 2015
  • 6
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
Pointer-induced aliasing: a problem classification
  • 253
  • Highly Influential
  • PDF
Efficient and optimal bit-vector data flow analyses: A uniform interprocedural framework,
  • Bericht Nr
  • 1993
Fast interprocedural alias analysis,
  • Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, (Austin,
  • 1989
Crafting a Compiler, Benjamin/Cummings Publishing
  • 1988
S.W.K., “Code generation using tree matching and dynamic programming,
  • ACM Trans. Program. Lang. Syst
  • 1989
Invariance of approximative semantics with respect to program transformation,
  • 1981