Synthesizing proofs from programs in the Calculus of Inductive Constructions (1995)
| Venue: | In Proceedings of the International Conference on Mathematics for Programs Constructions. Springer-Verlag LNCS 947 |
| Citations: | 22 - 1 self |
BibTeX
@INPROCEEDINGS{Parent95synthesizingproofs,
author = {Catherine Parent},
title = {Synthesizing proofs from programs in the Calculus of Inductive Constructions},
booktitle = {In Proceedings of the International Conference on Mathematics for Programs Constructions. Springer-Verlag LNCS 947},
year = {1995},
pages = {351--379},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We want to prove "automatically" that a program is correct with respect to a set of given properties that is a specification. Proofs of specifications contain logical parts and computational parts. Programs can be seen as computational parts of proofs. They can then be extracted from proofs and be certified to be correct. We focus on the inverse problem : is it possible to reconstruct proof obligations from a program and its specification ? The framework is the type theory where a proof can be represented as a typed -term [Con86, NPS90] and particularly the Calculus of Inductive Constructions [Coq85]. A notion of coherence is introduced between a specification and a program containing annotations as in the Hoare sense. This notion is based on the definition of an extraction function called the weak extraction. Such an annotated program can give a method to reconstruct a set of proof obligations needed to have a proof of the initial specification. This can be seen either as a method o...
