Sciweavers

Share
IWMM
2010
Springer

Parametric inference of memory requirements for garbage collected languages

9 years 1 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into account or adopt specific models of garbage collectors which do not necessarily correspond to the actual memory usage. We present a novel approach to inferring upper bounds on memory requirements of Java-like programs which is parametric on the notion of object lifetime, i.e., on when objects become collectible. If objects lifetimes are inferred by a reachability analysis, then our analysis infers accurate upper bounds on the memory consumption for a reachability-based garbage collector. Interestingly, if objects lifetimes are inferred by a heap liveness analysis, then we approximate the program minimal memory requirement, i.e., the peak memory usage when using an optimal garbage collector which frees objects as soon as they become dead. The key idea is to integrate information on objects lifetimes into the pro...
Elvira Albert, Samir Genaim, Miguel Gómez-Z
Added 18 Oct 2010
Updated 18 Oct 2010
Type Conference
Year 2010
Where IWMM
Authors Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa
Comments (0)
books