Fault Localization and Correction with QBF

In this paper, we study the use of QBF solvers for fault localization and correction of sequential circuits. Given a violated specification, we compute whether the circuit can be repaired by evaluating a sequence of quantified Boolean formulas. If a repair exists, it can be extracted from a certificate for another quantified Boolean formula. Because it only finds components when a repair is possible, this approach is more precise than a satisfiability-based approach that we have developed earlier. We demonstrate this in an experimental evaluation.

[1]  Rajeev Alur,et al.  Deterministic generators and games for Ltl fragments , 2004, TOCL.

[2]  Thomas A. Henzinger,et al.  Reactive Modules , 1999, Formal Methods Syst. Des..

[3]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[4]  Fabio Somenzi,et al.  An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps , 2006, Formal Methods Syst. Des..

[5]  Armin Biere,et al.  Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings , 2006, SAT.

[6]  Graham Steel,et al.  Deduction with XOR Constraints in Security API Modelling , 2005, CADE.

[7]  George J. Milne,et al.  Correct Hardware Design and Verification Methods , 2003, Lecture Notes in Computer Science.

[8]  Rolf Drechsler,et al.  Post-verification debugging of hierarchical designs , 2005, ICCAD 2005.

[9]  Wolfgang Thomas,et al.  On the Synthesis of Strategies in Infinite Games , 1995, STACS.

[10]  Fahiem Bacchus.  CSPs: Adding Structure to SAT , 2006, SAT.

[11]  Rolf Drechsler,et al.  Automatic Fault Localization for Property Checking , 2006, Haifa Verification Conference.

[12]  S. Malik,et al.  Validating the result of a quantified Boolean formula (QBF) solver: theory and practice , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[13]  U. Egly,et al.  On Quantifier Shifting for Quantified Boolean Formulas , 2004 .

[14]  Roderick Bloem,et al.  Program Repair as a Game , 2005, CAV.

[15]  Fahiem Bacchus,et al.  Binary Clause Reasoning in QBF , 2006, SAT.

[16]  Jim Alves-Foss,et al.  Higher Order Logic Theorem Proving and its Applications 8th International Workshop, Aspen Grove, Ut, Usa, September 11-14, 1995 : Proceedings , 1995 .

[17]  Tiziano Villa,et al.  VIS: A System for Verification and Synthesis , 1996, CAV.

[18]  Marco Benedetti.  Extracting Certificates from Quantified Boolean Formulas , 2005, IJCAI.

[19]  M. Maidi.  The common fragment of CTL and LTL , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[20]  Roderick Bloem,et al.  Finding and Fixing Faults , 2005, CHARME.

[21]  Roderick Bloem,et al.  Automated Fault Localization for C Programs , 2007, V&D@FLoC.

[22]  Marco Benedetti,et al.  sKizzo: A Suite to Evaluate and Certify QBFs , 2005, CADE.