<--- Back to Details
First PageDocument Content
Logic in computer science / Automated theorem proving / Formal methods / Theoretical computer science / Constraint programming / Satisfiability modulo theories / Z3 / Isabelle / Formal verification / Proof assistant / Automated reasoning / E theorem prover
Date: 2015-01-25 16:18:54
Logic in computer science
Automated theorem proving
Formal methods
Theoretical computer science
Constraint programming
Satisfiability modulo theories
Z3
Isabelle
Formal verification
Proof assistant
Automated reasoning
E theorem prover

Noname manuscript No. (will be inserted by the editor) Extending Sledgehammer with SMT Solvers Jasmin Christian Blanchette · Sascha Böhme · Lawrence C. Paulson

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Download Document from Source Website

File Size: 189,10 KB

Share Document on Facebook

Similar Documents

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT  INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING  1. I NTRODUCTION

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTION

DocID: 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 for

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 for

DocID: 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 Johansson

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

DocID: 1sOSK - View Document

Microsoft Word - BlankPage

Microsoft Word - BlankPage

DocID: 1rugC - View Document

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

DocID: 1rrok - View Document