Emanuele De Angelis

VeriMAP: A Tool for Verifying Programs through Transformations

We present VeriMAP, a tool for the verification of C programs based on the transformation of constraint logic programs, also called constrained Horn clauses. VeriMAP makes use of Constraint Logic Programming (CLP) as a metalanguage for representing: (i) the operational semantics of the C language, (ii) the program, and (iii) the property to be verified. Satisfiability preserving transformations of the CLP representations are then applied for generating verification conditions and checking their satisfiability. VeriMAP has an interface with various solvers for reasoning about constraints that express the properties of the data (in particular, integers and arrays). Experimental results show that VeriMAP is competitive with respect to state-of-the-art tools for program verification.

Proving correctness of imperative programs by linearizing constrained Horn clauses

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

Verifying Array Programs by Transforming Verification Conditions

\{\varphi\}

Relational verification through horn clause transformation

prog

Verification of Imperative Programs by Constraint Logic Program Transformation

\{\psi\}

Specialization with Constrained Generalization for Software Model Checking

, where the assertions

Synthesizing Concurrent Programs Using Answer Set Programming

\varphi

Verification of Programs by Combining Iterated Specialization with Interpolation

and

Software Model Checking by Program Specialization

\psi

Verifying Controllability of Time-Aware Business Processes

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 constrained Horn clauses whose satisfiability implies that