Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite

Authors:
Sean McLaughlin;Clark Barrett;Yeting Ge
Affiliations:
Department of Computer Science, Carnegie Mellon University;Department of Computer Science, New York University;Department of Computer Science, New York University
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 8
Cited 15

Logic and computation: interactive proof with Cambridge LCF

Logic and computation: interactive proof with Cambridge LCF
A framework for defining logics

Journal of the ACM (JACM)
A Skeptic’s Approach to Combining HOL and Maple

Journal of Automated Reasoning
Validity Checking for Combinations of Theories with Equality

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
HOL Light: A Tutorial Introduction

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Formal Verification of Floating Point Trigonometric Functions

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
CVC: A Cooperating Validity Checker

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Decision Procedure for an Extensional Theory of Arrays

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science

Full functional verification of linked data structures

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Linear Arithmetic with Stars

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Trust and Automation in Verification Tools

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Fast and flexible proof checking for SMT

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
CVC3

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Rocket-fast proof checking for SMT solvers

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
Combining theories with shared set operations

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Extending Sledgehammer with SMT solvers

CADE'11 Proceedings of the 23rd international conference on Automated deduction
An interpretation of Isabelle/HOL in HOL light

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Fast LCF-Style proof reconstruction for z3

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
A modular integration of SAT/SMT solvers to coq through proof witnesses

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Modular SMT proofs for fast reflexive checking inside coq

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
versat: a verified modern SAT solver

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is a case study in combining theorem provers. We define a derived rule in HOL-Light, CVC_PROVE, which calls CVC Lite and translates the resulting proof object back to HOL-Light. As a result, we obtain a highly trusted proof-checker for CVC Lite, while also fundamentally expanding the capabilities of HOL-Light.