Fault diagnosis and logic debugging using Boolean satisfiability

被引:163
|
作者
Smith, A [1 ]
Veneris, A
Ali, MF
Viglas, A
机构
[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada
[2] Univ Sydney, Sch Informat Technol, Sydney, NSW 2006, Australia
关键词
Boolean satisfiability debugging; design errors; diagnosis; faults; verification; VLSI;
D O I
10.1109/TCAD.2005.852031
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Recent advances in Boolean satisfiability have made it an attractive engine for solving many digital very-large-scale-integration design problems. Although useful in many stages of the design cycle, fault diagnosis and logic debugging have not been addressed within a satisfiability-based framework. This work proposes a novel Boolean satisfiability-based method for multiple-fault diagnosis and multiple-design-error diagnosis in combinational and sequential circuits. A number of heuristics are presented that keep the method memory and run-time efficient. An extensive suite of experiments on large circuits corrupted with different types of faults and errors confirm its robustness and practicality. They also suggest that satisfiability captures significant characteristics of the problem of diagnosis and encourage novel research in satisfiability-based diagnosis as a complementary process to design verification.
引用
收藏
页码:1606 / 1621
页数:16
相关论文
共 50 条
  • [41] Symmetry in Boolean Satisfiability
    Aloul, Fadi A.
    SYMMETRY-BASEL, 2010, 2 (02): : 1121 - 1134
  • [42] Stochastic Boolean satisfiability
    Littman, ML
    Majercik, SM
    Pitassi, T
    JOURNAL OF AUTOMATED REASONING, 2001, 27 (03) : 251 - 296
  • [43] Stochastic Boolean Satisfiability
    Michael L. Littman
    Stephen M. Majercik
    Toniann Pitassi
    Journal of Automated Reasoning, 2001, 27 : 251 - 296
  • [44] StatSAT: A Boolean Satisfiability based Attack on Logic-Locked Probabilistic Circuits
    Mondal, Ankit
    Zuzak, Michael
    Srivastava, Ankur
    PROCEEDINGS OF THE 2020 57TH ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2020,
  • [45] A scalable, loadable custom programmable logic device for solving Boolean satisfiability problems
    Boyd, MJ
    Larrabee, T
    2000 IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS, 2000, : 13 - 21
  • [46] ATPG for Reversible Circuits Using Simulation, Boolean Satisfiability, and Pseudo Boolean Optimization
    Wille, Robert
    Zhang, Hongyan
    Drechsler, Rolf
    2011 IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI (ISVLSI), 2011, : 120 - 125
  • [47] Using cutwidth to improve symbolic simulation and boolean satisfiability
    Wang, D
    Clarke, E
    Zhu, YS
    Kukula, J
    SIXTH IEEE INTERNATIONAL HIGH-LEVEL DESIGN VALIDATION AND TEST WORKSHOP, PROCEEDINGS, 2001, : 165 - 170
  • [48] Solving employee timetabling problems using Boolean satisfiability
    Aloul, Fadi
    Al-Rawi, Bashar
    Al-Farra, Anas
    Al-Roh, Basel
    2006 INNOVATIONS IN INFORMATION TECHNOLOGY, 2006, : 71 - 75
  • [49] Bounded delay timing analysis using Boolean satisfiability
    Roy, Suchismita
    Chakrabarti, P. P.
    Dasgupta, Pallab
    20TH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS: TECHNOLOGY CHALLENGES IN THE NANOELECTRONICS ERA, 2007, : 295 - +
  • [50] PN Code Acquisition Using Boolean Satisfiability Techniques
    Aloul, Fadi A.
    El-Tarhuni, Mohamed
    2009 IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-5, 2009, : 632 - +