Identification of logically related heap regions

Marron, Mark and Kapur, Deepak and Hermenegildo, Manuel V. (2009). Identification of logically related heap regions. In: "The 2009 International Symposium on Memory Management", June 19-20, 2009, Trinity College Dublin, Ireland. ISBN 978-1-60558-347-1.


Title: Identification of logically related heap regions
  • Marron, Mark
  • Kapur, Deepak
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: The 2009 International Symposium on Memory Management
Event Dates: June 19-20, 2009
Event Location: Trinity College Dublin, Ireland
Title of Book: ISMM '09 Proceedings of the 2009 international symposium on Memory management
Date: 2009
ISBN: 978-1-60558-347-1
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

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

Alternative locations

Official URL:


This paper introduces a novel technique for identifying logically related sections of the heap such as recursive data structures, objects that are part of the same multi-component structure, and related groups of objects stored in the same collection/array. When combined withthe lifetime properties of these structures, this information can be used to drive a range of program optimizations including pool allocation, object co-location, static deallocation, and region-based garbage collection. The technique outlined in this paper also improves the efficiency of the static analysis by providing a normal form for the abstract models (speeding the convergence of the static analysis). We focus on two techniques for grouping parts of the heap. The first is a technique for precisely identifying recursive data structures in object-oriented programs based on the types declared in the program. The second technique is a novel method for grouping objects that make up the same composite structure and that allows us to partition the objects stored in a collection/array into groups based on a similarity relation. We provide a parametric component in the similarity relation in order to support specific analysis applications (such as a numeric analysis which would need to partition the objects based on numeric properties of the fields). Using the Barnes-Hut benchmark from the JOlden suite we show how these grouping methods can be used to identify various types of logical structures allowing the application of many region-based program optimizations.

More information

Item ID: 14305
DC Identifier:
OAI Identifier:
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 18 Jan 2013 08:48
Last Modified: 21 Apr 2016 13:54
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM