Introduction to Mathematical Logic and Type Theory: To Truth through Proof
Introduction to Mathematical Logic and Type Theory: To Truth through Proof
Automated Proof Construction in Type Theory Using Resolution
Journal of Automated Reasoning
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
System Description: SystemOn TPTP
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Combining superposition, sorts and splitting
Handbook of automated reasoning
Tutorial: Automated Formal Methods with PVS, SAL, and Yices
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
MPTP 0.2: Design, Implementation, and Initial Experiments
Journal of Automated Reasoning
The design and implementation of VAMPIRE
AI Communications - CASC
Verification of clock synchronization algorithms: experiments on a combination of deductive tools
Formal Aspects of Computing
Translating Higher-Order Clauses to First-Order Clauses
Journal of Automated Reasoning
Property-directed incremental invariant generation
Formal Aspects of Computing
Handling Polymorphism in Automated Deduction
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Instantiation-Based Automated Reasoning: From Theory to Practice
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
VCC: A Practical System for Verifying Concurrent C
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
HOL-Boogie--An Interactive Prover-Backend for the Verifying C Compiler
Journal of Automated Reasoning
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
Electronic Notes in Theoretical Computer Science (ENTCS)
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Source-level proof reconstruction for interactive theorem proving
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
A polymorphic intermediate verification language: design and logical encoding
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Analytic tableaux for higher-order logic with choice
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Fast LCF-Style proof reconstruction for z3
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automatic proof and disproof in Isabelle/HOL
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Automating algebraic methods in isabelle
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Hybrid contract checking via symbolic simplification
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Reasoning about constants in nominal isabelle or how to formalize the second fixed point theorem
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Reconstruction of z3's bit-vector proofs in HOL4 and Isabelle/HOL
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Automatic verification of TLA+ proof obligations with SMT solvers
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Satallax: an automatic higher-order prover
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
HALO: haskell to logic through denotational semantics
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
Quantifier instantiation techniques for finite model finding in SMT
CADE'13 Proceedings of the 24th international conference on Automated Deduction
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.01 |
Sledgehammer is a component of Isabelle/HOL that employs firstorder automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It heuristically selects relevant facts and, if an ATP is successful, produces a snippet that replays the proof in Isabelle. We extended Sledgehammer to invoke satisfiability modulo theories (SMT) solvers as well, exploiting its relevance filter and parallel architecture. Isabelle users are now pleasantly surprised by SMT proofs for problems beyond the ATPs' reach. Remarkably, the best SMT solver performs better than the best ATP on most of our benchmarks