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 条
  • [21] Survey on Exact Logic Synthesis Based on Boolean SATisfiability br
    Chu, Zhufei
    Pan, Hongyang
    JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2023, 45 (01) : 14 - 23
  • [22] Exact minimum logic factoring via quantified Boolean satisfiability
    Yoshida, Hiroaki
    Ikeda, Makoto
    Asada, Kunihiro
    2006 13TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS 1-3, 2006, : 1065 - +
  • [23] Combining Symbolic Computer Algebra and Boolean Satisfiability for Automatic Debugging and Fixing of Complex Multipliers
    Mahzoon, Alireza
    Grosse, Daniel
    Drechsler, Rolf
    2018 IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI (ISVLSI), 2018, : 351 - 356
  • [24] Determining Gene Function in Boolean Networks using Boolean Satisfiability
    Lin, Pey-Chang Kent
    Khatri, Sunil P.
    2012 IEEE INTERNATIONAL WORKSHOP ON GENOMIC SIGNAL PROCESSING AND STATISTICS (GENSIPS), 2012, : 176 - 179
  • [25] Application of Probabilistic Spin Logic (PSL) in Detecting Satisfiability of a Boolean Function
    Agarwal, Vaibhav
    Saurabh, Sneh
    PROCEEDINGS OF THE 2019 20TH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN (ISQED), 2019, : 70 - 75
  • [26] Application of Probabilistic Spin Logic (PSL) in Detecting Satisfiability of a Boolean Function
    Agarwal, Vaibhav
    Saurabh, Sneh
    2018 FOURTH INTERNATIONAL CONFERENCE ON COMPUTING COMMUNICATION CONTROL AND AUTOMATION (ICCUBEA), 2018,
  • [27] Using configurable computing to accelerate Boolean satisfiability
    Department of Electrical Engineering, Princeton University, Princeton, NJ 08544, United States
    不详
    不详
    IEEE Trans Comput Aided Des Integr Circuits Syst, 6 (861-868):
  • [28] Satisfiability checking using Boolean Expression Diagrams
    Poul F. Williams
    Henrik R. Andersen
    Henrik Hulgaard
    International Journal on Software Tools for Technology Transfer, 2003, 5 (1) : 4 - 14
  • [29] Multipath Detection Using Boolean Satisfiability Techniques
    Aloul, Fadi A.
    El-Tarhuni, Andmohamed
    JOURNAL OF COMPUTER NETWORKS AND COMMUNICATIONS, 2011, 2011
  • [30] TEST PATTERN GENERATION USING BOOLEAN SATISFIABILITY
    LARRABEE, T
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1992, 11 (01) : 4 - 15