{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:10:09Z","timestamp":1737094209278,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008972"},{"type":"electronic","value":"9783540365761"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36576-1_11","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:42:17Z","timestamp":1181616137000},"page":"169-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["When Ambients Cannot Be Opened"],"prefix":"10.1007","author":[{"given":"Iovka","family":"Boneva","sequence":"first","affiliation":[]},{"given":"Jean-Marc","family":"Talbot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"11_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-45309-1_14","volume-title":"What are polymorphically-typed ambients?","author":"T. Amtoft","year":"2001","unstructured":"T. Amtoft, A. J. Kfoury, and S.M. Peric\u00e1s-Geertsen. What are polymorphically-typed ambients? In 10th European Symposium on Programming (ESOP 2001), LNCS 2028, pages 206\u2013220. Springer, 2001."},{"key":"11_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Theoretical Aspects of Computer Software (TACS 2001)","author":"M. Bugliesi","year":"2001","unstructured":"M. Bugliesi, G. Castagna, and S. Crafa. Boxed ambients. In Theoretical Aspects of Computer Software (TACS 2001), LNCS 2215. Springer, 2001."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"N. Busi and G. Zavattaro. On the expressiveness of movement in pure mobile ambients. In Foundations of Wide Area Network Computing, ENTCS 66(3). Elsevier, 2002.","DOI":"10.1016\/S1571-0661(04)80414-6"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"L. Cardelli and A.D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In 27th Symp. on Principles of Programming Languages (POPL\u201900), pages 365\u2013377, 2000.","DOI":"10.1145\/325694.325742"},{"key":"11_CR5","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:177\u2013213, 2000.","journal-title":"Theoretical Computer Science"},{"key":"11_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-45927-8_21","volume-title":"Finite-control mobile ambients","author":"W. Charatonik","year":"2002","unstructured":"W. Charatonik, A. D. Gordon, and J.-M. Talbot. Finite-control mobile ambients. In European Symposium on Programming (ESOP\u201902), LNCS 2305, pages 295\u2013313. Springer, 2002."},{"key":"11_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-44802-0_24","volume-title":"Computer Science Logic (CSL\u201901)","author":"W. Charatonik","year":"2001","unstructured":"W. Charatonik and J.-M. Talbot. The decidability of model checking mobile ambients. In Computer Science Logic (CSL\u201901), LNCS 2142, pages 339\u2013354. Springer, 2001."},{"key":"11_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-44464-5_8","volume-title":"Spatial congruence for ambients is decidable","author":"S. D. Zilio","year":"2000","unstructured":"S. Dal Zilio. Spatial congruence for ambients is decidable. In 6th Asian Computing Science Conference (ASIAN\u201900), volume 1961 of LNCS, pages 88\u2013103. Springer, 2000."},{"key":"11_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Abstract interpretation-based static analysis of mobile ambients","author":"J. Feret","year":"2001","unstructured":"J. Feret. Abstract interpretation-based static analysis of mobile ambients. In Eighth International Static Analysis Symposium (SAS\u201901), LNCS 2126. Springer, 2001."},{"key":"11_CR10","first-page":"1","volume":"12","author":"A. D. Gordon","year":"2002","unstructured":"A. D. Gordon and L. Cardelli. Equational properties of mobile ambients. Mathematical Structures in Computer Science, 12:1\u201338, 2002.","journal-title":"Mathematical Structures in Computer Science"},{"key":"11_CR11","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), LNCS 1694, pages 134\u2013148. Springer, 1999."},{"key":"11_CR12","unstructured":"D. Hirschkoff. Mise en Euvre de preuves de bisimulation. PhD thesis, Ecole Nationale des Ponts et Chauss\u00e9es, 1999."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"D. Hirschkoff, E. Lozes, and D. Sangiorgi. Separability, expressiveness, and decidability in the ambient logic. In Logic in Computer Science (LICS\u201902), pages 423\u2013432. IEEE, 2002.","DOI":"10.1109\/LICS.2002.1029850"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"F. Levi and D. Sangiorgi. Controlling interference in ambients. In 27th Symp. on Principles of Programming Languages (POPL\u201900), pages 352\u2013364, 2000.","DOI":"10.1145\/325694.325741"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"E.W. Mayr. An Algorithm for the General Petri Net Reachability Problem. SIAM Journal of Computing, 13(3):441\u2013460, 1984.","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and J. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1):1\u201340,41-77, 1992.","journal-title":"Information and Computation"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"M. Minsky. Recursive Unsolvability of Post\u2019s Problem of \u201cTag\u201d and others Topics in the Theory of Turing Machines. Annals of Math., 74:437\u2013455, 1961.","journal-title":"Annals of Math."},{"key":"11_CR18","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), LNCS 1664, pages 463\u2013477. Springer, 1999."},{"key":"11_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45694-5_20","volume-title":"CONCUR 2002\u2014Concurrency Theory","author":"D. Teller","year":"2002","unstructured":"D. Teller, P. Zimmer, and D. Hirschkoff. Using ambients to control resources. In CONCUR 2002\u2014Concurrency Theory, LNCS 2421, pages 288\u2013303. Springer, 2002."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"P. Zimmer. On the Expressiveness of Pure Safe Ambients. Mathematical Structures of Computer Science, 2002. To appear.","DOI":"10.1017\/S0960129503004079"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36576-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:53:31Z","timestamp":1737093211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36576-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008972","9783540365761"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-36576-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}