Download PDFOpen PDF in browser

Quantified Heap Invariants for Object-Oriented Programs

17 pagesPublished: May 4, 2017

Abstract

Heap and data structures represent one of the biggest challenges when applying model checking to the analysis of software programs: in order to verify (unbounded) safety of a program, it is typically necessary to formulate quantified inductive invariants that state properties about an unbounded number of heap locations. Methods like Craig interpolation, which are commonly used to infer invariants in model checking, are often ineffective when a heap is involved. To address this challenge, we introduce a set of new proof and program transformation rules for verifying object-oriented programs with the help of space invariants, which (implicitly) give rise to quantified invariants. Leveraging advances in Horn solving, we show how space invariants can be derived fully automatically, and how the framework can be used to effectively verify safety of Java programs.

Keyphrases: Horn Clause Solving, memory models, software model checking

In: Thomas Eiter and David Sands (editors). LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 46, pages 368--384

Links:
BibTeX entry
@inproceedings{LPAR-21:Quantified_Heap_Invariants_for,
  author    = {Temesghen Kahsai and Rody Kersten and Philipp R\textbackslash{}"ummer and Martin Sch\textbackslash{}"af},
  title     = {Quantified Heap Invariants for Object-Oriented Programs},
  booktitle = {LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Thomas Eiter and David Sands},
  series    = {EPiC Series in Computing},
  volume    = {46},
  pages     = {368--384},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/Pmh},
  doi       = {10.29007/zrct}}
Download PDFOpen PDF in browser