SMT Solvers: New Oracles for the HOL Theorem Prover

Tjark Weber. Published at the Workshop on Verified Software: Theory, Tools, and Experiments (VSTTE 2009), November 2, 2009, Eindhoven, Netherlands.

Abstract

This paper describes an integration of Satisfiability Modulo Theories (SMT) solvers with the HOL4 theorem prover. Proof obligations are passed from the interactive HOL4 prover to the SMT solver, which can often prove them automatically. This makes state-of-the-art SMT solving techniques available to users of the HOL4 system, thereby increasing the degree of automation for a substantial fragment of its logic. We compare a translation to Yices's native input format with a translation to SMT-LIB format.

Download

BibTeX

@inproceedings{weber09smt,
  author = {Tjark Weber},
  title  = {{SMT} Solvers: New Oracles for the {HOL} Theorem Prover},
  note   = {Published at the Workshop on Verified Software: Theory, Tools, and Experiments (VSTTE 2009), November~2, 2009, Eindhoven, Netherlands}
}

Note

A revised version of this paper is available.
Last modified: 2011-12-09