Parametric Inference of Memory Requirements for Garbage Collected Languages

Albert Albiol, Elvira and Genaim, Samir and Gomez Zamalloa, Miguel (2010). Parametric Inference of Memory Requirements for Garbage Collected Languages. In: "2010 international symposiumon Memory management", 05/06/2010 - 06/06/2010, Toronto, Canadá. ISBN 978-1-4503-0054-4.

Description

Title: Parametric Inference of Memory Requirements for Garbage Collected Languages
Author/s:
  • Albert Albiol, Elvira
  • Genaim, Samir
  • Gomez Zamalloa, Miguel
Item Type: Presentation at Congress or Conference (Article)
Event Title: 2010 international symposiumon Memory management
Event Dates: 05/06/2010 - 06/06/2010
Event Location: Toronto, Canadá
Title of Book: Proceedings of the 2010 international symposium on Memory management
Date: 2010
ISBN: 978-1-4503-0054-4
Subjects:
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (299kB) | Preview

Abstract

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 process of generating the recurrence equations which capture the memory usage at the different program states. If the heap size limit is set to the memory requirement inferred by our analysis, it is ensured that execution will not exceed the memory limit with the only assumption that garbage collection works when the limit is reached. Experiments on Java bytecode programs provide evidence of the feasibility and accuracy of our analysis.

Funding Projects

TypeCodeAcronymLeaderTitle
FP7231620HATSUnspecifiedHighly Adaptable and Trustworthy Software using Formal Models

More information

Item ID: 9125
DC Identifier: http://oa.upm.es/9125/
OAI Identifier: oai:oa.upm.es:9125
Official URL: http://dl.acm.org/citation.cfm?id=1806671
Deposited by: Memoria Investigacion
Deposited on: 15 Nov 2011 09:34
Last Modified: 07 Nov 2014 10:56
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM