Conferencia

Braberman, V.; Fernández, F.; Garbervetsky, D.; Yovine, S. "Parametric prediction of heap memory requirements" (2008) 2008 International Symposium on Memory Management, ISMM'08:141-150
La versión final de este artículo es de uso interno de la institución.
Consulte el artículo en la página del editor

Abstract:

This work presents a technique to compute symbolic polynomial approximations of the amount of dynamic memory required to safely execute a method without running out of memory, for Javalike imperative programs. We consider object allocations and deallocations made by the method and the methods it transitively calls. More precisely, given an initial configuration of the stack and the heap, the peak memory consumption is the maximum space occupied by newly created objects in all states along a run from it. We over-approximate the peak memory consumption using a scoped-memory management where objects are organized in regions associated with the lifetime of methods. We model the problem of computing the maximum memory occupied by any region configuration as a parametric polynomial optimization problem over a polyhedral domain and resort to Bernstein basis to solve it. We apply the developed tool to several benchmarks.Copyright © 2008 ACM.

Registro:

Documento: Conferencia
Título:Parametric prediction of heap memory requirements
Autor:Braberman, V.; Fernández, F.; Garbervetsky, D.; Yovine, S.
Ciudad:Tuscon, AZ
Filiación:Departamento de Computación, FCEyN, UBA, Argentina
CNRS-VERIMAG, France
Palabras clave:Heap consumption; Heap space analysis; Java; Memory regions; Bernstein bases; Dynamic memories; Heap consumption; Heap space analysis; Imperative programs; Initial configurations; Java; Life-times; Memory consumptions; Memory managements; Memory regions; Memory requirements; Object allocations; Out of memories; Polyhedral domains; Polynomial optimization problems; Polynomial approximation
Año:2008
Página de inicio:141
Página de fin:150
DOI: http://dx.doi.org/10.1145/1375634.1375655
Título revista:2008 International Symposium on Memory Management, ISMM'08
Título revista abreviado:Int. Symp. Mem. Manage. ISMM
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97816055_v_n_p141_Braberman

Referencias:

  • Abdulla, P., Jonsson, B., Nilsson, M., Saksena, M., A survey of regular model checking. CONCUR '04 (2004) LNCS, 3170
  • Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D., Cost analysis of Java bytecode. ESOP'07 (2007) LNCS, 4421
  • Albert, E., Genaim, S., Gómez-Zamalloa, M., Heap space analysis for Java bytecode (2007) ISMM'07, , ACM
  • Bacon, D., Cheng, P., Grove, D., Garbage collection for embedded systems (2004) EMSOFT'04, , ACM
  • Barthe, G., Pavlova, M., Schneider, G., Precise analysis of memory consumption using program logics (2005) SEFM'05, , IEEE
  • Bollella, G., Gosling, J., (2000) The Real-Time Specification for Java, , Addison-Wesley Longman Publishing Co, Inc
  • Braberman, V., Garbervetsky, D., Yovine, S., A static analysis for synthesizing parametric specifications of dynamic memory consumption (2006) JOT, 5 (5), pp. 31-58
  • Cahoon, B., McKinley, K.S., Data flow analysis for software prefetching linked data structures in lava (2001) PACT'01, , IEEE
  • Cherem, S., Rugina, R., Region analysis and transformation for Java programs (2004) ISMM'04, , ACM
  • Chin, W., Khoo, S., Qin, S., Popeea, C., Nguyen, H., Verifying safety policies with size properties and alias controls (2005) ICSE'05, , ACM
  • Chin, W., Nguyen, H.H., Qin, S., Rinard, M., Memory usage verification for oo programs. SAS'05 (2005) LNCS, 3672
  • W.N. Chin, H.H. Nguyen, C. Popeea, S. Qin Analysing memory resource bounds for low-level programs. In ISMM 08, 2008; Clauss, P., Tchoupaeva, I., A symbolic approach to Bernstein expansion for program analysis and optimization (2004) CC'04
  • Ph. Clauss, F. Fernández, D. Garbervetsky, S. Verdoolaege. Symbolic polynomial maximization over convex sets and its application to memory requirement estimation. TR06-04, Univ. L. Pasteur, 2006; Detlefs, D., A hard look at hard real-time garbage collection (2004) ISORC'04, , IEEE
  • Ernst, M.D., Perkins, J.H., Guo, P.J., McCamant, S., Pacheco, C., Tschantz, M.S., Xiao, C., The Daikon system for dynamic detection of likely invariants (2007) Sci. Comput. Program, 69 (1-3), pp. 35-45
  • Garbervetsky, D., (2007) Parametric specification of dymamic memory utilization, , Ph.D Thesis, DC, FCEyN, UBA, November
  • Gay, D., Aiken, A., Language support for regions (2001) PLDI'01, , ACM
  • O. Gheorghioiu. Statically determining memory consumption of real-time Java threads. MEng, MIT, 2002; Hofman, M., Jost, S., Static prediction of heap usage for first-order functional programs (2003) POPL'03, , ACM
  • Hofman, M., Jost, S., Type-based amortised heap-space analysis (2006) ESOP '06
  • Hughes, J., Pareto, L., Recursion and dynamic data-structures in bounded space: Towards embedded ML programming ICFP'99, 34 (9). , SIGPLAN Notices , ACM 1999
  • Hughes, J., Pareto, L., Sabry, A., Proving the correctness of reactive systems using sized types (1996) POPL'96, , ACM
  • V. Sundaresan, P. Lam, E. Gagnon, R. Vallée-Rai, L. Hendren, P. Co. Soot: A java optimization framework. CASCON'99, IBM 1999; Salagnac, G., Rippert, C., Yovine, S., Semi-automatic region-based memory management for real-time java embedded systems (2007) RTCSA'07, , IEEE
  • Salagnac, G., Yovine, S., Garbervetsky, D., Fast escape analysis for region-based memory management (2005) ENTCS, 131, pp. 99-110
  • Salcianu, A., Rinard, M., Pointer and escape analysis for multithreaded programs PPoPP'01, 36 (7). , SIGPLAN Notices , ACM 2001
  • Tofte, M., Talpin, J.P., Region-based memory management (1997) Inf. Comput, 132 (2), pp. 109-176
  • Unnikrishnan, L., Stoller, S.D., Liu, Y.A., Optimized live heap bound analysis. VMCAI'03 (2003) LNCS, 2575A4 - ACM SIGPLAN

Citas:

---------- APA ----------
Braberman, V., Fernández, F., Garbervetsky, D. & Yovine, S. (2008) . Parametric prediction of heap memory requirements. 2008 International Symposium on Memory Management, ISMM'08, 141-150.
http://dx.doi.org/10.1145/1375634.1375655
---------- CHICAGO ----------
Braberman, V., Fernández, F., Garbervetsky, D., Yovine, S. "Parametric prediction of heap memory requirements" . 2008 International Symposium on Memory Management, ISMM'08 (2008) : 141-150.
http://dx.doi.org/10.1145/1375634.1375655
---------- MLA ----------
Braberman, V., Fernández, F., Garbervetsky, D., Yovine, S. "Parametric prediction of heap memory requirements" . 2008 International Symposium on Memory Management, ISMM'08, 2008, pp. 141-150.
http://dx.doi.org/10.1145/1375634.1375655
---------- VANCOUVER ----------
Braberman, V., Fernández, F., Garbervetsky, D., Yovine, S. Parametric prediction of heap memory requirements. Int. Symp. Mem. Manage. ISMM. 2008:141-150.
http://dx.doi.org/10.1145/1375634.1375655