{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T07:26:49Z","timestamp":1748071609425},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427360"},{"type":"electronic","value":"9783540455004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45500-0_1","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T19:37:33Z","timestamp":1193341053000},"page":"1-37","source":"Crossref","is-referenced-by-count":35,"title":["A Spatial Logic for Concurrency (Part I)"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Caires","sequence":"first","affiliation":[]},{"given":"Luca","family":"Cardelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,10]]},"reference":[{"key":"1_CR1","unstructured":"G. Boudol. Asynchrony and the \u03c0-calculus (note). Rapport de Recherche 1702, INRIA Sofia-Antipolis, May 1992."},{"key":"1_CR2","unstructured":"L. Caires. A Model for Declarative Programming and Specification with Concurrency and Mobility. PhD thesis, Departamento de Inform\u00e1tica, Faculdade de Ci\u00eancias e Tecnologia, Universidade Nova de Lisboa, 1999."},{"key":"1_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BFb0053562","volume-title":"Programming Languages and Systems: Proceedings of the 7th European Symposium on Programming (ESOP 1998)","author":"L. Caires","year":"1998","unstructured":"L. Caires and L. Monteiro. Verifiable and Executable Specifications of Concurrent Objects in L \u03c0. In C. Hankin, editor, Programming Languages and Systems: Proceedings of the 7th European Symposium on Programming (ESOP 1998), number 1381 in Lecture Notes in Computer Science, pages 42\u201356. Springer-Verlag, 1998."},{"key":"1_CR4","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Programming Languages and Systems: Proceedings of the 10th European Symposium on Programming (ESOP 2001)","author":"L. Cardelli","year":"2001","unstructured":"L. Cardelli and G. Ghelli. A Query Language Based on the Ambient Logic. In David Sands, editor, Programming Languages and Systems: Proceedings of the 10th European Symposium on Programming (ESOP 2001), volume 2028 of Lecture Notes in Computer Science, pages 1\u201322. Springer-Verlag, 2001."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"L. Cardelli and A. D. Gordon. Anytime, Anywhere. Modal Logics for Mobile Ambients. In 27th ACM Symposium on Principles of Programming Languages, pages 365\u2013377. ACM, 2000.","DOI":"10.1145\/325694.325742"},{"key":"1_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45413-6_8","volume-title":"Typed Lambda Calculi and Applications","author":"L. Cardelli","year":"2001","unstructured":"L. Cardelli and A. D. Gordon. Logical Properties of Name Restriction. In S. Abramsky, editor, Typed Lambda Calculi and Applications, number 2044 in Lecture Notes in Computer Science. Springer-Verlag, 2001."},{"key":"1_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 15th Annual Conference of the European Association for Computer Science Logic","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, Lecture Notes in Computer Science. Springer-Verlag, 2001. To appear."},{"key":"1_CR8","series-title":"Lect Notes Comput Sci","first-page":"365","volume-title":"Proceedings of ASIAN\u201900-6th Asian Computing Science Conference","author":"S. Dal-Zilio","year":"2000","unstructured":"S. Dal-Zilio. Spatial Congruence for Ambients is Decidable. In Proceedings of ASIAN\u201900-6th Asian Computing Science Conference, number 1961 in Lecture Notes in Computer Science, pages 365\u2013377. Springer-Verlag, 2000."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"M. Dam. Relevance Logic and Concurrent Composition. In Proceedings, Third Annual Symposium on Logic in Computer Science, pages 178\u2013185, Edinburgh, Scotland, 5-8 July 1988. IEEE Computer Society.","DOI":"10.1109\/LICS.1988.5116"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(97)00179-5","volume":"152","author":"J. Engelfriet","year":"1999","unstructured":"J. Engelfriet and Tj. Gelsema. A Multiset Semantics for the \u03c0-calculus withReplication. Theoretical Computer Science, (152):311\u2013337, 1999.","journal-title":"Theoretical Computer Science"},{"key":"1_CR11","first-page":"214","volume-title":"14th Annual Symposium on Logic in Computer Science","author":"M. J. Gabbay","year":"1999","unstructured":"M. J. Gabbay and A. M. Pitts. A New Approachto Abstract Syntax Involving Binders. In 14th Annual Symposium on Logic in Computer Science, pages 214\u2013224. IEEE Computer Society Press, Washington, 1999."},{"key":"1_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-44618-4_7","volume-title":"CONCUR 2000: Concurrency Theory (11th International Conference, University Park, PA, USA)","author":"P. Gardner","year":"2000","unstructured":"P. Gardner. From Process Calculi to Process Frameworks. In Catuscia Palamidessi, editor, CONCUR 2000: Concurrency Theory (11th International Conference, University Park, PA, USA), volume 1877 of Lecture Notes in Computer Science, pages 69\u201388. Springer, August 2000."},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner. Algebraic laws for Nondeterminism and Concurrency. JACM, 32(1):137\u2013161, 1985.","journal-title":"JACM"},{"key":"1_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-55613-3_2","volume-title":"Object-Based Concurrent Computing 1991","author":"K. Honda","year":"1992","unstructured":"K. Honda and M. Tokoro. On Asynchronous Communication Semantics. In M. Tokoro, O. Nierstrasz, and P. Wegner, editors, Object-Based Concurrent Computing 1991, number 612 in Lecture Notes in Computer Science, pages 21\u201351. Springer-Verlag, 1992."},{"issue":"3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen. Results on the Propositional \u03bc-Calculus. TCS, 27(3):333\u2013354, 1983.","journal-title":"TCS"},{"key":"1_CR16","unstructured":"R. Milner. Communicating and Mobile Systems: the \u03c0-calculus. Cambridge University Press, 1999."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"D. Sangiorgi. Extensionality and Intensionality of the Ambient Logics. In 28th Annual Symposium on Principles of Programming Languages, pages 4\u201313. ACM, 2001.","DOI":"10.1145\/360204.375707"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45500-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T00:54:36Z","timestamp":1556931276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45500-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427360","9783540455004"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45500-0_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}