Translation Validation for Synchronous Data-Flow Specification in the SIGNAL Compiler

Ngo, Van Chan; Talpin, Jean-Pierre; Gautier, Thierry

doi:10.1007/978-3-319-19195-9_5

Cited by 2 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Following this approach, the semantics preservation is not proved once and for all by proving a compiler, but verified a posteriori for each run of the compiler. Research in this domain about synchronous languages concentrates mainly on Signal [1,20,36] and on Simulink [18,37]. In particular, [18] proposes a framework to show refinement relations between Simulink discrete-time block diagrams and SPARK / Ada implementations.…”

Section: Related Workmentioning

confidence: 99%

Equation-Directed Axiomatization of Lustre Semantics to Enable Optimized Code Validation

Brun,

Garion,

Garoche

et al. 2023

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

Model-based design tools like SCADE Suite and Simulink are often used to design safety-critical embedded software. Consequently, generating correct code from such models is crucial. We tackle this challenge on Lustre, a dataflow synchronous language that embodies the concepts that base such tools. Instead of proving correct a whole code generator, we turn an existing compiler into a certifying compiler from Lustre to C, following a translation validation approach. We propose a solution that generates both C code and an attached specification expressing a correctness result for the generated and optionally optimized code. The specification yields proof obligations that are discharged by external solvers through the Frama-C platform.

show abstract

Section: Related Workmentioning

confidence: 99%

Equation-Directed Axiomatization of Lustre Semantics to Enable Optimized Code Validation

Brun,

Garion,

Garoche

et al. 2023

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…Translation validation has been pioneered by A. Pnueli et al [16]. Recently, [13] have pushed forward this approach for the Signal language. The basic idea is that each individual translation is followed by a validation phase which verifies that the produced code implements the source code.…”

Section: Translation Validationmentioning

confidence: 99%

A refinement-based compiler development for synchronous languages

Bodeveix

Filali-Amine

Kan

2017

Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design

View full text Add to dashboard Cite

In this paper, we are concerned by the elaboration of generic development steps for the code generation for synchronous languages. Our aim is to provide a correct by construction solution. For that purpose, we adopt a refinement-based approach where proof obligations for each step guarantee properties preservation. We use the Event-B formal method. We start with a big step semantics specified by an Event-B machine. Through a sequence of refinements, expressed as Event-B refinement machines, we end up with a code generation step which implements a small step semantics preserving the properties of the big step semantics.

show abstract

Translation Validation for Synchronous Data-Flow Specification in the SIGNAL Compiler

Cited by 2 publications

References 15 publications

Equation-Directed Axiomatization of Lustre Semantics to Enable Optimized Code Validation

Equation-Directed Axiomatization of Lustre Semantics to Enable Optimized Code Validation

A refinement-based compiler development for synchronous languages

Contact Info

Product

Resources

About