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 条
  • [41] Efficient zonal diagnosis with maximum satisfiability
    Meng Liu
    Dantong Ouyang
    Shaowei Cai
    Liming Zhang
    Science China Information Sciences, 2018, 61
  • [42] Tableaux for Maximum Satisfiability in Lukasiewicz Logic
    Li, Chu Min
    Manya, Felip
    Vidal, Amanda
    2020 IEEE 50TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2020), 2020, : 243 - 248
  • [43] Efficient zonal diagnosis with maximum satisfiability
    Meng LIU
    Dantong OUYANG
    Shaowei CAI
    Liming ZHANG
    ScienceChina(InformationSciences), 2018, 61 (11) : 17 - 30
  • [44] Branch Location Problems with Maximum Satisfiability
    Zaikin, Oleg
    Ignatiev, Alexey
    Marques-Silva, Joao
    ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, 325 : 379 - 386
  • [45] Query-Guided Maximum Satisfiability
    Zhang, Xin
    Mangal, Ravi
    Nori, Aditya V.
    Naik, Mayur
    ACM SIGPLAN NOTICES, 2016, 51 (01) : 109 - 122
  • [46] Efficient strategies for (weighted) maximum satisfiability
    Xing, Z
    Zhang, WX
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2004, PROCEEDINGS, 2004, 3258 : 690 - 705
  • [47] Subsumed Label Elimination for Maximum Satisfiability
    Berg, Jeremias
    Saikko, Paul
    Jarvisalo, Matti
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 630 - 638
  • [48] Survey on algorithms for the maximum satisfiability problem
    He, Kun
    Zheng, Jiongzhi
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2022, 50 (02): : 82 - 95
  • [49] Satisfiability models for maximum transition power
    Roy, Suchismita
    Chakrabarti, P. P.
    Dasgupta, Pallab
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2008, 16 (08) : 941 - 951
  • [50] Improved design debugging architecture using low power serial communication protocols for signal processing applications
    Murali, A.
    Kakarla, Hari Kishore
    Anitha Priyadarshini, G. M.
    INTERNATIONAL JOURNAL OF SPEECH TECHNOLOGY, 2021, 24 (02) : 291 - 302