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 条
  • [1] Revisiting resistance speeds up I/O-efficient LTL model checking
    Barnat, J.
    Brim, L.
    Simecek, P.
    Weber, M.
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 2008, 4963 : 48 - +
  • [2] Cluster-based LTL model checking of large systems
    Barnat, Jiri
    Brim, Lubos
    Cerna, Ivana
    FORMAL METHODS FOR COMPONENTS AND OBJECTS, 2006, 4111 : 259 - 279
  • [3] Efficient LTL compilation for SAT-based model checking
    Armoni, R
    Egorov, S
    Fraer, R
    Korchemny, D
    Vardi, MY
    ICCAD-2005: INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, DIGEST OF TECHNICAL PAPERS, 2005, : 877 - 884
  • [4] Flash memory efficient LTL model checking
    Edelkamp, S.
    Sulewski, D.
    Barnat, J.
    Brim, L.
    Simecek, P.
    SCIENCE OF COMPUTER PROGRAMMING, 2011, 76 (02) : 136 - 157
  • [5] I/O-efficient planar separators
    Maheshwari, Anil
    Zeh, Norbert
    SIAM JOURNAL ON COMPUTING, 2008, 38 (03) : 767 - 801
  • [6] I/O-Efficient Similarity Join
    Pagh, Rasmus
    Pham, Ninh
    Silvestri, Francesco
    Stockel, Morten
    ALGORITHMICA, 2017, 78 (04) : 1263 - 1283
  • [7] I/O-Efficient Similarity Join
    Rasmus Pagh
    Ninh Pham
    Francesco Silvestri
    Morten Stöckel
    Algorithmica, 2017, 78 : 1263 - 1283
  • [8] I/O-Efficient Similarity Join
    Paghl, Rasmus
    Phaml, Ninh
    Silvestril, Francesco
    Stockel, Morten
    ALGORITHMS - ESA 2015, 2015, 9294 : 941 - 952
  • [9] Efficient model checking for LTL with partial order snapshots
    Niebert, Peter
    Peled, Doron
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (42) : 4180 - 4189
  • [10] Efficient model checking for LTL with partial order snapshots
    Niebert, P
    Peled, D
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2006, 3920 : 272 - 286