Automatic Proof and Disproof in Isabelle/HOL

  • Jasmin Christian Blanchette
  • Lukas Bulwahn
  • Tobias Nipkow
Conference paper

DOI: 10.1007/978-3-642-24364-6_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6989)
Cite this paper as:
Blanchette J.C., Bulwahn L., Nipkow T. (2011) Automatic Proof and Disproof in Isabelle/HOL. In: Tinelli C., Sofronie-Stokkermans V. (eds) Frontiers of Combining Systems. FroCoS 2011. Lecture Notes in Computer Science, vol 6989. Springer, Berlin, Heidelberg

Abstract

Isabelle/HOL is a popular interactive theorem prover based on higher-order logic. It owes its success to its ease of use and powerful automation. Much of the automation is performed by external tools: The metaprover Sledgehammer relies on resolution provers and SMT solvers for its proof search, the counterexample generator Quickcheck uses the ML compiler as a fast evaluator for ground formulas, and its rival Nitpick is based on the model finder Kodkod, which performs a reduction to SAT. Together with the Isar structured proof format and a new asynchronous user interface, these tools have radically transformed the Isabelle user experience. This paper provides an overview of the main automatic proof and disproof tools.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jasmin Christian Blanchette
    • 1
  • Lukas Bulwahn
    • 1
  • Tobias Nipkow
    • 1
  1. 1.Fakultät für InformatikTechnische Universität MünchenGermany

Personalised recommendations