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


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

Document Date: 2015-01-25 16:18:54


Open Document

File Size: 189,10 KB

Share Result on Facebook

City

Munich / Cambridge / Wrocław / /

Company

Sledgehammer / S. Böhme L. C. / /

Country

Poland / United Kingdom / /

/

Facility

boehmes}@in.tum.de L. C. Paulson Computer Laboratory / store Z3 / University of Cambridge / /

IndustryTerm

Internet access / embedded application operator / external tool / minimization tool / naive linear algorithm / arithmetic operators / official web site / binary algorithm / automated reasoning systems / explicit application operator / proof search / translated using an explicit application operator / /

OperatingSystem

Mac OS X / Linux / Microsoft Windows / /

Organization

U.K.’s Engineering and Physical Sciences Research Council / University of Cambridge / de L. C. Paulson Computer Laboratory / Technische Universität München / S. Böhme Institut für Informatik / /

Person

Tobias Nipkow / Sascha Böhme / Meng / Lawrence C. Paulson / Jasmin Christian Blanchette / /

Position

editor / /

ProgrammingLanguage

ML / /

Technology

binary algorithm / Linux / naive linear algorithm / two algorithms / /

SocialTag