Cell morphing: from array programs to array-free Horn clauses - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

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


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.
Fichier principal
Vignette du fichier
arrays_Horn_articleHAL.pdf (339.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01206882 , version 1 (29-09-2015)
hal-01206882 , version 2 (06-04-2016)
hal-01206882 , version 3 (13-08-2016)





David Monniaux, Laure Gonnord. Cell morphing: from array programs to array-free Horn clauses. Static Analysis Symposium, Sep 2016, Edinburgh, United Kingdom. ⟨hal-01206882v2⟩
826 View
1144 Download



Gmail Facebook X LinkedIn More