cvc3

Automatic theorem prover for SMT problems

Description

CVC3 is an automatic theorem prover for Satisfiability Modulo Theories (SMT) problems. It can be used to prove the validity (or, dually, the satisfiability) of first-order formulas in a large number of built-in logical theories and their combination.

CVC3 is the last offspring of a series of popular SMT provers, which originated at Stanford University with the SVC system. In particular, it builds on the code base of CVC Lite, its most recent predecessor. Its high level design follows that of the Sammy prover.

CVC3 works with a version of first-order logic with polymorphic types and has a wide variety of features including:

* several built-in base theories: rational and integer linear

arithmetic, arrays, tuples, records, inductive data types, bit

vectors, and equality over uninterpreted function symbols;

* support for quantifiers;

* an interactive text-based interface;

* rich C, C++, and Java APIs for embedding in other systems;

* proof and model generation abilities;

* predicate subtyping;

* essentially no limit on its use for research or commercial

purposes (see license).

This package contains the CVC3 command line program.

Upload more screenshots

Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.

Upload a screenshot

Hint: upload an image here from your clipboard with Ctrl-V

Homepage

http://www.cs.nyu.edu/acsys/cvc3/

Install this software package

If the package is available for the distribution you are currently using on your computer then install the software by clicking on…

Install cvc3