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 …

Abstract The Ant Colony System (ACS) is, next to Ant Colony Optimization (ACO) and the
MAX–MIN Ant System (MMAS), one of the most efficient metaheuristic algorithms inspired by …

Metaheuristics have been showing interesting results in solving hard optimization problems.
However, they become limited in terms of effectiveness and runtime for high dimensional …

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 …

The growing scale of applications encoded to Boolean Satisfiability (SAT) problems imposes
the need for accelerating SAT simplifications or preprocessing. Parallel SAT preprocessing …

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 …

This paper presents a novel framework comprises of a Propositional Satisfiability (SAT)
encoder and solver. The framework responsible for generating and proving a simplified SAT …

Abstract We present SIGmA (SAT sImplification on GPU Architectures), a preprocessor to
accelerate SAT solving that runs on NVIDIA GPUs. We discuss the tool, focussing on its full …