View source for About CVC4

From CVC4
You do not have permission to edit this page, for the following reason:
The action you have requested is limited to users in the group: Users.
You can view and copy the source of this page.
CVC4 is an automatic theorem prover for [http://en.wikipedia.org/wiki/Satisfiability_Modulo_Theories Satisifiability Modulo Theories (SMT)] (for a more formal introduction to SMT see the following book chapter [https://cs.stanford.edu/~barrett/pubs/BSST09.pdf Satisfiability Modulo Theories] ). Technically, it is an automated validity checker for a many-sorted (i.e., typed) first-order logic with built-in theories.
It can be used to prove the validity (or, dually, the satisfiability) of a formula with respect to several built-in logical theories and their combination.

CVC4 currently has support for the following theories:
* equality over free (aka uninterpreted) function and predicate symbols
* real and integer linear arithmetic
* bit-vectors
* arrays
* [[Datatypes|tuples]]
* [[Datatypes|records]]
* user-defined inductive [[Datatypes|datatypes]]
* [[Strings|strings]]
* [[Sets|finite sets and relations]]
* [[Separation Logic|separation logic]]

CVC4 has a wide variety of features including:

* support for quantifiers through heuristic instantiation;
* an interactive text-based interface;
* a rich [http://cvc4.cs.stanford.edu/cvc4-builds/documentation/public/latest/ C++ API] for embedding in other systems;
* model generation abilities;
* source compatibility with much of the CVC3 API via a "compatibility library";
* essentially no limit on its use for research or commercial purposes (see [https://github.com/CVC4/CVC4/blob/master/COPYING license]).

=Web site=

For more information and the latest news about CVC4, visit the [http://cvc4.cs.stanford.edu CVC4 web site].

=Decision Procedures=
* Architecture
** See the [http://dl.acm.org/citation.cfm?id=2032319 CVC4 tool paper].
* Arithmetic
** CVC4 solves linear real arithmetic using an implementation of [http://link.springer.com/chapter/10.1007%2F11817963_11? Simplex for DPLL(T)]. For a more complete introduction see the [http://yices.csl.sri.com/sri-csl-06-01.pdf tech report].
** The linear arithmetic module includes heuristics from [http://eprints-phd.biblio.unitn.it/166/2/thesis.pdf Section 2.5 of Alberto Griggio's thesis] and a few currently unpublished ones.
** Integers are currently handled by first solving the real relaxation of the constraints, and then using a combination of [http://www.cs.wm.edu/~idillig/cav2009.pdf Cuts from Proofs] and branching to ensure integer solutions.  This approach and the equational solver  used are described in [https://es.fbk.eu/people/griggio/papers/jsat12.pdf A Practical Approach to Satisfiability Modulo Linear Integer Arithmetic].
** A technical report is planned to explain a number of small details and extensions including analysis to improve simplex's conflicts, handling disequalities, supporting model generation in CVC4's combination framework, heuristically propagating equalities over sharing terms, tableau row based propagation, and terminating simplex with unknown.
** A heuristic approach non-linear arithmetic is supported based on this paper [https://es-static.fbk.eu/people/griggio/papers/tacas17.pdf].
* Arrays
** Arrays are implemented in a manner inspired by the [http://research.microsoft.com/en-us/um/people/leonardo/files/fmcad09.pdf Generalized, efficient array decision procedures] paper with a few major modifications.
* Bitvectors
** Bitvectors is implemented primarily via a lazy schema for bitblasting. See [http://eprints-phd.biblio.unitn.it/345/ Anders Franzen's thesis chapter 3].
* Combination
** Theory combination is based on the care graph framework described in both [http://cs.nyu.edu/~dejan/papers/jovanovic-fmsd2012.pdf Being careful about theory combination] and [http://cs.nyu.edu/~dejan/papers/jovanovic-frocos2011.pdf Sharing is Caring: Combination of Theories].
* Datatypes
** CVC4 implements [http://homepage.cs.uiowa.edu/~tinelli/papers/BarST-JSAT-07.pdf An Abstract Decision Procedure for a Theory of Inductive Data Types].
** This procedure has been extended to incorporate coinductive datatypes [http://homepage.cs.uiowa.edu/~ajreynol/cade15.pdf].
** The datatypes decision procedure is optimized via the use of shared selectors, described in this paper [http://homepage.divms.uiowa.edu/~ajreynol/ijcar18.pdf].
* Quantifiers
** E-matching and conflict-based quantifier instantiation [http://homepage.cs.uiowa.edu/~ajreynol/fmcad14.pdf].
** Finite model finding [http://homepage.cs.uiowa.edu/~ajreynol/thesis.pdf].
** Enumerative instantiation, as described in [http://homepage.divms.uiowa.edu/~ajreynol/tacas18.pdf].
** Techniques for finding counterexamples for conjectures in the presence of recursive functions [http://homepage.cs.uiowa.edu/~ajreynol/ijcar16a.pdf].
** Automated induction for datatypes [http://homepage.cs.uiowa.edu/~ajreynol/vmcai15.pdf].
** A decision procedure for quantified linear integer and real arithmetic [http://homepage.divms.uiowa.edu/~ajreynol/fmsd17-instla.pdf].
** A dedicated approach for quantified bit-vectors based on invertibility conditions, as described in [http://homepage.divms.uiowa.edu/~ajreynol/cav18.pdf].
** Support for syntax-guided synthesis, as described in [http://homepage.cs.uiowa.edu/~ajreynol/cav15a.pdf].
* Relations
** An extension of the decision procedure for sets, as described in [http://homepage.cs.uiowa.edu/~tinelli/papers/MenEtAl-CADE-17.pdf].
* SAT Solver
** The main sat solver is based on [http://minisat.se/ minisat v2.2.0].
** Additionally, we (optionally, and enabled by default for certain theories) use non-clausal analysis to cut down search space of minisat. For more details see the article [http://cs.nyu.edu/~kshitij/articles/cvc4-branching-heuristic.pdf A branching heuristic in CVC4].
* Separation Logic
** A decision procedure for a fragment quantifier-free separation logic containing negation, separation star and magic wand is implemented and can be composed with other decision procedures supported by CVC4.  For details see [http://homepage.divms.uiowa.edu/~ajreynol/atva16.pdf A Decision Procedure for Separation Logic in SMT].
* Sets
** Adaptation of tableau-based decision procedure described [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5176 here].
* Strings
** Original approach described in our [http://www.cs.stanford.edu/~barrett/pubs/LRT+14.pdf CAV 2014 paper: A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions].
** Decision procedure for regular memberships with length [http://homepage.cs.uiowa.edu/~ajreynol/frocos15.pdf].
* Uninterpreted functions
** UF (without cardinality) is handled in a manner inspired by [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.1745 Simplify's tech report].
** UF + cardinality is described [http://www.divms.uiowa.edu/~ajreynol/pres-fmf12.pdf this presentation] and is used for finite model finding.

=History of CVC=

[[File:svc.gif|thumb|border|100px|The SVC logo.]]
[[File:cvc3_logo.jpg|thumb|border|100px|The CVC3 logo.]]
[[File:cvc3_night_logo.png|thumb|border|100px|The CVC3 "by night" logo, used for nightly builds and regressions.]]
[[File:cvc3cvc4.png|thumb|border|100px|An early CVC4 logo.]]

The Cooperating Validity Checker series has a long history.  The
Stanford Validity Checker (SVC) came first in 1996, incorporating
theories and its own SAT solver.  Its successor, the Cooperating
Validity Checker (CVC), had a more optimized internal design, produced
proofs, used the Chaff SAT solver, and featured a number of usability
enhancements.  Its name comes from the cooperative nature of decision
procedures in Nelson-Oppen theory combination, which share amongst
each other equalities between shared terms.  CVC Lite, first made
available in 2003, was a rewrite of CVC that attempted to make CVC
more flexible (hence the "lite") while extending the feature set: CVC
Lite supported quantifiers where its predecessors did not.  CVC3 was a
major overhaul of portions of CVC Lite: it added better decision
procedure implementations, added support for using MiniSat in the
core, and had generally better performance.

[[File:cvc4-logo.png|thumb|border|100px|The CVC4 logo.]]
CVC4 is the new version, the fifth generation of this validity checker
line that is now celebrating sixteen years of heritage.  It represents
a complete re-evaluation of the core architecture to be both
performant and to serve as a cutting-edge research vehicle for the
next several years.  Rather than taking CVC3 and redesigning problem
parts, we've taken a clean-room approach, starting from scratch.
Before using any designs from CVC3, we have thoroughly scrutinized,
vetted, and updated them.  Many parts of CVC4 bear only a superficial
resemblance, if any, to their correspondent in CVC3.

However, CVC4 is fundamentally similar to CVC3 and many other modern
SMT solvers: it is a DPLL(T) solver, with a SAT solver at its core and
a delegation path to different decision procedure implementations,
each in charge of solving formulas in some background theory.

The re-evaluation and ground-up rewrite was necessitated, we felt, by
the performance characteristics of CVC3.  CVC3 has many useful
features, but some core aspects of the design led to high memory use,
and the use of heavyweight computation (where more nimble engineering
approaches could suffice) makes CVC3 a much slower prover than other
tools.  As these designs are central to CVC3, a new version was
preferable to a selective re-engineering, which would have ballooned
in short order.
Return to About CVC4.
Retrieved from "http://cvc4.cs.stanford.edu/wiki/About_CVC4"
View source for About CVC4

Navigation menu

Views

Personal tools

CVC4

For CVC4 Developers

Cascade

Meta

Wiki

Search

Tools
