Skip to search formSkip to main contentSkip to account menu
LTSmin: Distributed and Symbolic Reachability
TLDR
The LTSmin toolset provides means to generate state spaces from high-level specifications, to check safety properties on-the-fly, to store the resulting labelled transition systems (LTSs) in compressed format, and to minimize them with respect to (branching) bisimulation.
View via Publisher
Boosting multi-core reachability performance with shared hash tables
TLDR
The implementation outperforms two state-of-the-art multi-core model checkers, SPIN and DiVinE, by a large margin, while placing fewer constraints on the load balancing and search algorithms.
View on IEEE
Multi-Core LTSmin: Marrying Modularity and Scalability
TLDR
This work 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.
View via Publisher
A Multi-Core Solver for Parity Games
View via Publisher
Local Parallel Model Checking for the Alternation-Free µ-Calculus
We describe the design of (several variants of) a local parallel model-checking algorithm for the alternation-free fragment of the µ-calculus. It exploits a characterisation of the problem for this…
View via Publisher
Detection of symmetry of Boolean functions represented by ROBDDs
TLDR
The approach presented in this paper uses preprocessing methods to find as many asymmetric pairs of variables as possible to avoid cofactor computations at the end, using special properties of the ROBDD structure as well as properties of Boolean functions.
View on ACM
Parallel Recursive State Compression for Free
TLDR
A multi-core tree-based compression method, which works by leveraging sharing among sub-vectors of state vectors, which shows the potential to compress even large states to a small constant on average (8 bytes).
View PDF on arXiv
Bridging the Gap between Enumerative and Symbolic Model Checkers
TLDR
The method proposed significantly reduces the complexity of building modular yet still efficient model checking tools by match or even outperform existing tools by reusing their own state generators, which are linked into an implementation of the ideas.
Multi-core Nested Depth-First Search
TLDR
This paper introduces, for the first time, a multi-core Ndfs algorithm that can scale beyond two threads, while maintaining exactly the same worst-case time complexity.
View via Publisher
Parallel Model Checking for LTL, CTL*, and Lµ2
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License