A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Verifying Array Programs by Transforming Verification Conditions
[chapter]
2014
Lecture Notes in Computer Science
We present a method for verifying properties of imperative programs manipulating integer arrays. We assume that we are given a program and a property to be verified. The interpreter (that is, the operational semantics) of the program is specified as a set of Horn clauses with constraints in the domain of integer arrays, also called constraint logic programs over integer arrays, denoted CLP(Array). Then, by specializing the interpreter with respect to the given program and property, we generate
doi:10.1007/978-3-642-54013-4_11
fatcat:f347lp3cwndclmjj7qprwc2r4e