This space is reserved for the EPiC Series header, do not use it Checkable Proofs for First-Order Theorem Proving∗ Giles Reger1 and Martin Suda2 1

First Page		Document Content
Date: 2017-07-30 15:10:50 Theoretical computer science Automated theorem proving Mathematics Logic in computer science Mathematical logic Formal methods Automated reasoning Proof assistant Isabelle Interactive Theorem Proving Mathematical proof Geoff Sutcliffe		This space is reserved for the EPiC Series header, do not use it Checkable Proofs for First-Order Theorem Proving∗ Giles Reger1 and Martin Suda2 1 Add to Reading List Source URL: www.cs.man.ac.uk Download Document from Source Website File Size: 153,06 KB Share Document on Facebook

	Alloy as an Introduction to Formal Methods DocID: 1xVY1 - View Document
	Integrated Formal Methods DocID: 1xVBb - View Document
	Trust in Formal Methods Toolchains Arie Gurfinkel Software Engineering Institute Carnegie Mellon University DocID: 1xUHE - View Document
	Formal Methods in System Design manuscript No. (will be inserted by the editor) Inferring Event Stream Abstractions Sean Kauffman · Klaus Havelund · Rajeev Joshi · Sebastian Fischmeister DocID: 1xUCm - View Document
	Formal Methods in System Design manuscript No. (will be inserted by the editor) Automatic Verification of Competitive Stochastic Systems Taolue Chen · Vojtˇ DocID: 1xUrV - View Document