A Dynamic Constraint-Based BMC Strategy For Generating Counterexamples

Hélène Collavizza (1) , Nguyen Le Vinh (1) , Michel Rueher (1) , Samuel Devulder (2) , Thierry Gueguen (2)

1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe CEP
2 Geensys

Checking safety properties is mandatory in the validation process of critical software. When formal verification tools fail to prove some properties, the automatic generation of counterexamples for a given loop depth is achievable, and is therefore an important issue in practice. We propose in this paper a dynamic constraint based exploration strategy for software bounded model checking. Constraint solving is integrated with state exploration to prune state space. Experiments on a real industrial Flasher Manager controller show that our system outperforms state of the art bounded model checking tools.

Mots clés: bounded model checking; dynamic exploration strategy; con- straint programming; counterexamples; program testing

Domaines: Logique en informatique [cs.LO]; Génie logiciel [cs.SE]; Intelligence artificielle [cs.AI]

Hélène Collavizza, Nguyen Le Vinh, Michel Rueher, Samuel Devulder, Thierry Gueguen. A Dynamic Constraint-Based BMC Strategy For Generating Counterexamples. 2010. ⟨hal-00531081⟩