First Page | Document Content | |
---|---|---|
Date: 2015-05-21 06:02:19Theoretical computer science Software engineering Programming language theory Logic in computer science Proof assistants Formal methods Automated theorem proving Isabelle Satisfiability modulo theories ACL2 Curry Logic for Computable Functions | Automatic Proof and Disproof in Isabelle/HOL Jasmin Christian Blanchette, Lukas Bulwahn, and Tobias Nipkow Fakult¨at f¨ur Informatik, Technische Universit¨at M¨unchen Abstract. Isabelle/HOL is a popular interactive tAdd to Reading ListSource URL: people.mpi-inf.mpg.deDownload Document from Source WebsiteFile Size: 207,13 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 |