Cluster-Based I/O-Efficient LTL Model Checking

Investor logo
Investor logo
Investor logo

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BARNAT Jiří BRIM Luboš ŠIMEČEK Pavel

Year of publication 2009
Type Article in Proceedings
Conference 24th IEEE/ACM International Conference on Automated Software Engineering
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords parallel; I/O efficient; LTL Model Checking
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.