Verification of SpecC using predicate abstraction

被引:0
|
作者
Jain, H [1 ]
Kroening, D [1 ]
Clarke, E [1 ]
机构
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
来源
SECOND ACM AND IEEE INTERNATIONAL CONFERENCE ON FORMAL METHODS AND MODELS FOR CO-DESIGN, PROCEEDINGS | 2004年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Languages such as SystemC or SpecC offer a new design paradigm that addresses the industry's need for a fast time-to-market. However formal verification techniques are widely applied in the hardware design industry only for low level designs, such as a netlist or RTL. The higher abstraction levels offered by these new languages are not yet amenable to rigorous, formal verification. This paper describes how to apply predicate abstraction to SpecC system descriptions. The technique supports the concurrency constructs offered by SpecC. It models the bit-vector semantics of the language accurately, and can be used for both property checking and for checking refinement together with a traditional low-level design given in Verilog.
引用
收藏
页码:7 / 16
页数:10
相关论文
共 50 条
  • [31] Shape analysis by predicate abstraction
    Balaban, I
    Pnueli, A
    Zuck, LD
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, PROCEEDINGS, 2005, 3385 : 164 - 180
  • [32] Predicate abstraction with minimum predicates
    Chaki, S
    Clarke, E
    Groce, A
    Strichman, O
    CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, PROCEEDINGS, 2003, 2860 : 19 - 34
  • [33] Predicate Abstraction for Reactive Synthesis
    Walker, Adam
    Ryzhyk, Leonid
    2014 FORMAL METHODS IN COMPUTER-AIDED DESIGN (FMCAD), 2014, : 219 - 226
  • [34] Counterexamples with loops for predicate abstraction
    Kroening, Daniel
    Weissenbacher, Georg
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2006, 4144 : 152 - 165
  • [35] Using counterexample analysis to minimize the number of predicates for predicate abstraction
    Sakunkonchak, Thanyapat
    Komatsu, Satoshi
    Fujita, Masahiro
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2007, 4762 : 553 - +
  • [36] Predicate Abstraction of ANSI-C Programs Using SAT
    Edmund Clarke
    Daniel Kroening
    Natasha Sharygina
    Karen Yorav
    Formal Methods in System Design, 2004, 25 : 105 - 127
  • [37] Progress on reachability analysis of hybrid systems using predicate abstraction
    Alur, R
    Dang, T
    Ivancic, F
    HYBRID SYSTEMS: COMPUTATION AND CONTROL, PROCEEDINGS, 2003, 2623 : 4 - 19
  • [38] Predicate abstraction of ANSI-C programs using SAT
    Clarke, E
    Kroening, D
    Sharygina, N
    Yorav, K
    FORMAL METHODS IN SYSTEM DESIGN, 2004, 25 (2-3) : 105 - 127
  • [39] Counter-example based predicate discovery in predicate abstraction
    Das, S
    Dill, DL
    FORMAL METHODS IN COMPUTER-AIDED DESIGN, PROCEEDINGS, 2002, 2517 : 19 - 32
  • [40] Incremental Verification Using Trace Abstraction
    Rothenberg, Bat-Chen
    Dietsch, Daniel
    Heizmann, Matthias
    STATIC ANALYSIS (SAS 2018), 2018, 11002 : 364 - 382