Co-inductive Axiomatization of a Synchronous Language

David Nowak (1) , Jean-René Beauvais (1) , Jean-Pierre Talpin (1)

1 EP-ATR - Environnement de programmation d'applications temps réel

Over the last decade, the increasing demand for the validation of safety critical systems lead to the development of domain-specific programming languages (e.g. synchronous languages) and automatic verification tools (e.g. model checkers). Conventionally, the verification of a reactive system is implemented by specifying a discrete model of the system (i.e. a finite-state machine) and then checking this model against temporal properties (e.g. using an automata-based tool). We investigate the use of a theorem prover, Coq, for the specification of infinite state systems and for the verification of co-inductive properties.

Domaines: Systèmes embarqués

David Nowak, Jean-René Beauvais, Jean-Pierre Talpin. Co-inductive Axiomatization of a Synchronous Language. 11th International Conference on Theorem Proving in Higher Order Logics (TPHOLs '98), Sep 1998, Canberra, Australia. pp.387-399, ⟨10.1007/BFb0055148⟩. ⟨hal-00544505⟩