First Page | Document Content | |
---|---|---|
Date: 2017-07-30 15:10:52Theoretical computer science Software engineering Mathematical software Formal methods Proof assistants Logic in computer science Automated theorem proving Isabelle Automated reasoning E theorem prover Formal verification KeY | Towards Strong Higher-Order Automation for Fast Interactive Verification Jasmin Christian Blanchette1,2,3 , Pascal Fontaine3 , Stephan Schulz4 , and Uwe Waldmann2 1Add to Reading ListSource URL: www.cs.man.ac.ukDownload Document from Source WebsiteFile Size: 177,27 KBShare Document on Facebook |
LATEX Sugar for Isabelle Documents Florian Haftmann, Gerwin Klein, Tobias Nipkow, Norbert Schirmer August 15, 2018 Abstract This document shows how to typset mathematics in Isabelle-basedDocID: 1xVCA - View Document | |
Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark WeberDocID: 1xVzf - View Document | |
Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark WeberDocID: 1xVu1 - View Document | |
PDF DocumentDocID: 1xVhU - View Document | |
Defining Recursive Functions in Isabelle/HOL Alexander Krauss Abstract This tutorial describes the use of the function package, which provides general recursive function definitions for Isabelle/HOL. We start with veryDocID: 1xVds - View Document |