Modular Compilation of a Synchronous Language
| dc.creator | Ressouche, Annie | |
| dc.creator | Gaffé, Daniel | |
| dc.creator | Roy, Valérie | |
| dc.date | 2008-01-24 | |
| dc.date.accessioned | 2026-07-07T13:05:25Z | |
| dc.date.available | 2026-07-07T13:05:25Z | |
| dc.description | Synchronous languages rely on formal methods to ease the development of applications in an efficient and reusable way. Formal methods have been advocated as a means of increasing the reliability of systems, especially those which are safety or business critical. It is still difficult to develop automatic specification and verification tools due to limitations like state explosion, undecidability, etc... In this work, we design a new specification model based on a reactive synchronous approach. Then, we benefit from a formal framework well suited to perform compilation and formal validation of systems. In practice, we design and implement a special purpose language (LE) and its two semantics: the ehavioral semantics helps us to define a program by the set of its behaviors and avoid ambiguousness in programs' interpretation; the execution equational semantics allows the modular compilation of programs into software and hardware targets (c code, vhdl code, fpga synthesis, observers). Our approach is pertinent considering the two main requirements of critical realistic applications: the modular compilation allows us to deal with large systems, the model-based approach provides us with formal validation. | |
| dc.identifier | https://arxiv.org/abs/0801.3715 | |
| dc.identifier | http://arxiv.org/abs/0801.3715 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/227484 | |
| dc.subject | Programming Languages | |
| dc.subject | Logic in Computer Science | |
| dc.title | Modular Compilation of a Synchronous Language | |
| dc.type | text |