Cluster-Based I/O-Efficient LTL Model Checking

被引:6
|
作者
Barnat, Jiri [1 ]
Brim, Lubos [1 ]
Simecek, Pavel [1 ]
机构
[1] Masaryk Univ, Fac Informat, Brno, Czech Republic
关键词
I/O efficient algorithms; LTL; model checking; parallel algorithms;
D O I
10.1109/ASE.2009.32
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
I/O-efficient algorithms take the advantage of large capacities of external memories to verify huge state spaces even on a single machine with low-capacity RAM. On the other hand, parallel algorithms are used to accelerate the computation and their usage may significantly increase the amount of available RAM memory if clusters of computers are involved. Since both the large amount of memory and high speed computation are desired in veri. cation of large-scale industrial systems, extending I/O-efficient model checking to work over a network of computers can bring substantial benefits. In this paper we propose an explicit state cluster-based I/O efficient LTL model checking algorithm that is capable to verify systems with approximately 10(10) states within hours.
引用
收藏
页码:635 / 639
页数:5
相关论文
共 50 条
  • [21] Flash-Efficient LTL Model Checking with Minimal Counterexamples
    Edelkamp, Stefan
    Sulewski, Damian
    SEFM 2008: SIXTH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, PROCEEDINGS, 2008, : 73 - 82
  • [22] Memory-Efficient Tactics for Randomized LTL Model Checking
    Larsen, Kim
    Peled, Doron
    Sedwards, Sean
    VERIFIED SOFTWARE: THEORIES, TOOLS, AND EXPERIMENTS (VSTTE 2017), 2017, 10712 : 152 - 169
  • [23] I/O-Efficient flow Modeling on fat terrains
    de Berg, Mark
    Cheong, Otfried
    Haverkort, Herman
    Lim, Jung Gun
    Toma, Laura
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 239 - +
  • [24] I/O-Efficient Algorithms for Graphs of Bounded Treewidth
    Maheshwari, Anil
    Zeh, Norbert
    ALGORITHMICA, 2009, 54 (03) : 413 - 469
  • [25] I/O-Efficient Algorithms on Triangle Listing and Counting
    Hu, Xiaocheng
    Tao, Yufei
    Chung, Chin-Wan
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2014, 39 (04):
  • [26] I/O-Efficient point location in a set of rectangles
    Nekrich, Yakov
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 687 - 698
  • [27] I/O-Efficient Algorithms for Computing Contours on a Terrain
    Agarwal, Pankaj K.
    Arge, Lars
    Molhave, Thomas
    Sadri, Bardia
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SGG'08), 2008, : 129 - 138
  • [28] I/O-efficient dynamic planar point location
    Arge, L
    Vahrenhold, J
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2004, 29 (02): : 147 - 162
  • [29] I/O-efficient algorithms for graphs of bounded treewidth
    Maheshwari, A
    Zeh, N
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 89 - 90
  • [30] A survey of techniques for designing I/O-efficient algorithms
    Maheshwari, A
    Zeh, N
    ALGORITHMS FOR MEMORY HIERARCHIES: ADVANCED LECTURES, 2003, 2625 : 36 - 61