[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]

Bug#559245: marked as done (ITP: cvc3 -- automatic theorem prover for Satisfiability Modulo Theories (SMT) problems.)

Your message dated Mon, 4 Jan 2010 18:20:27 -0500
with message-id <4a051d931001041520p566780b5x4938241dbd6f082d@mail.gmail.com>
and subject line Installed in unstable repository
has caused the Debian Bug report #559245,
regarding ITP: cvc3 -- automatic theorem prover for Satisfiability Modulo Theories (SMT) problems.
to be marked as done.

This means that you claim that the problem has been dealt with.
If this is not the case it is now your responsibility to reopen the
Bug report if necessary, and/or fix the problem forthwith.

(NB: If you are a system administrator and have no idea what this
message is talking about, this may indicate a serious mail system
misconfiguration somewhere. Please contact owner@bugs.debian.org
immediately.)


-- 
559245: http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=559245
Debian Bug Tracking System
Contact owner@bugs.debian.org with problems
--- Begin Message --- 
Package: wnpp
Severity: wishlist

* Package name    : cvc3
  Version         : 2.2
  Upstream Author : Clark Barrett <barrett@cs.nyu.edu>, Cesare Tinelli <tinelli@cs.uiowa.edu>
* URL             : http://www.cs.nyu.edu/acsys/cvc3/
* License         : BSD
  Programming Lang: C++
  Description     : CVC3 is an automatic theorem prover for Satisfiability Modulo Theories (SMT) problems.

>From the web page:
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;

--- End Message ---
--- Begin Message --- 
Installed in unstable repository

--- End Message ---
Reply to: