Concurrent programming in ERLANG (2nd ed.)
Concurrent programming in ERLANG (2nd ed.)
The discrete time TOOLBUS—a software coordination architecture
Science of Computer Programming
Model checking
The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Formalizing Properties of Mobile Agent Systems
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Dynamic rebinding for marshalling and update, with destruct-time ?
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Models and Temporal Logics for Timed Component Connectors
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Abstract behavior types: a foundation model for components and their composition
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Construction of negotiation protocols for e-commerce applications
ACM SIGecom Exchanges
Symbolic Model Checking for Channel-based Component Connectors
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing Three Coordination Models: Reo, ARC, and RRD
Electronic Notes in Theoretical Computer Science (ENTCS)
Connector Rewriting with High-Level Replacement Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic model checking for channel-based component connectors
Science of Computer Programming
Comparing three coordination models: Reo, ARC, and PBRD
Science of Computer Programming
Automata based model checking for reo connectors
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |
Software systems evolve over time. To facilitate this, the coordination language Reo offers operations to dynamically reconfigure the topology of component connectors. We present a semantics of Reo in the presence of reconfiguration, and a logic, and its model checking algorithm, for reasoning about connector behaviour in this setting.