An application of co-inductive types in Coq: Verification of the alternating bit protocol

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1158 LNCS, Issue , 1996, Pages 135-152

  Gimenez, Eduardo ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AXIOMATI-SATION; BROADCASTING SYSTEMS; INFINITE OBJECTS; RECURSIVE TYPES;

CALCULATIONS;

THEOREM PROVING;

EID: 84885606605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61780-9_67     Document Type: Conference Paper

References (18)

1. P. Aczel. Non-Well-Founded Sets, Volume 14 of CLSI Lecture Notes. Stanford University, 1988.
2. M. Bezem and J. Groote. A Formal verification of Alternating Protocol in the Calculus of Constructions. Technical Report 88, Departament of Philosophy, University of Utrecht, 1993.
3. T. Coquand. Infinite objects in Type Theory. In Henk Barendregt, Tobias Nipkow, editor, Types for Proofs and Programs, pages 62-78. LNCS 806, 1993.
4. C. Cornes et al. The Coq Proof assistant user's guide - Version V5.10. Technical Report 0177, INRIA, 1995.
5. C. Cornes and D. Terrasse. Automatizing Inversion Predicates in Coq. In BRA Workshop on Types for Proofs on Programs, 1995. In this book.
6. M. Dummett. Elements of Intuitionism. Oxford University Press, 1977.
7. E. Gimenez. Codifying guarded definitions with recursive schemes. In BRA Workshop on Types for Proofs and Programs (TYPES'94), LNCS 996, pages 39-59, 1994.
8. L. Helmink, M.P.A. Selliok, and F.W. Vaandrager. Proof-Checking a Data Link Protocol. In Henk Barendregt, Tobias Nipkow, editor, Types for Proofs and Programs, pages 127-165. LNCS 806, 1993.
9. G. Kahn and D. MacQueen. Coroutines and networks of parallel processes. Information Processing 77, pages 993-998, 1977.
10. L. Magnusson and B. Nordstrom. The ALF proof editor and its proof engine. In Nijmegen Workshop on Types for Proofs and Programs, 1993.
11. C. Parent. Synthesizing proofs from programs in the Calculus of Inductive Constructions. In Mathematics for Programs Constructions'95, LNCS 947, pages 351-379, 1995.
12. C. Paulin-Mohring. Inductive definitions in the system Coq: Rules and Properties. In M. Bezem, J.F. Groote, editor, Proceedings of the TLCA, 1993.
13. L. Paulson. Co-induction and Co-recursion in Higher-order Logic. Technical Report 304, Computer Laboratory, University of Cambridge, 1993.
14. L. Paulson. The IsabeEe reference manual. Technical Report 283, Computer Laboratory, University of Cambridge, 1993.
15. L. Paulson. A fixed point approach to implementing (co)inductive definitions. Technical Report 304, Computer Laboratory, University of Cambridge, 1995.
16. K.V.S. Prasad. Programming with broadcasts. In E. Best, editor, CONCUR '93, pages 173-187. LNCS 715, 1993.
17. K.V.S. Prasad. A Calculus of Broadcasting Systems. To appear in Science of Computer Programming, 1995.
18. H.P. Sanders. A Logic of Functional Programs with an Application to Concurrency. PhD thesis, Chalmers University of Goteborg, 1992.