Since 2013, the leading SAT solvers in the SAT competition all use inprocessing, which
unlike preprocessing, interleaves search with simplifications. However, applying …

Various techniques have been proposed to accelerate explicit-state model checking with
GPUs, but none address the compact storage of states, or if they do, at the cost of losing …

Since 2013, the leading SAT solvers in SAT competitions all use inprocessing, which, unlike
preprocessing, interleaves search with simplifications. However, inprocessing is typically a …

In-Memory Computing (IMC) using memristors has gained significant interest in recent years
as it addresses the issue of memory bottleneck in the von Neumann architectures. One of …

The effective parallelisation of Bounded Model Checking is challenging, due to SAT and
SMT solving being hard to parallelise. We present ParaFROST, which is the first tool to …

GPUexplore 3.0 is an explicit state space exploration tool that runs entirely on a graphics
processing unit (GPU), and supports models of concurrent systems with data variables. We …

Most modern and successful SAT solvers are based on the Conflict-Driven Clause-Learning
(CDCL) algorithm. The CDCL approach is to try to learn from previous assignments, and …

The need for massively parallel algorithms, suitable to exploit the computational power of
hardware such as graphics processing units, is ever increasing. In this paper, we propose a …

This paper presents a brief description of our solver PARAFROST which stands for Parallel
Formal Reasoning On SaTisfiability in 2 different configurations. Compared to the solver …

The GPU acceleration of explicit state space exploration, for explicit-state model checking,
has been the subject of previous research, but to date, the tools have been limited in their …