Verified resource guarantees for heap manipulating programs

  • Authors:

  • Elvira Albert;Richard Bubel;Samir Genaim;Reiner Hähnle;Guillermo Román-Díez

  • Affiliations:

  • DSIC, Complutense University of Madrid (UCM), Spain;CSE, Chalmers University of Technology, Sweden;DSIC, Complutense University of Madrid (UCM), Spain;CSE, Chalmers University of Technology, Sweden;DLSIIS, Technical University of Madrid (UPM), Spain

  • Venue:
  • FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.