On Efficiently Specifying Models for Model Checking

被引:0
|
作者
Nykolaychuk, Mykhaylo [1 ]
Lipaczewski, Michael [1 ]
Liebusch, Tino [1 ]
Ortmeier, Frank [1 ]
机构
[1] Otto von Guericke Univ, Chair Software Engn, Magdeburg, Germany
关键词
design for verification; state-space explosion; formal verification; stateless transitions; SAML; SAFETY ANALYSIS;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Using formal methods for quality assurance is recommended in many standards for safety critical applications. In most industrial contexts, model checking is the only viable option for formal verification, as interactive approaches often require very highly specialized experts. However, model checking typically suffers from the well-known statespace explosion problem. Due to this problem, engineers typically have to decide on a trade-off between readability and completeness of the model on one side, and the state space size, and thus, computational feasibility on the other. In this paper, we propose a method for reducing the state space by restructuring models. The core idea is to introduce as few additional states as possible by model design making state transitions more complex. To avoid unreadability and infeasible model sizes, we introduce a concept for hierarchical boolean formulas to efficiently specify state transitions. For evaluation purposes, we applied this approach to a case study using the VECS toolkit. In this exemplary case study, we were able to reduce the state space size significantly and make verification time feasible.
引用
收藏
页码:14 / 27
页数:14
相关论文
共 50 条
  • [1] On efficiently specifying models for model checking
    Nykolaychuk, Mykhaylo
    Lipaczewski, Michael
    Liebusch, Tino
    Ortmeier, Frank
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8822 : 14 - 27
  • [2] Specifying and Checking File System Crash-Consistency Models
    Bornholt, James
    Kaufmann, Antoine
    Li, Jialin
    Krishnamurthy, Arvind
    Torlak, Emina
    Wang, Xi
    [J]. ACM SIGPLAN NOTICES, 2016, 51 (04) : 83 - 98
  • [3] Specifying and checking file system crash-consistency models
    Bornholt J.
    Kaufmann A.
    Li J.
    Krishnamurthy A.
    Torlak E.
    Wang X.
    [J]. 2016, Association for Computing Machinery (51): : 83 - 98
  • [4] An Environment for Specifying and Model Checking Mobile Ring Robot Algorithms
    Ha Thi Thu Doan
    Riesco, Adrian
    Ogata, Kazuhiro
    [J]. STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2019, 2019, 11914 : 111 - 126
  • [5] Jaaru: Efficiently Model Checking Persistent Memory Programs
    Gorjiara, Hamed
    Xu, Guoqing Harry
    Demsky, Brian
    [J]. ASPLOS XXVI: TWENTY-SIXTH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS, 2021, : 415 - 428
  • [6] Detecting Spurious Counterexamples Efficiently in Abstract Model Checking
    Tian, Cong
    Duan, Zhenhua
    [J]. PROCEEDINGS OF THE 35TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE 2013), 2013, : 202 - 211
  • [7] Specifying Safety Monitors for Autonomous Systems Using Model-Checking
    Machin, Mathilde
    Dufosse, Fanny
    Blanquart, Jean-Paul
    Guiochet, Jeremie
    Powell, David
    Waeselynck, Helene
    [J]. COMPUTER SAFETY, RELIABILITY, AND SECURITY (SAFECOMP 2014), 2014, 8666 : 262 - 277
  • [8] Specifying and Model Checking Workflows of Single Page Applications with TLA+
    Zhang, Gefei
    [J]. COMPANION OF THE 2020 IEEE 20TH INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY, AND SECURITY (QRS-C 2020), 2020, : 406 - 410
  • [9] Specifying and Model Checking Distributed Control Algorithms at Meta-level
    Ha Thi Thu Doan
    Ogata, Kazuhiro
    [J]. COMPUTER JOURNAL, 2022, 65 (12): : 2998 - 3019
  • [10] Coherent checking and updating of Bayesian models without specifying the model space: A decision-theoretic semantics for possibility theory
    Bickel, David R.
    [J]. INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2022, 142 : 81 - 93