Toward Certification for Free!
Résumé
How can we reduce the required effort to develop certified programs in proof assistants such as Coq? A major trend is to introduce untrusted oracles able to justify their answers by producing a certificate, i.e. a witness of their computations. A trustworthy result is then built from this certificate by a certified checker. This alleviates the burden of proof, but producing certificates is a requirement which increases complexity of oracle development.
We propose a design pattern, called Polymorphic LCF Style, that removes the need for certificates: ML oracles directly compute the certified result by invoking trusted operators and datastructures extracted from Coq. But, oracles only handle these datastructures as polymorphic values, which forbids oracles to forge incorrect results. This design thus delegates a part of the certification to the ML typechecker. Correctness comes from a weak parametricity property of imperative ML polymorphic types that we call parametric invariance. We demonstrate the relevance of Polymorphic LCF Style for the certification of a realistic library: an abstract domain of convex polyhedra.
Mots clés
Linear Programming
Type theory
Abstract Domain of Polyhedra
Polymorphism
Program verification
Parametricity
CCS Concepts: •Software and its engineering → Polymorphism
•Theory of computation → Program veriication
Invariants
•Mathematics of computing → Solvers
Additional Key Words and Phrases: Abstract Domain of Polyhedra
CCC
CCS Concepts: • Software and its engineering → Polymorphism
• Theory of computation → Program verification
• Mathematics of computing → Solvers
Coq
Origine : Fichiers produits par l'(les) auteur(s)
Loading...