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

来源：

2009 IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING, PROCEEDINGS | 2009年

关键词：

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

共 12 条

[1] Barnat J, 2008, LECT NOTES COMPUT SC, V4963, P48, DOI 10.1007/978-3-540-78800-3_5
[2] Barnat J, 2007, LECT NOTES COMPUT SC, V4595, P187
[3] Barnat J, 2007, LECT NOTES COMPUT SC, V4590, P281
[4] BOLLIG B, 2001, LNCS, V2031, P543
[5] Cerná I, 2003, LECT NOTES COMPUT SC, V2648, P49
[6] Edelkamp S, 2006, LECT NOTES COMPUT SC, V3925, P1
[7] Hammer M, 2007, LECT NOTES COMPUT SC, V4346, P51
[8] Holub V, 2007, TASE 2007: FIRST JOINT IEEE/IFIP SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, PROCEEDINGS, P356, DOI 10.1109/TASE.2007.47
[9] Jabbar S, 2006, LECT NOTES COMPUT SC, V3855, P237
[10] KORF RE, 2005, AAAI, P1380

← 1 2 →