Frontend model generation for SAT-based property checking

被引:0
|
作者
Wedler, M [1 ]
Stoffel, D [1 ]
Kunz, W [1 ]
机构
[1] Univ Kaiserslautern, Dept Elect & Comp Engn, Kaiserslautern, Germany
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper provides an overview on recently developed model generation techniques for SAT-based property checking. To overcome limitations of SAT-based property checking, we suggest to tailor synthesis procedures in the frontend of the property checker towards the verification algorithms used in the backend. This paradigm has been applied to two different design categories. As a first example, for control intensive designs with many interacting state machines, appropriate state encoding can facilitate the representation of state sets. As a second example, for arithmetic datapath verification, we suggest to synthesize an arithmetic bit level description to enable normalization techniques in the backend. W? demonstrate the usefulness of our approach by means of industrial test cases.
引用
下载
收藏
页码:914 / 919
页数:6
相关论文
共 50 条
  • [21] SAT-based unbounded model checking of timed automata
    Penczek, Wojciech
    Szreter, Maciej
    SEVENTH INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS, 2007, : 236 - 237
  • [22] Efficient LTL compilation for SAT-based model checking
    Armoni, R
    Egorov, S
    Fraer, R
    Korchemny, D
    Vardi, MY
    ICCAD-2005: INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, DIGEST OF TECHNICAL PAPERS, 2005, : 877 - 884
  • [23] Model checking with SAT-based characterization of ACTL formulas
    Zhang, Wenhui
    FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, 2007, 4789 : 191 - 211
  • [24] Combining abstraction refinement and SAT-Based model checking
    Amla, Nina
    McMillan, Kenneth L.
    Tools and Algorithms for the Construction and Analysis of Systems, Proceedings, 2007, 4424 : 405 - 419
  • [25] Proving ∀μ-calculus properties with SAT-based model checking
    Wang, BY
    FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2005, 2005, 3731 : 113 - 127
  • [26] SAT-Based ATL Satisfiability Checking
    Kacprzak, Magdalena
    Niewiadomski, Artur
    Penczek, Wojciech
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 539 - 549
  • [27] SAT-based bounded model checking for SE-LTL
    Zhou Conghua
    Ju Shiguang
    SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, : 582 - +
  • [28] Lazy Abstraction and SAT-Based Reachability in Hardware Model Checking
    Vizel, Yakir
    Grumberg, Orna
    Shoham, Sharon
    PROCEEDINGS OF THE 12TH CONFERENCE ON FORMAL METHODS IN COMPUTER-AIDED DESIGN (FMCAD 2012), 2012, : 173 - 181
  • [29] SAT-based model-checking for security protocols analysis
    Alessandro Armando
    Luca Compagna
    International Journal of Information Security, 2008, 7 : 3 - 32
  • [30] On SAT-Based Model Checking of Speed-Independent Circuits
    Huemer, Florian
    Najvirt, Robert
    Steininger, Andreas
    2022 25TH INTERNATIONAL SYMPOSIUM ON DESIGN AND DIAGNOSTICS OF ELECTRONIC CIRCUITS AND SYSTEMS (DDECS), 2022, : 100 - 105