Date: 2001-04-10
Easter break.
Date: 2001-04-17
M. Emami, R. Ghiya, and L. Hendren.
Context-sensitive interprocedural points-to analysis in the presence of function pointers.
In Proceedings of the SIGPLAN '94 Conference on Program Language Design and
Implementation, Orlando, FL, June 1994.
local copy
(local access only)
Date: 2001-04-24
Room: 1106
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
(local access only)
Alexander Aiken, Introduction to Set Constraint-Based Program Analysis Science of Computer Programming, 35(1999):79-111, 1999. local copy (local access only)
Date: 2001-05-08
Room: 1106
R. P. Wilson and M. S. Lam,
Efficient Context-Sensitive Pointer Analysis for C Programs (PostScript)
Proceedings of the ACM SIGPLAN'95 Conference on Programming Language Design and Implementation, June, 1995.
local copy (PDF)
(local access only)
J. S. Foster, M. Fahndrich, and A. Aiken. Polymorphic versus Monomorphic Flowinsensitive Points-to Analysis for C. Technical report, University of California, Berkeley, Apr. 2000. local copy (PDF) (local access only)
Date: 2001-05-15
Room: 1106
Cormac Flanagan.
Effective Static Debugging via Componential Set-Based Analysis
TR97-287, August 28, 1997
local copy (PDF)
READ: sections 2.0 - 2.4, 3.0 - 3.5 also interesting are sections 2.5 - 2.7.
J. S. Foster, M. Fahndrich, and A. Aiken.
Polymorphic versus Monomorphic Flowinsensitive Points-to Analysis for C.
Technical report, University of California, Berkeley, Apr. 2000.
local copy (PDF)
(local access only)
READ: The sections about set-based analysis and compare with the thesis by Flanagan.
Manuvir Das Unification-based pointer analysis with directional assignments In Proceedings of the SIGPLAN '00 Conference on Program Language Design and Implementation, June 18 - 21, 2000, Vancouver, BC Canada Pages 35 - 46 local copy (local access only)
Date: 2001-05-29
Room: 1106
Nevin Heintze and Olivier Tardieu,
Ultra-fast Aliasing Analysis using CLA: A Million Lines of C Code in a Second,
to appear PLDI'01.
Nevin Heintze and Olivier Tardieu, Demand-Driven Pointer Analysis, with Olivier Tardieu, to appear PLDI'01.
Date: 2001-05-29
Room: 1106
Reps, T.,
Program analysis via graph reachability.
TR-1386, Computer Sciences Department, University of Wisconsin, Madison, WI, August 1998.
(Section 4.3 less important.)
Heintze and Tardieu: Does the exhaustive analysis compute the transitive closure?