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

	A Comparison of Functional and Imperative Programming Techniques for Mathematical Software Development Scott Frame and John W. Coffey Department of Computer Science University of West Florida Pensacola, FL DocID: 1uXfb - View Document
	Knowledge-Based Interoperability for Mathematical Software Systems Michael Kohlhase1 Luca De Feo5 Dennis M¨ uller1 Markus Pfeiffer3 Florian 2 4 DocID: 1uNkl - View Document
	Open Software and Open Textbooks for Mathematics Korean Mathematical Society Invited Lecture Rob Beezer April 29, 2017 DocID: 1tXMw - View Document
	MAS115 PRESENTATION LAB 1 In this lab we will use a software bundle called MiKTeX (pronounced ‘miktek’) to create basic mathematical documents. Log on, then check to see if MiKTeX is installed on the computer by typ DocID: 1tEBq - View Document
	8•November1984 SIAM NEWS Computational Sciences Choices for Mathematical Wordprocessing Software In this article, P. K. Wong discusses some issues involved DocID: 1sYDk - View Document