Ubuntu
cvc3 package

cvc3 2.4.1-4ubuntu1 source package in Ubuntu

Changelog

cvc3 (2.4.1-4ubuntu1) trusty; urgency=low

  * Use dh_autotools-dev* for newer arches.
 -- Daniel T Chen <email address hidden>   Mon, 03 Feb 2014 18:08:55 -0500

Upload details

Uploaded by:
Daniel T Chen
Uploaded to:
Trusty
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
math
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Trusty release universe math

Downloads

File Size SHA-256 Checksum
cvc3_2.4.1.orig.tar.gz 1.1 MiB d5eae61a66da81ad2a909e0793feca6a13f807a498664a2504189ca9267b3615
cvc3_2.4.1-4ubuntu1.debian.tar.gz 9.1 KiB 5f3e8146258b635b870d7dadb36c8b521a0a9af2a4a047efd88b2b3c712dc8f5
cvc3_2.4.1-4ubuntu1.dsc 1.8 KiB 6479b32ea124d86c3651d97e03b885ac695038e75c761c975143613322f6536a

View changes file

Binary packages built by this source

cvc3: Automatic theorem prover for SMT problems

 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.

cvc3-el: No summary available for cvc3-el in ubuntu utopic.

No description available for cvc3-el in ubuntu utopic.

libcvc3-5: Automatic theorem prover library for SMT problems

 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 files necessary for running applications
 that use the CVC3 library.

libcvc3-5-java: Java bindings for CVC3 (bytecode library)

 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 provides architecture-independent files of the Java
 bindings for CVC3

libcvc3-5-jni: Java bindings for CVC3 (native library)

 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 provides the native library needed for the Java bindings
 for CVC3

libcvc3-dev: Automatic theorem prover library for SMT problems (development files)

 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 files necessary for building applications
 that use the CVC3 library.