Heap space analysis for java bytecode

International Symposium on Memory Management, ISMM

Volumn , Issue , 2007, Pages 105-116

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

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

Heap consumption; Heap space analysis; Java bytecode; Low level languages

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COSTS; DATA STRUCTURES; FINANCE; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; REFINING; SOFTWARE PROTOTYPING; STANDARDS; TREES (MATHEMATICS);

(2+1) DIMENSIONS; COMPILE TIME; COST RELATIONS; DATA SIZE; ESCAPE ANALYSIS; GARBAGE COLLECTOR (GC); IN ORDER; INTERNATIONAL SYMPOSIUM; ITS DATA; JAVA BYTE CODES; MEMORY-MANAGEMENT; OBJECT-ORIENTED PROGRAMMING; PROTOTYPE IMPLEMENTATIONS; SPACE ANALYSIS; UPPER BOUNDS;

COST BENEFIT ANALYSIS;

EID: 42149163410     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1296907.1296922     Document Type: Conference Paper

References (25)

1. E. Albert, P. Arenas, S. Genaim, and G. Puebla. Automatic Inference of Upper Bounds for Cost Equation Systems. Submitted, 2007.
2. E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. Cost analysis of java bytecode. In 16th European Symposium on Programming, ESOP'07, Lecture Notes in Computer Science. Springer, March 2007.
3. E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. Experiments in Cost Analysis of Java Bytecode. In Proc. of BYTECODE'07, Electronic Notes in Theoretical Computer Science. Elsevier - North Holland, March 2007.
4. E. Albert, G. Puebla, and M. Hermenegildo. Abstraction-Carrying Code. In Proc. of LPAR'04, number 3452 in LNAI, pages 380-397. Springer-Verlag, 2005.
5. D. Aspinall, S. Gilmore, M. Hofmann, D. Sannella, and I. Stark. Mobile Resource Guarantees for Smart Devices. In CASSIS'04, number 3362 in LNCS. Springer, 2005.
6. Gilles Barthe, Mariela Pavlova, and Gerardo Schneider. Precise analysis of memory consumption using program logics. In Bernhard K. Aichernig and Bernhard Beckert, editors, SEFM, pages 86-95. IEEE Computer Society, 2005.
7. L. Beringer, M. Hofmann, A. Momigliano, and O. Shkaravska. Automatic Certification of Heap Consumption. In Proc. of LPAR'04, LNCS 3452, pages 347-362. Springer, 2004.
8. Bruno Blanchet. Escape Analysis for Java™: Theory and practice. ACM Trans. Program. Lang. Syst., 25(6):713-775, 2003.
9. Victor Braberman, Diego Garbervetsky, and Sergio Yovine. A static analysis for synthesizing parametric specifications of dynamic memory consumption. Journal of Object Technology, 5(5):31-58, 2006.
10. F. Bueno, D. Cabeza, M. Carro, M. Hermenegildo, P. López- García, and G. Puebla (Eds.). The Ciao System. Ref. Manual (v1.13). Technical report, C. S. School (UPM), 2006. Available at http://www.ciaohome. org.
11. D. Cachera, D. Pichardie T. Jensen, and G. Schneider. Certified memory usage analysis. In FM'05, number 3582 in LNCS. Springer, 2005.
12. A. Chander, D. Espinosa, N. Islam, P. Lee, and G. Necula. Enforcing resource bounds via static verification of dynamic checks. In Proc. of ESOP'05, volume 3444 of Lecture Notes in Computer Science, pages 311-325. Springer, 2005.
13. W. Chin, H. Nguyen, S. Qin, and M. Rinard. Memory Usage Verification for OO Programs. In Proc. of SAS'05, LNCS 3672, pages 70-86. Springer, 2005.
14. K. Crary and S. Weirich. Resource bound certification. In Proc. of POPL'00, pages 184-198. ACM Press, 2000.
15. Patricia M. Hill and Fausto Spoto. Deriving Escape Analysis by Abstract Interpretation. Higher-Order and Symbolic Computation, (19):415-463, 2006.
16. M. Hofmann. Certification of Memory Usage. In Theoretical Computer Science, 8th Italian Conference, ICTCS, volume 2841 of Lecture Notes in Computer Science, page 21. Springer, 2003.
17. M. Hofmann and S. Jost. Static prediction of heap space usage for first-order functional programs. In 30th ACM Symposium on Principles of Programming Languages (POPL), pages 185-197. ACM Press, 2003.
18. M. Hofmann and S. Jost. Type-Based Amortised Heap-Space Analysis. In 15th European Symposium on Programming, ESOP 2006, volume 3924 of Lecture Notes in Computer Science, pages 22-37. Springer, 2006.
19. J. Hughes and L. Pareto. Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded ML Programming. In Proc. of ICFP'99, pages 70-81. ACM Press, 1999.
20. T. Lindholm and F. Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1996.
21. Patricia M.Hill, Etienne Payet, and Fausto Spoto. Path-length analysis of object-oriented programs. In Proc. EAAI, 2006.
22. G. Necula. Proof-Carrying Code. In POPL'97. ACM Press, 1997.
23. S. Rossignoli and F. Spoto. Detecting Non-Cyclicity by Abstract Compilation into Boolean Functions. In E. A. Emerson and K. S. Namjoshi, editors, Proc. of the 7th workshop on Verification, Model Checking and Abstract Interpretation, volume 3855 of Lecture Notes in Computer Science, pages 95-110, Charleston, SC, USA, January 2006. Springer-Verlag.
24. L. Unnikrishnan, S. Stoller, and Y. Liu. Optimized Live Heap Bound Analysis. In Proc. of VMCAI'03, Lecture Notes in Computer Science, pages 70-85. Springer, 2003.
25. P. Vasconcelos and K. Hammond. Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs. In IFL, volume 3145 of LNCS. Springer, 2003.