2 citations · 4 across the 6 of their papers we have counts for
6 papers
Efficient Evidence Generation for Modal -Calculus Model Checking (extended version)
Anna Stramaglia, Jeroen J. A. Keiren, Maurice Laveaux +1
Model checking is a technique to automatically assess whether a model of the behaviour of a system meets its requirements. Evidence explaining why the behaviour does (not) meet its…
On-The-Fly Solving for Symbolic Parity Games
Maurice Laveaux, Wieger Wesselink, Tim A. C. Willemse
Parity games can be used to represent many different kinds of decision problems. In practice, tools that use parity games often rely on a specification in a higher-order logic from…
Decomposing Monolithic Processes in a Process Algebra with Multi-actions
Maurice Laveaux, Tim A. C. Willemse
A monolithic process is a single recursive equation with data parameters, which only uses non-determinism, action prefixing, and recursion. We present a technique that decomposes s…
Decompositional Minimisation of Monolithic Processes
Maurice Laveaux, Tim A. C. Willemse
Compositional minimisation can be an effective technique to reduce the state space explosion problem. This technique considers a parallel composition of several processes. In its s…
Adaptive Non-linear Pattern Matching Automata
Rick Erkens, Maurice Laveaux
Efficient pattern matching is fundamental for practical term rewrite engines. By preprocessing the given patterns into a finite deterministic automaton the matching patterns can be…
Correct and Efficient Antichain Algorithms for Refinement Checking
Maurice Laveaux, Jan Friso Groote, Tim A. C. Willemse
The notion of refinement plays an important role in software engineering. It is the basis of a stepwise development methodology in which the correctness of a system can be establis…