Cluster-Based I/O-Efficient LTL Model Checking

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 avai...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE/ACM International Conference on Automated Software Engineering pp. 635 - 639
Main Authors Barnat, J., Brim, L., Simecek, P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2009
Subjects
Acceleration
Clustering algorithms
Computer industry
Computer networks
Concurrent computing
I/O-efficient model checking
Large-scale systems
LTL
Parallel algorithms
parallel model checking
Random access memory
Read-write memory
State-space methods
Online AccessGet full text

Cover

More Information
Summary: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 verification 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.
ISBN:1424452597
9781424452590
ISSN:1938-4300
2643-1572
DOI:10.1109/ASE.2009.32