{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:46:40Z","timestamp":1648691200987},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2004,8,1]],"date-time":"2004-08-01T00:00:00Z","timestamp":1091318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJIS"],"published-print":{"date-parts":[[2004,8]]},"DOI":"10.1007\/s10207-004-0035-y","type":"journal-article","created":{"date-parts":[[2004,7,9]],"date-time":"2004-07-09T13:00:20Z","timestamp":1089378020000},"page":"126-144","source":"Crossref","is-referenced-by-count":0,"title":["Using ambients to control resources"],"prefix":"10.1007","volume":"2","author":[{"given":"David","family":"Teller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Zimmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Hirschkoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,8,1]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Amadio R (2003) Max-plus quasi-interpretations. In: Proceedings of TLCA\u201903. Lecture notes in computer science, vol 2701. Springer, Berlin Heidelberg New York, pp 31\u201345","DOI":"10.1007\/3-540-44904-3_3"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Bugliesi M, Castagna G, Crafa S (2001) Boxed ambients. In: Proceedings of TACS 2001. Lecture notes in computer science, vol 2215. Springer, Berlin Heidelberg New York, pp 38\u201363","DOI":"10.1007\/3-540-45500-0_2"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Bugliesi M, Crafa S, Merro M, Sassone V (2002) Communication interference in mobile boxed ambients. In: Proceedings of FST-TCS\u201902 Lecture notes in computer science. Springer, Berlin Heidelberg New York","DOI":"10.1007\/3-540-36206-1_8"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/S0890-5401(01)93121-9","volume":"177","author":"Cardelli","year":"2002","unstructured":"Cardelli L, Ghelli G, Gordon A (2002) Types for the ambient calculus. Inf Comput 177(2):160\u2013194","journal-title":"Inf Comput"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Cardelli L, Gordon AD (1998) Mobile ambients. In: Proceedings of FOSSACS\u201998. Lecture notes in computer science, vol 1378. Springer, Berlin Heidelberg New York, pp 140\u2013155","DOI":"10.1007\/BFb0053547"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Cardelli L, Gordon AD (1999) Types for mobile ambients. In: Proceedings of the symposium on principles of programming languages (POPL\u201999). ACM Press, New York, pp 79\u201392","DOI":"10.1145\/292540.292550"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Charatonik W, Gordon AD, Talbot J-M (2002) Finite-control mobile ambients. In: Proceedings of ESOP\u201902. Lecture notes in computer science, vol 2305. Springer, Berlin Heidelberg New York, pp 295\u2013313","DOI":"10.1007\/3-540-45927-8_21"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Crary K, Weirich S (2000) Resource bound certification. In: Proceedings of the symposium on principles of programming languages (POPL\u201900). ACM Press, New York, pp 184\u2013198","DOI":"10.1145\/325694.325716"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Dezani-Ciancaglini M, Salvo I (2000) Security types for mobile safe ambients. In: Proceedings of ASIAN\u201900. Lecture notes in computer science, vol 1961. Springer, Berlin Heidelberg New York, pp 215\u2013236","DOI":"10.1007\/3-540-44464-5_16"},{"key":"35_CR10","unstructured":"Fournet C, L\u00e9vy J-J, Schmitt A (1872) A distributed implementation of mobile ambients. In: Proceedings of IFIP TCS\u201900. Springer, Berlin Heidelberg New York, pp 348\u2013364"},{"key":"35_CR11","unstructured":"Gazagnaire T, Pous D (2002) Impl\u00e9mentation des Controlled Ambients en JoCaml. Student project \u2013 Magist\u00e8re d\u2019Informatique ENS Lyon, France"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Gordon AD, Cardelli L (1999) Equational properties of mobile ambients. In: Proceedings of FOSSACS\u201999. Lecture notes in computer science, vol 1578. Springer, Berlin Heidelberg New York, pp 212\u2013226","DOI":"10.1007\/3-540-49019-1_15"},{"key":"35_CR13","unstructured":"Guan X, Yang Y, You J (2000) Making ambients more robust. In: Proceedings of the international conference on software: theory and practice, pp 377\u2013384"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Hennessy M, Riely J (1998) Resource access control in systems of mobile agents. In: Proceedings of HLCL \u201998. Electronic notes in theoretical computer science, vol 163. Elsevier, Amsterdam, pp 3\u201317","DOI":"10.1016\/S1571-0661(04)00141-0"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Hicks M, Kakkar P, Moore JT, Gunter CA, Nettles S (1999) PLAN: A Packet Language for Active Networks. In: Proceedings of ICFP\u201999. ACM Press, New York, pp 86\u201393","DOI":"10.1145\/291251.289431"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Hofmann M (2002) The strength of non-size increasing computation. In: Proceedings of the 29th ACM symposium on principles of programming languages (POPL\u201902). ACM Press, New York, pp 260\u2013269","DOI":"10.1145\/565816.503297"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Hughes J, Pareto L (1999) Recursion and dynamic data-structures in bounded space: towards embedded ML programming. In: Proceedings of ICFP\u201999. ACM Press, New York, pp 70\u201381","DOI":"10.1145\/317765.317785"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Levi F, Sangiorgi D (2000) Controlling interference in ambients. In: Proceedings of the symposium on principles of programming languages. ACM Press, New York, pp 352\u2013364","DOI":"10.1145\/325694.325741"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Merro M, Hennessy M (2002) Bisimulation congruences in safe ambients. In: Proceedings of POPL\u201902. ACM Press, New York, pp 71\u201380","DOI":"10.1145\/565816.503280"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Moreau L (1998) A distributed garbage collector with diffusion tree reorganisation and mobile objects. In: Proceedings of ICFP\u201998. ACM Press, New York, pp 204\u2013215","DOI":"10.1145\/289423.289443"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Riely J, Hennessy M (1998) A typed language for distributed mobile processes. In: Proceedings of POPL\u201998. ACM Press, New York, pp 378\u2013390","DOI":"10.1145\/268946.268978"},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Sangiorgi D, Valente A (2001) A distributed abstract machine for safe ambients. In: Proceedings of ICALP\u201901","DOI":"10.1007\/3-540-48224-5_34"},{"key":"35_CR23","unstructured":"Sassone V, Barbanera F, Bugliesi M, Dezani M (2003) A calculus of bounded capacities. In: Proceedings of ASIAN\u201903. Lecture notes in computer science. Springer, pp 205\u2013223"},{"key":"35_CR24","unstructured":"Stefani J-B (2003) A calculus of higher-order distributed components. Technical Report 4692, INRIA"},{"key":"35_CR25","doi-asserted-by":"crossref","unstructured":"Teller D (2003) Formalisms for mobile resource control. In: Proceedings of FGC\u201903. Electronic notes in theoretical computer science, vol 85. Elsevier, Amsterdam","DOI":"10.1016\/S1571-0661(05)80084-2"},{"key":"35_CR26","doi-asserted-by":"crossref","unstructured":"Teller D, Zimmer P, Hirschkoff D (2002) Using ambients to control resources. In: Proceedings of CONCUR\u201902. Lecture notes in computer science. Springer, Berlin Heidelberg New York","DOI":"10.1007\/3-540-45694-5_20"},{"key":"35_CR27","first-page":"expressing","volume":"calculi","author":"Unyapoth","year":"2001","unstructured":"Unyapoth A (2001) Nomadic pi calculi: expressing and verifying infrastructure for mobile computation. PhD thesis, Computer Laboratory, University of Cambridge, June 2001","journal-title":"Nomadic pi"},{"key":"35_CRSeal","doi-asserted-by":"crossref","unstructured":"Vitek J, Castagna G (1999) Seal: a framework for secure mobile computations. In: Internet programming languages. Lecture notes in computer science, vol 1686. Springer, Berlin Heidelberg New York","DOI":"10.1007\/3-540-47959-7_3"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-004-0035-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-004-0035-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-004-0035-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T17:57:21Z","timestamp":1585850241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-004-0035-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8]]},"references-count":28,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2004,8]]}},"alternative-id":["35"],"URL":"https:\/\/doi.org\/10.1007\/s10207-004-0035-y","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8]]}}}