<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2013-05-31 14:00:42Theoretical computer science Logic in computer science Formal methods Mathematical logic Automated theorem proving Substructural logic Formal verification Compiler correctness Separation logic Correctness Semantics Hoare logic |
Add to Reading List |
Program Logics for Certified Compilers | 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 |