Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Satisfiability Modulo Theories
- C. Barrett, R. Sebastiani, S. Seshia, C. Tinelli
- Computer Science
- Handbook of Satisfiability
- 2009
Many applications of formal methods rely on generating formulas of First-Order Logic (FOL) and proving or disproving their validity. Despite the great progress in the last twenty years in automated… Expand
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks
- G. Katz, C. Barrett, D. Dill, Kyle Julian, Mykel J. Kochenderfer
- Computer Science
- CAV
- 3 February 2017
Deep neural networks have emerged as a widely used and effective means for tackling complex, real-world problems. However, a major obstacle in applying them to safety-critical systems is the great… Expand
The SMT-LIB Standard Version 2.0
- C. Barrett, A. Stump, C. Tinelli
- Mathematics
- 2010
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 of… Expand
- 774
- 92
- PDF
CVC Lite: A New Implementation of the Cooperating Validity Checker Category B
- C. Barrett, S. Berezin
- Computer Science
- CAV
- 13 July 2004
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, including… Expand
A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions
- Tianyi Liang, A. Reynolds, C. Tinelli, C. Barrett, M. Deters
- Computer Science
- CAV
- 18 July 2014
An increasing number of applications in verification and security rely on or could benefit from automatic solvers that can check the satisfiability of constraints over a rich set of data types that… Expand
CVC: A Cooperating Validity Checker
- A. Stump, C. Barrett, D. Dill
- Computer Science
- CAV
- 27 July 2002
Decision procedures for decidable logics and logical theories have proven to be useful tools in verification. This paper describes the CVC ("Cooperating Validity Checker") decision procedure. CVC… Expand
Counterexample-Guided Quantifier Instantiation for Synthesis in SMT
- A. Reynolds, M. Deters, Viktor Kuncak, C. Tinelli, C. Barrett
- Computer Science
- CAV
- 18 July 2015
We introduce the first program synthesis engine implemented inside an SMT solver. We present an approach that extracts solution functions from unsatisfiability proofs of the negated form of synthesis… Expand
Validity Checking for Combinations of Theories with Equality
- C. Barrett, D. Dill, J. Levitt
- Computer Science
- FMCAD
- 6 November 1996
An essential component in many verification methods is a fast decision procedure for validating logical expressions. This paper presents the algorithm used in the Stanford Validity Checker (SVC)… Expand
A decision procedure for an extensional theory of arrays
- A. Stump, C. Barrett, D. Dill, J. Levitt
- Computer Science
- Proceedings 16th Annual IEEE Symposium on Logic…
- 16 June 2001
A decision procedure for a theory of arrays is of interest for applications in formal verification, program analysis and automated theorem proving. This paper presents a decision procedure for an… Expand
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
- C. Barrett, D. Dill, A. Stump
- Computer Science
- CAV
- 27 July 2002
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 has also been shown that… Expand