Abstract

Introduction This deliverable is intended to present the current year achievements with respect to task 3.4. This task aimed at exploring both the need of theorem proving for synchronous dataflow programs and ways to achieve it. As an example, the chosen data-flow language was Lustre and the theorem proving tool was PVS. According to the proposal, we had in mind the following schedule: ffl deliverable 3.4.1 (12 months) : Comparative study of data-flow to PVS translations. ffl deliverable 3.4.2 (24 months) : Case studies on checking data-flow programs with PVS. ffl deliverable 3.4.3 (36 months) : Front-end prototype. Yet this schedule was rather theoretical: for instance, in order to compare translations, we needed some case studies. Similarly, in order to have thorough comparisons we also needed some assistance from automated tools. This led us to progress in each direction at the same time: ffl<F13.3

Citations

490	PVS: A prototype verification system - Owre, Rushby, et al. - 1992
48	Synchronous Kahn networks - Caspi, Pouzet - 1996
15	A co-iterative characterization of synchronous stream functions - Caspi, Pouzet - 1998
13	Circuits as Streams in Coq: Verification of a Sequential Multiplier - Paulin-Mohring - 1996
11	Verification of an optimized fault-tolerant clock synchronization circuit: A case study exploring the boundary between formal reasoning systems - Miner, Johnson - 1996