{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:49:58Z","timestamp":1725562198155},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_7","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:06:41Z","timestamp":1280747201000},"page":"72-89","source":"Crossref","is-referenced-by-count":31,"title":["Behavioral and Spatial Observations in a Logic for the \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Caires","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/155183.155231","volume":"15","author":"R. Amadio","year":"1993","unstructured":"Amadio, R., Cardelli, L.: Subtyping recursive types. ACM Transactions on Programming Languages and Systems\u00a015(4), 575\u2013631 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR2","unstructured":"Caires, L.: A Model for Declarative Programming and Specification with Concurrency and Mobility. PhD thesis, Dept. de Inform\u00e1tica, FCT, Universidade Nova de Lisboa (1999)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-45694-5_15","volume-title":"CONCUR 2002 - Concurrency Theory","author":"L. Caires","year":"2002","unstructured":"Caires, L., Cardelli, L.: A spatial logic for concurrency (Part II). In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, p. 209. Springer, Heidelberg (2002)"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0890-5401(03)00137-8","volume":"186","author":"L. Caires","year":"2003","unstructured":"Caires, L., Cardelli, L.: A Spatial Logic for Concurrency (Part I). Information and Computation\u00a0186(2), 194\u2013235 (2003)","journal-title":"Information and Computation"},{"key":"7_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":"7_CR6","first-page":"365","volume-title":"27th ACM Symp. on Principles of Programming Languages","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Anytime, Anywhere. Modal Logics for Mobile Ambients. In: 27th ACM Symp. on Principles of Programming Languages, pp. 365\u2013377. ACM, New York (2000)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-45413-6_8","volume-title":"Typed Lambda Calculi and Applications","author":"L. Cardelli","year":"2001","unstructured":"Cardelli, L., Gordon, A.D.: Logical properties of name restriction. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, p. 46. Springer, Heidelberg (2001)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-45927-8_21","volume-title":"Programming Languages and Systems","author":"W. Charatonik","year":"2002","unstructured":"Charatonik, W., Gordon, A.D., Talbot, J.-M.: Finite-control mobile ambients. In: Le M\u00e9tayer, D. (ed.) ESOP 2002. LNCS, vol.\u00a02305, pp. 295\u2013313. Springer, Heidelberg (2002)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45927-8_21","volume-title":"Programming Languages and Systems","author":"W. Charatonik","year":"2002","unstructured":"Charatonik, W., Talbot, J.-M.: The decidability of model-checking mobile ambients. In: Metayer, D. (ed.) ESOP 2002. LNCS, vol.\u00a02305, Springer, Heidelberg (2002)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","first-page":"365","volume-title":"Advances in Computing Science - ASIAN 2000","author":"S. Dal-Zilio","year":"2000","unstructured":"Dal-Zilio, S.: Spatial congruence for ambients is decidable. In: He, J., Sato, M. (eds.) ASIAN 2000. LNCS, vol.\u00a01961, pp. 365\u2013377. Springer, Heidelberg (2000)"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.1996.0072","volume":"129","author":"M. Dam","year":"1996","unstructured":"Dam, M.: Model checking mobile processes. Information and Computation\u00a0129(1), 35\u201351 (1996)","journal-title":"Information and Computation"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Dam, M.: Proof systems for \u03c0-calculus logics. In: de Queiroz (ed.) Logic for Concurrency and Synchronisation, Studies in Logic and Computation, Oxford University Press, Oxford (to appear)","DOI":"10.1007\/0-306-48088-3_4"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Gelsema, T.: Multisets and Structural Congruence of the \u03c0- calculus with Replication. Theoretical Computer Science\u00a0(211), 311\u2013337 (1999)","DOI":"10.1016\/S0304-3975(97)00179-5"},{"issue":"3-5","key":"7_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M. Gabbay","year":"2002","unstructured":"Gabbay, M., Pitts, A.: A New Approach to Abstract Syntax with Variable Binding. Formal Aspects of Computing\u00a013(3-5), 341\u2013363 (2002)","journal-title":"Formal Aspects of Computing"},{"key":"7_CR15","unstructured":"Ghelli, G., Conforti, G.: Decidability of freshness, undecidability of revelation. Technical Report 03\u201311, Dipartimento di Informatica, Universita di Pisa (2003)"},{"key":"7_CR16","volume-title":"Proc. LICS","author":"D. Hirschkoff","year":"2002","unstructured":"Hirschkoff, D., Lozes, E., Sangiorgi, D.: Separability, Expressiveness and Decidability in the Ambient Logic. In: Proc. LICS, Copenhagen, Denmark, IEEE Computer Society, Los Alamitos (2002)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-24597-1_22","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"D. Hirschkoff","year":"2003","unstructured":"Hirschkoff, D., Lozes, \u00c9., Sangiorgi, D.: Minimality results for the spatial logics. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 252\u2013264. Springer, Heidelberg (2003)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Ishtiaq, S., O\u2019Hearn, P.: BI as an Assertion Language for Mutable Data Structures. In: 28th ACM Symp. on Principles of Programming Languages (2001)","DOI":"10.1145\/360204.375719"},{"key":"7_CR19","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"7_CR20","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-calculus. CUP (1999)"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(93)90156-N","volume":"114","author":"R. Milner","year":"1993","unstructured":"Milner, R., Parrow, J., Walker, D.: Modal logics for mobile processes. Theoretical Computer Science\u00a0114, 149\u2013171 (1993)","journal-title":"Theoretical Computer Science"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Montanari, U., Pistore, M.: Pi-Calculus, Structured Coalgebras, and Minimal HD-Automata. In: MFCS: Symp. on Mathematical Foundations of Computer Science, pp. 569\u2013578 (2000)","DOI":"10.1007\/3-540-44612-5_52"},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"P. O\u2019Hearn","year":"1999","unstructured":"O\u2019Hearn, P., Pym, D.: The Logic of Bunched Implications. The Bulletin of Symbolic Logic\u00a05(2), 215\u2013243 (1999)","journal-title":"The Bulletin of Symbolic Logic"},{"key":"7_CR24","first-page":"4","volume-title":"28th Annual Symposium on Principles of Programming Languages","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D.: Extensionality and Intensionality of the Ambient Logics. In: 28th Annual Symposium on Principles of Programming Languages, pp. 4\u201313. ACM, New York (2001)"},{"key":"7_CR25","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: A Theory of Mobile Processes. CUP (2001)"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/BFb0035797","volume-title":"Automata, Languages and Programming","author":"G. Winskel","year":"1989","unstructured":"Winskel, G.: A note on model checking the modal \u03bd-calculus. In: Ausiello, G., Dezani-Ciancaglini, M., Rocca, S.R.D. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 761\u2013772. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:23:22Z","timestamp":1559345002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}