Towards Coq-verified Esterel Semantics and Compiling

09/27/2019
by   Gérard Berry, et al.
0

This paper focuses on semantics of the Esterel synchronous programming language. In particular, in addition to the usual behavioral (CBS) and state (CSS) semantics, it introduces a novel microstep semantics which does not need the Can potential function. Formal proofs in Coq of the equivalence between the CBS and CSS semantics and of the refinement between the CSS and microstep semantics are also provided.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2018

Parametric Denotational Semantics for Extensible Language Definition and Program Analysis

We present a novel approach to construction of a formal semantics for a ...
research
09/12/2019

A Formal Semantics of Findel in Coq (Short Paper)

We present the first formal semantics of Findel - a DSL for specifying f...
research
05/01/2020

Combining predicate transformer semantics for effects: a case study in parsing regular languages

This paper describes how to verify a parser for regular expressions in a...
research
03/16/2023

Formally Verified Animation for RoboChart using Interaction Trees

RoboChart is a core notation in the RoboStar framework. It is a timed an...
research
03/25/2022

Formal Semantics and Formally Verified Validation for Temporal Planning

We present a simple and concise semantics for temporal planning. Our sem...
research
09/20/2017

Context-Updates Analysis and Refinement in Chisel

This paper presents the context-updates synthesis component of Chisel--a...
research
01/20/2021

One-way resynchronizability of word transducers

The origin semantics for transducers was proposed in 2014, and led to va...

Please sign up or login with your details

Forgot password? Click here to reset