8 citations · 15 across the 8 of their papers we have counts for
8 papers
The Autonomous Data Language -- Concepts, Design and Formal Verification
Tom T. P. Franken, Thomas Neele, Jan Friso Groote
Nowadays, the main advances in computational power are due to parallelism. However, most parallel languages have been designed with a focus on processors and threads. This makes de…
A Detailed Account of Compositional Automata Learning through Alphabet Refinement
Leo Henry, Thomas Neele, Mohammad Reza Mousavi +1
Active automata learning infers automaton models of systems from behavioral observations, a technique successfully applied to a wide range of domains. Compositional approaches have…
Expressivity of AuDaLa: Turing Completeness and Possible Extensions
Tom T. P. Franken, Thomas Neele
AuDaLa is a recently introduced programming language that follows the new data autonomous paradigm. In this paradigm, small pieces of data execute functions autonomously. Consideri…
AuDaLa is Turing Complete
Tom T. P. Franken, Thomas Neele
AuDaLa is a recently introduced programming language that follows the new data autonomous paradigm. In this paradigm, small pieces of data execute functions autonomously. Consideri…
Operations on Fixpoint Equation Systems
Thomas Neele, Jaco van de Pol
We study operations on fixpoint equation systems (FES) over arbitrary complete lattices. We investigate under which conditions these operations, such as substituting variables by 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…
On the Scalability of the GPUexplore Explicit-State Model Checker
Nathan Cassee, Thomas Neele, Anton Wijs
The use of graphics processors (GPUs) is a promising approach to speed up model checking to such an extent that it becomes feasible to instantly verify software systems during deve…