SMT solvers: new oracles for the HOL theorem prover

Authors:
Tjark Weber
Affiliations:
University of Cambridge, Computer Laboratory, 15 JJ Thomson Avenue, CB3 0FD, Cambridge, UK
Venue:
International Journal on Software Tools for Technology Transfer (STTT) - VSTTE 2009
Year:
2011

Citing 0
Cited 3

Automatic proof and disproof in Isabelle/HOL

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Reconstruction of z3's bit-vector proofs in HOL4 and Isabelle/HOL

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus

Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice

Quantified Score

Hi-index	0.00

Visualization

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.