Abstract Behavior Types: a foundation model for components and their composition

Arbab, Farhad

doi:10.1016/j.scico.2004.05.010

Cited by 93 publications

(21 citation statements)

References 39 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the same observations about the importance of studying glue as a first-class notion, Abstract Behavior Types (ABM) were proposed in [2] guiding the design of the Reo language. ABT propose to characterise components as channels (or dataflow transformers) that do not provide any information as to the manner in which the defining transformations are computed.…”

Section: Discussion and Related Workmentioning

confidence: 99%

“…To prove that (Traces, , ⊑, , ⊗, 0) is a behaviour type we only have to show that condition 1 (and condition 3) of Definition 2.1 holds. (1) preserves the semantic preorder defined by (2).…”

Section: Example: Tracesmentioning

confidence: 99%

“…(S, f ) (R, g). 2 In the general case, the subject of coalgebra composition has been considered, for example, in [3,17]. Here we provide, for a functor F ∈ NDF ′ , an example of the F-coalgebra composition operator along the lines of [17].…”

Section: Example: Coalgebrasmentioning

confidence: 99%

See 2 more Smart Citations

Towards a Theory of Glue

Bliudze

2012

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We propose and study the notions of behaviour type and composition operator making a first step towards the definition of a formal framework for studying behaviour composition in a setting sufficiently general to provide insight into how the component-based systems should be modelled and compared. We illustrate the proposed notions on classical examples (Traces, Labelled Transition Systems and Coalgebras). Finally, the definition of memoryless glue operators, takes us one step closer to a formal understanding of the separation of concerns principle stipulating that computational aspects of a system should be localised within its atomic components, whereas coordination layer responsible for managing concurrency should be realised by memoryless glue operators.

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Section: Example: Tracesmentioning

confidence: 99%

See 1 more Smart Citation

Towards a Theory of Glue

Bliudze

2012

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…LateAsyncMerg and EarlyAsyncMerg in Figure 6 are probably folklore; these two names were first used by Jongmans [Jon16a]. OddFib is based on Arbab's Fibonacci [Arb05]. Rout was introduced by Arbab [Arb05].…”

Section: Introductionmentioning

confidence: 99%

Data optimizations for constraint automata

Jongmans¹,

Arbab²

2017

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Constraint automata (CA) constitute a coordination model based on finite automata on infinite words. Originally introduced for modeling of coordinators, an interesting new application of CAs is implementing coordinators (i.e., compiling CAs into executable code). Such an approach guarantees correctness-by-construction and can even yield code that outperforms hand-crafted code. The extent to which these two potential advantages materialize depends on the smartness of CA-compilers and the existence of proofs of their correctness.Every transition in a CA is labeled by a "data constraint" that specifies an atomic data-flow between coordinated processes as a first-order formula. At run-time, compiler-generated code must handle data constraints as efficiently as possible. In this paper, we present, and prove 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. Through experiments, we show that these optimization techniques can have a positive impact on performance of generated executable code.

show abstract

“…Essentially, Reo circuits impose constraints on the order in which components can send and receive data items to and from each other. Although ostensibly simple, Reo connectors can describe complex protocols (e.g., a solution to the Dining Philosophers problem [2]). In recent years, various formal models for describing the behavior of Reo circuits have arisen, including a coalgebraic model [4], various operational models (e.g., constraint automata [6]), and two coloring models [8] (we mention more models in Section 7).…”

Section: Introductionmentioning

confidence: 99%

Correlating Formal Semantic Models of Reo Connectors: Connector Coloring and Constraint Automata

Jongmans¹,

Arbab²

2011

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Over the past decades, coordination languages have emerged for the specification and implementation of interaction protocols for communicating software components. This class of languages includes Reo, a platform for compositional construction of connectors. In recent years, various formalisms for describing the behavior of Reo connectors have come to existence, each of them serving its own purpose. Naturally, questions about how these models relate to each other arise. From a theoretical point of view, answers to these questions provide us with better insight into the fundamentals of Reo, while from a more practical perspective, these answers broaden the applicability of Reo's development tools. In this paper, we address one of these questions: we investigate the equivalence between coloring models and constraint automata, the two most dominant and practically relevant semantic models of Reo. More specifically, we define operators that transform one model to the other (and vice versa), prove their correctness, and show that they distribute over composition. To ensure that the transformation operators map one-to-one (instead of many-to-one), we extend coloring models with data constraints. Though primarily a theoretical contribution, we sketch some potential applications of our results: the broadening of the applicability of existing tools for connector verification and animation

show abstract

Abstract Behavior Types: a foundation model for components and their composition

Cited by 93 publications

References 39 publications

Towards a Theory of Glue

Towards a Theory of Glue

Data optimizations for constraint automata

Correlating Formal Semantic Models of Reo Connectors: Connector Coloring and Constraint Automata

Contact Info

Product

Resources

About