Making the most of BMC counterexamples

Journal article

The value of model checking counterexamples for debugging programs (and specifications) is widely recognized. Unfortunately, bounded model checkers often produce counterexamples that are difficult to understand due to the values chosen by a SAT solver. This paper presents two approaches to making better use of BMC counterexamples. The first contribution is a new notion of counterexample minimization that minimizes values with respect to the type system of the language being model checked, rather than at the level of SAT variables. Greedy and optimal approaches to the minimization problem are presented and compared. The second contribution extends a BMC-based error explanation approach to automatically hypothesize causes for the error in a counterexample. These hypotheses (in terms of relationships between variables) can be automatically checked to determine if a causal dependence exists. Experimental results show that causes can be automatically determined for errors in interesting ANSI C programs. © 2005 Elsevier B.V.

Authors: Groce, A; Kroening, D

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Elsevier
• Journal: Electronic Notes in Theoretical Computer Science
• Volume: 119
• Issue: 2
• Pages: 67-81
• Publication date: 2005-03-01
• DOI: 10.1016/j.entcs.2004.12.023
• ISSN: 1571-0661
• Keywords: SBTMR