Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB (short paper) Ramana Kumar1 , Eric Mullen2 , Zachary Tatlock2 , and Magnus O. Myreen3 1

First Page		Document Content
Date: 2018-05-16 23:20:58 Theoretical computer science Formal methods Logic in computer science Software engineering Proof assistants Automated theorem proving Formal verification Interactive Theorem Proving Isabelle Coq HOL Correctness		Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB (short paper) Ramana Kumar1 , Eric Mullen2 , Zachary Tatlock2 , and Magnus O. Myreen3 1 Add to Reading List Source URL: cakeml.org Download Document from Source Website File Size: 230,31 KB Share 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-based DocID: 1xVCA - View Document
	Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark Weber DocID: 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 Weber DocID: 1xVu1 - View Document
	PDF Document DocID: 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 very DocID: 1xVds - View Document