A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Proving correctness of imperative programs by linearizing constrained Horn clauses
2015
Theory and Practice of Logic Programming
AbstractWe present a method for verifying the correctness of imperative programs which is based on the automated transformation of their specifications. Given a programprog, we consider a partial correctness specification of the form {ϕ},prog{ψ}, where the assertions ϕ and ψ are predicates defined by a setSpecof possibly recursive Horn clauses with linear arithmetic (LA) constraints in their premise (also calledconstrained Horn clauses). The verification method consists in constructing a
doi:10.1017/s1471068415000289
fatcat:3avbtyt3tjhshad3tnq4pcwv4i