{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T02:51:07Z","timestamp":1761706267589},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_62","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"766-778","source":"Crossref","is-referenced-by-count":28,"title":["Spatial Logics for Bigraphs"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Conforti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damiano","family":"Macedonio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimiro","family":"Sassone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45500-0_1","volume-title":"Theoretical Aspects of Computer Software","author":"L. Caires","year":"2001","unstructured":"Caires, L., Cardelli, L.: A spatial logic for concurrency (Part I). In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 1\u201337. Springer, Heidelberg (2001)"},{"key":"62_CR2","doi-asserted-by":"crossref","unstructured":"Calcagno, C., Cardelli, L., Gordon, A.D.: Deciding validity in a spatial logic for trees. In: Proc. of TLDI (2003)","DOI":"10.1145\/604174.604183"},{"key":"62_CR3","unstructured":"Calcagno, C., Gardner, P., Zarfaty, U.: A context logic for tree update. In: Proc. of LRPP (2004); revised version to appear in POPL, 2005"},{"key":"62_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45465-9_51","volume-title":"Automata, Languages and Programming","author":"L. Cardelli","year":"2002","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: A spatial logic for querying graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, p. 597. Springer, Heidelberg (2002)"},{"key":"62_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-36576-1_14","volume-title":"Foundations of Software Science and Computational Structures","author":"L. Cardelli","year":"2003","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: Manipulating trees with hidden labels. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 216\u2013232. Springer, Heidelberg (2003)"},{"key":"62_CR6","unstructured":"Cardelli, L., Gordon, A.D.: Ambient logic. To appear in Mathematical Structures in Computer Science"},{"key":"62_CR7","volume-title":"Proc. of POPL","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Anytime, anywhere: Modal logics for mobile ambients. In: Proc. of POPL. ACM Press, New York (2000)"},{"key":"62_CR8","unstructured":"Conforti, G., Macedonio, D., Sassone, V.: Bigraphical logics for XML. In: Proc. of SEBD (2005) (to appear)"},{"key":"62_CR9","doi-asserted-by":"crossref","unstructured":"Conforti, G., Macedonio, D., Sassone, V.: BiLog: spatial logics for bigraphs. Computer Science Report 2005:02, University of Sussex (2005)","DOI":"10.1007\/11523468_62"},{"key":"62_CR10","unstructured":"Hildebrandt, T., Winther, J.W.: Bigraphs and (Reactive) XML, an XML-centric model of computation. IT University of Copenhagen Technical Report TR-2005-26 (2005)"},{"key":"62_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-28644-8_21","volume-title":"CONCUR 2004 - Concurrency Theory","author":"D. Hirschkoff","year":"2004","unstructured":"Hirschkoff, D.: An extensional spatial logic for mobile processes. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 325\u2013339. Springer, Heidelberg (2004)"},{"key":"62_CR12","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and mobile processes (revised). Technical Report UCAM-CL-TR-580. University of Cambridge (2004)"},{"key":"62_CR13","unstructured":"Leifer, J.J., Milner, R.: Transition systems, link graphs and petri nets. Technical Report UCAM-CL-TR-598. University of Cambridge (2004)"},{"key":"62_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-44685-0_2","volume-title":"CONCUR 2001 - Concurrency Theory","author":"R. Milner","year":"2001","unstructured":"Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 16\u201335. Springer, Heidelberg (2001)"},{"key":"62_CR15","unstructured":"Milner, R.: Axioms for bigraphical structure. Technical Report UCAM-CL-TR-581. University of Cambridge (2004)"},{"key":"62_CR16","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-540-27755-2_19","volume-title":"Lectures on Concurrency and Petri Nets: Advances in Petri Nets","author":"R. Milner","year":"2004","unstructured":"Milner, R.: Bigraphs for petri-nets. In: Lectures on Concurrency and Petri Nets: Advances in Petri Nets, pp. 686\u2013701. Springer, Heidelberg (2004)"},{"key":"62_CR17","unstructured":"Milner, R.: Pure bigraphs. Technical Report UCAM-CL-TR-614. University of Cambridge (2005)"},{"key":"62_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44802-0_1","volume-title":"Computer Science Logic","author":"P. O\u2019Hearn","year":"2001","unstructured":"O\u2019Hearn, P., Reynolds, J.C., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 1\u201319. Springer, Heidelberg (2001)"},{"key":"62_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-45500-0_11","volume-title":"Theoretical Aspects of Computer Software","author":"A.M. Pitts","year":"2001","unstructured":"Pitts, A.M.: Nominal logic: A first order theory of names and binding. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 219\u2013242. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:13Z","timestamp":1605643573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11523468_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}