Treo: Textual Syntax for Reo Connectors

@inproceedings{Dokter2018TreoTS,
  title={Treo: Textual Syntax for Reo Connectors},
  author={Kasper Dokter and Farhad Arbab},
  booktitle={MeTRiD@ETAPS},
  year={2018}
}
textabstractReo is an interaction-centric model of concurrency for compositional specification of communication and coordination protocols. Formal verification tools exist to ensure correctness and compliance of protocols specified in Reo, which can readily be (re)used in different applications, or composed into more complex protocols. Recent benchmarks show that compiling such high-level Reo specifications produces executable code that can compete with or even beat the performance of hand… 
View With Semantic Reader
9 Citations
Background Citations
3
Methods Citations
5

Figures and Tables from this paper

9 Citations

Citation Type

Citation Type

Compiling Protocols to Promela and Verifying their LTL Properties
TLDR
This paper extends the current set of back-end languages supported by Reo's compiler with Promela, the specification language of the model checker SPIN, to help develop reliable protocols specified in a coordination language.
Hubs for VirtuosoNext: Online verification of real-time coordinators
Simulation of Hybrid Reo Connectors
TLDR
A hybrid coordination framework to specify CPSs with components and use the resulting models to simulate, validate and verify those systems, using UPPAAL statistical model checker (SMC).
Soft component automata: Composition, compilation, logic, and verification
Stateless and Rule-Based Verification For Compliance Checking Applications
TLDR
The proposed SARV method could be beneficial for stateless verification in compliance checking applications and outperforms famous machine learning methods on a 3125-records software quality dataset.
Different Glasses to Look into the Three Cs: Component, Connector, Coordination
TLDR
Three approaches within three different classes: composition in software architectures, coordination models, and programming abstractions for concurrency are discussed, encompass different perspectives and solutions to face crucial challenges in developing concurrent and distributed systems.
Rule-Based Form for Stream Constraints
TLDR
This work proposes stream constraints as an alternative to constraint automata that avoids state space explosions and introduces a rule-based form for stream constraints that can avoid transition space explosions.
Models, Languages, and Tools for Concurrent and Distributed Programming
TLDR
The principles that have guided the establishment of the doctoral programmes at two international PhD schools in computer science in Italy and the lessons the authors have learnt by working with Rocco De Nicola at the GSSI are described.
A Reo Based Solution for Engineering the Coordination Protocols for Smart Cities
TLDR
This work demonstrates how to engineer the protocols layer of a smart city by using a ReoBased solution, which could act as a complexity management strategy to tackle the inherent complexity of smart city systems.

References

SHOWING 1-10 OF 22 REFERENCES
Puff, The Magic Protocol
  • F. Arbab
  • Computer Science
    Formal Modeling: Actors, Open Systems, Biological Systems
  • 2011
TLDR
It is shown how exogenous coordination in Reo reflects an interaction-centric model of concurrency where an interaction (protocol) consists of nothing but a relational constraint on communication actions.
Automata-Based Optimization of Interaction Protocols for Scalable Multicore Platforms
TLDR
The Constraint Automata semantics of Reo protocols are used as the formal basis for optimizing a generalization of the producer-consumer pattern, by applying CA transformations and proving the correctness of the transforms.
Centralized coordination vs. partially-distributed coordination with Reo and constraint automata
Reo: a channel-based coordination model for component composition
  • F. Arbab
  • Computer Science
    Mathematical Structures in Computer Science
  • 2004
TLDR
It is shown that exogenous coordination patterns that can be expressed as (meta-level) regular expressions over I/O operations can be composed in Reo out of a small set of only five primitive channel types.
Overview of Thirty Semantic Formalisms for Reo
TLDR
An overview of all classes of semantic models for describing the behavior of Reo connectors, and investigates the expressiveness of two more prominent classes, constraint automata and coloring models, in detail.
Data optimizations for constraint automata
TLDR
This paper presents, and proves the correctness of two optimization techniques for CA-compilers related to handling of data constraints: a reduction to eliminate redundant variables and a translation from (declarative) data constraints to (imperative)Data commands expressed in a small sequential language.
PrDK: Protocol Programming with Automata
TLDR
This work presents Prdk, a development kit for programming protocols that consists of syntax editors, a translator, a parser, an interpreter, and a compiler into Java.
Automata-theoretic protocol programming
TLDR
An approach to protocol programming where programmers implement their workers in an existing general-purpose language (GPL), while they implement their protocols in a complementary domain-specific language (DSL) based on a theory of formal automata and their languages is studied.
A Uniform Framework for Modeling and Verifying Components and Connectors
TLDR
A framework to model component interfaces and the component connectors that provide the glue code for the components and the verification toolset Vereofy which realizes several model checking algorithms for components, component connectors, and the composite system is presented.
Modeling component connectors in Reo by constraint automata
...
...