A Refinement-based compiler development for synchronous languages - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

A Refinement-based compiler development for synchronous languages

Résumé

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.
Fichier principal
Vignette du fichier
bodeveix_19174.pdf (340.84 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03624681 , version 1 (30-03-2022)

Identifiants

Citer

Jean-Paul Bodeveix, M Filali, Shuanglong Kan. A Refinement-based compiler development for synchronous languages. 15th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE 2017), Sep 2017, Vienna, Austria. pp.165-174, ⟨10.1145/3127041.3127056⟩. ⟨hal-03624681⟩
14 Consultations
8 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More