Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
First-Order Automation for Higher-Order-Logic Theorem Proving
Proceedings of the 7th International Workshop on Higher Order Logic Theorem Proving and Its Applications
A Resolution Theorem Prover for Intuitonistic Logic
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Optimizing Proof Search in Model Elimination
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Hierarchical Verification Using an MDG-HOL Hybrid Tool
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
PROSPER - An Investigation into Software Architecture for Embedded Proof Engines
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Providing a formal linkage between MDG and HOL
Formal Methods in System Design
Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Theorem Proving for Verification (Invited Tutorial)
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Extending Sledgehammer with SMT solvers
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Connecting a logical framework to a first-order logic prover
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Modular SMT proofs for fast reflexive checking inside coq
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
The HOL Light Theory of Euclidean Space
Journal of Automated Reasoning
| Hi-index | 0.00 |
Gandalf is a first-order resolution theorem-prover, optimized for speed and specializing in manipulations of large clauses. In this paper I describe GANDALF_TAC, a HOL tactic that proves goals by calling Gandalf and mirroring the resulting proofs in HOL. This call can occur over a network, and a Gandalf server may be set up servicing multiple HOL clients. In addition, the translation of the Gandalf proof into HOL fits in with the LCF model and guarantees logical consistency.