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...
Egile Nagusiak: | Groce, A, Kroening, D |
---|---|
Formatua: | Journal article |
Argitaratua: |
Elsevier
2005
|
Antzeko izenburuak
-
Making the Most of BMC Counterexamples
nork: Groce, A, et al.
Argitaratua: (2005) -
Understanding Counterexamples with explain
nork: Groce, A, et al.
Argitaratua: (2004) -
Counterexample Guided Abstraction Refinement via Program Execution
nork: Groce, A, et al.
Argitaratua: (2004) -
Counterexample−guided Precondition Inference
nork: Seghir, M, et al.
Argitaratua: (2013) -
Counterexample-guided precondition inference
nork: Seghir, M, et al.
Argitaratua: (2013)