Preprocessing has become a key component of the Boolean satisfiability (SAT) solving
workflow. In practice, preprocessing is situated between the encoding phase and the solving …

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 …

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 …

Recently, a continuous-time, deterministic analog solver based on ordinary differential
equations (CTDS) was introduced, to solve Boolean satisfiability (SAT), a family of discrete …

The tool VoxLogicA merges the state-of-the-art library of computational imaging algorithms
ITK with the combination of declarative specification and optimised execution provided by …

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 …

The past two decades have witnessed an unprecedented improvement in runtime
performance of SAT solvers owing to clever software engineering and creative design of …

GPU programs are widely used in industry. To obtain the best performance, a typical
development process involves the manual or semi-automatic application of optimizations …