Multi-core LTSmin: marrying modularity and scalability

Authors:
Alfons Laarman;Jaco van de Pol;Michael Weber
Affiliations:
Formal Methods and Tools, University of Twente, The Netherlands;Formal Methods and Tools, University of Twente, The Netherlands;Formal Methods and Tools, University of Twente, The Netherlands
Venue:
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Year:
2011

Citing 6
Cited 8

The Design of a Multicore Extension of the SPIN Model Checker

IEEE Transactions on Software Engineering
Shared Hash Tables in Parallel Model Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
Incremental Hashing for Spin

SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
BEEM: benchmarks for explicit model checkers

Proceedings of the 14th international SPIN conference on Model checking software
Boosting multi-core reachability performance with shared hash tables

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
LTSMIN: distributed and symbolic reachability

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification

Parallel recursive state compression for free

Proceedings of the 18th international SPIN conference on Model checking software
Multi-core nested depth-first search

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Improved multi-core nested depth-first search

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Multi-core reachability for timed automata

FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
DiVinE 3.0: an explicit-state model checker for multithreaded c & c++ programs

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Multi-core emptiness checking of timed Büchi automata using inclusion abstraction

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Distributed LTL Model Checking with Hash Compaction

Electronic Notes in Theoretical Computer Science (ENTCS)
SpinS: Extending LTSmin with Promela through SpinJa

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The LTSMIN toolset provides multiple generation and on-the-fly analysis algorithms for large graphs (state spaces), typically generated from concise behavioral specifications (models) of systems. LTSMIN supports a variety of input languages, but its key feature is modularity: language frontends, optimization layers, and algorithmic backends are completely decoupled, without sacrificing performance. To complement our existing symbolic and distributed model checking algorithms, we added a multi-core backend for checking safety properties, with several new features to improve efficiency and memory usage: low-overhead load balancing, incremental hashing and scalable state compression.