Share This Author
LTSmin: High-Performance Language-Independent Model Checking
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.
LTSmin: Distributed and Symbolic Reachability
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.
Boosting multi-core reachability performance with shared hash tables
- A. Laarman, J. V. D. Pol, Michael Weber
- Computer ScienceFormal Methods in Computer Aided Design
- 16 April 2010
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.
µCRL: A Toolset for Analysing Algebraic Specifications
- S. Blom, W. Fokkink, J. F. Groote, Izak van Langevelde, B. Lisser, J. V. D. Pol
- Computer ScienceCAV
- 18 July 2001
µCRL  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…
Improved Multi-Core Nested Depth-First Search
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.
Efficient Modelling and Generation of Markov Automata
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.
Multi-Core LTSmin: Marrying Modularity and Scalability
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.
Guard-based partial-order reduction
- A. Laarman, E. Pater, J. V. D. Pol, Henri Hansen
- Computer ScienceInternational Journal on Software Tools for…
- 8 July 2013
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.
A Multi-Core Solver for Parity Games
Termination Proofs for Higher-order Rewrite Systems
- J. V. D. Pol
- 23 September 1993
This paper deals with termination proofs for Higher-Order Rewrite Systems (HRSs), introduced in , 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.