Verified resource guarantees for heap manipulating programs

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

Volumn 7212 LNCS, Issue , 2012, Pages 130-145

  Albert, Elvira ^b   Bubel, Richard ^a   Genaim, Samir ^b   Hähnle, Reiner ^a   Román Díez, Guillermo ^c  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^c UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COST ANALYSIS; FORMAL VERIFICATIONS; MEMORY CONSUMPTION; PROGRAM LOGIC; PROGRAM PROPERTIES; PROOF OBLIGATIONS; RESOURCE CONSUMPTION; SOUND ANALYSIS; THEOREM PROVERS; HEAP-MANIPULATING PROGRAMS; REALISTIC PROJECTS;

COST ACCOUNTING; DATA STRUCTURES; INTEGER PROGRAMMING; SOFTWARE ENGINEERING; POSITIVE IONS;

STATIC ANALYSIS;

EID: 84859138175     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28872-2_10     Document Type: Conference Paper

References (18)

1. Albert, E., Arenas, P., Genaim, S., Puebla, G.: Closed-Form Upper Bounds in Static Cost Analysis. Journal of Automated Reasoning 46(2), 161-203 (2011)
2. 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, pp. 157-172. Springer, Heidelberg (2007)
3. Albert, E., Bubel, R., Genaim, S., Hähnle, R., Puebla, G., Román-Díez, G.: Verified Resource Guarantees using COSTA and KeY. In: Proc. of PEPM 2011, pp. 73-76. ACM Press (2011)
4. Ball, T., Bounimova, E., Levin, V., Kumar, R., Lichtenberg, J.: The Static Driver Verifier Research Platform. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 119-122. Springer, Heidelberg (2010)
5. Beckert, B., Hähnle, R., Schmitt, P.H. (eds.): Verification of Object-Oriented Software. LNCS (LNAI), vol. 4334. Springer, Heidelberg (2007)
6. Crary, K., Weirich, S.: Resource Bound Certification. In: POPL 2005, pp. 184-198. ACM Press (2000)
7. de Dios, J., Peña, R.: Certification of Safe Polynomial Memory Bounds. In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 184-199. Springer, Heidelberg (2011)
8. Filliâtre, J.-C., Marché, C.: The Why/Krakatoa/Caduceus Platform for Deductive Program Verification. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 173-177. Springer, Heidelberg (2007)
9. Genaim, S., Zanardini, D.: The Acyclicity Inference of COSTA. In: Workshop on Termination (WST 2010) (July 2010)
10. Gulwani, S., Mehra, K.K., Chilimbi, T.M.: Speed: precise and efficient static estimation of program computational complexity. In: Proc. of POPL 2009, pp. 127-139. ACM (2009)
11. Hoffmann, J., Hofmann, M.: Amortized Resource Analysis with Polynomial Potential. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 287-306. Springer, Heidelberg (2010)
12. Leino, K.R.M.: Dafny: An Automatic Program Verifier for Functional Correctness. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol. 6355, pp. 348-370. Springer, Heidelberg (2010)
13. Necula, G.: Proof-Carrying Code. In: POPL 1997, ACM Press (1997)
14. Pnueli, A., Siegel, M.D., Singerman, E.: Translation Validation. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 151-166. Springer, Heidelberg (1998)
15. Secci, S., Spoto, F.: Pair-Sharing Analysis of Object-Oriented Programs. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 320-335. Springer, Heidelberg (2005)
16. Smans, J., Jacobs, B., Piessens, F., Schulte, W.: An Automatic Verifier for JavaLike Programs Based on Dynamic Frames. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 261-275. Springer, Heidelberg (2008)
17. Spoto, F., Mesnard, F., Payet, É.: A termination analyzer for java bytecode based on path-length. ACM Trans. Program. Lang. Syst. 32(3) (2010)
18. Weiß, B.: Deductive Verification of Object-Oriented Software: Dynamic Frames, Dynamic Logic and Predicate Abstraction. PhD thesis, KIT (2011)