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. The solver reads input in SMTLIB Version 2 format.

References in zbMATH (referenced in 11 articles )

Showing results 1 to 11 of 11.
Sorted by year (citations)

  1. Barrett, Clark; Tinelli, Cesare: Satisfiability modulo theories (2018)
  2. Giesl, Jürgen; Aschermann, Cornelius; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René: Analyzing program termination and complexity automatically with \ssfAProVE (2017)
  3. Ábrahám, Erika; Kremer, Gereon: Satisfiability checking: theory and applications (2016)
  4. Christ, Jürgen; Hoenicke, Jochen: Proof tree preserving tree interpolation (2016)
  5. Komuravelli, Anvesh; Gurfinkel, Arie; Chaki, Sagar: SMT-based model checking for recursive programs (2016)
  6. Koskinen, Eric; Yang, Junfeng: Reducing crash recoverability to reachability (2016)
  7. Christ, Jürgen; Hoenicke, Jochen: Weakly equivalent arrays (2015)
  8. Dietsch, Daniel; Heizmann, Matthias; Langenfeld, Vincent; Podelski, Andreas: Fairness modulo theory: a new approach to LTL software model checking (2015)
  9. Christ, Jürgen; Ermis, Evren; Schäf, Martin; Wies, Thomas: Flow-sensitive fault localization (2013)
  10. Heizmann, Matthias; Christ, Jürgen; Dietsch, Daniel; Ermis, Evren; Hoenicke, Jochen; Lindenmann, Markus; Nutz, Alexander; Schilling, Christian; Podelski, Andreas: Ultimate automizer with smtinterpol. (Competition contribution) (2013) ioport
  11. Christ, Jürgen; Hoenicke, Jochen; Nutz, Alexander: SMTInterpol: an interpolating SMT solver (2012) ioport