In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described.
The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their …

Boolean satisfiability (SAT) solvers are currently very effective in practice. However, there
are still many challenging problems for SAT solvers. Nowadays, extra computational power …

Abstract Amazon Web Services (AWS) is a cloud computing services provider that has made
significant investments in applying formal methods to proving correctness of its internal …

Formal verification of neural networks is an active topic of research, and recent advances
have significantly increased the size of the networks that verification tools can handle …

One of the main challenges of dynamic symbolic execution—an automated program
analysis technique which has been successfully employed to test a variety of software—is …

The range of verification problems that can be solved with logic model checking tools has
increased significantly in the last few decades. This increase in capability is based on …

In the contexts of automated reasoning (AR) and formal verification (FV), important decision
problems are effectively encoded into Satisfiability Modulo Theories (SMT). In the last …

Satisfiability modulo theories (SMT) solvers implement a wide range of optimizations that are
often tailored to a particular class of problems, and that differ significantly between solvers …

This paper provides a broad overview of the situation in Parallel SAT Solving. A set of
challenges to researchers is presented which, we believe, must be met to ensure the …

With its combination of Datalog, SMT solving, and functional programming, the language
Formulog provides an appealing mix of features for implementing SMT-based static …