Verified resource guarantees for heap manipulating programs
Paper i proceeding, 2012

Program properties that are automatically inferred by static analysis tools are generally not considered to be completely trustworthy, unless the tool implementation or the results are formally verified. Here we focus on the formal verification of resource guarantees inferred by automatic cost analysis. Resource guarantees ensure that programs run within the indicated amount of resources which may refer to memory consumption, to number of instructions executed, etc. In previous work we studied formal verification of inferred resource guarantees that depend only on integer data. In realistic programs, however, resource consumption is often bounded by the size of heap-allocated data structures. Bounding their size requires to perform a number of structural heap analyses. The contributions of this paper are (i) to identify what exactly needs to be verified to guarantee sound analysis of heap manipulating programs, (ii) to provide a suitable extension of the program logic used for verification to handle structural heap properties in the context of resource guarantees, and (iii) to improve the underlying theorem prover so that proof obligations can be automatically discharged.

Proof obligations

Theorem provers

Data structures

Integer programming

Software engineering

Memory consumption

Cost analysis

Cost accounting

Program properties

Sound analysis

Resource consumption

Formal verifications

Static analysis

Program logic


Elvira Albert

Universidad Complutense de Madrid

Richard Bubel

Chalmers, Data- och informationsteknik, Programvaruteknik

Samir Genaim

Universidad Complutense de Madrid

Reiner Hähnle

Chalmers, Data- och informationsteknik, Programvaruteknik

Guillermo Roman-Diez

Universidad Politecnica de Madrid

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 7212 130-145


Data- och informationsvetenskap