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 条
  • [41] Bounded model checking for past LTL
    Benedetti, M
    Cimatti, A
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2003, 2619 : 18 - 33
  • [42] Mutation coverage estimation for model checking
    Lee, TC
    Hsiung, PA
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2004, 3299 : 354 - 368
  • [43] A practical approach to coverage in model checking
    Chockler, H
    Kupferman, O
    Kurshan, RP
    Vardi, MY
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2001, 2102 : 66 - 78
  • [44] Analyzing interaction orderings with model checking
    Dwyer, MB
    Robby
    Tkachuk, O
    Visser, W
    19TH INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING, PROCEEDINGS, 2004, : 154 - 163
  • [45] Checking nested properties using bounded model checking and sequential ATPG
    Qiang, Q
    Saab, DG
    Abraham, JA
    19TH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS, 2005, : 225 - 230
  • [46] Benefits of Bounded Model Checking at an industrial setting
    Copty, F
    Fix, L
    Fraer, R
    Giunchiglia, E
    Kamhi, G
    Tacchella, A
    Vardi, MY
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2001, 2102 : 436 - 453
  • [47] Bounded model checking of infinite state systems
    Tobias Schuele
    Klaus Schneider
    Formal Methods in System Design, 2007, 30 : 51 - 81
  • [48] Bounded model checking for the universal fragment of CTL
    Penczek, W
    Wozna, B
    Zbrzezny, A
    FUNDAMENTA INFORMATICAE, 2002, 51 (1-2) : 135 - 156
  • [49] Contradictory Antecedent Debugging in Bounded Model Checking
    Grosse, Daniel
    Wille, Robert
    Kuehne, Ulrich
    Drechsler, Rolf
    GLSVLSI 2009: PROCEEDINGS OF THE 2009 GREAT LAKES SYMPOSIUM ON VLSI, 2009, : 173 - 176
  • [50] FO Model Checking on Posets of Bounded Width
    Gajarsky, Jakub
    Hlineny, Petr
    Lokshtanov, Daniel
    Obdrzalek, Jan
    Ordyniak, Sebastian
    Ramanujan, M. S.
    Saurabh, Saket
    2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 963 - 974