{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:28:35Z","timestamp":1778297315855,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540433637","type":"print"},{"value":"9783540459279","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45927-8_21","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T05:39:04Z","timestamp":1192772344000},"page":"295-313","source":"Crossref","is-referenced-by-count":25,"title":["Finite-Control Mobile Ambients"],"prefix":"10.1007","author":[{"given":"Witold","family":"Charatonik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew D.","family":"Gordon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Talbot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"21_CR1","unstructured":"R.M. Amadio and Ch. Meyssonnier. On the decidability of fragments of the asynchronous pi-calculus. In Electronic Notes in Theoretical Computer Science, Proceedings EXPRESS 2001, 2001."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"M. Bugliesi and G. Castagna. Secure safe ambients. In 28th ACM Symposium on Principles of Programming Languages (POPL\u201901), pages 222\u2013235, 2001.","DOI":"10.1145\/360204.360223"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","first-page":"212","volume-title":"Equational properties of mobile ambients","author":"L. Cardelli","year":"1999","unstructured":"L. Cardelli and A. D. Gordon. Equational properties of mobile ambients. In Proceedings FoSSaCS\u201999, volume 1578 of LNCS, pages 212\u2013226. Springer, 1999."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"L. Cardelli and A. D. Gordon. Modal logics for mobile ambients: Semantic reasoning. Unpublished annex to [5], 1999.","DOI":"10.1145\/292540.292550"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"L. Cardelli and A. D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proceedings POPL\u201900, pages 365\u2013377. ACM, January 2000.","DOI":"10.1145\/325694.325742"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"L. Cardelli and A. D. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):177\u2013213, 2000.","journal-title":"Theoretical Computer Science"},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/3-540-45413-6_8","volume-title":"Logical properties of name restriction","author":"L. Cardelli","year":"2001","unstructured":"L. Cardelli and A. D. Gordon. Logical properties of name restriction. In Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications (TLCA\u201901), volume 2044 of LNCS, pages 46\u201360. Springer, 2001."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"L. Cardelli and A.D. Gordon. Types for mobile ambients. In 26th ACM Symposium on Principles of Programming Languages (POPL\u201999), pages 79\u201392, 1999.","DOI":"10.1145\/292540.292550"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"S. Chaki, S.K. Rajamani, and J. Rehof. Types as models: Model checking message-passing programs. In 29th ACM Symposium on Principles of Programming Languages (POPL\u201902), 2002. To appear.","DOI":"10.1145\/503272.503278"},{"key":"21_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/3-540-45315-6_10","volume-title":"The complexity of model checking mobile ambients","author":"W. Charatonik","year":"2001","unstructured":"W. Charatonik, S. Dal Zilio, A. D. Gordon, S. Mukhopadhyay, and J.-M. Talbot. The complexity of model checking mobile ambients. In Proceedings FoSSaCS\u201901, volume 2030 of LNCS, pages 152\u2013167. Springer, 2001. An extended version appearas as Technical Report MSR-TR-2001-03, Microsoft Research, 2001."},{"key":"21_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44802-0_24","volume-title":"The decidability of model checking mobile ambients","author":"W. Charatonik","year":"2001","unstructured":"W. Charatonik and J.-M. Talbot. The decidability of model checking mobile ambients. In Proceedings of the 15th Annual Conference of the European Association for Computer Science Logic, volume 2142 of LNCS, pages 339\u2013354. Springer, 2001."},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.1996.0072","volume":"121","author":"M. Dam","year":"1996","unstructured":"M. Dam. Model checking mobile processes. Information and Computation, 121(1):35\u201351, 1996.","journal-title":"Information and Computation"},{"key":"21_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-48294-6_9","volume-title":"Static Analysis (SAS\u201999)","author":"R.R. Hansen","year":"1999","unstructured":"R.R. Hansen, J.G. Jensen, F. Nielson, and H. Riis Nielson. Abstract interpretation of mobile ambients. In Static Analysis (SAS\u201999), volume 1694 of Lecture Notes in Computer Science, pages 134\u2013148. Springer, 1999."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"F. Levi and D. Sangiorgi. Controlling interference in ambients. In 27th ACM Symposium on Principles of Programming Languages (POPL\u201900), pages 352\u2013364, 2000.","DOI":"10.1145\/325694.325741"},{"key":"21_CR15","unstructured":"R. Milner. Communicating and Mobile Systems: the \u03c0-Calculus. Cambridge University Press, 1999."},{"key":"21_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/3-540-48320-9_32","volume-title":"Concurrency Theory (Concur\u201999)","author":"F. Nielson","year":"1999","unstructured":"F. Nielson, H. Riis Nielson, R.R. Hansen, and J.G. Jensen. Validating firewalls in mobile ambients. In Concurrency Theory (Concur\u201999), volume 1664 of Lecture Notes in Computer Science, pages 463\u2013477. Springer, 1999."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"D. Sangiorgi. Extensionality and intensionality of the ambient logics. In Proceedings POPL\u201901, pages 4\u201313. ACM, January 2001.","DOI":"10.1145\/360204.375707"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45927-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T08:47:16Z","timestamp":1684054036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45927-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433637","9783540459279"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45927-8_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}