• Publications
  • Influence
An Extensible SAT-solver
In this article, we present a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff. We aim to give sufficient details about implementation toExpand
  • 2,841
  • 395
  • Open Access
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three dieren t techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be handled by a standardExpand
  • 589
  • 94
  • Open Access
Effective Preprocessing in SAT Through Variable and Clause Elimination
Preprocessing SAT instances can reduce their size considerably. We combine variable elimination with subsumption and self-subsuming resolution, and show that these techniques not only shrink theExpand
  • 626
  • 65
  • Open Access
Efficient implementation of property directed reachability
Last spring, in March 2010, Aaron Bradley published the first truly new bit-level symbolic model checking algorithm since Ken McMillan's interpolation based model checking procedure introduced inExpand
  • 262
  • 53
  • Open Access
Temporal induction by incremental SAT solving
We show how a very modest modification to a typical modern SAT-solver enables it to solve a series of related SAT-instances efficiently. We apply this idea to checking safety properties by means ofExpand
  • 378
  • 37
MiniSat v1.13 - A SAT Solver with Conflict-Clause Minimization
In this poster we summarize the features of the MiniSat version en- tering the SAT Competition 2005. The main new feature is a resolution based conflict clause minimization technique based onExpand
  • 220
  • 16
  • Open Access
DeepMath - Deep Sequence Models for Premise Selection
We study the effectiveness of neural sequence models for premise selection in automated theorem proving, one of the main bottlenecks in the formalization of mathematics. We propose a two stageExpand
  • 121
  • 11
  • Open Access
Symbolic Reachability Analysis Based on SAT-Solvers
The introduction of symbolic model checking using Binary Decision Diagrams (BDDs) has led to a substantial extension of the class of systems that can be algorithmically verified. Although BDDs haveExpand
  • 202
  • 10
  • Open Access
Improvements to Combinational Equivalence Checking
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulation and BDD/SATExpand
  • 134
  • 7
  • Open Access
A single-instance incremental SAT formulation of proof- and counterexample-based abstraction
This paper presents an efficient, combined formulation of two widely used abstraction methods for bit-level verification: counterexample-based abstraction (CBA) and proof-based abstraction (PBA).Expand
  • 48
  • 4
  • Open Access