Skip to main content
Journal Article

Certifying synchrony for free

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2250 495-506
DOI: 10.1007/3-540-45653-8_34
21Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We express reactive programs in Coq using data-flow synchronous operators. Following Lucid-Synchrone approach, synchronous static constraints are here expressed using dependent types. Hence, our analysis of synchrony is here directly performed by Coq typechecker. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Boulmé, S., & Hamon, G. (2001). Certifying synchrony for free. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2250, 495–506. https://doi.org/10.1007/3-540-45653-8_34

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