Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
A process algebraic view of Linda coordination primitives
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
On the expressive power of a language for programming coordination media
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Coordination for Internet Application Development
Autonomous Agents and Multi-Agent Systems
MARS: A Programmable Coordination Architecture for Mobile Agents
IEEE Internet Computing
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Multiple Tuple Spaces in Linda
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages
Three Semantics of the Output Operation for Generative Communication
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Formal ReSpecT in the A&A Perspective
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Semantics and Analysis of Component Connectors in Reo
Electronic Notes in Theoretical Computer Science (ENTCS)
A framework for modelling and implementing self-organising coordination
Proceedings of the 2009 ACM symposium on Applied Computing
| Hi-index | 0.00 |
The formal modelling of programming languages has always been a challenging activity due to the gap occurring between formal definition and actual implementation. On the other hand, the Maude rewriting language has already proven to be a suitable tool to bridge the gap between theory and practice when implementing the operational semantics of programming languages. In particular, Maude has been exploited to model languages belonging to different paradigms and levels of abstraction, leading to specifications that represent de facto executable prototypes of such languages. In this paper we focus on A&A ReSpecT, a coordination language based on the agents and artifacts (A&A) meta-model, and exploit Maude to generate an execution machine for A&A ReSpecT programs, acting as an implementation of its operational semantics.