Skip to Main content Skip to Navigation
New interface
Conference papers

Cell morphing: from array programs to array-free Horn clauses

Abstract : Automatically verifying safety properties of programs is hard. Many approaches exist for verifying programs operating on Boolean and integer values (e.g. abstract interpretation, counterexample-guided abstraction refinement using interpolants), but transposing them to array properties has been fraught with difficulties. Our work addresses that issue with a powerful and flexible abstraction that morphes concrete array cells into a finite set of abstract ones. This abstraction is parametric both in precision and in the back-end analysis used. From our programs with arrays, we generate nonlinear Horn clauses over scalar variables only, in a common format with clear and unambiguous logical semantics, for which there exist several solvers. We thus avoid the use of solvers operating over arrays, which are still very immature. Experiments with our prototype VAPHOR show that this approach can prove automatically and without user annotations the functional correctness of several classical examples, including \emph{selection sort}, \emph{bubble sort}, \emph{insertion sort}, as well as examples from literature on array analysis.
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download
Contributor : Laure Gonnord Connect in order to contact the contributor
Submitted on : Saturday, August 13, 2016 - 7:23:37 AM
Last modification on : Tuesday, October 25, 2022 - 4:25:11 PM
Long-term archiving on: : Monday, November 14, 2016 - 10:25:44 AM


Files produced by the author(s)




  • HAL Id : hal-01206882, version 3
  • ARXIV : 1509.09092



David Monniaux, Laure Gonnord. Cell morphing: from array programs to array-free Horn clauses. 23rd Static Analysis Symposium (SAS 2016), Sep 2016, Edimbourg, United Kingdom. ⟨hal-01206882v3⟩



Record views


Files downloads