Many verification problems reduce to proving the validity of formulas involving both
propositional connectives and domain-specific functions and predicates. This paper …

We introduce proof systems for propositional logic that admit short proofs of hard formulas as
well as the succinct expression of most techniques used by modern SAT solvers. Our proof …

Satisfiability (SAT) solvers—and software in general—sometimes have serious bugs. We
mitigate these effects by validating the results. Today's SAT solvers emit proofs that can be …

PVS is a prototype system for writing specifications and constructing proofs. Its development
has been shaped by our experiences studying or using several other systems 1 and …

We describe a tool called CVC Lite (CVCL), an automated theorem prover for formulas in a
union of first-order theories. CVCL supports a set of theories which are useful in verification …

Clausal proofs have become a popular approach to validate the results of SAT solvers.
However, validating clausal proofs in the most widely supported format (DRAT) is expensive …

In the past few years, general-purpose propositional satisfiability (SAT) solvers have
improved dramatically in performance and have been used to tackle many new problems. It …

In many applications the desired outcome of satisfiability checking is that the formula is
unsatisfiable: A satisfying assignment essentially exhibits a bug and unsatisfiability implies a …

We present a new abstraction-based framework for deciding satisfiability of quantifier-free
Presburger arithmetic formulas. Given a Presburger formula φ, our algorithm invokes a SAT …

The DRAT-trim tool is a satisfiability proof checker based on the new DRAT proof format.
Unlike its predecessor, DRUP-trim, all presently known SAT solving and preprocessing …