1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
Source: cvc4
Maintainer: Debian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net>
Uploaders: Fabian Wolff <fabi.wolff@arcor.de>
Section: math
Priority: optional
Build-Depends: debhelper (>= 11),
libgmp-dev,
libantlr3c-dev,
libboost-thread-dev,
libreadline-dev,
pkg-config,
cxxtest,
chrpath,
python3
Standards-Version: 4.2.0
Homepage: http://cvc4.cs.stanford.edu/web/
Vcs-Git: https://salsa.debian.org/science-team/cvc4.git/
Vcs-Browser: https://salsa.debian.org/science-team/cvc4
Package: cvc4
Architecture: amd64 i386 mips mips64el mipsel hurd-i386 ia64 kfreebsd-amd64 kfreebsd-i386 m68k powerpcspe x32
Depends: libcvc4-5 (= ${binary:Version}),
libcvc4parser5 (= ${binary:Version}),
${shlibs:Depends},
${misc:Depends}
Description: automated theorem prover for SMT problems
CVC4 is an efficient 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.
.
CVC4 is intended to be an open and extensible SMT engine, and it can
be used as a stand-alone tool or as a library. It is the fourth in
the Cooperating Validity Checker family of tools (also including CVC,
CVC Lite and CVC3). CVC4 has been designed to increase the
performance and reduce the memory overhead of its predecessors.
.
This package contains binaries needed to use CVC4 as a stand-alone
tool.
Package: libcvc4-dev
Architecture: amd64 i386 mips mips64el mipsel hurd-i386 ia64 kfreebsd-amd64 kfreebsd-i386 m68k powerpcspe x32
Section: libdevel
Depends: libcvc4-5 (= ${binary:Version}),
libcvc4parser5 (= ${binary:Version}),
${shlibs:Depends},
${misc:Depends},
libgmp-dev
Description: automated theorem prover for SMT problems (development files)
CVC4 is an efficient 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.
.
CVC4 is intended to be an open and extensible SMT engine, and it can
be used as a stand-alone tool or as a library. It is the fourth in
the Cooperating Validity Checker family of tools (also including CVC,
CVC Lite and CVC3). CVC4 has been designed to increase the
performance and reduce the memory overhead of its predecessors.
.
This package contains development files for CVC4. Install it if you
want to develop applications that use CVC4's API.
Package: libcvc4-5
Architecture: amd64 i386 mips mips64el mipsel hurd-i386 ia64 kfreebsd-amd64 kfreebsd-i386 m68k powerpcspe x32
Section: libs
Multi-Arch: same
Depends: ${shlibs:Depends},
${misc:Depends}
Description: automated theorem prover for SMT problems (runtime)
CVC4 is an efficient 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.
.
CVC4 is intended to be an open and extensible SMT engine, and it can
be used as a stand-alone tool or as a library. It is the fourth in
the Cooperating Validity Checker family of tools (also including CVC,
CVC Lite and CVC3). CVC4 has been designed to increase the
performance and reduce the memory overhead of its predecessors.
.
This package contains CVC4's runtime shared libraries.
Package: libcvc4parser5
Architecture: amd64 i386 mips mips64el mipsel hurd-i386 ia64 kfreebsd-amd64 kfreebsd-i386 m68k powerpcspe x32
Section: libs
Multi-Arch: same
Depends: ${shlibs:Depends},
${misc:Depends}
Description: automated theorem prover for SMT problems (parser runtime)
CVC4 is an efficient 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.
.
CVC4 is intended to be an open and extensible SMT engine, and it can
be used as a stand-alone tool or as a library. It is the fourth in
the Cooperating Validity Checker family of tools (also including CVC,
CVC Lite and CVC3). CVC4 has been designed to increase the
performance and reduce the memory overhead of its predecessors.
.
This package contains runtime shared libraries for CVC4's parser.
|
