CPBPV: A Constraint-Programming Framework For Bounded Program Verification - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

CPBPV: A Constraint-Programming Framework For Bounded Program Verification

Résumé

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.

Dates et versions

hal-01099509 , version 1 (28-01-2015)

Licence

Paternité - Pas d'utilisation commerciale - Pas de modification

Identifiants

Citer

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⟩
95 Consultations
1 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More