On SAT-based bounded invariant checking of blackbox designs

被引:0
|
作者
Herbstritt, Marc [1 ]
Becker, Bernd [1 ]
机构
[1] Univ Freiburg, Inst Comp Sci, Hugstetter Str 55, D-79110 Freiburg, Germany
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Design verification by property checking is a mandatory task during circuit design. In this context, Bounded Model Checking (BMC) has become popular for falsifying erroneous designs. Additionally, the analysis of partial designs, i.e., circuits that are not fully specified, has recently gained attraction. In this work we analyze how BMC can be applied to such partial designs. Our experiments show that even with the most simple modelling scheme, namely 01X-simulation, a relevant number of errors can be detected. Additionally, we propose a SAT-solver that directly can handle 01X-logic.
引用
收藏
页码:23 / +
页数:3
相关论文
共 50 条
  • [21] SAT-Based Model Checking without Unrolling
    Bradley, Aaron R.
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, 2011, 6538 : 70 - 87
  • [22] Symmetry reduction in SAT-based model checking
    Tang, DJ
    Malik, S
    Gupta, A
    Ip, CN
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2005, 3576 : 125 - 138
  • [23] Certifying proofs for SAT-based model checking
    Alberto Griggio
    Marco Roveri
    Stefano Tonetta
    Formal Methods in System Design, 2021, 57 : 178 - 210
  • [24] SAT-based unbounded symbolic model checking
    Kang, HJ
    Park, IC
    40TH DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2003, 2003, : 840 - 843
  • [25] SAT-based unbounded symbolic model checking
    Kang, HJ
    Park, IC
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2005, 24 (02) : 129 - 140
  • [26] Certifying proofs for SAT-based model checking
    Griggio, Alberto
    Roveri, Marco
    Tonetta, Stefano
    FORMAL METHODS IN SYSTEM DESIGN, 2021, 57 (02) : 178 - 210
  • [27] SAT-based explicit LTLf satisfiability checking
    Li, Jianwen
    Pu, Geguang
    Zhang, Yueling
    Vardi, Moshe Y.
    Rozier, Kristin Y.
    ARTIFICIAL INTELLIGENCE, 2020, 289
  • [28] SAT-Based Explicit LTLf Satisfiability Checking
    Li, Jianwen
    Rozier, Kristin Y.
    Pu, Geguang
    Zhang, Yueling
    Vardi, Moshe Y.
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 2946 - 2953
  • [29] Acceleration of SAT-based iterative property checking
    Grosse, D
    Drechsler, R
    CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, PROCEEDINGS, 2005, 3725 : 349 - 353
  • [30] SAT-based verification of bounded Petri nets
    Tao Zhihong
    Zhou Conghua
    Hans, Kleine Buning
    Wang Lifu
    CHINESE JOURNAL OF ELECTRONICS, 2006, 15 (04): : 567 - 572