(Enter summary)
Abstract: Known algorithms for pointer analysis are "global" in the
sense that they perform an exhaustive analysis of a program
or program component. In this paper we introduce a
demand-driven approach for pointer analysis. Specifically,
we describe a demand-driven flow-insensitive, subset-based,
context-insensitive points-to analysis. Given a list of pointer
variables (a query), our analysis performs just enough computation
to determine the points-to sets for these query variables.
Using deductive... (Update)
Similar documents based on text: More All
1.4: Ultra-fast Aliasing Analysis using CLA: A Million Lines of C .. - Heintze, Tardieu (2001)
(Correct)
0.5: Points-to Analysis for Java Using Annotated Constraints - Rountev, Milanova, Ryder (2001)
(Correct)
0.5: Estimating the Impact of Scalable Pointer Analysis on.. - Das, Liblit, Fähndrich, .. (2001)
(Correct)
Related documents from co-citation: More All
5: Ultra-fast aliasing analysis using CLA: A million lines of C code
- Heintze, Tardieu - 2001
4: A semantic model of reference counting and its abstraction
- Hudak - 1986
4: Detecting format string vulnerabilities with type qualifiers
- Shankar, Talwar et al. - 2001
BibTeX entry: (Update)
N. Heintze and O. Tardieu, \Demand-Driven Pointer Analysis," ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 24-34, Snowbird, Utah, June 2001. http://citeseer.ist.psu.edu/heintze01demanddriven.html More
@inproceedings{ heintze01demanddriven,
author = "Nevin Heintze and Olivier Tardieu",
title = "Demand-Driven Pointer Analysis",
booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
pages = "24-34",
year = "2001",
url = "citeseer.ist.psu.edu/heintze01demanddriven.html" }
Citations (may not include all citations):
246
Context-Sensitive Interprocedural Points-to Analysis in the ..
- Emami, Ghiya et al. - 1994
232
Program Analysis and Specialization for the C Programming La.. (context) - Andersen - 1994
228
Points-to Analysis in Almost Linear Time
- Steensgaard - 1996
131
Interprocedural May-Alias Analysis for Pointers: Beyond-k li..
- Deutsch - 1994
114
Fast and Accurate Flow-Insensitive Points-To Analysis
- Shapiro, Horwitz - 1997
101
Context-insensitive alias analysis reconsidered
- Ruf - 1995
69
Unification-Based Pointer Analysis with Directional Assignme..
- Das - 2000
55
Demand-driven Computation of Interprocedural Data flow
- Duesterwald, Gupta et al. - 1995
54
Partial Online Cycle Elimination in Inclusion Constraint Gra..
- Fahndrich, Foster et al. - 1998
34
Projection Merging: Reducing Redundancies in Inclusion Const..
- Su, Fahndrich et al. - 2000
33
Polymorphic versus Monomorphic Flow-insensitive Points-to An..
- Foster, Fahndrich et al. - 2000
11
Off-line Variable Substitution for Scaling Points-to Analysi..
- Rountev, Chandra - 2000
5
Analysis of Large Code Bases: The Compile-Link-Analyze Model
- Heintze - 1999
3
ckit: an extensible C frontend in ML (context) - Chandra, Heintze et al.
1
Ultra-fast Pointer Analysis using CLA: A Million Lines of C .. (context) - Heintze, Tardieu - 2001
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cm.bell-labs.com/cm/cs/who/nch): More
Ultra-fast Aliasing Analysis using CLA: A Million Lines of C .. - Heintze, Tardieu (2001)
(Correct)
Analysis of Large Code Bases: The Compile-Link-Analyze Model - Heintze (1999)
(Correct)
A Framework for Combining Analysis and Verification - Heintze, Jaffar, Voicu (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC