SAT Solving with GPU Accelerated Inprocessing. | 0 | 0.34 | 2021 |
Term Rewriting on GPUs. | 0 | 0.34 | 2021 |
An O(m log n) algorithm for branching bisimilarity on labelled transition systems. | 0 | 0.34 | 2020 |
Parallel SAT Simplification on GPU Architectures. | 0 | 0.34 | 2019 |
The mCRL2 Toolset for Analysing Concurrent Systems - Improvements in Expressivity and Usability. | 0 | 0.34 | 2019 |
On the Scalability of the GPUexplore Explicit-State Model Checker. | 0 | 0.34 | 2017 |
Analysing the Performance of GPU Hash Tables for State Space Exploration. | 0 | 0.34 | 2017 |
Proceedings Second Graphs as Models Workshop. | 0 | 0.34 | 2016 |
GPU Accelerated Strong and Branching Bisimilarity Checking. | 6 | 0.42 | 2015 |
Formalizing correspondence rules for automotive architecture views | 2 | 0.42 | 2014 |
Define, Verify, Refine: Correct Composition and Transformation of Concurrent System Semantics. | 6 | 0.63 | 2013 |
Partial Order Reduction for Branching Security Protocols | 3 | 0.38 | 2010 |
Solving scheduling problems by untimed model checking - the clinical chemical analyser case study. | 0 | 0.34 | 2005 |