{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T17:52:12Z","timestamp":1777657932767,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00231-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:42:30Z","timestamp":1027651350000},"page":"177-213","source":"Crossref","is-referenced-by-count":527,"title":["Mobile ambients"],"prefix":"10.1016","volume":"240","author":[{"given":"Luca","family":"Cardelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew D.","family":"Gordon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00231-5_BIB1","doi-asserted-by":"crossref","unstructured":"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\u201347.","DOI":"10.1145\/266420.266432"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB2","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-63383-9_92"},{"issue":"1","key":"10.1016\/S0304-3975(99)00231-5_BIB3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","article-title":"The chemical abstract machine","volume":"96","author":"Berry","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00231-5_BIB4","unstructured":"G. Boudol, Asynchrony and the \u03c0-calculus, Tech. Rep. 1702, INRIA, Sophia-Antipolis, 1992."},{"issue":"1","key":"10.1016\/S0304-3975(99)00231-5_BIB5","first-page":"27","article-title":"A language with distributed scope","volume":"8","author":"Cardelli","year":"1995","journal-title":"Comput. Systems"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB6","doi-asserted-by":"crossref","unstructured":"L. Cardelli, A.D. Gordon, Types for mobile ambients, Proc. 26th Annual ACM Symp. on Principles of Programming Languages, 1999, pp. 79\u201392.","DOI":"10.1145\/292540.292550"},{"issue":"4","key":"10.1016\/S0304-3975(99)00231-5_BIB7","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/63334.63337","article-title":"Linda in context","volume":"32","author":"Carriero","year":"1989","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB8","first-page":"66","article-title":"Bauhaus Linda","volume":"vol. 924","author":"Carriero","year":"1995"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB9","doi-asserted-by":"crossref","unstructured":"R. De Nicola, G.-L. Ferrari, R. Pugliese, Locality based Linda: programming with explicit localities, Proc. TAPSOFT\u201997, Lecture Notes in Computer Science, vol. 1214, Springer, Berlin, pp. 712\u2013726.","DOI":"10.1007\/BFb0030636"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB10","doi-asserted-by":"crossref","unstructured":"C. Fournet, G. Gonthier, The reflexive CHAM and the join-calculus, Proc. 23rd Annual ACM Symp. on Principles of Programming Languages, 1996, pp. 372\u2013385.","DOI":"10.1145\/237721.237805"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB11","doi-asserted-by":"crossref","unstructured":"C. Fournet, G. Gonthier, J.-J. L\u00e9vy, L. Maranget, D. R\u00e9my, A calculus of mobile agents, Proc. 7th Internat. Conf. on Concurrency Theory (CONCUR\u201996), 1996, pp. 406\u2013421.","DOI":"10.1007\/3-540-61604-7_67"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB12","series-title":"The Java Language Specification","author":"Gosling","year":"1996"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB13","doi-asserted-by":"crossref","unstructured":"A.D. Gordon, L. Cardelli, Equational properties of mobile ambients, Microsoft Research Tech. Rep. MSR-TR-99-11, February 1999.","DOI":"10.1145\/292540.292550"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB14","doi-asserted-by":"crossref","unstructured":"K. Honda, M. Tokoro, An object calculus for asynchronous communication, Proc. ECOOP\u201991, Lecture Notes in Computer Science, vol. 521, Springer, Berlin, 1991, pp. 133\u2013147.","DOI":"10.1007\/BFb0057019"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB15","doi-asserted-by":"crossref","unstructured":"R. Milner, A calculus of communicating systems, Lecture Notes in Computer Science, vol. 92, Springer, Berlin, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","article-title":"Functions as processes","volume":"2","author":"Milner","year":"1992","journal-title":"Math. Struct. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(99)00231-5_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes, Parts 1-2","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00231-5_BIB18","series-title":"Lambda-calculus models of programming languages, Ph.D. Thesis","author":"Morris","year":"1968"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB19","doi-asserted-by":"crossref","unstructured":"J. Riely, M. Hennessy, A typed language for distributed mobile processes. Proc. 25th Annual ACM Symp. on Principles of Programming Languages, 1998, pp. 378\u2013390.","DOI":"10.1145\/268946.268978"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB20","doi-asserted-by":"crossref","unstructured":"P. Sewell, Global\/local subtyping and capability inference for a distributed \u03c0-calculus, Proc. ICALP\u201998, Lecture Notes in Computer Science, vol. 1443, Springer, Berlin, 1998, pp. 695\u2013706.","DOI":"10.1007\/BFb0055094"},{"key":"10.1016\/S0304-3975(99)00231-5_BIB21","series-title":"Software Agents","article-title":"Mobile agents","author":"White","year":"1996"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002315?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002315?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T04:30:01Z","timestamp":1580877001000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002315"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00231-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}