Certifying Synchrony for Free

  • Authors:
  • Sylvain Boulmé;Grégoire Hamon

  • Affiliations:
  • -;-

  • Venue:
  • LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.