From design-time concurrency to effective implementation parallelism: The multi-clock reactive case

Papailiopoulou, Virginia; Potop-Butucaru, Dumitru; Sorel, Yves; Simone, Robert de; Besnard, Loïc; Talpin, Jean-Pierre

doi:10.1109/eslsyn.2011.5952287

Cited by 9 publications

(6 citation statements)

References 17 publications

(23 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, in order to exploit the emerging multi-core processors, thanks to the theory of weakly endochronous systems [24], there are several research to synthesize multi-threaded code from the synchronous specifications [17][19] [29]. However, one also needs to prove the semantics preservation from the SIGNAL specifications to the multi-threaded code.…”

Section: Discussionmentioning

confidence: 99%

A verified transformation

Yang

Bodeveix

Filali

et al. 2014

Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems

View full text Add to dashboard Cite

SIGNAL belongs to the synchronous languages family. Such languages are widely used in the design of safety-critical realtime systems such as avionics, space systems, and nuclear power plants. This paper reports a key step of a verified SIG-NAL compiler prototype, that is the transformation from a subset of SIGNAL to S-CGA (a variant of clocked guarded actions) and the proof of semantics preservation. Compared with the existing SIGNAL compiler, we use clocked guarded actions as the intermediate representation, to integrate more synchronous programs into our verified compiler prototype in the future. However, in contrast to the SIGNAL language, clocked guarded actions can evaluate a variable even if its clock does not hold. Thus, we propose a variant of clocked guarded actions, namely S-CGA, which constrains variable accesses as done by SIGNAL. To conform with the revised semantics of clocked guarded actions, we also do some adjustments on the existing translation rules from SIGNAL to clocked guarded actions. Finally, the verified transformation is mechanized in the theorem prover Coq.

show abstract

Section: Discussionmentioning

confidence: 99%

A verified transformation

Yang

Bodeveix

Filali

et al. 2014

Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems

View full text Add to dashboard Cite

show abstract

“…In particular, the target architecture has a distributed feature, such as multi-core systems. In order to exploit the emerging multicore processors, thanks to the theory of weakly endochronous systems [27], there are several research to synthesize multithreaded code from the synchronous specifications [28,29]. However, one needs to prove the semantics preservation from the SIGNAL specifications to the multi-threaded code.…”

Section: Discussionmentioning

confidence: 99%

A comparative study of two formal semantics of the SIGNAL language

Yang

Bodeveix

Filali

2013

Front. Comput. Sci.

View full text Add to dashboard Cite

SIGNAL is a part of the synchronous languages family, which are broadly used in the design of safety-critical real-time systems such as avionics, space systems, and nuclear power plants. There exist several semantics for SIGNAL , such as denotational semantics based on traces (called trace semantics), denotational semantics based on tags (called tagged model semantics), operational semantics presented by structural style through an inductive definition of the set of possible transitions, operational semantics defined by synchronous transition systems(STS), etc. However, there is little research about the equivalence between these semantics. In this work, we would like to prove the equivalence between the trace semantics and the tagged model semantics, to get a determined and precise semantics of the SIGNAL language. These two semantics have several different definitions respectively, we select appropriate ones and mechanize them in the Coq platform, the Coq expressions of the abstract syntax of SIGNAL and the two semantics domains, i.e., the trace model and the tagged model, are also given. The distance between these two semantics discourages a direct proof of equivalence. Instead, we transform them to an intermediate model, which mixes the features of both the trace semantics and the tagged model semantics. Finally, we get a determined and precise semantics of SIGNAL.

show abstract

“…In this paper, generic control semantics is presented for the specification of adaptive and dynamically reconfigurable SoCs. In [20] a design flow based on high-level languages (SysML, MARTE, SystemC, etc.) enables the generation of the deterministic multi-threaded code for parallel implementations.…”

Section: Innovation With Respect To the State Of The Artmentioning

confidence: 99%