Technical report

 
Bozga, M., Habermehl, P., Iosif, R., Konečný, F., Vojnar, T.: Automatic Verification of Integer Array Programs, TR-2009-2, Grenoble, FR, VERIMAG, 2009, p. 49
Publication language:english
Original title:Automatic Verification of Integer Array Programs
Title (cs):Automatická verifikace programů s poli
Pages:49
Place:TR-2009-2, Grenoble, FR
Year:2009
Publisher:VERIMAG
URL:http://www-verimag.imag.fr/TR/TR-2009-2.pdf [PDF]
Keywords
formal verification, arrays, automata, mathematical logic
Annotation
This report is the full version of an CAV'09 paper. We provide a verification technique for a class of programs working  on \emph{integer
arrays} of finite, but not a priori bounded length. We use the logic of integer arrays \textbf{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 \textbf{SIL}. Loop pre-conditions derived during the computation in \textbf{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 \textbf{SIL} formulae, thus inferring post-conditions
of the loops. Finally, validity of post-conditions specified by the user in \textbf{SIL} may be checked as entailment is
decidable for \textbf{SIL}.
BibTeX:
@TECHREPORT{
   author = {Marius Bozga and Peter Habermehl and Radu Iosif and Filip
	Konečný and Tomáš Vojnar},
   title = {Automatic Verification of Integer Array Programs},
   pages = {49},
   year = {2009},
   location = {TR-2009-2, Grenoble, FR},
   publisher = {VERIMAG},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=9006}
}