VeriMAP: A tool for verifying programs through transformations
Tools and Algorithms for the Construction and Analysis of Systems: 20th …, 2014•Springer
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 …
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 …
Abstract
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.
Springer
Showing the best result for this search. See all results