Heap space analysis for garbage collected languages, by Elvira Albert, Samir Genaim, Miguel GÃ³mez-Zamalloa:

Accurately predicting the dynamic memory consumption (or heap space) of programs can be critical during software development. It is well-known that garbage collection (GC) complicates such problem. The peak heap consumption of a program is the maximum size of the data on the heap during its execution, i.e., the minimum amount of heap space needed to safely run the program. 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. This paper presents a novel static analysis for garbage collected imperative languages that infers accurate upper bounds on the peak heap usage, including exponential, logarithmic and polynomial bounds. A unique characteristic of the analysis is that it is parametric on the notion of object lifetime, i.e., on when objects become collectible.

Similar work has been covered here in the past.

## Recent comments

1 hour 1 min ago

3 hours 50 min ago

6 hours 21 min ago

6 hours 57 min ago

10 hours 38 min ago

20 hours 12 min ago

21 hours 3 min ago

21 hours 24 min ago

1 day 1 hour ago

1 day 2 hours ago