Proving correctness of imperative programs by linearizing constrained Horn clauses

  title={Proving correctness of imperative programs by linearizing constrained Horn clauses},
  author={Emanuele De Angelis and Fabio Fioravanti and Alberto Pettorossi and Maurizio Proietti},
We present a method for verifying the correctness of imperative programs which is based on the automated transformation of their specifications. Given a program prog, we consider a partial correctness specification of the form {φ} prog {ψ}, where the assertions φ and ψ are predicates defined by a set Spec of possibly recursive Horn clauses with linear arithmetic (LA) constraints in their premise (also called constrained Horn clauses). The verification method consists in constructing a set PC of… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 14 extracted citations


Publications referenced by this paper.
Showing 1-10 of 30 references

Horn clause programs for recursive functions

J. Sebelik, P. Stepánek
Logic Programming, K. L. Clark and S.-A. Tärnlund, Eds. Academic Press, 325–340. • 1982
View 4 Excerpts
Highly Influenced

Transformations of CLP Modules

Theor. Comput. Sci. • 1996
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…