diff options
| author |   Mark Wright <gienah@gentoo.org> | 2012-05-30 00:51:22 +0000 |
|---|---|---|
| committer | Mark Wright <gienah@gentoo.org> | 2012-05-30 00:51:22 +0000 |
| commit | e94320903bdb9f2408adc5bde37a36e4dbf787f5 (patch) | |
| tree | df2a31d052c2755d34dd04085918f46ad940a6ee /sci-mathematics/cvc3/metadata.xml | |
| parent | keyword ~x86-fbsd (diff) | |
| download | gentoo-2-e94320903bdb9f2408adc5bde37a36e4dbf787f5.tar.gz gentoo-2-e94320903bdb9f2408adc5bde37a36e4dbf787f5.tar.bz2 gentoo-2-e94320903bdb9f2408adc5bde37a36e4dbf787f5.zip | |
Add CVC3 automatic theorem prover, with optional Isabelle/HOL integration.
(Portage version: 2.1.10.63/cvs/Linux x86_64)
Diffstat (limited to 'sci-mathematics/cvc3/metadata.xml')
| -rw-r--r-- | sci-mathematics/cvc3/metadata.xml | 40 |
1 files changed, 40 insertions, 0 deletions
diff --git a/sci-mathematics/cvc3/metadata.xml b/sci-mathematics/cvc3/metadata.xml new file mode 100644 index 000000000000..db25562598fb --- /dev/null +++ b/sci-mathematics/cvc3/metadata.xml @@ -0,0 +1,40 @@ +<?xml version="1.0" encoding="UTF-8"?> +<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd"> +<pkgmetadata> +<maintainer> + <email>gienah@gentoo.org></email> +</maintainer> +<herd>sci-mathematics</herd> +<longdescription lang='en'> +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; + a rich C and C++ API 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). +</longdescription> +<use> + <flag name='isabelle'>Add integration support for the Isabelle/HOL + theorem prover.</flag> + <flag name='zchaff'>Use the SAT solver zchaff whose copyright is + owned by Princeton University and is more restrictive (see license). + </flag> +</use> +</pkgmetadata> |