Automated Verification of Recursive Programs with Pointers

  • Frank de Boer
  • Marcello Bonsangue
  • Jurriaan Rot
Conference paper

DOI: 10.1007/978-3-642-31365-3_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7364)
Cite this paper as:
de Boer F., Bonsangue M., Rot J. (2012) Automated Verification of Recursive Programs with Pointers. In: Gramlich B., Miller D., Sattler U. (eds) Automated Reasoning. IJCAR 2012. Lecture Notes in Computer Science, vol 7364. Springer, Berlin, Heidelberg

Abstract

We present a fully automated method for the verification of annotated recursive programs with dynamic pointer structures. Assertions are expressed in a dialect of dynamic logic extended with nominals and tailored to heap structures, in which one can express complex reachability properties. Verification conditions are generated using a novel calculus for computing the strongest postcondition of statements manipulating the heap, such as dynamic allocation and field-assignment. Further, we introduce a new decidable tableaux-based method and its prototype implementation to automatically check these verification conditions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Frank de Boer
    • 1
    • 2
  • Marcello Bonsangue
    • 1
  • Jurriaan Rot
    • 1
  1. 1.Leiden Institute of Advanced Computer Science (LIACS)LeidenNetherlands
  2. 2.Centrum Wiskunde en Informatica (CWI)AmsterdamNetherlands

Personalised recommendations