Skip to main content
Conference Proceedings

Formalizing stalmarck's algorithm in coq

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1869 388-405
DOI: 10.1007/3-540-44659-1_24
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present the development of a machine-checked implementation of Stalmarck's algorithm. First, we prove the correctness and the completeness of an abstract representation of the algorithm. Then, we give an effective implementation of the algorithm that we prove correct.

Cite

CITATION STYLE

APA

Letouzey, P., & Thery, L. (2000). Formalizing stalmarck’s algorithm in coq. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1869, pp. 388–405). Springer Verlag. https://doi.org/10.1007/3-540-44659-1_24

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