The Heuristic Theorem Prover : Yet another SMT Modulo Theorem Prover ( Tool Paper )

Abstract

HTP is an SMT Modulo theorem prover similar to many others.[2–6, 9, 11] As input, HTP accepts problems using the SMT-LIB format[8]. As output, HTP will answer either SAT, UNSAT or UNKNOWN. Alternatively, HTP can be run in a preprocessing mode in which the output is the simplified problem in SMTLIB format. An evidence file showing the derivation in a human… (More)

Topics

  • Presentations referencing similar topics