• Publications
  • Influence
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)
TLDR
We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann--Loveland (DPLL) procedure for propositional satisfiability. Expand
  • 827
  • 100
  • PDF
Paramodulation-Based Theorem Proving
  • 393
  • 27
DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic
TLDR
We present a general DPLL(X) engine whose X can be instantiated with different theory solvers SolverT for difference logic. Expand
  • 143
  • 23
  • PDF
DPLL( T): Fast Decision Procedures
TLDR
We propose a general DPLL(X) engine, whose parameter X can be instantiated with a specialized solver Solver T for a given theory T, and our solver for EUF, which includes incremental and backtrackable congruence closure algorithms. Expand
  • 345
  • 22
  • PDF
On SAT Modulo Theories and Optimization Problems
TLDR
Solvers for SAT Modulo Theories (SMT) can nowadays handle large industrial (e.g., formal hardware and software verification) problems over theories such as the integers, arrays, or equality. Expand
  • 159
  • 17
  • PDF
Cardinality Networks: a theoretical and empirical study
TLDR
We introduce Cardinality Networks, a new CNF encoding of cardinality constraints. Expand
  • 117
  • 17
  • PDF
SMT Techniques for Fast Predicate Abstraction
TLDR
Predicate abstraction is a technique for automatically extracting finite-state abstractions for systems with potentially infinite state space. Expand
  • 119
  • 12
  • PDF
Induction=I-Axiomatization+First-Order Consistency
TLDR
In the early 1980s, there was a number of papers on what should be called proofs by consistency. Expand
  • 46
  • 12
A New Look at BDDs for Pseudo-Boolean Constraints
TLDR
Pseudo-Boolean constraints are omnipresent in practical applications, and thus a significant effort has been devoted to the development of good SAT encoding techniques for them. Expand
  • 59
  • 11
  • PDF
Fast congruence closure and extensions
TLDR
Congruence closure algorithms for deduction in ground equational theories are ubiquitous in many (semi-)decision procedures used for verification and automated deduction. Expand
  • 72
  • 11
  • PDF
...
1
2
3
4
5
...