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 条
  • [21] Solving disjunctive temporal problems with preferences using maximum satisfiability
    Maratea, Marco
    Pulina, Luca
    AI COMMUNICATIONS, 2012, 25 (02) : 137 - 156
  • [22] Automated Synthesis of Semantic Malware Signatures using Maximum Satisfiability
    Feng, Yu
    Bastani, Osbert
    Martins, Ruben
    Dillig, Isil
    Anand, Saswat
    24TH ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2017), 2017,
  • [23] On the maximum satisfiability of random formulas
    Achlioptas, Dimitris
    Naor, Assaf
    Peres, Yuval
    JOURNAL OF THE ACM, 2007, 54 (02)
  • [24] Cause Clue Clauses: Error Localization using Maximum Satisfiability
    Jose, Manu
    Majumdar, Rupak
    PLDI 11: PROCEEDINGS OF THE 2011 ACM CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION, 2011, : 437 - 446
  • [25] ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM
    HANSEN, P
    JAUMARD, B
    COMPUTING, 1990, 44 (04) : 279 - 303
  • [26] Symmetry Breaking for Maximum Satisfiability
    Marques-Silva, Joao
    Lynce, Ines
    Manquinho, Vasco
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2008, 5330 : 1 - +
  • [27] Fault Localization of Energy Consumption Behavior Using Maximum Satisfiability
    Nakajima, Shin
    Lamraoui, Si-Mohamed
    CYBER PHYSICAL SYSTEMS: DESIGN, MODELING, AND EVALUATION, CYPHY 2015, 2015, 9361 : 99 - 115
  • [28] Quantum Algorithm for Maximum Satisfiability
    Alasow, Abdirahman
    Perkowski, Marek
    2022 IEEE 52ND INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2022), 2022, : 27 - 34
  • [29] Cause Clue Clauses: Error Localization using Maximum Satisfiability
    Jose, Manu
    Majumdar, Rupak
    ACM SIGPLAN NOTICES, 2011, 46 (06) : 437 - 446
  • [30] Maximum Satisfiability Using Core-Guided MAXSAT Resolution
    Narodytska, Nina
    Bacchus, Fahiem
    PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 2717 - 2723