2005
DOI: 10.1007/978-3-540-31862-0_6
|View full text |Cite
|
Sign up to set email alerts
|

Specifying Software Connectors

Abstract: Abstract. Orchestrating software components, often independently supplied, has assumed a central role in software construction. Actually, as relevant as components themselves, are the ways in which they can be put together to interact and cooperate in order to achieve some common goal. Such is the role of so-called software connectors: external coordination devices which ensure both the flow of data and synchronization restrictions within a component's network. This paper introduces a new model for software co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2005
2005
2013
2013

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 14 publications
0
11
0
Order By: Relevance
“…A lot of work has also been devoted to connectors like for example [29][30][31][32][33] to mention few. A work strictly related to the mediators is the seminal work by Yellin and Strom [34].…”
Section: Related Workmentioning
confidence: 99%
“…A lot of work has also been devoted to connectors like for example [29][30][31][32][33] to mention few. A work strictly related to the mediators is the seminal work by Yellin and Strom [34].…”
Section: Related Workmentioning
confidence: 99%
“…In Figure 1, we considered a set of pipes as a set 5 An extreme example of this continuum comes from the world of operating system security, where covert channel analysis shows us that any stateful shared resource can act as a communication channel.…”
Section: Components As Objectsmentioning
confidence: 99%
“…Some make no clear distinction between the two [5], whereas others define "connectors" as a particular type of "coordinator" [4].…”
Section: Are Connectors the Same As Coordinators?mentioning
confidence: 99%
“…Note that the final coalgebra for the 'abstract' shape is A ∞ , i.e., the space of finite and infiinite sequences of A, whereas for the concrete case one gets (A+1) ω , i.e., 10 The laws of reflection, cancellation and fusion stated below, in this order, and used in the proof are standard results on coinduction easily derived from the universal property (10) [15].…”
Section: Shape Refinementmentioning
confidence: 99%