Increasing the accuracy of SAT-based debugging

Authors:
André Sülflow;Görschwin Fey;Cécile Braunstein;Ulrich Kühne;Rolf Drechsler
Affiliations:
University of Bremen, Bremen, Germany;University of Bremen, Bremen, Germany;University Paris VI, Paris, France;University of Bremen, Bremen, Germany;University of Bremen, Bremen, Germany
Venue:
Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2009

Citing 9
Cited 3

Symbolic model checking using SAT procedures instead of BDDs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Finding Good Counter-Examples to Aid Design Verification

MEMOCODE '03 Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design
Debugging sequential circuits using Boolean satisfiability

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Comparison of schemes for encoding unobservability in translation to SAT

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Post-verification debugging of hierarchical designs

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Fixing Design Errors with Counterexamples and Resynthesis

ASP-DAC '07 Proceedings of the 2007 Asia and South Pacific Design Automation Conference
Making the Most of BMC Counterexamples

Electronic Notes in Theoretical Computer Science (ENTCS)
Fault diagnosis and logic debugging using Boolean satisfiability

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Automatic Fault Localization for Property Checking

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

WoLFram- A Word Level Framework for Formal Verification

RSP '09 Proceedings of the 2009 IEEE/IFIP International Symposium on Rapid System Prototyping
Accurately handle don't-care conditions in high-level designs and application for reducing initialized registers

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Automated design debugging in a testbench-based verification environment

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Equivalence checking and property checking are powerful techniques to detect error traces. Debugging these traces is a time consuming design task where automation provides help. In particular, debugging based on Boolean Satisfiability (SAT) has been shown to be quite efficient. Given some error traces, the algorithm returns fault candidates. But using random error traces cannot ensure that a fault candidate is sufficient to explain all erroneous behaviors. Our approach provides a more accurate diagnosis by iterating the generation of counterexamples and debugging. This increases the accuracy of the debugging result and yields more valuable counterexamples. As a consequence less time consuming manual iterations between verification and debugging are required - thus the debugging productivity increases.