(Enter summary)
Abstract: We present a new pointer and escape analysis. Instead of
analyzing the whole program, the algorithm incrementally
analyzes only those parts of the program that may deliver
useful results. An analysis policy monitors the analysis results
to direct the incremental investment of analysis resources
to those parts of the program that o#er the highest
expected optimization return. (Update)
Cited by: More
An in-Card Bytecode Optimization for Objects Management In.. - Fournerie
(Correct)
Connectivity-Based Garbage Collection - Hirzel (2004)
(Correct)
Data Structure Analysis: A Fast and Scalable Context-Sensitive .. - Lattner, Adve (2003)
(Correct)
Similar documents (at the sentence level):
72.2%: Incrementalized Pointer and Escape Analysis - Fr Ed Eric (2001)
(Correct)
Active bibliography (related documents): More All
0.2: Incremental Analysis For Flow- And Context-Sensitive Data-Flow.. - Yur (1999)
(Correct)
0.2: Tool Support for Improving Test Coverage - Horwitz (2002)
(Correct)
0.2: Modular Static Program Analysis - Cousot, Cousot (2002)
(Correct)
Related documents from co-citation: More All
7: Solving shape-analysis problems in languages with destructive updating
- Sagiv, Reps et al. - 1996
7: Escape Analysis for Java
- Choi, Gupta et al. - 1999
6: Pointer analysis: haven't we solved this problem yet
- Hind - 2001
BibTeX entry: (Update)
F. Vivien and M. Rinard. Incrementalized pointer and escape analysis. In Conference on Programming Language Design and Implementation, pages 35--46, 2001. http://citeseer.ist.psu.edu/vivien01incrementalized.html More
@inproceedings{ vivien01incrementalized,
author = "Frric Vivien and Martin C. Rinard",
title = "Incrementalized Pointer and Escape Analysis",
booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
pages = "35-46",
year = "2001",
url = "citeseer.ist.psu.edu/vivien01incrementalized.html" }
Citations (may not include all citations):
167
Garbage collection in an uncooperative environment (context) - Boehm, Weiser - 1988
154
Escape analysis for Java
- Choi, Gupta et al. - 1999
119
Compositional pointer and escape analysis for Java programs
- Whaley, Rinard - 1999
103
The Real-Time Specification for Java
- Bollella - 2000
67
Escape analysis for object oriented languages (context) - Blanchet - 1999
63
Removing unnecessary synchronization in Java
- Bogda, Hoelzle - 1999
59
Demand interprocedural dataflow analysis
- Reps, Horowitz et al. - 1995
49
The cartesian product algorithm: Simple and precise type inf..
- Agesen - 1995
45
ective synchronization removal for Java (context) - Ruf - 2000
23
A practical framework for demand-driven interprocedural data..
- Duesterwald, Gupta et al. - 1997
18
Data-flow analysis of program fragments
- Rountev, Ryder et al. - 1999
6
Demand-driven interprocedural array property analysis (context) - Lin, Padua - 1999
5
Optimizing the use of high performance libraries (context) - Guyer, Lin - 2000
5
Simultaneous demand-driven data-flow and call graph analysis
- Agrawal - 1999
5
Incremental algorithms and empirical comparison for flow- an..
- Yur, Ryder et al. - 1999
4
Points-to and side-e#ect analyses for programs built with pr..
- Rountev, Ryder - 2001
3
Design-directed compilation (context) - Rugina, Rinard - 2001
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://flex-master.csail.mit.edu/Harpoon/papers.html): More
Ownership Types for Safe Programming: Preventing Data.. - Boyapati, Lee, Rinard (2002)
(Correct)
Statically Determining Memory Consumption of Real-Time Java.. - Gheorghioiu (2002)
(Correct)
An Implementation of Scoped Memory for Real-Time Java - Beebee, Jr., Rinard (2001)
(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