Automatic Verification of Integer Array Programs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F09%3APU82657" target="_blank" >RIV/00216305:26230/09:PU82657 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Automatic Verification of Integer Array Programs
Original language description
<div align=left>We provide a verification technique for a class of programs working  on emph{integer<br> arrays} of finite, but not a priori bounded length. We use the logic of integer arrays textbf{SIL} cite{lpar08} to<br> specify pre- and post-conditions of programs and their parts. Effects of non-looping parts of code are computed<br> syntactically on the level of textbf{SIL}. Loop pre-conditions derived during the computation in textbf{SIL} are<br> converted into counter automata (CA). Loops are automatically translated---purely on the syntactical level---to<br> transducers. Pre-condition CA and transducers are composed, and the composition over-approximated by flat automata with<br> difference bound constraints, which are next convertedback into textbf{SIL} formulae, thus inferring post-conditions<br> of the loops. Finally, validity of post-conditions specified by the user in textbf{SIL} may be checked as entailment is<br> decidable for textbf{SIL}.</div>
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)