Summary-based inference of quantitative bounds of live heap objects

Mostrar todas las versiones(2)

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 a...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Braberman, V., Garbervetsky, D., Hym, S., Yovine, S.
Formato:	INPR
Lenguaje:	English
Materias:	Heap memory requirements Quantitative analysis Resource consumption
Acceso en línea:	http://hdl.handle.net/20.500.12110/paper_01676423_v_n_p_Braberman
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	todo:paper_01676423_v_n_p_Braberman
record_format	dspace
spelling	todo:paper_01676423_v_n_p_Braberman2023-10-03T15:05:02Z Summary-based inference of quantitative bounds of live heap objects Braberman, V. Garbervetsky, D. Hym, S. Yovine, S. Heap memory requirements Quantitative analysis Resource consumption 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. © 2013 Elsevier B.V. All rights reserved. Fil:Braberman, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Garbervetsky, D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. INPR English info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_01676423_v_n_p_Braberman
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
language	English
orig_language_str_mv	English
topic	Heap memory requirements Quantitative analysis Resource consumption
spellingShingle	Heap memory requirements Quantitative analysis Resource consumption Braberman, V. Garbervetsky, D. Hym, S. Yovine, S. Summary-based inference of quantitative bounds of live heap objects
topic_facet	Heap memory requirements Quantitative analysis Resource consumption
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. © 2013 Elsevier B.V. All rights reserved.
format	INPR
author	Braberman, V. Garbervetsky, D. Hym, S. Yovine, S.
author_facet	Braberman, V. Garbervetsky, D. Hym, S. Yovine, S.
author_sort	Braberman, V.
title	Summary-based inference of quantitative bounds of live heap objects
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
url	http://hdl.handle.net/20.500.12110/paper_01676423_v_n_p_Braberman
work_keys_str_mv	AT brabermanv summarybasedinferenceofquantitativeboundsofliveheapobjects AT garbervetskyd summarybasedinferenceofquantitativeboundsofliveheapobjects AT hyms summarybasedinferenceofquantitativeboundsofliveheapobjects AT yovines summarybasedinferenceofquantitativeboundsofliveheapobjects
_version_	1807324005236998144

Summary-based inference of quantitative bounds of live heap objects

Ejemplares similares