Lightweight integration of the Ergo theorem prover inside a proof assistant

Authors:
Sylvain Conchon;Evelyne Contejean;Johannes Kanig;Stéphane Lescuyer
Affiliations:
LRI, Univ Paris-Sud, CNRS, Orsay, INRIA Futurs, ProVal, Orsay;LRI, Univ Paris-Sud, CNRS, Orsay, INRIA Futurs, ProVal, Orsay;INRIA Futurs, ProVal, Orsay, LRI, Univ Paris-Sud, CNRS, Orsay;INRIA Futurs, ProVal, Orsay, LRI, Univ Paris-Sud, CNRS, Orsay
Venue:
Proceedings of the second workshop on Automated formal methods
Year:
2007

Citing 8
Cited 4

Deciding Combinations of Theories

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Deconstructing Shostak

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Verification of non-functional programs using interpretations in type theory

Journal of Functional Programming
Simplify: a theorem prover for program checking

Journal of the ACM (JACM)
Type-safe modular hash-consing

Proceedings of the 2006 workshop on ML
Handling Polymorphism in Automated Deduction

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
CVC3

CAV'07 Proceedings of the 19th international conference on Computer aided verification

E-matching for Fun and Profit

Electronic Notes in Theoretical Computer Science (ENTCS)
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
Automated reasoning and presentation support for formalizing mathematics in Mizar

AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ergo is a little engine of proof dedicated to program verification. It fully supports quantifiers and directly handles polymorphic sorts. Its core component is CC(X), a new combination scheme for the theory of uninterpreted symbols parameterized by a built-in theory X. In order to make a sound integration in a proof assistant possible, Ergo is capable of generating proof traces for CC(X). Alternatively, Ergo can also be called interactively as a simple oracle without further verification. It is currently used to prove correctness of C and Java programs as part of the Why platform.