Skip to content

Read-only version: For security reasons, the Research Information System (FIS) has been temporarily replaced by this read-only version. All public content and full texts remain available; login, editing, submission and statistics are not available. Questions: fis@uni-bamberg.de

Home › Publications › Grounding Synchronous Deterministic Concurrency in Sequential Programming

Publication

Grounding Synchronous Deterministic Concurrency in Sequential Programming

Aguado, Joaquín; Mendler, Michael; Von Hanxleden, Reinhard; u. a. (2014): Grounding Synchronous Deterministic Concurrency in Sequential Programming, Bamberg: opus.

Details

Faculty/Chair
Author
Aguado, Joaquín
Von Hanxleden, Reinhard
Fuhrmann, Insa
Publisher Information
opus : Bamberg
Year of publication
2014
Pages
86, Illustrationen
Series ; Volume
Language
English
Licence
URN
Abstract

In this report, we introduce an abstract interval domain I(D; P) and associated fixed point semantics for reasoning about concurrent and sequential variable accesses within a synchronous cycle-based model of computation. The interval domain captures must (lower bound) and cannot (upper bound) information to approximate the synchronisation status of variables consisting of a value status D and an init status P. We use this domain for a new behavioural definition of Berry’s causality analysis for Esterel. This gives a compact and uniform understanding of Esterel-style constructiveness for shared-memory multi-threaded programs. Using this new domain-theoretic characterisation we show that Berry’s constructive semantics is a conservative approximation of the recently proposed sequentially constructive (SC) model of computation. We prove that every Berry-constructive program is sequentially constructive, i.e., deterministic and deadlock-free under sequentially admissible scheduling. This gives, for the first time, a natural interpretation of Berry-constructiveness for main-stream imperative programming in terms of scheduling, where previous results were cast in terms of synchronous circuits. It also opens the door to a direct mapping of Esterel’s signal mechanism into boolean variables that can be set and reset arbitrarily within a tick.

We illustrate the practical usefulness of this mapping by discussing how signal reincarnation is handled efficiently by this transformation, which is of complexity that is linear in program

GND Keywords
Programmiersprache
Parallelverarbeitung
Keywords
Concurrency
determinism
constructiveness
Mealy reactive systems
synchronous programming
DDC Classification
004 Computer science
RVK Classification
ST 240
Type
Book
URI
Activation date
2016-05-25, 2016-05-25

Permalink: https://fis.uni-bamberg.de/handle/uniba/20793 · Data as JSON · Cite: BibTeX · RIS

Data as of: 2026-11-16

Restricted read-only access: login, editing and submission are temporarily disabled.