Skip to Main content Skip to Navigation
Conference papers

CPBPV: A Constraint-Programming Framework For Bounded Program Verification

Abstract : This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification (CPBPV). The CPBPV framework uses constraint stores to represent the specification and the program and explores execution paths nondeterministically. The input program is partially correct if each constraint store so produced implies the post-condition. CPBPV does not explore spurious execution paths as it incrementally prunes execution paths early by detecting that the constraint store is not consistent. CPBPV uses the rich language of constraint programming to express the constraint store. Finally, CPBPV is parametrized with a list of solvers which are tried in sequence, starting with the least expensive and less general. Experimental results often produce orders of magnitude improvements over earlier approaches, running times being often independent of the variable domains. Moreover, CPBPV was able to detect subtle errors in some programs while other frameworks based on model checking have failed.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download
Contributor : Michel Rueher <>
Submitted on : Wednesday, January 28, 2015 - 9:39:30 PM
Last modification on : Monday, October 12, 2020 - 10:30:32 AM


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License

Links full text




Hélène Collavizza, Michel Rueher, Pascal van Hentenryck. CPBPV: A Constraint-Programming Framework For Bounded Program Verification. 14th International Conference on Principles and Practice of Constraint Programming, Sep 2008, Sydney, Australia. pp.327-341, ⟨10.1007/978-3-540-85958-1_22⟩. ⟨hal-01099509⟩



Record views