25 citations · 42 across the 8 of their papers we have counts for
9 papers
A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value
Antti Valmari, Lauri Hella
We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula t…
A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction
Thomas Neele, Antti Valmari, Tim A. C. Willemse
One of the most popular state-space reduction techniques for model checking is partial-order reduction (POR). Of the many different POR implementations, stubborn sets are a very ve…
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction
Thomas Neele, Antti Valmari, Tim A. C. Willemse
In model checking, partial-order reduction (POR) is an effective technique to reduce the size of the state space. Stubborn sets are an established variant of POR and have seen many…
A State Space Tool for Models Expressed In C++ (tool paper)
Antti Valmari
This publication introduces A State Space Exploration Tool that is based on representing the model under verification as a piece of C++ code that obeys certain conventions. Its nam…
Stop It, and Be Stubborn!
Antti Valmari
A system is AG EF terminating, if and only if from every reachable state, a terminal state is reachable. This publication argues that it is beneficial for both catching non-progres…
A Simple Character String Proof of the "True but Unprovable" Version of Gödel's First Incompleteness Theorem
Antti Valmari
A rather easy yet rigorous proof of a version of Gödel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1,…