- CVC Lite: A New Implementation of the Cooperating Validity Checker ?
- Solving Quantified Verification Conditions using Satisfiability Modulo Theories #
- Clark Barrett 1 and Cesare Tinelli 2 1 New York University, barrett@cs.nyu.edu
- Satisfiability Modulo Theories Competition Clark Barrett 1 , Leonardo de Moura 2 , and Aaron Stump 3
- CHECKING VALIDITY OF QUANTIFIERFREE FORMULAS IN COMBINATIONS OF FIRSTORDER
- A Decision Procedure for BitVector Arithmetic Clark W. Barrett, David L. Dill, and Jeremy R. Levitt \Lambda
- A Decision Procedure for an Extensional Theory of Arrays Aaron Stump, Clark W. Barrett, and David L. Dill
- Cascade: C Assertion Checker and Deductive Engine (Tool Submission)
- Theory and Algorithms for the Generation and Validation of Speculative Loop Optimizations
- An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types
- Design and Results of the 2nd Annual Satisfiability Modulo Theories Competition
- Polite Theories Revisited Dejan Jovanovic and Clark Barrett
- Solving Quantified Verification Conditions using Satisfiability Modulo Theories #
- A Generalization of Shostak's Method for Combining Decision Procedures
- PDPAR 2005 Preliminary Version Cooperating Theorem Provers: A Case Study
- An Abstract Decision Procedure for Satis ability in the Theory of Recursive Data Types
- A Framework for Cooperating Decision Clark W. Barrett, David L. Dill, and Aaron Stump
- Automatic Generation of Invariants in Processor Verification
- CVC: a Cooperating Validity Checker Aaron Stump, Clark W. Barrett, and David L. Dill
- An Abstract Decision Procedure for a Theory of Inductive Data Types
- Validity Checking for Combinations of Theories with Equality
- Electronic Notes in Theoretical Computer Science 89 No. 2 (2003) URL: http://www.elsevier.nl/locate/entcs/volume89.html 19 pages
- COCV'04 Preliminary Version Into the Loops
- Handbook of Satisfiability Armin Biere, Marijn Heule, Hans van Maaren and Toby Walsch
- Design and Results of the 1st Satisfiability Modulo Theories Competition (SMTCOMP 2005)
- PDPAR 2004 Preliminary Version Combining SAT Methods with Non-Clausal
- Checking Satisfiability of FirstOrder Formulas by Incremental Translation to SAT
- A Proof-Producing Boolean Search Engine ? Clark Barrett 1 and Sergey Berezin 2
- Verifying Low-Level Implementations of High-Level Datatypes
- Exploring and Categorizing Error Spaces using BMC and SMT , Clark Barrett1
- Sharing is Caring Dejan Jovanovic Clark Barrett
