Fast LCF-Style Proof Reconstruction for Z3

  • Sascha Böhme
  • Tjark Weber
Conference paper

DOI: 10.1007/978-3-642-14052-5_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6172)
Cite this paper as:
Böhme S., Weber T. (2010) Fast LCF-Style Proof Reconstruction for Z3. In: Kaufmann M., Paulson L.C. (eds) Interactive Theorem Proving. ITP 2010. Lecture Notes in Computer Science, vol 6172. Springer, Berlin, Heidelberg

Abstract

The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers Isabelle/HOL and HOL4 with particular focus on efficiency. Our highly optimized implementations outperform previous LCF-style proof checkers for SMT, often by orders of magnitude. Detailed performance data shows that LCF-style proof reconstruction can be faster than proof search in Z3.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Sascha Böhme
    • 1
  • Tjark Weber
    • 2
  1. 1.Technische Universität München 
  2. 2.University of Cambridge 

Personalised recommendations