{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:43:58Z","timestamp":1725486238159},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_6","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:53:52Z","timestamp":1181364832000},"page":"67-81","source":"Crossref","is-referenced-by-count":3,"title":["On Compositional Reasoning in the Spi-calculus"],"prefix":"10.1007","author":[{"given":"Michele","family":"Boreale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Gorla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi, C. Fournet. Mobile Values, New Names and Secure Communication. POPL\u201901, Proceedings, 104\u2013115.","DOI":"10.1145\/373243.360213"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"M. Abadi, A.D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1\u201370, Academic Press, 1999.","journal-title":"Information and Computation"},{"issue":"4","key":"6_CR3","first-page":"267","volume":"5","author":"M. Abadi","year":"1998","unstructured":"M. Abadi, A.D. Gordon. A Bisimulation Method for Cryptographic Protocols. Nordic Journal of Computing, 5(4):267\u2013303, 1998.","journal-title":"Nordic Journal of Computing"},{"key":"6_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/3-540-48224-5_55","volume-title":"ICALP\u201901","author":"M. Boreale","year":"2001","unstructured":"M. Boreale. Symbolic trace analysis of cryptographic protocols. ICALP\u201901, LNCS 2076, pp.667\u2013681, Springer-Verlag, 2001."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/inco.1996.0032","volume":"126","author":"M. Boreale","year":"1996","unstructured":"M. Boreale, R. De Nicola. A Symbolic Semantics for the \u03a0-calculus. Information and Computation, vol.126, pp.34\u201352, 1996.","journal-title":"Information and Computation"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"M. Boreale, R. De Nicola, R. Pugliese. Proof Techniques for Cryptographic Processes. LICS\u201999, Proceedings, IEEE Computer Society Press, pp.157\u2013166, 1999. Full version to appear in SIAM Journal on Computing.","DOI":"10.1109\/LICS.1999.782608"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"M. Boreale, R. De Nicola, R. Pugliese. Process Algebraic Analysis of Cryptographic Protocols. Proc. of 13th FORTE \/ 20th PSV, Kluwer, 2000.","DOI":"10.1007\/978-0-387-35533-7_24"},{"key":"6_CR8","unstructured":"A.S. Elkjaer, M. H\u00f6hle, H. H\u00fcttel, K.O. Nielsen. Towards Automatic Bisimilarity Checking in the Spi Calculus, Proc. of DMTCS\u201999+CATS\u201999, 1999."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"M. Hennessy, H. Lin. Symbolic Bisimulations. Theoretical Computers Science, 138, pp. 353\u2013389, 1995.","journal-title":"Theoretical Computers Science"},{"key":"6_CR10","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall International, 1989."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner. The poliadic \u03a0-calculus: a tutorial. Logic and Algebra of Specification, ed. F.L. Bauer, W. Bauer and H. Schwichtenberg Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"6_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"ICALP\u201992, Proceedings","author":"R. Milner","year":"1992","unstructured":"R. Milner, D. Sangiorgi. Barbed Bisimulation. ICALP\u201992, Proceedings (W. Kuich, Ed.), LNCS 623, pp.685\u2013695, Springer-Verlag, 1992."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/inco.1995.1108","volume":"120","author":"J. Parrow","year":"1995","unstructured":"J. Parrow, D. Sangiorgi. Algebraic theories for name-passing calculi. Information and Computation, 120, pp.174\u2013197, 1995.","journal-title":"Information and Computation"}],"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\/3-540-45931-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T23:58:54Z","timestamp":1587599934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}