Analyzing functional coverage in bounded model checking

被引:19
|
作者
Grosse, Daniel [1 ]
Kuehne, Ulrich [1 ]
Drechsler, Rolf [1 ]
机构
[1] Univ Bremen, D-28359 Bremen, Germany
关键词
Boolean satisfiability (SAT); bounded model checking (BMC); formal verification; functional coverage;
D O I
10.1109/TCAD.2008.925790
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Formal verification is an important issue in circuit and system design. In this context, bounded model checking (BMC) is one of the most successful techniques. However, even if all the specified properties can be verified, it is difficult to determine whether they cover the complete functional behavior of a design. We propose a practical approach to analyze coverage in BMC. The approach can easily be integrated in a BMC tool with only minor changes. In our approach, a coverage property is generated for each important signal. If the considered properties do not describe the signal's entire behavior, the coverage property fails, and a counter example is generated. From the counter example, an uncovered scenario can be derived. This way, the approach also helps in design understanding. We demonstrate our method for a reduced instruction set computer (RISC) CPU. First, the coverage of the block-level verification is considered. Second, it is demonstrated how the technique can be applied on a higher level. Therefore, we investigate the instruction set verification of the RISC CPU. The experiments show that the costs for coverage analysis are comparable to the verification costs. Based on the results, we identified coverage gaps during the verification. We were able to close all of them and achieved 100% functional coverage in total.
引用
收藏
页码:1305 / 1314
页数:10
相关论文
共 50 条
  • [31] Simple bounded LTL model checking
    Latvala, T
    Biere, AN
    Heljanko, K
    Junttila, T
    FORMAL METHODS IN COMPUTER-AIDED DESIGN, 2004, 3312 : 186 - 200
  • [32] Bounded Model Checking of ACTL formulae
    Chen, Wei
    Zhang, Wenhui
    THIRD INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, PROCEEDINGS, 2009, : 90 - 99
  • [33] Bounded Model Checking for Probabilistic Programs
    Jansen, Nils
    Dehnert, Christian
    Kaminski, Benjamin Lucien
    Katoen, Joost-Pieter
    Westhofen, Lukas
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2016, 2016, 9938 : 68 - 85
  • [34] Model checking with bounded context switching
    Holzmann, Gerard J.
    Florian, Mihai
    FORMAL ASPECTS OF COMPUTING, 2011, 23 (03) : 365 - 389
  • [35] Bounded model checking for timed systems
    Audemard, G
    Cimatti, A
    Kornilowicz, A
    Sebastiani, R
    FORMAL TECHNIQUE FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2002, PROCEEDINGS, 2002, 2529 : 243 - 259
  • [36] Using bounded model checking with BOGOR
    Lee, Taehoon
    Cho, Mintaek
    Kwon, Gihwon
    SERA 2007: 5TH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING RESEARCH, MANAGEMENT, AND APPLICATIONS, PROCEEDINGS, 2007, : 863 - +
  • [37] Bounded model checking of pointer programs
    Charatonik, W
    Georgieva, L
    Maier, P
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2005, 3634 : 397 - 412
  • [38] Completeness and complexity of bounded model checking
    Clarke, E
    Kroening, D
    Ouaknine, J
    Strichman, O
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, PROCEEDINGS, 2004, 2937 : 85 - 96
  • [39] Computational challenges in bounded model checking
    Clarke E.
    Kroening D.
    Ouaknine J.
    Strichman O.
    International Journal on Software Tools for Technology Transfer, 2005, 7 (2) : 174 - 183
  • [40] Bounded model checking for region automata
    Yu, F
    Wang, BY
    Huang, YW
    FORMAL TECHNIQUES, MODELLING AND ANALYSIS OF TIMED AND FAULT-TOLERANT SYSTEMS, PROCEEDINGS, 2004, 3253 : 246 - 262