Summary-based inference of quantitative bounds of live heap objects

Autores
Braberman, Victor Adrian; Garbervetsky, Diego David; Hym, Samuel; Yovine, Sergio Fabian
Año de publicación
2013
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
This article presents a symbolic static analysis for computing parametric upper bounds of the number of simultaneously live objects of sequential Java-like programs. Inferring the peak amount of irreclaimable objects is the cornerstone for analyzing potential heap-memory consumption of stand-alone applications or libraries. The analysis builds method-level summaries quantifying the peak number of live objects and the number of escaping objects. Summaries are built by resorting to summaries of their callees. The usability, scalability and precision of the technique is validated by successfully predicting the object heap usage of a medium-size, real-life application which is significantly larger than other previously reported case-studies.
Fil: Braberman, Victor Adrian. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Garbervetsky, Diego David. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Hym, Samuel. Universite Lille 3; Francia
Fil: Yovine, Sergio Fabian. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Materia
Resource consumption
Quantitative analysis
Heap memory requirements
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/33079

id CONICETDig_5b938375325ad510200e9d080782d5ea
oai_identifier_str oai:ri.conicet.gov.ar:11336/33079
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Summary-based inference of quantitative bounds of live heap objectsBraberman, Victor AdrianGarbervetsky, Diego DavidHym, SamuelYovine, Sergio FabianResource consumptionQuantitative analysisHeap memory requirementshttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1This article presents a symbolic static analysis for computing parametric upper bounds of the number of simultaneously live objects of sequential Java-like programs. Inferring the peak amount of irreclaimable objects is the cornerstone for analyzing potential heap-memory consumption of stand-alone applications or libraries. The analysis builds method-level summaries quantifying the peak number of live objects and the number of escaping objects. Summaries are built by resorting to summaries of their callees. The usability, scalability and precision of the technique is validated by successfully predicting the object heap usage of a medium-size, real-life application which is significantly larger than other previously reported case-studies.Fil: Braberman, Victor Adrian. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Garbervetsky, Diego David. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Hym, Samuel. Universite Lille 3; FranciaFil: Yovine, Sergio Fabian. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaElsevier Science2013-11info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/33079Garbervetsky, Diego David; Hym, Samuel; Braberman, Victor Adrian; Yovine, Sergio Fabian; Summary-based inference of quantitative bounds of live heap objects; Elsevier Science; Science of Computer Programming; 92; 11-2013; 56-840167-6423CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.scico.2013.11.036info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0167642313003298info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T09:52:33Zoai:ri.conicet.gov.ar:11336/33079instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 09:52:33.55CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Summary-based inference of quantitative bounds of live heap objects
title Summary-based inference of quantitative bounds of live heap objects
spellingShingle Summary-based inference of quantitative bounds of live heap objects
Braberman, Victor Adrian
Resource consumption
Quantitative analysis
Heap memory requirements
title_short Summary-based inference of quantitative bounds of live heap objects
title_full Summary-based inference of quantitative bounds of live heap objects
title_fullStr Summary-based inference of quantitative bounds of live heap objects
title_full_unstemmed Summary-based inference of quantitative bounds of live heap objects
title_sort Summary-based inference of quantitative bounds of live heap objects
dc.creator.none.fl_str_mv Braberman, Victor Adrian
Garbervetsky, Diego David
Hym, Samuel
Yovine, Sergio Fabian
author Braberman, Victor Adrian
author_facet Braberman, Victor Adrian
Garbervetsky, Diego David
Hym, Samuel
Yovine, Sergio Fabian
author_role author
author2 Garbervetsky, Diego David
Hym, Samuel
Yovine, Sergio Fabian
author2_role author
author
author
dc.subject.none.fl_str_mv Resource consumption
Quantitative analysis
Heap memory requirements
topic Resource consumption
Quantitative analysis
Heap memory requirements
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv This article presents a symbolic static analysis for computing parametric upper bounds of the number of simultaneously live objects of sequential Java-like programs. Inferring the peak amount of irreclaimable objects is the cornerstone for analyzing potential heap-memory consumption of stand-alone applications or libraries. The analysis builds method-level summaries quantifying the peak number of live objects and the number of escaping objects. Summaries are built by resorting to summaries of their callees. The usability, scalability and precision of the technique is validated by successfully predicting the object heap usage of a medium-size, real-life application which is significantly larger than other previously reported case-studies.
Fil: Braberman, Victor Adrian. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Garbervetsky, Diego David. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Hym, Samuel. Universite Lille 3; Francia
Fil: Yovine, Sergio Fabian. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
description This article presents a symbolic static analysis for computing parametric upper bounds of the number of simultaneously live objects of sequential Java-like programs. Inferring the peak amount of irreclaimable objects is the cornerstone for analyzing potential heap-memory consumption of stand-alone applications or libraries. The analysis builds method-level summaries quantifying the peak number of live objects and the number of escaping objects. Summaries are built by resorting to summaries of their callees. The usability, scalability and precision of the technique is validated by successfully predicting the object heap usage of a medium-size, real-life application which is significantly larger than other previously reported case-studies.
publishDate 2013
dc.date.none.fl_str_mv 2013-11
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/33079
Garbervetsky, Diego David; Hym, Samuel; Braberman, Victor Adrian; Yovine, Sergio Fabian; Summary-based inference of quantitative bounds of live heap objects; Elsevier Science; Science of Computer Programming; 92; 11-2013; 56-84
0167-6423
CONICET Digital
CONICET
url http://hdl.handle.net/11336/33079
identifier_str_mv Garbervetsky, Diego David; Hym, Samuel; Braberman, Victor Adrian; Yovine, Sergio Fabian; Summary-based inference of quantitative bounds of live heap objects; Elsevier Science; Science of Computer Programming; 92; 11-2013; 56-84
0167-6423
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.scico.2013.11.036
info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0167642313003298
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842269166167392256
score 13.13397