First Page | Document Content | |
---|---|---|
Date: 2015-05-21 06:02:19Theoretical computer science Software engineering Programming language theory Logic in computer science Proof assistants Formal methods Automated theorem proving Isabelle Satisfiability modulo theories ACL2 Curry Logic for Computable Functions | 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 tAdd to Reading ListSource URL: people.mpi-inf.mpg.deDownload Document from Source WebsiteFile Size: 207,13 KBShare Document on Facebook |
AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTIONDocID: 1vah4 - View Document | |
Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both forDocID: 1sXwT - View Document | |
Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa JohanssonDocID: 1sOSK - View Document | |
Microsoft Word - BlankPageDocID: 1rugC - View Document | |
SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, GermanyDocID: 1rrok - View Document |