Skip to search formSkip to main contentSkip to account menu
LTSmin: High-Performance Language-Independent Model Checking
TLDR
An overview of the LTSmin model checker toolset and its recent changes is presented, and its performance and versatility is demonstrated in two case studies.
View via Publisher
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
µCRL: A Toolset for Analysing Algebraic Specifications
µCRL [13] is a language for specifying and verifying distributed systems in an algebraic fashion. It targets the specification of system behaviour in a process-algebraic style and of data elements in…
View via Publisher
Improved Multi-Core Nested Depth-First Search
TLDR
Cndfs is presented, a tight integration of two earlier multi-core nested depth-first search (Ndfs) algorithms for LTL model checking that exhibits more robust performance with similar scalability, while at the same time reducing memory requirements.
View via Publisher
Efficient Modelling and Generation of Markov Automata
TLDR
A framework for the efficient modelling and generation of Markov automata, consisting of the data-rich process-algebraic language MAPA, a restricted form of the language, the MLPPE, enabling easy state space generation and parallel composition; and several syntactic reduction techniques on theMLPPE format, for generating equivalent but smaller models.
View via Publisher
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
Guard-based partial-order reduction
TLDR
A guard-based method which is a general-purpose implementation of the stubborn set method is presented, and the efficiency of the heuristic algorithm is established by a comparison to the subset-minimal Deletion algorithm and the simple closure algorithm.
View on Springer
A Multi-Core Solver for Parity Games
View via Publisher
Termination Proofs for Higher-order Rewrite Systems
TLDR
This paper deals with termination proofs for Higher-Order Rewrite Systems (HRSs), introduced in [12], which combines the computational aspects of term rewriting and simply typed lambda calculus and produces a proof technique similar to the proof technique for the termination of a well-founded monotone algebra.
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