(Enter summary)
Abstract: algorithm for Java programs. The algorithm is based on
the abstraction of points-to escape graphs, which characterize
how local variables and
elds in objects refer to other
objects. Each points-to escape graph also contains escape
information, which characterizes how objects allocated in
one region of the program can escape to be accessed by another
region. The algorithm is designed to analyze arbitrary
regions of complete or incomplete programs, obtaining complete
information for objects that ... (Update)
Cited by: More
Optimising Java RMI Programs by Communication Restructuring - Yeung, Kelly (2003)
(Correct)
Math. Struct. in Comp. Science (2004), vol. 14, pp.. - Cambridge University Press
(Correct)
Modal Transition Systems: A Foundation for - Three-Valued Program Analysis
(Correct)
Similar documents (at the sentence level):
72.8%: Compositional Pointer and Escape Analysis for Java Programs - Whaley, Rinard (1999)
(Correct)
14.9%: Compositional Pointer and Escape Analysis for Multithreaded.. - Rinard, Whaley
(Correct)
Active bibliography (related documents): More All
2.1: Unknown -
(Correct)
0.2: Compiler-Based Object Consistency - von Praun, Gross (2001)
(Correct)
0.2: From Polyvariant Flow Information to Intersection and Union.. - Palsberg, Pavlopoulou (2000)
(Correct)
Similar documents based on text: More All
0.6: Incrementalized Pointer and Escape Analysis - Vivien, Rinard (2001)
(Correct)
0.3: Pointer and Escape Analysis for Multithreaded Programs - Salcianu, Rinard (2001)
(Correct)
0.3: Escape Analysis on Lists - Park, Goldberg (1992)
(Correct)
Related documents from co-citation: More All
76: Escape Analysis for Java
- Choi, Gupta et al. - 1999
41: Escape analysis for object oriented languages (context) - Blanchet - 1999
40: Removing Unnecessary Synchronization in Java
- Bogda, olzle - 1999
BibTeX entry: (Update)
J. Whaley and M. Rinard. Compositional pointer and escape analysis for java programs. In Proceedings of the 14th Annual Conference on Object-Oriented Programming Systems, Languages and Applications, Denver, CO, November 1999. http://citeseer.ist.psu.edu/whaley99compositional.html More
@article{ whaley99compositional,
author = "John Whaley and Martin Rinard",
title = "Compositional pointer and escape analysis for {Java} programs",
journal = "ACM SIG{\-}PLAN Notices",
volume = "34",
number = "10",
pages = "187--206",
year = "1999",
url = "citeseer.ist.psu.edu/whaley99compositional.html" }
Citations (may not include all citations):
246
Contextsensitive interprocedural points-to analysis in the p..
- Emami, Ghiya et al. - 1994
200
Solving shapeanalysis problems in languages with destructive..
- Sagiv, Reps et al. - 1998
190
Optimization of object-oriented programs using static class ..
- Dean, Grove et al. - 1995 ACM DBLP
154
Escape analysis for java
- Choi, Gupta et al. - 1999 ACM DBLP
101
Context-insensitive alias analysis reconsidered
- Ruf - 1995 ACM DBLP
73
A safe approximation algorithm for interprocedural pointer a.. (context) - Landi, Ryder - 1992
70
Points-to analysis in almost linear time
- Steensgaard - 1996 ACM DBLP
68
On determining lifetime and aliasing of dynamically allocate.. (context) - Deutsch - 1990
67
Escape analysis for object oriented languages (context) - Blanchet - 1999
62
Program Analysis and Specialization for the C Programming La.. (context) - Andersen - 1994
52
Relevant context inference
- Chatterjee, Ryder et al. - 1999 ACM DBLP
51
Pointer analysis for multithreaded programs
- Rugina, Rinard - 1999 ACM DBLP
42
Static analyses for eliminating unnecessary synchronization ..
- Aldrich, Chambers et al. - 1999 ACM DBLP
38
Escape analysis on lists
- Goldberg, Park - 1992 ACM DBLP
30
ano, V. Sreedhar, H. Srinivasan, and J. Whaley. The jalape~n.. (context) - Burke, Choi et al. - 1999
28
implementation and experimental results (context) - Blanchet, Correctness - 1998
28
Ecient context-sensitive pointer analysis for C programs (context) - Wilson, Lam - 1995
26
the complexity of escape analysis (context) - Deutsch - 1997
24
Synchronization transformations for parallel computing
- Diniz, Rinard - 1997 ACM DBLP
21
Lock coarsening: Eliminating lock overhead in automatically ..
- Diniz, Rinard - 1996
12
Fast and accurate owinsensitive points-to analysis (context) - Shapiro, Horwitz - 1997
10
Ecient ow-sensitive interprocedural computation of pointerin.. (context) - Choi, Burke et al. - 1993
6
Unifying and conquer (context) - Baker - 1990
6
Using shape analysis to reduce nite-state models of concurre.. (context) - Corbett - 1998
5
Context-sensitive interprocedural pointer analysis in the pr.. (context) - Sathyanathan, Lam - 1996
4
A type-based analysis for block allocation in functional lan.. (context) - Hannan - 1995
4
Obtaining sequential eciency for concurrent object-oriented .. (context) - Plevyak, Zhang et al. - 1995
4
Removing unnecessary synchronization in java (context) - Bodga, Hoelzle - 1999 ACM DBLP
2
ects for escape analysis (context) - Tang, Jouvelot - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.stanford.edu/~jwhaley/index.html): More
A Portable Sampling-Based Profiler for Java Virtual Machines - Whaley (2000)
(Correct)
System Checkpointing using Reflection and Program Analysis - Whaley (2001)
(Correct)
An Efficient Inclusion-Based Points-To Analysis for.. - Whaley, Lam (2002)
(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