More SPASS with Isabelle: superposition with hard sorts and configurable simplification

Blanchette, Jasmin Christian, Popescu, Andrei, Wand, Daniel and Weidenbach, Cristoph (2012) More SPASS with Isabelle: superposition with hard sorts and configurable simplification. In: Interactive Theorem Proving (ITP), Third International Conference, 13-15 Aug 2012, Princeton, New Jersey, US.

[img]
Preview
PDF - Final accepted version (with author's formatting)
Download (150kB) | Preview

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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Online ISBN:9783642323478 Published paper appears in: Interactive Theorem Proving, Volume 7406 of the series Lecture Notes in Computer Science pp 345-360, 2012
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 15376
Notes on copyright: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-32347-8_24
Useful Links:
Depositing User: Andrei Popescu
Date Deposited: 27 Apr 2015 13:29
Last Modified: 31 May 2019 00:12
URI: https://eprints.mdx.ac.uk/id/eprint/15376

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year