More SPASS with Isabelle

Superposition with Hard Sorts and Configurable Simplification
  • Jasmin Christian Blanchette
  • Andrei Popescu
  • Daniel Wand
  • Christoph Weidenbach
Conference paper

DOI: 10.1007/978-3-642-32347-8_24

Volume 7406 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Blanchette J.C., Popescu A., Wand D., Weidenbach C. (2012) More SPASS with Isabelle. In: Beringer L., Felty A. (eds) Interactive Theorem Proving. ITP 2012. Lecture Notes in Computer Science, vol 7406. Springer, Berlin, Heidelberg

Abstract

Sledgehammer for Isabelle/HOL integrates automatic theorem provers to discharge interactive proof obligations. This paper considers a tighter integration of the superposition prover SPASS to increase Sledgehammer’s success rate. The main enhancements are native support for hard sorts (simple types) in SPASS, simplification that honors the orientation of Isabelle simp rules, and a pair of clause-selection strategies targeted at large lemma libraries. The usefulness of this integration is confirmed by an evaluation on a vast benchmark suite and by a case study featuring a formalization of language-based security.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jasmin Christian Blanchette
    • 1
  • Andrei Popescu
    • 1
  • Daniel Wand
    • 2
  • Christoph Weidenbach
    • 2
  1. 1.Fakultät für InformatikTechnische Universität MünchenGermany
  2. 2.Max-Planck-Institut für InformatikSaarbrückenGermany