{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T09:19:06Z","timestamp":1672478346838},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2010,8,3]],"date-time":"2010-08-03T00:00:00Z","timestamp":1280793600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10817-010-9189-7","type":"journal-article","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T09:51:06Z","timestamp":1280742666000},"page":"293-323","source":"Crossref","is-referenced-by-count":1,"title":["Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation"],"prefix":"10.1007","volume":"46","author":[{"given":"Joana","family":"Martinho","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio","family":"Ravara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,3]]},"reference":[{"key":"9189_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of the 28th ACM Symposium on Principles of Programming Languages (POPL\u201901), pp. 104\u2013115. ACM, New York (2001)","DOI":"10.1145\/360204.360213"},{"key":"9189_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. In: Proceedings of the 4th ACM Conference on Computer and Communications Security, pp. 36\u201347. ACM, New York (1997)","DOI":"10.1145\/266420.266432"},{"key":"9189_CR3","doi-asserted-by":"crossref","unstructured":"Baldamus, M., Parrow, J., Victor, B.: Spi calculus translated to \u03c0-calculus preserving may-testing. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS \u201904), pp. 21\u201331. IEEE Computer Society Press (2004)","DOI":"10.1109\/LICS.2004.1319597"},{"key":"9189_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jlap.2007.06.002","volume":"75","author":"B Blanchet","year":"2007","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. J. Logic Algebr. Program. 75, 3\u201351 (2007)","journal-title":"J. Logic Algebr. Program."},{"issue":"3","key":"9189_CR5","doi-asserted-by":"crossref","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 J. Comput. 31(3), 947\u2013986 (2002)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9189_CR6","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1017\/S0960129505004706","volume":"15","author":"J Borgstr\u00f6m","year":"2005","unstructured":"Borgstr\u00f6m, J., Nestmann, U.: On bisimulations for the spi calculus. Math. Struct. Comput. Sci. 15(3), 487\u2013552 (2005)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"9189_CR7","first-page":"70","volume":"10","author":"M Carbone","year":"2003","unstructured":"Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronization in \u03c0-calculus. Nord. J. Comput. 10(2), 70\u201398 (2003)","journal-title":"Nord. J. Comput."},{"key":"9189_CR8","doi-asserted-by":"crossref","unstructured":"Hansen, M., H\u00fcttel, H., Kleist, J.: Bisimulations for asynchronous mobile processes. In: Proceedings of the Tiblisi Symposium on Language, Logic, and Computation. Research paper HCRC\/RP-72, Human Communication Research Centre, University of Edinburgh (1995)","DOI":"10.7146\/brics.v3i8.19971"},{"key":"9189_CR9","unstructured":"Martinho, J., Ravara, A.: Encoding cryptographic primitives in a calculus with polyadic synchronization. In: Proceedings of the International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS \u201908), pp. 102\u2013109. ISRST 2008, ISBN 978-1-60651-006-3 (2008)"},{"key":"9189_CR10","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River (1989)"},{"key":"9189_CR11","unstructured":"Milner, R.: The polyadic \u03c0-calculus: A tutorial. In: Bauer F.L., Brauer W., Schwichtenberg H. (eds.) Logic and Algebra of Specification, Proceedings of the International NATO Summer School (Marktoberdorf, Germany, 1991), vol. 94 of Series F: Computer and System Sciences. NATO Advanced Study Institute, Springer-Verlag, 1993. Available as Technical Report ECS-LFCS-91-180, University of Edinburgh, UK (1991)"},{"key":"9189_CR12","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, part I\/II. In: Journal of Information and Computation, vol. 100, pp. 1\u201377, 1992. Available as Technical Reports ECS-LFCS-89-85 and ECS-LFCS-89-86, University of Edinburgh, U.\u00a0K. (1989)","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"9189_CR13","doi-asserted-by":"crossref","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP \u201992). Lecture Notes in Computer Science, vol. 623, pp. 685\u2013695. Springer, Heidelberg (1992)","DOI":"10.1007\/3-540-55719-9_114"},{"key":"9189_CR14","first-page":"104","volume":"68","author":"P Quaglia","year":"1999","unstructured":"Quaglia, P.: The pi-calculus: notes on labelled semantics. Bull. Eur. Assoc. Theor. Comput. Sci. (EATCS) 68, 104\u2013114 (1999)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. (EATCS)"},{"key":"9189_CR15","unstructured":"Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms. PhD thesis CST\u201399\u201393, Department of Computer Science, University of Edinburgh, UK (1992)"},{"key":"9189_CR16","doi-asserted-by":"crossref","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 Inform. 33, 69\u201397 (1996)","journal-title":"Acta Inform."},{"key":"9189_CR17","volume-title":"Proof, Language and Interaction: Essays in Honour of Robin Milner","author":"D Sangiorgi","year":"2000","unstructured":"Sangiorgi, D.: Lazy functions and mobile processes. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT, Cambridge (2000)"},{"key":"9189_CR18","volume-title":"The \u03c0-calculus: a Theory of Mobile Processes","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"9189_CR19","unstructured":"Victor, B.: A verification tool for the polyadic \u03c0-calculus. Licentiate thesis, Department of Computer Systems, Uppsala University, Sweden. Available as Report DoCS 94\/50 (1994)"},{"key":"9189_CR20","doi-asserted-by":"crossref","unstructured":"Victor, B., Moller, F.: The mobility workbench\u2014a tool for the \u03c0-calculus. In: Proceedings of the 6th International Conference on Computer Aided Verification (CAV \u201994). Lecture Notes in Computer Science, vol. 818, pp. 428\u2013440. Springer, Heidelberg (1994)","DOI":"10.1007\/3-540-58179-0_73"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-010-9189-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10817-010-9189-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-010-9189-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:07:12Z","timestamp":1559344032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10817-010-9189-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,3]]},"references-count":20,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9189"],"URL":"https:\/\/doi.org\/10.1007\/s10817-010-9189-7","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,3]]}}}