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...
Huvudupphovsmän: | Groce, A, Kroening, D |
---|---|
Materialtyp: | Journal article |
Publicerad: |
Elsevier
2005
|
Liknande verk
Liknande verk
-
Making the Most of BMC Counterexamples
av: Groce, A, et al.
Publicerad: (2005) -
Understanding Counterexamples with explain
av: Groce, A, et al.
Publicerad: (2004) -
Counterexample Guided Abstraction Refinement via Program Execution
av: Groce, A, et al.
Publicerad: (2004) -
Counterexample−guided Precondition Inference
av: Seghir, M, et al.
Publicerad: (2013) -
Counterexample-guided precondition inference
av: Seghir, M, et al.
Publicerad: (2013)