• Publications
  • Influence
Satisfiability Modulo Theories
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
  • 932
  • 129
  • PDF
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks
We present a novel, scalable, and efficient technique for verifying properties of deep neural networks, extended to handle the non-convex Rectified Linear Unit (ReLU) activation function, which is a crucial ingredient in many modern neural networks. Expand
  • 802
  • 124
  • 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
  • 827
  • 96
  • PDF
CVC Lite: A New Implementation of the Cooperating Validity Checker Category B
We describe a tool called CVC Lite (CVCL), an automated theorem prover for formulas in a union of first-order theories. Expand
  • 324
  • 33
A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions
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
Handbook of Satisfiability
Satisfiability Modulo Theories in first-order logic and formal methods for hardware and software development . Expand
  • 330
  • 21
  • PDF
CVC: A Cooperating Validity Checker
This paper describes the CVC ("Cooperating Validity Checker") decision procedure that combines subsidiary decision procedures for certain logical theories into a decision procedure for the theories' union. Expand
  • 241
  • 20
Counterexample-Guided Quantifier Instantiation for Synthesis in SMT
We introduce the first program synthesis engine implemented inside an SMT solver. Expand
  • 98
  • 15
  • PDF
Validity Checking for Combinations of Theories with Equality
An essential component in many verification methods is a fast decision procedure for validating logical expressions. Expand
  • 223
  • 14
  • PDF
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
We describe a number of obstacles that had to be overcome before developing an approach which was ultimately very effective, and give results on verification benchmarks using CVC (Cooperating Validity Checker), which includes the Chaff SAT solver. Expand
  • 170
  • 13
  • PDF