Automated Reasoning and Natural Proofs for Programs Manipulating Data Structures

Author Madhusudan Parthasarathy

Thumbnail PDF


  • Filesize: 234 kB
  • 2 pages

Document Identifiers

Author Details

Madhusudan Parthasarathy

Cite AsGet BibTex

Madhusudan Parthasarathy. Automated Reasoning and Natural Proofs for Programs Manipulating Data Structures. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 18, pp. 34-35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


We consider the problem of automatically verifying programs that manipulate a dynamic heap, maintaining complex and multiple data-structures, given modular pre-post conditions and loop invariants. We discuss specification logics for heaps, and discuss two classes of automatic procedures for reasoning with these logics. The first identifies fragments of logics that admit completely decidable reasoning. The second is a new approach called the natural proof method that builds proof procedures for very expressive logics that are automatic and sound (but incomplete), and that embody natural proof tactics learnt from manual verification.
  • logic
  • heap structures
  • data structures
  • program verification


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads