Certifying synchrony for free

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

Volumn 2250, Issue , 2001, Pages 495-506

  Boulmé, Sylvain ^a   Hamon, Grégoire ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

DATA FLOW; DEPENDENT TYPES; REACTIVE PROGRAMS; STATIC CONSTRAINTS;

ARTIFICIAL INTELLIGENCE;

EID: 35248865890     PISSN: None     EISSN: None     Source Type: Journal    
DOI: 10.1007/3-540-45653-8_34     Document Type: Article

References (22)

1. Barras B, et al. The Coq Proof Assistant Reference Manual, version 6.3.1. Coq Project, INRIA-Rocquencourt, May 2000.
2. Bensalem S, et al. A methodology for proving control programs with Lustre and PVS. In Dependable Computingfor Critical Applications, DCCA-7. IEEE Computer Society, January 1999.
3. Boulmé S and Hamon G. A clocked denotational semantics for Lucid-Synchrone in Coq. Technical report, LIP6, 2001. Available at http://www-spi.lip6.fr/lucid-synchrone/lucid in coq report.ps.
4. Benveniste A, et al. Synchronous programming with events and relations: The Signal language and its semantics. Science of Computer Programming, 16:103-149, 1991.
5. Caspi P. Clocks in dataflow languages. Theorical Computer Science, 94:125-140, 1992.
6. Coupet-Grimal S and Jakubiec L. Hardware verification using coinduction in Coq. In TPHOLs'99, number 1690 in LNCS. 1999.
7. Coquand T and Huet G. The Calculus of Constructions. Information and Computation, 76:95-120, 1988.
8. Caspi P and Pouzet M. A co-iterative characterization of synchronous stream functions. In Coalgebraic Methods in Computer Science (CMCS'98), ENTCS. 28-29 March 1998.
9. Caspi P and Pouzet M. Lucid Synchrone, an ML extension to Lustre. In Submited for publication. 2000.
10. Colaco JL and Pouzet M. Prototypages. Rapport final du projet GENIE II, Verilog SA, Janvier 2000.
11. Dumas-Canovas C and Caspi P. A PVS proof obligation generator for Lustre programs. In LPAR'2000, number 1955 in LNAI. 2000.
12. Filliâtre JC. Preuve de programmes impératifs en théorie des types. Ph. D. thesis, Université Paris-Sud, July 1999.
13. Gimenez E. Codifying guarded definitions with recursive schemes. Technical Report 95-07, LIP ENS-Lyon, December 1994.
14. Gimenez E. A tutorial on recursive types in Coq. Technical Report 0221, INRIA, May 1998.
15. Halbwachs N. Synchronous programming of reactive systems. Kluwer Academic Pub., 1993.
16. Halbwachs N, et al. The Synchronous dataflow programming language Lustre. Proceedings of the IEEE, 79(9):1305-1320, September 1991.
17. Kerboeuf M, et al. The steam-boiler problem in Signal-Coq. In TPHOLs'2000, number 1869 in LNCS. 2000.
18. Nowak D, et al. Co-inductive axiomatization of a synchronous language. In TPHOLs'98, number 1479 in LNCS. 1998.
19. Parent C. Synthesizing proofs from programs in the Calculus of Inductive Constructions. In Mathematics for Programs Constructions'95, number 947 in LNCS. 1995.
20. Pouzet M, et al. Lucid Synchrone v2.0 - Tutorial and Reference manual. LIP6, April 2001. Available at http://www-spi.lip6.fr/lucidsynchrone/lucid synchrone 2.0 manual.ps.
21. Paulin-Mohring C. Inductive Definitions in the System Coq - Rules and Properties. In TLCA, number 664 in LNCS. 1993.
22. Telelogic. Telelogic Tau Scade language - Reference manual, 2001.