• Publications
  • Influence
Satisfiability Modulo Theories
TLDR
We show that general-purpose theorem provers, such as for instance provers based on the resolution calculus, are typically inadequate to work with the sort of formulas generated by formal methods tools. Expand
  • 925
  • 128
  • PDF
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
  • 823
  • 98
  • PDF
The SMT-LIB Standard Version 2.0
The SMT-LIB initiative is an international effort, supported by research groups worldwide, with the two-fold goal of producing an extensive on-line library of benchmarks and promoting the adoption ofExpand
  • 822
  • 96
  • PDF
A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions
TLDR
We present an alternative approach, based on algebraic techniques for solving (quantifier-free) constraints natively over a theory of unbounded strings with length and regular language membership. Expand
  • 113
  • 24
  • 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
Handbook of Satisfiability
TLDR
Satisfiability Modulo Theories in first-order logic and formal methods for hardware and software development . Expand
  • 326
  • 21
  • PDF
Introducing StarExec: a Cross-Community Infrastructure for Logic Solving
TLDR
We introduce StarExec, a public web-based service built to facilitate the experimental evaluation of logic solvers, broadly understood as automated tools based on formal reasoning. Expand
  • 153
  • 20
  • PDF
The SMT-LIB Standard: Version 1.2
TLDR
This paper defines syntax and semantics of the language used by SMT-LIB for writing theory specifications and benchmarks for satisfiability modulo theories. Expand
  • 205
  • 17
  • PDF
Counterexample-Guided Quantifier Instantiation for Synthesis in SMT
TLDR
We introduce the first program synthesis engine implemented inside an SMT solver. Expand
  • 96
  • 15
  • PDF
A New Correctness Proof of the {Nelson-Oppen} Combination Procedure
TLDR
We show that equality sharing between the satisfiability procedures of the component theories, the main idea of the method, can be confined to a restricted set of variables. Expand
  • 176
  • 11
  • PDF
...
1
2
3
4
5
...