{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:12:32Z","timestamp":1725516752606},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_8","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"87-98","source":"Crossref","is-referenced-by-count":5,"title":["Extended pi-Calculi"],"prefix":"10.1007","author":[{"given":"Magnus","family":"Johansson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Parrow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f6rn","family":"Victor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Bengtson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, part I\/II. Journal of Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Journal of Information and Computation"},{"key":"8_CR2","series-title":"Series F., NATO ASI","volume-title":"Logic and Algebra of Specification","author":"R. Milner","year":"1993","unstructured":"Milner, R.: The polyadic \u03c0-calculus: A tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. Series F., NATO ASI, vol.\u00a094. Springer, Heidelberg (1993)"},{"key":"8_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. Journal of Information and Computation\u00a0148, 1\u201370 (1999)","journal-title":"Journal of Information and Computation"},{"key":"8_CR4","first-page":"104","volume-title":"Proceedings of POPL 2001","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of POPL 2001, pp. 104\u2013115. ACM, New York (2001)"},{"key":"8_CR5","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 spi calculus. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.\u00a02422, pp. 287\u2013303. Springer, Heidelberg (2002)"},{"issue":"2","key":"8_CR6","first-page":"70","volume":"10","author":"M. Carbone","year":"2003","unstructured":"Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in \u03c0-calculus. Nordic Journal of Computing\u00a010(2), 70\u201398 (2003)","journal-title":"Nordic Journal of Computing"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: a Proof Assistant for Higher-Order Logic","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"issue":"4","key":"8_CR8","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"},{"key":"8_CR9","series-title":"Australian Computer Science Communications","first-page":"175","volume-title":"Combinatorics, Computation & Logic","author":"A.S. Elkj\u00e6r","year":"1999","unstructured":"Elkj\u00e6r, A.S., H\u00f6hle, M., H\u00fcttel, H., Overg\u00e5rd, K.: Towards automatic bisimilarity checking in the spi calculus. In: Calude, C.S., Dinneen, M.J. (eds.) Combinatorics, Computation & Logic. Australian Computer Science Communications, vol.\u00a021(3), pp. 175\u2013189. Springer, Heidelberg (1999)"},{"issue":"3","key":"8_CR10","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"},{"issue":"2","key":"8_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 spi calculus specifications. ACM Trans. Softw. Eng. Methodol.\u00a012(2), 222\u2013284 (2003)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"8_CR12","unstructured":"Borgstr\u00f6m, J.: Equivalences and Calculi for Formal Verifiation of Cryptographic Protocols. PhD thesis, EPFL, Lausanne (to appear, 2008)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-36532-X_20","volume-title":"Software Security \u2013 Theories and Systems","author":"C. Fournet","year":"2003","unstructured":"Fournet, C., Abadi, M.: Hiding names: Private authentication in the applied pi calculus. In: Okada, M., Pierce, B.C., Scedrov, A., Tokuda, H., Yonezawa, A. (eds.) ISSS 2002. LNCS, vol.\u00a02609, pp. 317\u2013338. Springer, Heidelberg (2003)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Abadi, M., Blanchet, B., Fournet, C.: Just fast keying in the pi calculus. ACM Trans. Inf. Syst. Secur.\u00a010(3) (2007)","DOI":"10.1145\/1266977.1266978"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2005.03.005","volume":"340","author":"K. Bhargavan","year":"2005","unstructured":"Bhargavan, K., Fournet, C., Gordon, A.D.: A semantics for web services authentication. Theor. Comput. Sci.\u00a0340(1), 102\u2013153 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1103576.1103583","volume-title":"FMSE 2005: Proceedings of the 2005 ACM workshop on Formal methods in security engineering","author":"A. Chaudhuri","year":"2005","unstructured":"Chaudhuri, A., Abadi, M.: Formal security analysis of basic network-attached storage. In: FMSE 2005: Proceedings of the 2005 ACM workshop on Formal methods in security engineering, pp. 43\u201352. ACM, New York (2005)"},{"issue":"8","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1016\/j.ic.2006.04.004","volume":"204","author":"C. Haack","year":"2006","unstructured":"Haack, C., Jeffrey, A.: Pattern-matching spi-calculus. Information and Computation\u00a0204(8), 1195\u20131263 (2006)","journal-title":"Information and Computation"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"186","author":"A.M. Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. Information and Computation\u00a0186, 165\u2013193 (2003)","journal-title":"Information and Computation"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-71389-0_6","volume-title":"Foundations of Software Science and Computational Structures","author":"J. Bengtson","year":"2007","unstructured":"Bengtson, J., Parrow, J.: Formalising the pi-calculus using nominal logic. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 63\u201377. Springer, Heidelberg (2007)"},{"key":"8_CR20","unstructured":"Carbone, M., Coccia, M., Ferrari, G., Maffeis, S.: Process algebra-guided design of java mobile network applications. In: Informal Proceedings of the FMTJP 2001 Workshop, Budapest (2001)"},{"key":"8_CR21","unstructured":"Urban, C.: Nominal techniques in Isabelle\/HOL. Journal of Automatic Reasoning (to appear, 2007)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Fournet, C., Gordon, A.D., Maffeis, S.: A type discipline for authorization in distributed systems. In: Proc. of CSF 2007 (to appear, 2007)","DOI":"10.1109\/CSF.2007.7"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11539452_17","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"A.D. Gordon","year":"2005","unstructured":"Gordon, A.D., Jeffrey, A.: Secrecy despite compromise: Types, cryptography, and the pi-calculus. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 186\u2013201. Springer, Heidelberg (2005)"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-540-31987-0_11","volume-title":"Programming Languages and Systems","author":"C. Fournet","year":"2005","unstructured":"Fournet, C., Gordon, A.D., Maffeis, S.: A type discipline for authorization policies. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 141\u2013156. Springer, Heidelberg (2005)"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.: The Concurrency Workbench: a semantics-based tool for the verification of concurrent systems. ACM Trans. Program. Lang. Syst.\u00a015(1), 36\u201372 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:23:39Z","timestamp":1620015819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}