Sciweavers

5 search results - page 1 / 1
» Fast Escape Analysis and Stack Allocation for Object-Based P...
Sort
View
CC
2000
Springer
135views System Software» more  CC 2000»
13 years 9 months ago
Fast Escape Analysis and Stack Allocation for Object-Based Programs
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of created objects whose lifetime is bounded by the life...
David Gay, Bjarne Steensgaard
OOPSLA
1999
Springer
13 years 9 months ago
Compositional Pointer and Escape Analysis for Java Programs
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...
John Whaley, Martin C. Rinard
SERP
2007
13 years 6 months ago
Runtime Support of Speculative Optimization for Offline Escape Analysis
Escape analysis can improve the speed and memory efficiency of garbage collected languages by allocating objects to the call stack, but an offline analysis will potentially interf...
Kevin Cleereman, Michelle Cheatham, Krishnaprasad ...
CGO
2007
IEEE
13 years 11 months ago
Run-Time Support for Optimizations Based on Escape Analysis
The JavaTM programming language does not allow the programmer to influence memory management. An object is usually allocated on the heap and deallocated by the garbage collector ...
Thomas Kotzmann, Hanspeter Mössenböck
VEE
2005
ACM
199views Virtualization» more  VEE 2005»
13 years 10 months ago
Escape analysis in the context of dynamic compilation and deoptimization
In object-oriented programming languages, an object is said to escape the method or thread in which it was created if it can also be accessed by other methods or threads. Knowing ...
Thomas Kotzmann, Hanspeter Mössenböck