Verification of a network ASIC component using bounded model checking

被引:3
|
作者
Sun, X. [1 ]
Xie, F.
Wu, J.
Song, X.
机构
[1] Chinese Acad Sci, Chengdu Inst Comp Applicat, Chengdu 610041, Peoples R China
[2] Portland State Univ, Dept ECE, Portland, OR 97207 USA
[3] Portland State Univ, Dept CS, Portland, OR 97207 USA
[4] Univ Mannheim, Fak Math & Informat, D-68131 Mannheim, Germany
关键词
bounded model checking; formal verification; ATM; satisfiability ( SAT);
D O I
10.1080/00207210600963165
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Recently, a new technique called bounded model checking has been proposed that uses fast satisfiability solvers instead of binary decision diagrams (BDDs). This paper presents the experiences on formally verifying the behaviour and implementation of an Asynchronous Transfer Mode (ATM) network switching module using Nusmv2 tool. A number of properties described by linear temporal logic (LTL) are provided, and their veri. cation in reasonable central processing unit ( CPU) time is accomplished by estimating a more precise bound k which is determined by the circuit structure. Moreover, equivalence checking between the structural and behavioural descriptions of the whole switch module as one model is performed, and the results compared with those of the BDD-based approach. Based on that experience, bounded model checking will be the mainstream of industrial chip verification.
引用
收藏
页码:183 / 196
页数:14
相关论文
共 50 条
  • [31] Diagnosability verification using LTL model checking
    Thiago M. Tuxi
    Lilian K. Carvalho
    Eduardo V. L. Nunes
    Antonio E. C. da Cunha
    Discrete Event Dynamic Systems, 2022, 32 : 399 - 433
  • [32] Diagnosability verification using LTL model checking
    Tuxi, Thiago M.
    Carvalho, Lilian K.
    Nunes, Eduardo V. L.
    da Cunha, Antonio E. C.
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2022, 32 (03): : 399 - 433
  • [33] Verifying web applications using bounded model checking
    Huang, YW
    Yu, F
    Hang, C
    Tsai, CH
    Lee, DT
    Kuo, SY
    2004 INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2004, : 199 - 208
  • [34] Using Bounded Model Checking to Focus Fixpoint Iterations
    Monniaux, David
    Gonnord, Laure
    STATIC ANALYSIS, 2011, 6887 : 369 - +
  • [35] Using Bounded Model Checking to Verify Consensus Algorithms
    Tsuchiya, Tatsuhiro
    Schiper, Andre
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2008, 5218 : 466 - +
  • [36] Small Trojan Testing using Bounded Model Checking
    Zhang, Ying
    Yu, Lu
    Li, Huawei
    Jiang, Jianhui
    2018 IEEE INTERNATIONAL TEST CONFERENCE IN ASIA (ITC-ASIA 2018), 2018, : 85 - 90
  • [37] Plankton: Scalable network configuration verification through model checking
    Prabhu, Santhosh
    Chou, Kuan-Yen
    Kheradmand, Ali
    Godfrey, P. Brighten
    Caesar, Matthew
    PROCEEDINGS OF THE 17TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION, 2020, : 953 - 967
  • [38] Bounded Model Checking for LLVM
    Priya, Siddharth
    Su, Yusen
    Bao, Yuyan
    Zhou, Xiang
    Vizel, Yakir
    Gurfinkel, Arie
    2022 FORMAL METHODS IN COMPUTER-AIDED DESIGN, FMCAD, 2022, 3 : 214 - 224
  • [39] Bounded model checking with QBF
    Dershowitz, N
    Hanna, Z
    Katz, J
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS, 2005, 3569 : 408 - 414
  • [40] Bounded model checking of CTL
    Tao, Zhi-Hong
    Zhou, Cong-Hua
    Chen, Zhong
    Wang, Li-Fu
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2007, 22 (01) : 39 - 43