Improved design debugging using maximum satisfiability

被引:0
|
作者
Safarpour, Sean [1 ]
Mangassarian, Hratch [1 ]
Veneris, Andreas [1 ]
Liffiton, Mark H. [2 ]
Sakallah, Karem A. [2 ]
机构
[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON, Canada
[2] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In today's SoC design cycles, debugging is one of the most time consuming manual tasks. CAD solutions strive to reduce the inefficiency of debugging by identifying error sources in designs automatically. Unfortunately, the capacity and performance of such automated techniques must be considerably extended for industrial applicability. This work aims to improve the performance of current state-of-the-art debugging techniques, thus making them more practical. More specifically, this work proposes a novel design debugging formulation based on maximum satisfiability (max-sat) and approximate max-sat. The developed technique can quickly discard many potential error sources in designs, thus drastically reducing the size of the problem passed to an existing debugger. The max-sat formulation is used as a pre-processing step to construct a highly optimized debugging framework. Empirical results demonstrate the effectiveness of the proposed framework as run-time improvements of orders of magnitude are consistently realized over a state-of-the-art debugger.
引用
收藏
页码:13 / +
页数:2
相关论文
共 50 条
  • [1] Automated Design Debugging With Maximum Satisfiability
    Chen, Yibin
    Safarpour, Sean
    Marques-Silva, Joao
    Veneris, Andreas
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2010, 29 (11) : 1804 - 1817
  • [2] Debugging sequential circuits using Boolean satisfiability
    Ali, MF
    Veneris, A
    Safarpour, S
    Drechsler, R
    Smith, A
    Abadir, M
    ICCAD-2004: INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, IEEE/ACM DIGEST OF TECHNICAL PAPERS, 2004, : 204 - 209
  • [3] Debugging sequential circuits using Boolean Satisfiability
    Ali, MF
    Veneris, A
    Safarpour, S
    Abadir, M
    Drechsler, R
    Smith, A
    5TH INTERNATIONAL WORKSHOP ON MICROPROCESSOR TEST AND VERIFICATION: COMMON CHALLENGES AND SOLUTIONS, PROCEEDINGS, 2005, : 44 - 49
  • [4] Fault diagnosis and logic debugging using Boolean satisfiability
    Smith, A
    Veneris, A
    Ali, MF
    Viglas, A
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2005, 24 (10) : 1606 - 1621
  • [5] Fault diagnosis and logic debugging using Boolean satisfiability
    Veneris, A
    4TH INTERNATIONAL WORKSHOP ON MICROPROCESSOR TEST AND VERIFICATION: COMMON CHALLENGES AND SOLUTIONS, PROCEEDINGS, 2003, : 60 - 65
  • [6] Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    Goemans, MX
    Williamson, DP
    JOURNAL OF THE ACM, 1995, 42 (06) : 1115 - 1145
  • [7] Improved Algorithms for Maximum Satisfiability and Its Special Cases
    Brilliantov, Kirill
    Alferov, Vasily
    Bliznets, Ivan
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 4, 2023, : 3898 - 3905
  • [8] Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning
    Fang, Zhiwen
    Li, Chu-Min
    Qiao, Kan
    Feng, Xu
    Xu, Ke
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 303 - +
  • [9] Simulation and Satisfiability Guided Counter-example Triage for RTL Design Debugging
    Poulos, Zissis
    Yang, Yu-Shen
    Veneris, Andreas
    Le, Bao
    PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN (ISQED 2014), 2015, : 618 - +
  • [10] Sums of squares, satisfiability and maximum satisfiability
    van Maaren, H
    van Norden, L
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS, 2005, 3569 : 294 - 308