A computational approach to pocklington certificates in type theory

Authors:
Benjamin Grégoire;Laurent Théry;Benjamin Werner
Affiliations:
INRIA Sophia-Antipolis, France;INRIA Sophia-Antipolis, France;INRIA Futurs, France
Venue:
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Year:
2006

Citing 4
Cited 9

Formal and efficient primality proofs by use of computer algebra oracles

Journal of Symbolic Computation - Special issue on computer algebra and mechanized reasoning: selected St. Andrews' ISSAC/Calculemus 2000 contributions
A compiled implementation of strong reduction

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
A Skeptic’s Approach to Combining HOL and Maple

Journal of Automated Reasoning
Autarkic Computations in Formal Proofs

Journal of Automated Reasoning

Proving Bounds on Real-Valued Functions with Computations

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Fast reflexive arithmetic tactics the linear case and beyond

TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Primality proving with elliptic curves

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Certifying compilers using higher-order theorem provers as certificate checkers

Formal Methods in System Design
Proof certificates for algebra and their application to automatic geometry theorem proving

ADG'08 Proceedings of the 7th international conference on Automated deduction in geometry
View of computer algebra data from Coq

MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
A purely functional library for modular arithmetic and its application to certifying large prime numbers

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
On the strength of proof-irrelevant type theories

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A functional framework for result checking

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encoding of certificates for the proof system Coq which yields radically improved performances by relying heavily on computations inside and outside of the system (two-level approach).