Back to Results
First PageMeta Content
Logic in computer science / Automated theorem proving / Formal methods / Constraint programming / Reasoning / Satisfiability Modulo Theories / Proof assistant / E theorem prover / Isabelle / Theoretical computer science / Applied mathematics / Mathematics


Extending Sledgehammer with SMT Solvers Jasmin Christian Blanchette1,? , Sascha Böhme1 , and Lawrence C. Paulson2 1 Institut für Informatik, Technische Universität München, Germany 2 Computer Laboratory, University o
Add to Reading List

Document Date: 2013-06-03 12:43:37


Open Document

File Size: 146,73 KB

Share Result on Facebook

City

Munich / Cambridge / QE DNF / Instantiation / /

Company

Sledgehammer / Germany 2 Computer Laboratory / Needham / /

Country

United Kingdom / /

Event

FDA Phase / /

Facility

store Z3 / University of Cambridge / /

IndustryTerm

Internet access / shared-key protocol / external tool / minimization tool / naive linear algorithm / binary algorithm / proof search / Partial applications / /

OperatingSystem

Mac OS X / Linux / Microsoft Windows / /

Organization

U.K.’s Engineering and Physical Sciences Research Council / Institut für Informatik / University of Cambridge / Technische Universität München / /

Person

Tobias Nipkow / Metis / Jasmin Christian / Schroeder / /

Position

representative / /

Product

S2S / /

ProgrammingLanguage

Java / /

Technology

binary algorithm / Schroeder shared-key protocol / artificial intelligence / Java / Linux / naive linear algorithm / two algorithms / /

URL

http /

SocialTag