{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:09:44Z","timestamp":1725559784477},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_97","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"1202-1213","source":"Crossref","is-referenced-by-count":13,"title":["A Fully Abstract Encoding of the \u03c0-Calculus with Data Terms"],"prefix":"10.1007","author":[{"given":"Michael","family":"Baldamus","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Parrow","sequence":"additional","affiliation":[]},{"given":"Bj\u00f6rn","family":"Victor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"97_CR1","first-page":"104","volume-title":"Principles of Programming Languages","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile Values, New Names, and Secure Communication. In: Principles of Programming Languages, pp. 104\u2013115. ACM, New York (2001)"},{"key":"97_CR2","first-page":"105","volume-title":"Logic in Computer Science","author":"M. Abadi","year":"1998","unstructured":"Abadi, M., Fournet, C., Georges, G.: Secure Implementation of Channel Abstractions. In: Logic in Computer Science, pp. 105\u2013116. IEEE, Los Alamitos (1998)"},{"issue":"1","key":"97_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.: A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"97_CR4","first-page":"22","volume-title":"Logic in Computer Science","author":"M. Baldamus","year":"2004","unstructured":"Baldamus, M., Parrow, J., Victor, B.: Translating Spi Calculus to \u03c0-Calculus Preserving May-Tests. In: Logic in Computer Science, pp. 22\u201331. IEEE, Los Alamitos (2004)"},{"key":"97_CR5","doi-asserted-by":"crossref","unstructured":"Baldamus, M., Parrow, J., Victor, B.: A Fully Abstract Encoding of the \u03c0-Calculus with Data Terms. Technical Report 2005-004, Department of Information Technology, Uppsala University (February 2005)","DOI":"10.1007\/11523468_97"},{"issue":"3","key":"97_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":"97_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"97_CR8","unstructured":"Borgstr\u00f6m, J., Nestmann, U.: On Bisimulations for the Spi Calculus. Technical Report IC\/2003\/34, EPFL I&C (2003)"},{"key":"97_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1098\/rspa.1989.0125","volume":"426","author":"A. Burrows","year":"1989","unstructured":"Burrows, A., Abadi, M., Needham, R.: A logic of authentication. Proceedings of the Royal Society of London A\u00a0426, 233\u2013271 (1989)","journal-title":"Proceedings of the Royal Society of London A"},{"key":"97_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. De Nicola","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing Equivalences for Processes. Theoretical Computer Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"97_CR11","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the Security of Public-Key Protocols. IEEE Transactions on Information Technology\u00a029(2), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Technology"},{"issue":"2","key":"97_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"Milner, R.: Functions as Processes. Mathematical Structures in Computer Science\u00a02(2), 119\u2013141 (1992)","journal-title":"Mathematical Structures in Computer Science"},{"key":"97_CR13","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, Parts I\/II. Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Information and Computation"},{"key":"97_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1006\/inco.1999.2822","volume":"156","author":"U. Nestmann","year":"2000","unstructured":"Nestmann, U.: What Is a \u2018Good\u2019 Encoding of Guarded Choice? Information and Computation\u00a0156, 287\u2013319 (2000)","journal-title":"Information and Computation"},{"key":"97_CR15","volume-title":"Principles of Programming Languages","author":"C. Palamidessi","year":"1997","unstructured":"Palamidessi, C.: Comparing the Expressive Power of the Synchronous and the Asynchronous \u03c0-Calculus. In: Principles of Programming Languages. ACM, New York (1997)"},{"key":"97_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-56610-4_62","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"D. Sangiorgi","year":"1993","unstructured":"Sangiorgi, D.: From \u03c0-Calculus to Higher-Order \u03c0-Calculus \u2013 and Back. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 151\u2013161. Springer, Heidelberg (1993)"},{"key":"97_CR17","volume-title":"The \u03c0-Calculus: A Theory of Mobile Processes","author":"D. Sangiorgi","year":"2003","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_97.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:22Z","timestamp":1605643582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_97"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11523468_97","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}