Skip to main content
Conference Proceedings

From proposition to program embedding the refinement calculus in coq

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9613 29-44
DOI: 10.1007/978-3-319-29604-3_3
5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The refinement calculus and type theory are both frameworks that support the specification and verification of programs. This paper presents an embedding of the refinement calculus in the interactive theorem prover Coq, clarifying the relation between the two.As a result, refinement calculations can be performed in Coq, enabling the semi-automatic calculation of formally verified programs from their specification.

Cite

CITATION STYLE

APA

Swierstra, W., & Alpuim, J. (2016). From proposition to program embedding the refinement calculus in coq. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9613, pp. 29–44). Springer Verlag. https://doi.org/10.1007/978-3-319-29604-3_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free