Proof, language, and interaction
Building Tools for LOTOS Symbolic Semantics in Maude
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Composing architectural styles from architectural primitives
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Prototyping SOS Meta-theory in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Mapping modular SOS to rewriting logic
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Complete axioms for stateless connectors
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
A Congruence Rule Format with Universal Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
Prototyping A&A ReSpecT in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Building Mashups for the Enterprise with SABRE
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Coordination: Reo, Nets, and Logic
Formal Methods for Components and Objects
Automata for Context-Dependent Connectors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Structural Operational Semantics with First-Order Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Analysis of Reo Circuits using Symbolic Execution
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Mapping of Reo Circuits to Constraint Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Modeling and analysis of Reo connectors using alloy
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Comparing three coordination models: Reo, ARC, and PBRD
Science of Computer Programming
Channel-based coordination via constraint satisfaction
Science of Computer Programming
Büchi automata for modeling component connectors
Software and Systems Modeling (SoSyM)
Encoding context-sensitivity in Reo into non-context-sensitive semantic models
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Formal modeling
A model of context-dependent component connectors
Science of Computer Programming
Symbolic execution of Reo circuits using constraint automata
Science of Computer Programming
Dreams: a framework for distributed synchronous coordination
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
We present an operational semantics for a component composition language called Reo. Reo connectors exogenously compose and coordinate the interactions among individual components that comprise a complex system, into a coherent collaboration. The formal semantics we present here paves the way for a rigorous study of the behavior of component composition mechanisms. To demonstrate the feasibility of such a rigorous approach, we give a faithful translation of Reo semantics into the Maude term rewriting language. This translation allows us to exploit the rewriting engine and the model-checking module in the Maude tool-set to symbolically run and model-check the behavior of Reo connectors.