Hardware Verification using co-induction in COQ (1999)
| Venue: | In Proceedings of the International Conference on Theorem Proving in Higher-Order Logics |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Coupet-Grimal99hardwareverification,
author = {Solange Coupet-Grimal and Line Jakubiec},
title = {Hardware Verification using co-induction in COQ},
booktitle = {In Proceedings of the International Conference on Theorem Proving in Higher-Order Logics},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This paper presents a toolbox implemented in Coq and dedicated to the specification and verification of synchronous sequential devices. The use of Coq co-inductive types underpins our methodology and leads to elegant and uniform descriptions of the circuits and their behaviours as well as clear and short proofs. An application to a non trivial circuit is given as an illustration. 1 Introduction Co-induction is a powerful tool for dealing with infinite structures. It is especially well suited to prove properties about circuits where one has to cope with infinitely long temporal sequences. This work presents a general methodology to specifying and proving synchronous sequential circuits in the Calculus of Inductive Constructions (enriched with Co-inductive types) implemented in the Coq proof assistant [1]. It is a continuation of [5], where we made heavy use of dependent types. We go deeply into this direction, introducing dependent types systematically whenever this leads to m...
