This collection of papers was used in a reading-course given during spring 2001.
One of the most important applications of interprocedural analysis (for imperative languages) is alias analysis, i.e., to determine whether two pointers in a program may refer to the same object. Most of the papers in this list focus on alias analysis.
If you are interested in analysing other properties of a program, it can still be useful to know something about alias analysis, as it can be used to compute the call graph of a program (taking function pointers into account).
The paper by Emami et al. is not publicly available. You need an ACM account, or local access, to access the paper. All other papers should be accessible.
M. Emami, R. Ghiya, and L. Hendren.
Context-sensitive interprocedural points-to analysis in the presence of function pointers.
PLDI'94, Orlando, FL, June 1994.
ACM copy.
Local copy.
Michael Hind, Michael Burke, Paul Carini, and Jong-Deok Choi,
Interprocedural Pointer Alias Analysis,
ACM TOPLAS, 21(4), July 1999, Pages 848-894.
Local copy.
Alexander Aiken,
Introduction to Set Constraint-Based Program Analysis,
Science of Computer Programming, 35(1999):79-111, 1999.
Local copy.
R. P. Wilson and M. S. Lam,
Efficient Context-Sensitive Pointer Analysis for C Programs,
PLDI'95, June, 1995.
Local copy.
J. S. Foster, M. Fahndrich, and A. Aiken.
Polymorphic versus Monomorphic Flow-insensitive Points-to Analysis for C.
Technical report, University of California, Berkeley, April 2000.
Local copy.
Cormac Flanagan,
Effective Static Debugging via Componential Set-Based Analysis,
TR97-287, August 28, 1997.
Local copy.
Manuvir Das,
Unification-based pointer analysis with directional assignments,
PLDI'00, , June 18 - 21, Vancouver, BC Canada
Pages 35 - 46, 2000.
Local copy.
Nevin Heintze and Olivier Tardieu,
Ultra-fast Aliasing Analysis using CLA: A Million Lines of C Code in a Second,
PLDI'01, Snowbird, Utah, 2001.
Nevin Heintze and Olivier Tardieu,
Demand-Driven Pointer Analysis,
PLDI'01, Snowbird, Utah, 2001.
Reps, T.,
Program analysis via graph reachability.
TR-1386, Computer Sciences Department, University of Wisconsin, Madison, WI, August 1998.