Making the most of BMC counterexamples
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 be...
Auteurs principaux: | Groce, A, Kroening, D |
---|---|
Format: | Journal article |
Publié: |
Elsevier
2005
|
Documents similaires
-
Making the Most of BMC Counterexamples
par: Groce, A, et autres
Publié: (2005) -
Understanding Counterexamples with explain
par: Groce, A, et autres
Publié: (2004) -
Counterexample Guided Abstraction Refinement via Program Execution
par: Groce, A, et autres
Publié: (2004) -
Counterexample−guided Precondition Inference
par: Seghir, M, et autres
Publié: (2013) -
Counterexample-guided precondition inference
par: Seghir, M, et autres
Publié: (2013)