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 条
  • [31] Parallel search for maximum satisfiability
    Ruben Martins
    Constraints, 2015, 20 (4) : 469 - 470
  • [32] Parallel search for maximum satisfiability
    Martins, Ruben
    Manquinho, Vasco
    Lynce, Ines
    AI COMMUNICATIONS, 2012, 25 (02) : 75 - 95
  • [33] Investigation of maximum and minimum satisfiability problems using L-partition
    Adel'shin, AV
    AUTOMATION AND REMOTE CONTROL, 2004, 65 (03) : 388 - 395
  • [34] Efficient Static Compaction of Test Patterns Using Partial Maximum Satisfiability
    Zhou, Huisi
    Ouyang, Dantong
    Zhang, Liming
    TSINGHUA SCIENCE AND TECHNOLOGY, 2021, 26 (01) : 1 - 8
  • [35] Maximum Circuit Activity Estimation Using Pseudo-Boolean Satisfiability
    Mangassariani, Hratch
    Veneris, Andreas
    Safarpour, Sean
    Najm, Farid N.
    Abadir, Magdy S.
    2007 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, VOLS 1-3, 2007, : 1538 - +
  • [36] Maximum Circuit Activity Estimation Using Pseudo-Boolean Satisfiability
    Mangassarian, Hratch
    Veneris, Andreas
    Najm, Farid N.
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2012, 31 (02) : 271 - 284
  • [37] Efficient Static Compaction of Test Patterns Using Partial Maximum Satisfiability
    Huisi Zhou
    Dantong Ouyang
    Liming Zhang
    Tsinghua Science and Technology, 2021, 26 (01) : 1 - 8
  • [38] Investigation of Maximum and Minimum Satisfiability Problems Using L-Partition
    A. V. Adel'shin
    Automation and Remote Control, 2004, 65 : 388 - 395
  • [39] Clause tableaux for maximum and minimum satisfiability
    Argelich, Josep
    Li, Chu Min
    Manya, Felip
    Soler, Joan Ramon
    LOGIC JOURNAL OF THE IGPL, 2021, 29 (01) : 7 - 27
  • [40] Quantum Algorithm for Variant Maximum Satisfiability
    Alasow, Abdirahman
    Jin, Peter
    Perkowski, Marek
    ENTROPY, 2022, 24 (11)