• DocumentCode
    3635102
  • Title

    Cluster-Based I/O-Efficient LTL Model Checking

  • Author

    Jiri Barnat;Lubos Brim;Pavel Simecek

  • Author_Institution
    Fac. of Inf., Masaryk Univ., Brno, Czech Republic
  • fYear
    2009
  • Firstpage
    635
  • Lastpage
    639
  • Abstract
    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.
  • Keywords
    "Random access memory","Clustering algorithms","Read-write memory","Concurrent computing","Computer networks","State-space methods","Parallel algorithms","Acceleration","Large-scale systems","Computer industry"
  • Publisher
    ieee
  • Conference_Titel
    Automated Software Engineering, 2009. ASE ´09. 24th IEEE/ACM International Conference on
  • ISSN
    1527-1366
  • Print_ISBN
    978-1-4244-5259-0
  • Type

    conf

  • DOI
    10.1109/ASE.2009.32
  • Filename
    5431718