×

zbMATH — the first resource for mathematics

Mobile ambients. (English) Zbl 0954.68108
Summary: We introduce a calculus describing the movement of processes and devices, including movement through administrative domains.

MSC:
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] M. Abadi, A.D. Gordon, A calculus for cryptographic protocols: the spi calculus, Proc. 4th ACM Conf. on Computer and Communications Security, 1997, pp. 36-47. · Zbl 0924.68073
[2] R.M. Amadio, An asynchronous model of locality, failure, and process mobility, Proc. COORDINATION 97, Lecture Notes in Computer Science, vol. 1282, Springer, Berlin, 1997.
[3] Berry, G.; Boudol, G., The chemical abstract machine, Theoret. comput. sci., 96, 1, 217-248, (1992) · Zbl 0747.68013
[4] G. Boudol, Asynchrony and the \(π\)-calculus, Tech. Rep. 1702, INRIA, Sophia-Antipolis, 1992.
[5] Cardelli, L., A language with distributed scope, Comput. systems, 8, 1, 27-59, (1995)
[6] L. Cardelli, A.D. Gordon, Types for mobile ambients, Proc. 26th Annual ACM Symp. on Principles of Programming Languages, 1999, pp. 79-92.
[7] Carriero, N.; Gelernter, D., Linda in context, Comm. ACM, 32, 4, 444-458, (1989)
[8] Carriero, N.; Gelernter, D.; Zuck, L., Bauhaus linda, (), 66-76
[9] R. De Nicola, G.-L. Ferrari, R. Pugliese, Locality based Linda: programming with explicit localities, Proc. TAPSOFT’97, Lecture Notes in Computer Science, vol. 1214, Springer, Berlin, pp. 712-726.
[10] C. Fournet, G. Gonthier, The reflexive CHAM and the join-calculus, Proc. 23rd Annual ACM Symp. on Principles of Programming Languages, 1996, pp. 372-385.
[11] C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, D. Rémy, A calculus of mobile agents, Proc. 7th Internat. Conf. on Concurrency Theory (CONCUR’96), 1996, pp. 406-421.
[12] Gosling, J.; Joy, B.; Steele, G., The Java language specification, (1996), Addison-Wesley Reading, MA · Zbl 0865.68001
[13] A.D. Gordon, L. Cardelli, Equational properties of mobile ambients, Microsoft Research Tech. Rep. MSR-TR-99-11, February 1999. · Zbl 1085.68099
[14] K. Honda, M. Tokoro, An object calculus for asynchronous communication, Proc. ECOOP’91, Lecture Notes in Computer Science, vol. 521, Springer, Berlin, 1991, pp. 133-147.
[15] R. Milner, A calculus of communicating systems, Lecture Notes in Computer Science, vol. 92, Springer, Berlin, 1980. · Zbl 0452.68027
[16] Milner, R., Functions as processes, Math. struct. comput. sci., 2, 119-141, (1992) · Zbl 0773.03012
[17] Milner, R.; Parrow, J.; Walker, D., A calculus of mobile processes, parts 1-2, Inform. and comput., 100, 1, 1-77, (1992)
[18] Morris, J.H., Lambda-calculus models of programming languages, ph.D. thesis, (1968), MIT
[19] J. Riely, M. Hennessy, A typed language for distributed mobile processes. Proc. 25th Annual ACM Symp. on Principles of Programming Languages, 1998, pp. 378-390.
[20] P. Sewell, Global/local subtyping and capability inference for a distributed \(π\)-calculus, Proc. ICALP’98, Lecture Notes in Computer Science, vol. 1443, Springer, Berlin, 1998, pp. 695-706. · Zbl 0910.03021
[21] White, J.E., Mobile agents, ()
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.