Zum Inhalt springen

Nur-Lesen-Fassung: Das Forschungsinformationssystem (FIS) ist aus Sicherheitsgründen vorübergehend durch diese Nur-Lesen-Fassung ersetzt. Alle öffentlichen Inhalte und Volltexte sind weiterhin abrufbar; Anmeldung, Bearbeitung, Einreichung und Statistiken stehen nicht zur Verfügung. Bei Fragen: fis@uni-bamberg.de

Start › Publikationen › Grounding Synchronous Deterministic Concurrency in Sequential Programming

Publikation

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

Fakultät/Lehrstuhl
Autorin(nen)/Autor(en)
Aguado, Joaquín
Von Hanxleden, Reinhard
Fuhrmann, Insa
Verlagsangabe
opus : Bamberg
Erscheinungsjahr
2014
Seiten
86, Illustrationen
Schriftenreihe(n)/Serie(n) ; Band
Sprache(n)
Englisch
Lizenz
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-Schlagwort(e)
Programmiersprache
Parallelverarbeitung
Freie Schlagwort(e)
Concurrency
determinism
constructiveness
Mealy reactive systems
synchronous programming
DDC-Klassifikation
004 Computer science
RVK-Klassifikation
ST 240
Dokumenttyp
Buch (Monografie, Sammelband)
URI
Datum der Freischaltung
25.05.2016, 25.05.2016

Permalink: https://fis.uni-bamberg.de/handle/uniba/20793 · Daten als JSON · Zitieren: BibTeX · RIS

Datenstand: 15.11.2026

Eingeschränkter Lesezugriff: Anmeldung, Bearbeitung und Einreichung sind vorübergehend deaktiviert.