The M-calculus: A higher-order distributed process calculus

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2003, Pages 50-61

  Schmitt, Alan ^a   Stefani, Jean Bernard ^a  

^a NONE

Author keywords

Distribution; Higher Order; Mobility; Process Calculi; Type Systems

Indexed keywords

DIFFERENTIATION (CALCULUS); DISTRIBUTED COMPUTER SYSTEMS; MOBILE COMPUTING; SEMANTICS;

DYNAMIC BINDING;

COMPUTER SCIENCE;

EID: 0038643976     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. R. Amadio. An asynchronous model of locality, failure, and process mobility. Technical report, INRIA Research Report RR-3109, INRIA Sophia-Antipolis, France, 1997.
2. M. Bugliesi, G. Castagna, and S. Crafa. Boxed ambients. In 4th International Symposium on Theoretical Aspects of Computer Software (TACS), 2001.
3. L. Cardelli. Types for mobile ambients. In Proceedings 26th Annual ACM Symposium on Principles of Programming Languages (POPL), 1999.
4. L. Cardelli and A. Gordon. Mobile ambients. In Foundations of Software Science and Computational Structures, M. Nivat (Ed.), Lecture Notes in Computer Science, Vol. 1378. Springer Verlag, 1998.
5. D. Duggan. Atomic failure in wide-area computation. In Proceedings 4th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS), S. Smith and C. Talcott eds. Kluwer, 2000.
6. C. Fournet. The Join-Calculus. PhD thesis, Ecole Polytechnique, 1998.
7. C. Fournet, G. Gonthier, J.J. Levy, L. Maranget, and D. Remy. A calculus of mobile agents. In In Proceedings 7th International Conference on Concurrency Theory (CONCUR '96), Lecture Notes in Computer Science 1119. Springer Verlag, 1996.
8. C. Fournet, J.J. Levy, and A. Schmitt. An asynchronous distributed implementation of mobile ambients. In Proceedings of the International IFIP Conference TCS 2000, Sendai, Japan, Lecture Notes in Computer Science 1872. Springer, 2000.
9. F. Germain, M. Lacoste, and J.B. Stefani. An abstract machine for a higher-order distributed process calculus. In Proceedings of the EACTS Workshop on Foundations of Wide Area Network Computing (F-WAN), July 2002.
10. F. Levi and D. Sangiorgi. Controlling interference in ambients. In Proceedings 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2000), 2000.
11. J.J. Levy. Some results on the join-calculus. In 3rd International Symposium on Theoretical spects of Computer Software (TACS), Lecture Notes in Computer Science no 1281. Springer, 1997.
12. L. Lopes, F. Silva, A. Figueira, and V. Vasconcelos. DiTyCO: An Experiment in Code Mobility from the Realm of Process Calculi. In Proceedings 5th Mobile Object Systems Workshop (MOS'99), 1999.
13. M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. In 29th ACM Symposium on Principles of Programming Languages (POPL), Portland, Oregon, 16-18 January, 2002.
14. R. De Nicola, G.L. Ferrari, and R. Pugliese. Klaim: a Kernel Language for Agents Interaction and Mobility. IEEE Trans, on Software Engineering, Vol. 24, no 5, 1998.
15. R. De Nicola, G.L. Ferrari, R. Pugliese, and B. Venneri. Types for Access Control. Theoretical Computer Science, Vol. 240, no 1, 2000.
16. Didier Rémy. Type inference for records in a natural extension of ML. In Carl A. Gunter and John C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design. MIT Press, 1993.
17. D. Sangiorgi and A. Valente. A Distributed Abstract Machine for Safe Ambients. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming, volume 2076 of Lect. Notes in Comp. Sci. Springer-Verlag, 2001.
18. A. Schmitt and J.B. Stefani. The M-calculus: A Higher Order Distributed Process Calculus. Draft of the long version, available at http://pauillac.inria.fr/̃aschmitt/publications.html, 2002.
19. Alan Schmitt. Conception et Implmentation de Calculs d'Agents Mobiles. PhD thesis, Ecole Polytechnique, 2002.
20. Alan Schmitt. Safe Dynamic Binding in the Join Calculus. In IFIP TCS'02, Montreal, Canada, 2002.
21. Peter Sewell and Jan Vitek. Secure composition of untrusted code: BOX-π, wrappers and causality types. Journal of Computer Security, 2000. Invited submission for a CSFW00 special issue. To appear.
22. D. Teller, P. Zimmer, and D. Hirschkoff. Using Ambients to Control Resources. In Proceedings CONCUR 02, 2002.
23. J. Vitek and G. Castagna. Towards a calculus of secure mobile computations. In Proceedings Workshop on Internet Programming Languages, Chicago, Illinois, USA, 1998.
24. P. Wojciechowski and P. Sewell. Nomadic Pict: Language and Infrastructure. IEEE Concurrency, vol. 8, no 2, 2000.
25. N. Yoshida and M. Hennessy. Subtyping and locality in distributed higher-order processes. In Proceedings CONCUR 99, Lecture Notes in Computer Science no 1664. Springer. 1999.
26. N. Yoshida and M. Hennessy. Assigning types to processes. In 15th Annual IEEE Symposium on Logic in Computer Science (LICS), 2000.