{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:54Z","timestamp":1763467974612,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229407"},{"type":"electronic","value":"9783540286448"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28644-8_11","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T19:48:13Z","timestamp":1267127293000},"page":"161-176","source":"Crossref","is-referenced-by-count":27,"title":["Symbolic Bisimulation in the Spi Calculus"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Borgstr\u00f6m","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Briais","sequence":"additional","affiliation":[]},{"given":"Uwe","family":"Nestmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile Values, New Names, and Secure Communication. In: Proc. of POPL 2001, pp. 104\u2013115 (2001)","DOI":"10.1145\/373243.360213"},{"issue":"4","key":"11_CR2","first-page":"267","volume":"5","author":"M. Abadi","year":"1998","unstructured":"Abadi, M., Gordon, A.D.: A Bisimulation Method for Cryptographic Protocols. Nordic Journal of Computing\u00a05(4), 267\u2013303 (1998)","journal-title":"Nordic Journal of Computing"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-44618-4_28","volume-title":"CONCUR 2000 - Concurrency Theory","author":"R.M. Amadio","year":"2000","unstructured":"Amadio, R.M., Lugiez, D.: On the Reachability Problem in Cryptographic Protocols. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 380\u2013394. Springer, Heidelberg (2000)"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/inco.1996.0032","volume":"126","author":"M. Boreale","year":"1996","unstructured":"Boreale, M., De Nicola, R.: A Symbolic Semantics for the \u03c0-Calculus. Information and Computation\u00a0126(1), 34\u201352 (1996)","journal-title":"Information and Computation"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1137\/S0097539700377864","volume":"31","author":"M. Boreale","year":"2002","unstructured":"Boreale, M., De Nicola, R., Pugliese, R.: Proof Techniques for Cryptographic Processes. SIAM Journal on Computing\u00a031(3), 947\u2013986 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/3-540-45719-4_20","volume-title":"Algebraic Methodology and Software Technology","author":"J. Borgstr\u00f6m","year":"2002","unstructured":"Borgstr\u00f6m, J., Nestmann, U.: On Bisimulations for the \u03c0 Calculus. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.\u00a02422, pp. 287\u2013303. Springer, Heidelberg (2002)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/3-540-48224-5_55","volume-title":"Automata, Languages and Programming","author":"M. Boreale","year":"2001","unstructured":"Boreale, M.: Symbolic Trace Analysis of Cryptographic Protocols. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 667\u2013681. Springer, Heidelberg (2001)"},{"key":"11_CR9","unstructured":"Cortier, V.: V\u00e9rification automatique des protocoles cryptographiques. PhD thesis, \u00c9cole Normale Sup\u00e9rieure de Cachan (2003)"},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.26636\/jtit.2002.4.149","volume":"4","author":"H. Comon","year":"2002","unstructured":"Comon, H., Shmatikov, V.: Is it possible to decide whether a cryptographic protocol is secure or not? Journal of Telecommunications and Information Technology\u00a04, 5\u201315 (2002)","journal-title":"Journal of Telecommunications and Information Technology"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1145\/941566.941570","volume":"12","author":"L. Durante","year":"2003","unstructured":"Durante, L., Sisto, R., Valenzano, A.: Automatic testing equivalence verification of \u03c0-calculus specifications. ACM Transactions on Software Engineering and Methodology\u00a012(2), 222\u2013284 (2003)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Fiore, M., Abadi, M.: Computing Symbolic Models for Verifying Cryptographic Protocols. In: 14th IEEE Computer Security Foundations Workshop, pp. 160\u2013173 (2001)","DOI":"10.1109\/CSFW.2001.930144"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Lin, H.: Symbolic Bisimulations. Theoretical Computer Science\u00a0138(2), 353\u2013389 (1995)","journal-title":"Theoretical Computer Science"},{"key":"11_CR14","unstructured":"Huima, A.: Efficient Infinite-State Analysis of Security Protocols. In: FLOC Workshop on Formal Methods and Security Protocols (1999)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"H\u00fcttel, H.: Deciding Framed Bisimilarity. In: Proc. of INFINITY (2002)","DOI":"10.7146\/brics.v9i25.21741"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A Theory of Bisimulation for the \u03c0-calculus. Acta Informatica\u00a033, 69\u201397 (1996)","journal-title":"Acta Informatica"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/3-540-58179-0_73","volume-title":"Computer Aided Verification","author":"B. Victor","year":"1994","unstructured":"Victor, B., Moller, F.: The Mobility Workbench \u2014 A Tool for the \u03c0-Calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 428\u2013440. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2004 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28644-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:00:09Z","timestamp":1739916009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28644-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229407","9783540286448"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28644-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}