Towards Strong Higher-Order Automation for Fast Interactive Verification Jasmin Christian Blanchette1,2,3 , Pascal Fontaine3 , Stephan Schulz4 , and Uwe Waldmann2 1

First Page		Document Content
Date: 2017-07-30 15:10:52 Theoretical 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 1 Add to Reading List Source URL: www.cs.man.ac.uk Download Document from Source Website File Size: 177,27 KB Share Document on Facebook

	Language Models for Proofs Anonymous Author(s) ABSTRACT Proofs play a key role in reasoning about programs and verification of properties of systems. Mechanized proof assistants help users in developing proofs and checki DocID: 1xVtC - View Document
	Proof assistants in computer science research Xavier Leroy Inria Paris-Rocquencourt Semantics of proofs and certified mathematics, DocID: 1vgAJ - View Document
	ｂｲｵｳｳ･ｬｳＬ＠ＳＰ＠ｏ｣ｴｯ｢･ｲ＠ＲＰＱＵｃｏｓｔ＠ＰＵＵＯＱＵｄｅｃｉｓｉｏｎｓｵ｢ｪ･｣ｴＺ＠ DocID: 1rtVS - View Document
	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 t DocID: 1rlXv - View Document
	Mizar Hands-on Tutorial Adam Naumowicz Artur Kornilowicz Adam Grabowski DocID: 1rlwk - View Document