23 citations · 54 across the 12 of their papers we have counts for
13 papers
HaliVer: Deductive Verification and Scheduling Languages Join Forces
Lars B. van den Haak, Anton Wijs, Marieke Huisman +1
The HaliVer tool integrates deductive verification into the popular scheduling language Halide, used for image processing pipelines and array computations. HaliVer uses Vercors, a…
A linear parallel algorithm to compute bisimulation and relational coarsest partitions
Jan Martens, Jan Friso Groote, Lars van den Haak +2
The most efficient way to calculate strong bisimilarity is by calculation the relational coarsest partition on a transition system. We provide the first linear time algorithm to ca…
Term Rewriting on GPUs
Johri van Eerd, Jan Friso Groote, Pieter Hijma +2
We present a way to implement term rewriting on a GPU. We do this by letting the GPU repeatedly perform a massively parallel evaluation of all subterms. We find that if the term re…
A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems
David N. Jansen, Jan Friso Groote, Jeroen J. A. Keiren +1
Branching bisimilarity is a behavioural equivalence relation on labelled transition systems that takes internal actions into account. It has the traditional advantage that algorith…
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…
Analysing the Performance of GPU Hash Tables for State Space Exploration
Nathan Cassee, Anton Wijs
In the past few years, General Purpose Graphics Processors (GPUs) have been used to significantly speed up numerous applications. One of the areas in which GPUs have recently led t…
Proceedings Second Graphs as Models Workshop
Alexander Heußner, Aleks Kissinger, Anton Wijs
Graphs are used as models in all areas of computer science: examples are state space graphs, control flow graphs, syntax graphs, UML-type models of all kinds, network layouts, soci…
An O(m log n) Algorithm for Stuttering Equivalence and Branching Bisimulation
Jan Friso Groote, Anton Wijs
We provide a new algorithm to determine stuttering equivalence with time complexity , where is the number of states and is the number of transitions of a Kripk…
Confluence Detection for Transformations of Labelled Transition Systems
Anton Wijs
The development of complex component software systems can be made more manageable by first creating an abstract model and then incrementally adding details. Model transformation is…
Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering
Dragan Bošnački, Stefan Edelkamp, Alberto Lluch Lafuente +1
These are the proceedings of the Third Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2014), which took place on April 5, 2014 in Grenoble, France, as a satellite…
Proceedings 2nd Workshop on GRAPH Inspection and Traversal Engineering
Anton Wijs, Dragan Bošnački, Stefan Edelkamp
These are the proceedings of the Second Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2013), which took place on March 24, 2013 in Rome, Italy, as a satellite ev…
Proceedings First Workshop on GRAPH Inspection and Traversal Engineering
Anton Wijs, Dragan Bošnački, Stefan Edelkamp
These are the proceedings of the First Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2012), which took place on April 1, 2012 in Tallinn, Estonia, as a satellite…
The HIVE Tool for Informed Swarm State Space Exploration
Anton Wijs
Swarm verification and parallel randomised depth-first search are very effective parallel techniques to hunt bugs in large state spaces. In case bugs are absent, however, scalabili…