scispace - formally typeset
Proceedings ArticleDOI

Correct-by-construction asynchronous implementation of modular synchronous specifications

Reads0
Chats0
TLDR
A model for the representation of asynchronous implementations of synchronous specifications offers a unified framework for reasoning about two essential correctness properties of an implementation: the preservation of semantics and the absence of deadlocks.
Abstract
We introduce a model for the representation of asynchronous implementations of synchronous specifications. The model covers classical implementations, where a notion of global synchronization is preserved by means of signaling, and globally asynchronous, locally synchronous (GALS) implementations where the global clock is removed. Our model offers a unified framework for reasoning about two essential correctness properties of an implementation: the preservation of semantics and the absence of deadlocks.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Clock Refinement in Imperative Synchronous Languages

TL;DR: This article introduces refined clocks in imperative synchronous languages to overcome restrictions on the modeling and optimization of systems while still preserving important properties of the basic model.
Journal ArticleDOI

Application and Verification of Local Nonsemantic-Preserving Transformations in System Design

TL;DR: This paper addresses the verification problem by proposing a stepwise application of combined refinement and verification activities in the context of synchronous model of computation by dividing the verification tasks into two activities.
Journal ArticleDOI

From Concurrent Multi-clock Programs to Deterministic Asynchronous Implementations

TL;DR: This work uses a compact representation of the abstractsynchronization configurations of the analyzed process to determine aminimal set of synchronization patterns generating all possible reactions.
Journal ArticleDOI

A systematic approach to constructing families of incremental topology control algorithms using graph transformation

TL;DR: A well-known static analysis technique is applied to refine a given topology control algorithm in a way that the resulting algorithm preserves the specified graph constraints and is evaluated using a new tool integration of the graph transformation tool eMoflon and the Simonstrator network simulation framework.
Journal ArticleDOI

A systematic approach to constructing incremental topology control algorithms using graph transformation

TL;DR: In this paper, the authors present a methodology based on a visual graph transformation and graph constraint language, for developing incremental topology control algorithms that are guaranteed to fulfill a set of specified consistency and optimization constraints.
References
More filters
Book

Real-Time Systems: Design Principles for Distributed Embedded Applications

TL;DR: Real-Time Systems offers a splendid example for the balanced, integrated treatment of systems and software engineering, helping readers tackle the hardest problems of advanced real-time system design, such as determinism, compositionality, timing and fault management.
Book

Synchronous programming of reactive systems

TL;DR: This book presents a synthesis of recent works concerning reactive system design, based on Robin Milner's pioneering works about synchronous process algebras, which consists in considering that a program instantaneously reacts to events, or that the machine execution time is negligible with respect to the response delays of its environment.
Journal ArticleDOI

The synchronous languages 12 years later

TL;DR: The improvements, difficulties, and successes that have occured with the synchronous languages since then are discussed.
Journal ArticleDOI

Theory of latency-insensitive design

TL;DR: The theory of latency-insensitive design is presented as the foundation of a new correct-by-construction methodology to design complex systems by assembling intellectual property components to design large digital integrated circuits by using deep submicrometer technologies.
Journal ArticleDOI

Compositionality in Dataflow Synchronous Languages

TL;DR: It is shown that it is possible to characterize those synchronous programs which can be distributed on an asynchronous architecture without loosening semantic properties, and a theory for synthesizing additional schedulers and protocols needed to guarantee the correctness of distributed code generation is derived.
Related Papers (5)