First Page | Document Content | |
---|---|---|
Date: 2017-07-30 15:10:52Theoretical 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 1Add to Reading ListSource URL: www.cs.man.ac.ukDownload Document from Source WebsiteFile Size: 177,27 KBShare Document on Facebook |
Proceedings of the CADE-25 ATP System Competition CASC-25 Geo↵ Sutcli↵e University of Miami, USA AbstractDocID: 1qH8X - View Document | |
Proceedings of the 6th International Workshop on the Implementation of Logics Christoph Benzm¨ uller, Bernd Fischer, Geoff SutcliffeDocID: 1qjaE - View Document | |
The Applicability of Logic Program Analysis and Transformation to Theorem Proving 1 D.A. de WaalDocID: 1pBlm - View Document | |
Noname manuscript No. (will be inserted by the editor) Extending Sledgehammer with SMT Solvers Jasmin Christian Blanchette · Sascha Böhme · Lawrence C. PaulsonDocID: 1pyfq - View Document | |
Interactive Theorem Proving in Industry John Harrison Intel Corporation 16 April 2012DocID: 1oNzB - View Document |