{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:49:35Z","timestamp":1725472175544},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540488156"},{"type":"electronic","value":"9783540488163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11921240_21","type":"book-chapter","created":{"date-parts":[[2006,11,2]],"date-time":"2006-11-02T13:28:19Z","timestamp":1162474099000},"page":"302-316","source":"Crossref","is-referenced-by-count":2,"title":["Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Montagna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2004.10.020","volume":"333","author":"I. Boneva","year":"2005","unstructured":"Boneva, I., Talbot, J.-M.: When Ambients cannot be Opened? Theoretical Computer Science\u00a0333(1-2), 127\u2013169 (2005)","journal-title":"Theoretical Computer Science"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-45500-0_2","volume-title":"Theoretical Aspects of Computer Software","author":"M. Bugliesi","year":"2001","unstructured":"Bugliesi, M., Castagna, G., Crafa, S.: Boxed Ambients. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 38\u201363. Springer, Heidelberg (2001)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-540-31987-0_18","volume-title":"Programming Languages and Systems","author":"N. Busi","year":"2005","unstructured":"Busi, N., Zavattaro, G.: Deciding Reachability in Mobile Ambients. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 248\u2013262. Springer, Heidelberg (2005)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Busi, N., Zavattaro, G.: Deciding Reachability in Boxed Ambients. In: Proc. of ICTCS 2005, pp. 143\u2013159 (2005)","DOI":"10.1007\/11560586_12"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Mobile Ambients. Theoretical Computer Science\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theoretical Computer Science"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Coquid\u00e9, J.-L., Dauchet, M., Gilleron, R., V\u00e1gv\u00f6lgyi, S.: Bottom-Up Tree Pushdown Automata and Rewrite Systems. In: Proc. of RTA 1991, pp. 287\u2013298 (1991)","DOI":"10.1007\/3-540-53904-2_104"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Dauchet, M., Tison, S.: The Theory of Ground Rewrite Systems is Decidable. In: Proc. of LICS 1990, pp. 242\u2013248 (1990)","DOI":"10.1109\/LICS.1990.113750"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.tcs.2004.10.007","volume":"330","author":"G. Feuillade","year":"2005","unstructured":"Feuillade, G., Genet, T., Viet Triem Tong, V.: Reachability Analysis over Term Rewriting Systems. Theoretical Computer Science\u00a0330(3), 501\u2013551 (2005)","journal-title":"Theoretical Computer Science"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Jacquemard, F.: Decidable Approximations of Term Rewriting Systems. In: Proc. RTA 1996, pp. 362\u2013376 (1996)","DOI":"10.1007\/3-540-61464-8_65"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/596980.596981","volume":"25","author":"F. Levi","year":"2003","unstructured":"Levi, F., Sangiorgi, D.: Mobile Safe Ambients. ACM Transactions on Programming Languages and Systems\u00a025(1), 1\u201369 (2003)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.tcs.2004.10.007","volume":"330","author":"S. Maffeis","year":"2005","unstructured":"Maffeis, S., Phillips, I.: On the Computational Strength of Pure Ambient Calculi. Theoretical Computer Science\u00a0330(3), 501\u2013551 (2005)","journal-title":"Theoretical Computer Science"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Mayr, E.W.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal of Computing (1984)","DOI":"10.1137\/0213029"},{"key":"21_CR13","unstructured":"Mayr, R., Rusinowitch, M.: Reachability is Decidable for Ground AC Rewrite Systems. In: Proc. of Infinity 1998 (1998)"},{"issue":"1-2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process Rewrite Systems. Information and Computation\u00a0156(1-2), 264\u2013286 (2000)","journal-title":"Information and Computation"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","volume":"37","author":"K. Salomaa","year":"1988","unstructured":"Salomaa, K.: Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. Journal of Computer Systems Science\u00a037(3), 367\u2013394 (1988)","journal-title":"Journal of Computer Systems Science"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11921240_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:59:01Z","timestamp":1605643141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11921240_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540488156","9783540488163"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11921240_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}