{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T13:29:13Z","timestamp":1790429353435,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642112652","type":"print"},{"value":"9783642112669","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_46","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T09:04:58Z","timestamp":1260176698000},"page":"552-563","source":"Crossref","is-referenced-by-count":9,"title":["A Complete Symbolic Bisimulation for Full Applied Pi Calculus"],"prefix":"10.1007","author":[{"given":"Jia","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huimin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1-2","key":"46_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2006.08.032","volume":"367","author":"M. Abadi","year":"2006","unstructured":"Abadi, M., Cortier, V.: Deciding Knowledge in Security Protocols under Equational Theories. Theor. Comput. Sci.\u00a0367(1-2), 2\u201332 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile Values, New Names, and Secure Communication. In: POPL, pp. 104\u2013115 (2001)","DOI":"10.1145\/360204.360213"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/266420.266432","volume-title":"CCS\u00a01997: Proceedings of the 4th\u00a0ACM Conference on Computer and Communications Security","author":"M. Abadi","year":"1997","unstructured":"Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: the spi Calculus. In: CCS\u00a01997: Proceedings of the 4th\u00a0ACM Conference on Computer and Communications Security, pp. 36\u201347. ACM, New York (1997)"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1102120.1102125","volume-title":"CCS 2005: Proceedings of the 12th\u00a0ACM Conference on Computer and Communications Security","author":"M. Baudet","year":"2005","unstructured":"Baudet, M.: Deciding Security of Protocols against Off-Line Quessing Attacks. In: CCS 2005: Proceedings of the 12th\u00a0ACM Conference on Computer and Communications Security, pp. 16\u201325. ACM, New York (2005)"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-Calculi: Mobile Processes, Nominal Data, and Logic. In: LICS 2009: Proceedings of the 2009 24th\u00a0Annual IEEE Symposium on Logic In Computer Science, pp. 39\u201348 (2009)","DOI":"10.1109\/LICS.2009.20"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In: CSFW\u00a02001: Proceedings of the 14th\u00a0IEEE Workshop on Computer Security Foundations, p. 82 (2001)","DOI":"10.1109\/CSFW.2001.930138"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated Verification of Selected Equivalences for Security Protocols. In: LICS, pp. 331\u2013340 (2005)","DOI":"10.1109\/LICS.2005.8"},{"issue":"1-3","key":"46_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.tcs.2005.03.044","volume":"338","author":"M. Boreale","year":"2005","unstructured":"Boreale, M., Buscemi, M.: A Method for Symbolic Analysis of Security Protocols. Theor. Comput. Sci.\u00a0338(1-3), 393\u2013425 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"46_CR9","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 Pi-Calculus. Inf. Comput.\u00a0126(1), 34\u201352 (1996)","journal-title":"Inf. Comput."},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Borgstr\u00f6m, J.: A Complete Symbolic Bisimilarity for an Extended spi Calculus. Electron. Notes Theor. Comput. Sci.\u00a0242(3) (2009)","DOI":"10.1016\/j.entcs.2009.07.078"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-3-540-28644-8_11","volume-title":"CONCUR 2004 - Concurrency Theory","author":"J. Borgstr\u00f6m","year":"2004","unstructured":"Borgstr\u00f6m, J., Briais, S., Nestmann, U.: Symbolic Bisimulation in the spi Calculus. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 161\u2013176. Springer, Heidelberg (2004)"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. In: LICS\u00a02003: Proceedings of the 18th\u00a0Annual IEEE Symposium on Logic in Computer Science, p. 271 (2003)","DOI":"10.1109\/LICS.2003.1210067"},{"key":"46_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-77050-3_11","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"S. Delaune","year":"2007","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Symbolic Bisimulation for the Applied Pi Calculus. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 133\u2013145. Springer, Heidelberg (2007)"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Symbolic Bisimulation for the Applied pi\u00a0Calculus. Journal of Computer Security (to appear, 2009)","DOI":"10.3233\/JCS-2010-0363"},{"issue":"2","key":"46_CR15","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. Theor. Comput. Sci.\u00a0138(2), 353\u2013389 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"46_CR16","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01213531","volume":"8","author":"M. Hennessy","year":"1996","unstructured":"Hennessy, M., Lin, H.: Proof Systems for Message-Passing Process Algebras. Formal Asp. Comput.\u00a08(4), 379\u2013407 (1996)","journal-title":"Formal Asp. Comput."},{"key":"46_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-70583-3_8","volume-title":"Automata, Languages and Programming","author":"M. Johansson","year":"2008","unstructured":"Johansson, M., Parrow, J., Victor, B., Bengtson, J.: Extended Pi-Calculi. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 87\u201398. Springer, Heidelberg (2008)"},{"issue":"1","key":"46_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0890-5401(02)00014-7","volume":"180","author":"H. Lin","year":"2003","unstructured":"Lin, H.: Complete Inference Systems for Weak Bisimulation Equivalences in the Pi-Calculus. Inf. Comput.\u00a0180(1), 1\u201329 (2003)","journal-title":"Inf. Comput."},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"Liu, J., Lin, H.: A Complete Symbolic Bisimulation for Full Applied pi Calculus (full version) (2009), http:\/\/lcs.ios.ac.cn\/~jliu","DOI":"10.1007\/978-3-642-11266-9_46"},{"key":"46_CR20","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/501983.502007","volume-title":"CCS 2001: Proceedings of the 8th\u00a0ACM Conference on Computer and Communications Security","author":"J. Millen","year":"2001","unstructured":"Millen, J., Shmatikov, V.: Constraint Solving for Bounded-Process Cryptographic Protocol Analysis. In: CCS 2001: Proceedings of the 8th\u00a0ACM Conference on Computer and Communications Security, pp. 166\u2013175. ACM, New York (2001)"},{"key":"46_CR21","volume-title":"Communicating and Mobile Systems: the pi Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: the pi Calculus. Cambridge University Press, Cambridge (1999)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T22:58:10Z","timestamp":1590274690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}