Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs
From MaRDI portal
Publication:2802460
DOI10.1007/978-3-662-46669-8_27zbMATH Open1335.68051arXiv1410.5088OpenAlexW1481101394MaRDI QIDQ2802460
Matthew Lewis, Daniel Kroening, Cristina David
Publication date: 26 April 2016
Published in: Programming Languages and Systems (Search for Journal in Brave)
Abstract: This paper shows that it is possible to reason about the safety and termination of programs handling potentially cyclic, singly-linked lists using propositional reasoning even when the safety invariants and termination arguments depend on constraints over the lengths of lists. For this purpose, we propose the theory SLH of singly-linked lists with length, which is able to capture non-trivial interactions between shape and arithmetic. When using the theory of bit-vector arithmetic as a background, SLH is efficiently decidable via a reduction to SAT. We show the utility of SLH for software verification by using it to express safety invariants and termination arguments for programs manipulating potentially cyclic, singly-linked lists with unrestricted, unspecified sharing. We also provide an implementation of the decision procedure and use it to check safety and termination proofs for several heap-manipulating programs.
Full work available at URL: https://arxiv.org/abs/1410.5088
Related Items (1)
Uses Software
This page was built for publication: Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802460)
