Synchronised Shared Memory and Model Checking: A Proof of Concept

Aguado, Joaquín; Duenas, Alejandra

doi:10.1109/fdl53530.2021.9568373

Cited by 2 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this includes schedules that may require runtimedependent changes in the ordering of methods, for example, if a policy does not return to its initial state in each tick. Such policies are not supported by the current static compilation approach in SCCharts and either require a policy-conformant scheduling at runtime or an exploration of the program's state space at compile time, e. g., as illustrated by Aguado and Duenas [AD21] utilizing model checking. Hence, SPs in SCCharts only support a subset of policy automata at this point, specifically those that can be statically transformed into SDs. SDs are a special case of stateless SP automata that always return to their initial state after a tick and specify precedences which methods can be uniquely assigned to scheduling groups (indices) and classified as conflicting (listing themselfs in their blocking set) or commuting.…”

Section: Scheduling Policiesmentioning

confidence: 99%

Language Design for Reactive Systems

Schulz-Rosengarten

View full text Add to dashboard Cite

Reactive systems play a crucial role in the embedded domain. They continuously interact with their environment, handle concurrent operations, and are commonly expected to provide deterministic behavior to enable application in safety-critical systems. In this context, language design is a key aspect, since carefully tailored language constructs can aid in addressing the challenges faced in this domain, as illustrated by the various concurrency models that prevent the known pitfalls of regular threads. Today, many languages exist in this domain and often provide unique characteristics that make them specifically fit for certain use cases. This thesis evolves around two distinctive languages: the actor-oriented polyglot coordination language Lingua Franca and the synchronous statecharts dialect SCCharts. While they take different approaches in providing reactive modeling capabilities, they share clear similarities in their semantics and complement each other in design principles. This thesis analyzes and compares key design aspects in the context of these two languages. For three particularly relevant concepts, it provides and evaluates lean and seamless language extensions that are carefully aligned with the fundamental principles of the underlying language. Specifically, Lingua Franca is extended toward coordinating modal behavior, while SCCharts receives a timed automaton notation with an efficient execution model using dynamic ticks and an extension toward the object-oriented modeling paradigm.

show abstract

Section: Scheduling Policiesmentioning

confidence: 99%

Language Design for Reactive Systems

Schulz-Rosengarten

View full text Add to dashboard Cite

show abstract

Synchronized Shared Memory and Black-box Procedural Abstraction: Toward a Formal Semantics of Blech

Gretz¹,

Grosch

Mendler³

et al. 2024

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

Traditional imperative synchronous programming languages heavily rely on a strict separation between data memory and communication signals. Signals can be shared between computational units but cannot be overwritten within a synchronous reaction cycle. Memory can be destructively updated but cannot be shared between concurrent threads. This incoherence makes traditional imperative synchronous languages cumbersome for the programmer. The recent definition of sequentially constructive synchronous languages offers an improvement. It removes the separation between data memory and communication signals and unifies both through the notion of clock synchronized shared memory . However, it still depends on global causality analyses which precludes black-box procedural abstraction. This complicates reuse and composition of software components. This article shows how black-box procedural abstraction can be accommodated inside the sequentially constructive model of computation. We present the Sequentially Constructive Procedural Language ( SCoPL ) and its semantic theory of policy-constructive synchronous processes. SCoPL supports black-box procedural abstractions using policy interfaces to ensure that procedure calls are memory-safe, wait-free and their scheduling is determinate and causal. At the same time, a policy interface constrains the level of freedom for the implementation and subsequent refactoring of a procedure. As a result, policies enable separate compilation and composition of procedures. We present our extensions abstractly as a formal semantics for SCoPL and motivate it concretely in the context of the open-source, embedded, real-time language Blech .

show abstract

Synchronised Shared Memory and Model Checking: A Proof of Concept

Cited by 2 publications

References 7 publications

Language Design for Reactive Systems

Language Design for Reactive Systems

Synchronized Shared Memory and Black-box Procedural Abstraction: Toward a Formal Semantics of Blech

Contact Info

Product

Resources

About