CVC4
E904159
CVC4 is an open-source automated theorem prover and SMT (Satisfiability Modulo Theories) solver used for verifying logical formulas across a variety of theories such as arithmetic, bit-vectors, arrays, and datatypes.
Observed surface forms (1)
| Surface form | Occurrences |
|---|---|
| CVC4 SMT solver | 1 |
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
SMT solver
ⓘ
automated theorem prover ⓘ formal verification tool ⓘ open-source software ⓘ |
| hasCommandLineInterface | yes ⓘ |
| hasDeveloper |
Aaron Stump
NERFINISHED
ⓘ
Andrew Reynolds NERFINISHED ⓘ Cesare Tinelli NERFINISHED ⓘ Clark Barrett NERFINISHED ⓘ Morgan Deters NERFINISHED ⓘ other contributors ⓘ |
| hasProgrammingLanguageBinding |
C
NERFINISHED
ⓘ
C++ NERFINISHED ⓘ Java NERFINISHED ⓘ Python NERFINISHED ⓘ |
| hasWebsite | https://cvc4.github.io ⓘ |
| implementsStandard | SMT-LIB language NERFINISHED ⓘ |
| isPredecessorOf | cvc5 NERFINISHED ⓘ |
| isSuccessorOf | CVC3 NERFINISHED ⓘ |
| isWrittenInProgrammingLanguage | C++ NERFINISHED ⓘ |
| license | BSD-style license ⓘ |
| participatesIn | SMT-COMP NERFINISHED ⓘ |
| repository | https://github.com/CVC4/CVC4 ⓘ |
| supportsFeature |
incremental solving
ⓘ
interpolant generation ⓘ model generation ⓘ proof production ⓘ unsat core generation ⓘ |
| supportsInputFormat |
SMT-LIB v2
NERFINISHED
ⓘ
its own native formats ⓘ |
| supportsLogic |
first-order logics with quantifiers
ⓘ
many SMT-LIB logics ⓘ quantifier-free logics ⓘ |
| supportsTheory |
arithmetic
ⓘ
arrays ⓘ bags ⓘ bit-vectors ⓘ datatypes ⓘ floating-point arithmetic ⓘ linear arithmetic ⓘ nonlinear arithmetic ⓘ quantifiers ⓘ sets ⓘ uninterpreted functions ⓘ |
| usedFor |
constraint solving
ⓘ
hardware verification ⓘ model checking ⓘ program analysis ⓘ software verification ⓘ synthesis ⓘ |
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Satisfiability Modulo Theories
this entity surface form:
CVC4 SMT solver