an Interpolating SMT Solver
About SMTInterpol
SMTInterpol is an SMT Solver that can compute Craig interpolants for various theories. The solver is developed at the Chair of Software Engineering at the University of Freiburg.
The solver is written in Java and can be used on any operating system that supports Java Version 6 or above.
The solver reads input in SMTLIB Version 2 format.
The current version of SMTInterpol supports interpolation for the combination of the quantifier-free fragments of the theories of uninterpreted functions, linear real arithmetic, linear integer arithmetic, and arrays.
System Requirements
SMTInterpol needs a Java 6 JRE or above. No special hardware is necessary but depending on the input problem, a fast CPU and a good amount of RAM might be useful.
SMTInterpol is developed by J├╝rgen Christ, Jochen Hoenicke, Alexander Nutz, and Tanja Schindler in the context of the AVACS (Automatic Verification and Analysis of Complex Systems) project. If you have any questions, suggestions, or if you want to contribute, feel free to contact us.
SMTInterpol is distributed under LGPL Version 3.
SMTInterpol in Action
SMTInterpol participates regularly in the SMT-COMP. See this page or the news page for further details.
Further Development
We plan to extend SMTInterpol to reason about arrays and quantifiers. Interpolation procedures for these logics will be the next big challenge. Additionally, we try to add more flexibility to our interpolation engine to enable model checkers to easily adjust the interpolation procedure of SMTInterpol to their needs.

Last modified: Wed Mar 22 20:25:10 CET 2017   Valid XHTML 1.0 TransitionalValid CSS!