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

Ejemplares similares

Ejemplares similares