Skip to search formSkip to main contentSkip to account menu

Escape analysis

In compiler optimization, escape analysis is a method for determining the dynamic scope of pointers - where in the program a pointer can be accessed… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
We present an optimized implementation of the linear scan register allocation algorithm for Sun Microsystems' Java HotSpot… 
Highly Cited
2004
Highly Cited
2004
This paper describes JaRec, a portable record/replay system for Java. It correctly replays multi‐threaded, data‐race free Java… 
Highly Cited
2004
Highly Cited
2004
Explicit-state model checking tools often incorporate partial-order reductions to reduce the number of system states explored… 
2003
2003
Parallel programming languages that let multiple processors access shared data provide a variety of sharing mechanisms and memory… 
Highly Cited
2003
Highly Cited
2003
Escape analysis is a static analysis that determines whether the lifetime of data may exceed its static scope.This paper first… 
Highly Cited
2003
Highly Cited
2003
This article presents an escape analysis framework for Java to determine (1) if an object is not reachable after its method of… 
Highly Cited
1999
Highly Cited
1999
Escape analysis [27, 14, 5] is a static analysis that determines whether the lifetime of data exceeds its static scope.The main… 
Highly Cited
1998
Highly Cited
1998
We describe an escape analysis [32, 14], used to determine whether the lifetime of data exceeds its static scope.We give a new… 
Highly Cited
1997
Highly Cited
1997
Escape analysis is an abstract interpretation technique for statically optimizing storage management devised by Park & Goldberg… 
Highly Cited
1992
Highly Cited
1992
Higher order functional programs constantly allocate objects dynamically. These objects are typically cons cells, closures, and…