A dynamic constraint-based BMC strategy for generating counterexamples

Abstract

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.

Constraint-based BMC: a backjumping strategy

“…3.2 and 3.3). For each property, we compare the results obtained with DPVS [13] to those obtained with CBMC [10], a state-of-the-art bounded…”

Grey-Box Testing and Verification of Java/JML

“…This work represents a continuation of the work done in the DANOCOPS project 3 . A similar approach has been proposed by Collavizza et al [27], using a bounded model-checking approach to generate counter-examples of program properties using the Comet platform.…”