Automatic Verification of Integer Array Programs

Marius Bozga (1) , Peter Habermehl (2) , Radu Iosif (1) , Filip Konecny (1) , Tomas Vojnar (3)

1 VERIMAG - IMAG - VERIMAG
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
3 FIT / BUT - Faculty of Information Technology [Brno]

We provide a verification technique for a class of programs working on integerarrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL\cite{lpar08} to specify pre- and post-conditions of programs and their parts. Effects of non-looping parts of code are computed syntactically on the level of SIL. Loop pre-conditions derived during the computation in SIL are converted into counter automata (CA). Loops are automatically translated---purely on the syntactical level---to transducers. Pre-condition CA and transducers are composed, and the composition over-approximated by flat automata with difference bound constraints, which are next converted back into SIL formulae, thus inferring post-conditions of the loops. Finally, validity of post-conditions specified by the user in may be checked as entailment is decidable for SIL.

Mots clés: program verification; array programs; array logic; transducers; counter automata; difference bound matrices

Domaines: Systèmes embarqués

Marius Bozga, Peter Habermehl, Radu Iosif, Filip Konecny, Tomas Vojnar. Automatic Verification of Integer Array Programs. Computer Aided Verification, 21st International Conference, CAV 2009, Jun 2009, Grenoble, France. pp.157-172, ⟨10.1007/978-3-642-02658-4_15⟩. ⟨hal-00558070⟩