Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

...

pretsy-devel mailinglist

 

Papers:

 

[DATE’13]

Sequentially Constructive Concurrency: A Conservative Extension of the Synchronous Model of Computation.

...

Design, Automation Test in Europe Conference (DATE’13), March 2013: 581-586.

Abstract. Synchronous languages ensure deterministic concurrency, but at the price of heavy restrictions on what programs are considered valid, or constructive. Meanwhile, sequential languages such as C and Java offer an intuitive, familiar programming paradigm but provide no guarantees with regard to deterministic concurrency. The sequentially constructive (SC) model of computation (MoC) presented here harnesses the synchronous execution model to achieve deterministic concurrency while addressing concerns that synchronous languages are unnecessarily restrictive and difficult to adopt.

In essence, the SC MoC extends the classical synchronous MoC by allowing variables to be read and written in any order as long as sequentiality expressed in the program provides sufficient scheduling information to rule out race conditions. This allows to use programming patterns familiar from sequential programming, such as testing and later setting the value of a variable, which are forbidden in the standard synchronous MoC. The SC MoC is a conservative extension in that programs considered constructive in the common synchronous MoC are also SC and retain the same semantics. In this paper, we investigate classes of shared variable accesses, define SC admissible scheduling as a restriction of "free scheduling," derive the concept of sequential constructiveness, and present a priority-based scheduling algorithm for analyzing and compiling SC programs efficiently.

 

[CSIJC’13]

A Game Semantics for Instantaneous Esterel Reactions.

J. Aguado

CSI Journal of Computing. Vol.2, No.1-2, e-ISSN 2277-7091, 2013: 30-44.

Abstract. The present paper explains the constructive semantics of the synchronous language Estterel in terms of winning strategies in finite two–player games. The kernel fragment of Esterel considered here corresponds to combinational circuits and includes the statements for signal emission, status test, parallel composition and gives for the first time a game–theoretic interpretation to sequential composition and local signal declaration. This modelling shows how non-classical truth values induced by logic games can be used to characterise the constructive single-step semantics for Esterel.

 

 

 

Section
Column
width60%
Recently Updated
Column
width2%
 
Column
width38%
Navigate space
Page Tree Search
Page Tree