COSTA: Design and implementation of a cost and termination analyzer for Java bytecode

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5382 LNCS, Issue , 2008, Pages 113-132

  Albert, Elvira ^a   Arenas, Puri ^a   Genaim, Samir ^b   Puebla, German ^b   Zanardini, Damiano ^b  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; COST BENEFIT ANALYSIS; COSTS; FORMAL METHODS; MACHINERY; OBJECT ORIENTED PROGRAMMING; PROGRAM INTERPRETERS; PROGRAMMING THEORY;

ABSTRACT INTERPRETATIONS; BOUNDEDNESS; BYTECODE; BYTECODE PROGRAMS; JAVA BYTE CODES; JAVA LIBRARIES; NON-TRIVIAL; OBJECT-ORIENTED; PROGRAMMING LANGUAGES; RESOURCE CONSUMPTION; RESOURCE USAGE ANALYSIS; UPPER BOUNDS;

JAVA PROGRAMMING LANGUAGE;

EID: 58849099997     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92188-2_5     Document Type: Conference Paper

References (29)

1. Albert, E., Arenas, P., Codish, M., Genaim, S., Puebl., G., Zanardini, D.: Termination Analysis of Java Bytecode. in: Barthe, G., de Boer, F.S. (eds.) FMOODS 2008. LNCS, vol. 5051, pp. 2-18. Springer, Heidelberg (2008)
2. Albert, E., Arenas, P., Genaim, S., Puebla, G.: Automatic inference of Upper Bounds for Recurrence Relations in Cost Analysis. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 221-237. Springer, Heidelberg (2008)
3. Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost Analysis of Java Bytecode. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421. Springer, Heidelberg (2007)
4. Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: R.emoving Useless Variables in Cost Analysis of Java Bytecode. in: Proc. SAC. ACM Press, New York (2008)
5. Albert, E., Genaim, S., Gomez-Zamalloa, M.: Heap Space Analysis for Java Bytecode. in: 1SMM 2007 (October 2007)
6. Allen, F.: Control flow analysis. in: Proceedings of a symposium on Compiler optimization, pp. 1-19 (1970)
7. Aspinall, D., Gilmore, S., Hofmann, M., Sannella, D., Stark, L: Mobile Resource Guarantees for Smart Devices. In: Barthe, G., Burdy, L., Huisman, M., Lanet, J.-L., Muntean, T. (eds.) CASSIS 2004. LNCS, vol. 3362, pp. 1-26. Springer, Heidelberg (2005)
8. Bagnara, R., Ricci, E., Zaffanella, E., Hill, P.M.: Possibly not closed convex poly- hedra and the parma polyhedra library. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 213-229. Springer, Heidelberg (2002)
9. Chander, A., Espinosa, D., Islam, N., Lee, P., Necula, G.: Enforcing resource bounds via static verification of dynamic checks. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 311-325. Springer, Heidelberg (2005)
10. Codish, M., Taboch, G.: A semantic basis for the termination analysis of logic programs. The Journal of Logic Programming 41(1), 103-123 (1999)
11. Cousot, P., Cousot, R.: Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: POPL 1977, pp. 238-252. ACM, New York (1977)
12. Crary, K., Weirich, S.: Resource Bound Certification. In: POPL 2000, pp. 184-198. ACM, New York (2000)
13. Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. TOPLAS 13(4) (1991)
14. Debray, S.K., Lin, N.W.: Cost analysis of logic programs. TOPLAS 15(5) (1993)
15. Goodrich, M.T., Tamassia, R.: Data, Structures and Algorithms in Java, 3rd edn. John Wiley, Chichester (2004)
16. Hermenegildo, M., Albert, E., López-García, P., Puebla, G.: Abstraction Carrying Code and Resource-Awareness. In: Proc. of PPDP 2005. ACM Press, New York (2005)
17. Hermenegildo, M., Puebla, G., Bueno, F., López Garcia, P.: Integrated Program Debugging, Verification, and Optimization Using Abstract Interpretation (and The Ciao System Preprocessor). Science of Comp. Progr. 58(1-2) (2005)
18. Hill, P.M., Payet, E., Spoto, F.: Path-length analysis of object-oriented programs. In: EAAI 2006, ENTS. Elsevier, Amsterdam (2006)
19. Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: POPL 2001, pp. 81-92. ACM, New York (2001)
20. Lehner, H., Müller, P.: Formal translation of bytecode into BoogiePL. In: Bytecode 2007, ENTCS, pp. 35-50. Elsevier, Amsterdam (2007)
21. Lindholm, T., Yellin, F.: The Java Virtual Machine Specification. Addison-Wesley, Reading (1996)
22. Necula, G.: Proof-Carrying Code. In: POPL 1997, pp. 106-119. ACM Press, New York (1997)
23. Sands, D.: A naïve time analysis and its theory of cost equivalence. Journal of Logic and Computation 5(4) (1995)
24. Spoto, F.: JULIA: A generic static analyser for the java bytecode. In: FTfJP 2005. (2005)
25. Spoto, F., Jensen, T.: Class analyses as abstract interpretations of trace semantics. ACM Trans. Program. Lang. Syst. 25(5), 578-630 (2003)
26. Zou, W., Wei, T., Mao, J., Chen, Y.: A new algorithm for identifying loops in decompilation. In: Riis Nielson, H., Filé, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 170-183. Springer, Heidelberg (2007)
27. Tip, F.: A Survey of Program Slicing Techniques. J. of Prog. Lang. 3 (1995)
28. Vallee-R,ai, R., Hendren, L., Sundaresan, V., Lam, P., Gagnon, E., Co, P.: Soot - a Java optimization framework. In: GASCON 1999, pp. 125-135 (1999)
29. Wegbreit, B.: Mechanical Program Analysis. Comm. of the ACM 18(9) (1975)