Sciweavers

98 search results - page 1 / 20
» Constraints as polymorphic connectors
Sort
View
ENTCS
2006
158views more  ENTCS 2006»
13 years 4 months ago
Connector Colouring I: Synchronisation and Context Dependency
Reo is a coordination model based on circuit-like connectors which coordinate components through the interplay of data flow, synchronisation and mutual exclusion, state, and conte...
Dave Clarke, David Costa, Farhad Arbab
LICS
2012
IEEE
11 years 7 months ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
Libor Barto, Marcin Kozik, Ross Willard
ICECCS
2005
IEEE
87views Hardware» more  ICECCS 2005»
13 years 10 months ago
Modeling Diverse and Complex Interactions Enabled by Middleware as Connectors in Software Architectures
Middleware enables distributed components to interact with each others in diverse and complex manners. Such interactions should be modeled at architecture level for controlling th...
Yali Zhu
SCP
2011
228views Communications» more  SCP 2011»
12 years 11 months ago
Channel-based coordination via constraint satisfaction
Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, howe...
Dave Clarke, José Proença, Alexander...
TASE
2009
IEEE
13 years 11 months ago
Fault-Based Test Case Generation for Component Connectors
The complex interactions appearing in service-oriented computing make coordination a key concern in serviceoriented systems. In this paper, we present a fault-based method to gene...
Bernhard K. Aichernig, Farhad Arbab, Lacramioara A...