CVC5

E905300

CVC5 is an open-source, state-of-the-art Satisfiability Modulo Theories (SMT) solver used for automated reasoning and formal verification tasks.

Try in SPARQL Jump to: Statements Referenced by

Statements (49)

Predicate Object
instanceOf SMT solver
automated reasoning tool
open-source software
software project
acceptsInputFormat SMT-LIB NERFINISHED
hasDomain artificial intelligence
computer-aided verification
constraint solving
formal methods
software engineering
hasFeature incremental solving
model generation
optimization capabilities
proof production
support for multiple logics in one input
unsat core extraction
hasInterface API for integration into other tools
command-line interface
hasProperty extensible
highly configurable
state-of-the-art
implements Satisfiability Modulo Theories NERFINISHED
isA Satisfiability Modulo Theories solver
isPartOf CVC family of SMT solvers
isSuccessorOf CVC4 NERFINISHED
license open-source license
supportsLogic first-order logic fragments
quantified logics
quantifier-free logics
supportsStandard SMT-LIB language
supportsTask automated reasoning
formal verification
model checking workflows
program analysis workflows
satisfiability checking
supportsTheory arrays
bit-vectors
datatypes
floating-point arithmetic
linear arithmetic
nonlinear arithmetic
strings
uninterpreted functions
usedFor constraint solving in research
formal methods education
hardware verification
safety-critical system analysis
software verification
writtenIn C++ NERFINISHED

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Satisfiability Modulo Theories (SMT) hasSolver CVC5
subject surface form: Satisfiability Modulo Theories