The foundation of a generic theorem prover
Journal of Automated Reasoning
How to make ad-hoc polymorphism less ad hoc
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Order-sorted polymorphism in Isabelle
Papers presented at the second annual Workshop on Logical environments
HOL Light: A Tutorial Introduction
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Combining superposition, sorts and splitting
Handbook of automated reasoning
Organizing Numerical Theories Using Axiomatic Type Classes
Journal of Automated Reasoning
Automation for interactive proof: first prototype
Information and Computation - Special issue: Combining logical systems
The design and implementation of VAMPIRE
AI Communications - CASC
A formally verified proof of the prime number theorem
ACM Transactions on Computational Logic (TOCL)
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Extended static checking in JML4: benefits of multiple-prover support
Proceedings of the 2009 ACM symposium on Applied Computing
Faster and More Complete Extended Static Checking for the Java Modeling Language
Journal of Automated Reasoning
Large theory reasoning with SUMO at CASC
AI Communications - Practical Aspects of Automated Reasoning
Zenon: an extensible automated theorem prover producing checkable proofs
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
The TPTP world - infrastructure for automated reasoning
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Extending Sledgehammer with SMT solvers
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Proving valid quantified Boolean formulas in HOL light
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Automatic proof and disproof in Isabelle/HOL
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Integrating automated and interactive protocol verification
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Modular SMT proofs for fast reflexive checking inside coq
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Electronic Notes in Theoretical Computer Science (ENTCS)
PRocH: proof reconstruction for HOL light
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Automated reasoning service for HOL light
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Premise Selection for Mathematics by Corpus Analysis and Kernel Methods
Journal of Automated Reasoning
| Hi-index | 0.00 |
Interactive proof assistants should verify the proofs they receive from automatic theorem provers. Normally this proof reconstruction takes place internally, forming part of the integration between the two tools. We have implemented source-level proof reconstruction: resolution proofs are automatically translated to Isabelle proof scripts. Users can insert this text into their proof development or (if they wish) examine it manually. Each step of a proof is justified by calling Hurd's Metis prover, which we have ported to Isabelle. A recurrent issue in this project is the treatment of Isabelle's axiomatic type classes.