SMTInterpol

E904162

SMTInterpol is an SMT solver focused on generating interpolants and solving satisfiability modulo theories problems, particularly over linear arithmetic and related theories.

Jump to: Statements Referenced by

Statements (44)

Predicate Object
instanceOf SMT solver
software tool
theorem prover
canBeUsedVia Java API NERFINISHED
command-line interface
hasApplicationDomain formal verification
hardware verification
program synthesis
software model checking
static analysis
hasComponent DPLL(T) style solving engine NERFINISHED
interpolant construction engine
theory solver for linear arithmetic
hasLicense LGPL NERFINISHED
hasOutput interpolant for unsatisfiable partitions
model for satisfiable formulas
satisfiability result
unsat core
hasPrimaryFunction interpolant generation
satisfiability modulo theories solving
hasProperty cross-platform
runs on the Java Virtual Machine
hasStrength efficient interpolant generation
support for linear arithmetic theories
isDesignedFor use as backend solver in verification tools
isFreeSoftware true
isOpenSource true
isOptimizedFor interpolation-heavy workflows
linear arithmetic benchmarks
isWrittenInLanguage Java NERFINISHED
participatesIn SMT-COMP NERFINISHED
supportsFeature Craig interpolation
incremental solving
unsat core extraction
supportsStandard SMT-LIB 2 NERFINISHED
supportsTheory linear arithmetic
linear integer arithmetic
linear real arithmetic
supportsUsageMode batch solving GENERATED
interactive solving GENERATED
targetUser SMT practitioners
developers of verification tools
researchers in formal methods
usesInputFormat SMT-LIB NERFINISHED

Referenced by (1)

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

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