Live heap space analysis for languages with garbage collection

International Symposium on Memory Management, ISMM

Volumn , Issue , 2009, Pages 129-138

  Albert, Elvira ^a   Genaim, Samir ^a   Gómez Zamalloa, Miguel ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Java Bytecode; Live Heap Space Analysis; Low level Languages; Peak Memory Consumption

Indexed keywords

BYTECODES; COMPLEXITY CLASS; GARBAGE COLLECTION; JAVA BYTE CODES; LOW-LEVEL LANGUAGE; MEMORY CONSUMPTION; MEMORY MANAGER; OBJECT ORIENTED; SPACE ANALYSIS; SPACE BOUNDS; UPPER BOUND;

LINGUISTICS; OBJECT ORIENTED PROGRAMMING; QUERY LANGUAGES; REFUSE COLLECTION; WASTE DISPOSAL;

JAVA PROGRAMMING LANGUAGE;

EID: 70350701886     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542431.1542450     Document Type: Conference Paper

References (22)

1. E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. Cost Analysis of Java Bytecode. In Rocco De Nicola, editor, 16th European Symposium on Programming, ESOP '07,volume 4421 of Lecture Notes in Computer Science,pages 157-172. Springer, March 2007.
2. E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode. In Post-proceedings of Formal Methods for Components and Objects (FMCO'07),number 5382 in LNCS, pages 113-133. Springer-Verlag, October 2008.
3. E. Albert, S. Genaim, and M. Gomez-Zamalloa. Heap Space Analysis for Java Bytecode. In ISMM '07: Proceedings of the 6th international symposium on Memory management,pages 105-116, New York, NY, USA, October 2007. ACM Press.
4. Bruno Blanchet. Escape Analysis for Object Oriented Languages. Application to Java(TM). In Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA '99),pages 20-34. ACM, November 1999.
5. V. Braberman, F. Fernandez, D. Garbervetsky, and S. Yovine. Parametric Prediction of Heap Memory Requirements. In Proceedings of the International Symposium on Memory management (ISMM),New York, NY, USA, 2008. ACM.
6. Sigmund Cherem and Radu Rugina. Region analysis and transformation for java programs. In David F. Bacon and Amer Diwan, editors, Proceedings of the 4th International Symposium on Memory Management, ISMM 2004, Vancouver, BC, Canada, October 24-25, 2004,pages 85-96. ACM, 2004.
7. W.-N. Chin, H. H. Nguyen, S. Qin, and M. C. Rinard. Memory Usage Verification for OO Programs. In Proc. ofSAS'05,volume 3672 of LNCS,pages 70-86, 2005.
8. W-N. Chin, H.H. Nguyen, C. Popeea, and S. Qin. Analysing Memory Resource Bounds for Low-Level Programs. In Proceedings of the International Symposium on Memory management (ISMM),New York, NY, USA, 2008. ACM.
9. P. Cousot and N. Halbwachs. Automatic Discovery of Linear Restraints among Variables of a Program. In ACM Symposium on Principles of Programming Languages (POPL),pages 84-97. ACM Press, 1978.
10. K. Crary and S. Weirich. Resource bound certification. In POPL'00.ACM Press, 2000.
11. M. Hofmann and S. Jost. Static prediction of heap space usage for first-order functional programs. In ACM Symposium on Principles of Programming Languages (POPL),2003.
12. JOlden Suite Collection. http://www-ali.cs.umass.edu/DaCapo/benchmarks. html.
13. H. Lehner and P. Muller. Formal translation of bytecode into BoogiePL. In Bytecode'07,ENTCS, pages 35-50. Elsevier, 2007.
14. T. Lindholm and F. Yellin. The Java Virtual Machine Specification.Addison-Wesley, 1996.
15. Y G. Park and B. Goldberg. Escape analysis on lists. In PLDI,pages 116-127, 1992.
16. Mads Tofte and Jean-Pierre Talpin. Region-based memory management. Inf. Comput.,132(2): 109-176, 1997.
17. L. Unnikrishnan, S. D. Stoller, and Y A. Liu. Automatic Accurate Live Memory Analysis for Garbage-Collected Languages. In Proc. ofLCTES/OM,pages 102-111. ACM, 2001.
18. L. Unnikrishnan, S. D. Stoller, and Y A. Liu. Optimized Live Heap Bound Analysis. In Proc. ofVMCAI'03,volume 2575 of LNCS,pages 70-85, 2003.
19. R. Vallee-Rai, L. Hendren, V Sundaresan, P. Lam, E. Gagnon, and P. Co. Soot - a Java optimization framework. In CASCON'99,pages 125-135, 1999.
20. B. Wegbreit. Mechanical Program Analysis. Comm. of the ACM,18(9), 1975.
21. John Whaley and Monica S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI,pages 131-144. ACM, 2004.
22. R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing, D. B. Whalley, G. Bernat, C. Ferdinand, R. Heckmann, T. Mitra, F. Mueller, I. Puaut, P. P. Puschner, J. Staschulat, and P. Stenstrom. The worst-case execution-time problem - overview of methods and survey of tools. ACM Trans. Embedded Comput. Syst.,7(3), 2008.