(Enter summary)
Abstract: We describe an escape analysis [32, 14], used to determine
whether the lifetime of data exceeds its static scope.
We give a new correctness proof starting directly from a
semantics. Contrary to previous proofs, it takes into account
all the features of functional languages, including imperative
features and polymorphism. The analysis has been designed
so that it can be implemented under the small complexity
bound of O(n log
2
n) where n is the size of the analyzed
program. We have included... (Update)
Context of citations to this paper: More
...an equivalent, but more efficient, parallel program that uses fewer thread and locks. One promising direction is to use escape analysis [27] to identify unnecessary synchronization operations that can be eliminated. Another direction is optimize the structure of user defined...
Cited by: More
Compilation Techniques for Parallel Systems - Gupta, Pande, Psarris, Sakar (1999)
(Correct)
Active bibliography (related documents): More All
1.7: Escape Analysis for Object Oriented Languages. Application to Java - Blanchet (1999)
(Correct)
0.9: the Garbage Collection Bibliography - Richard Jones (2003)
(Correct)
0.4: Efficient Compile-Time Garbage Collection for Arbitrary Data.. - Mohnen (1995)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: Escape Analysis for Java. Theory and Practice - Blanchet (2003)
(Correct)
0.2: Analyzing Security Protocols with Secrecy Types and Logic.. - Abadi, Blanchet (2002)
(Correct)
0.2: From Secrecy to Authenticity in Security Protocols - Blanchet (2002)
(Correct)
BibTeX entry: (Update)
B. Blanchet, "Escape Analysis: Correctness, Proof, Implementation and Experimental Results," Proc. of the 25th Annual ACM Symposium on Principles of Programming Languages, pages 25-37, San Diego, CA, January 1998. http://citeseer.ist.psu.edu/blanchet98escape.html More
@inproceedings{ blanchet98escape,
author = "Bruno Blanchet",
title = "Escape Analysis: Correctness Proof, Implementation and Experimental Results",
booktitle = "Symposium on Principles of Programming Languages",
pages = "25-37",
year = "1998",
url = "citeseer.ist.psu.edu/blanchet98escape.html" }
Citations (may not include all citations):
815
Abstract interpretation: a unified lattice model for static .. (context) - Cousot, Cousot - 1977
312
Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
137
Compiler optimizations for improving data locality
- Carr, McKinley et al. - 1994
131
Interprocedural May-Alias Analysis for Pointers: Beyond k-li..
- Deutsch - 1994
127
Control flow analysis in Scheme (context) - Shivers - 1988
92
A flexible approach to interprocedural data flow analysis an.. (context) - Jones, Muchnick - 1982
85
Garbage Collection can be faster than Stack Allocation
- Appel - 1987
83
From Region Inference to von Neumann Machines via Region Rep..
- Birkedal, Tofte et al. - 1996
72
A Semantic Model of Reference Counting and its Abstraction
- Hudak - 1986
68
On determining lifetime and aliasing of dynamically allocate.. (context) - Deutsch - 1990
58
Better static memory management: Improving region-based anal..
- Aiken, ahndrich et al. - 1995
56
The interprocedural analysis and automatic parallelisation o.. (context) - Harrison - 1989
53
Applications of Path Compression on Balanced Trees (context) - Tarjan - 1979
48
Backward Analysis of Functional Programs (context) - Hughes - 1988
41
Lifetime Analysis of Dynamically Allocated Objects (context) - Ruggieri, Murtagh - 1988
38
Escape Analysis on Lists
- Park, Goldberg - 1992
32
Finding dominators in Directed Graphs (context) - Tarjan - 1974
29
An Empirical and Analytic Study of Stack vs (context) - Appel, Shao - 1993
28
Strictness analysis and polymorphic invariance (context) - Abramsky - 1986
28
Analysis of Functional Programs to Detect Run-Time Garbage C.. (context) - Inoue, Seki et al. - 1988
26
the Complexity of Escape Analysis (context) - Deutsch - 1997
23
A theory of Stack Allocation in Polymorphically Typed Langua..
- Tofte, Talpin - 1993
23
Safety considerations for storage allocation optimizations (context) - Chase - 1988
22
Storage Use Analysis and its Applications
- Serrano, Feeley - 1996
21
A Generalization of Dijkstra's Algorithm (context) - Knuth - 1977
17
Compile-Time Garbage Collection for Higher-Order Functional .. (context) - Hughes - 1992
15
Experiences with Compiler-Directed Storage Reclamation (context) - Hicks - 1993
13
A relationship between abstract interpretation and projectio.. (context) - Burn - 1990
12
Efficient compile-time garbage collection for arbitrary data..
- Mohnen - 1995
12
Computation of aliases and support sets (context) - Neyrinck, Panangaden et al. - 1987
9
LFCS Report Series ECS-LFCS (context) - Harper, Milner et al. - 1989
7
A Type-based Analysis for Stack Allocation in Functional Lan.. (context) - Hannan - 1995
6
Some properties of predicate transformers (context) - Hoare - 1978
4
Efficient closure utilisation by higher-order inheritance an..
- Mohnen - 1995
3
Compile Time Garbage Collection Using Reference Count Analys.. (context) - Hederman - 1988
2
Garbage collection statique (context) - Blanchet - 1996
2
Is compile time garbage collection worth the effort (context) - Jones, White - 1990
1
r'ealisation et certification d'un glaneur de cellules concu.. (context) - Doligez - 1995
Documents on the same site (http://pauillac.inria.fr/~bblanche/publications.html):
Escape Analysis for Object Oriented Languages. Application to Java - Blanchet (1999)
(Correct)
Secrecy Types for Asymmetric Communication - Abadi, Blanchet (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