Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of mobile processes, I
Information and Computation
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Nomadic pict: correct communication infrastructure for mobile computation
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
KLAVA: a Java package for distributed and mobile applications
Software—Practice & Experience
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
A flexible and modular framework for implementing infrastructures for global computing
DAIS'05 Proceedings of the 5th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
A java package for transparent code mobility
FIDJI'04 Proceedings of the 4th international conference on Scientific Engineering of Distributed Java Applications
A generic membrane model (note)
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
A Software Platform for Timed Mobility and Timed Interaction
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Hi-index | 0.00 |
In the last decade, many calculi for modelling distributed mobile code have been proposed. To assess their merits and encourage use, implementations of the calculi have often been proposed. These implementations usually consist of a limited part dealing with mechanisms that are specific of the proposed calculus and of a significantly larger part handling recurrent mechanisms that are common to many calculi. Nevertheless, also the ''classic'' parts are often re-implemented from scratch. In this paper we show how to implement a well established representative of the family of mobile calculi, the distributed @p-calculus, by using a Java middleware (called IMC - Implementing Mobile Calculi) where recurrent mechanisms of distributed and mobile systems are already implemented. By means of the case study, we illustrate a methodology to accelerate the development of prototype implementations while concentrating only on the features that are specific of the calculus under consideration and relying on the common framework for all the recurrent mechanisms like network connections, code mobility, name handling, etc.