{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:49:08Z","timestamp":1742953748971,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642197178"},{"type":"electronic","value":"9783642197185"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19718-5_19","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T10:17:15Z","timestamp":1300097835000},"page":"358-377","source":"Crossref","is-referenced-by-count":3,"title":["A Testing Theory for a Higher-Order Cryptographic Language"],"prefix":"10.1007","author":[{"given":"Vasileios","family":"Koutavas","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1145\/373243.360213","volume":"36","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. SIGPLAN Not.\u00a036(3), 104\u2013115 (2001)","journal-title":"SIGPLAN Not."},{"key":"19_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, 267\u2013303 (1998)","journal-title":"Nordic Journal of Computing"},{"issue":"1","key":"19_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. Inf. Comput.\u00a0148(1), 1\u201370 (1999)","journal-title":"Inf. Comput."},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1137\/S0097539700377864","volume":"31","author":"M. Boreale","year":"2001","unstructured":"Boreale, M., De Nicola, R., Pugliese, R.: Proof techniques for cryptographic processes. SIAM J. Comput.\u00a031(3), 947\u2013986 (2001)","journal-title":"SIAM J. Comput."},{"key":"19_CR5","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)"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","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. Structures in Comp. Sc.\u00a015(3), 487\u2013552 (2005)","journal-title":"Math. Structures in Comp. Sc."},{"issue":"1-2","key":"19_CR7","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.C.B.: Testing equivalences for processes. Theoretical Computer Science\u00a034(1-2), 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.3233\/JCS-2010-0363","volume":"18","author":"S. Delaune","year":"2010","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Symbolic bisimulation for the applied pi calculus. J. of Comp. Security\u00a018(2), 317\u2013377 (2010)","journal-title":"J. of Comp. Security"},{"issue":"2","key":"19_CR9","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":"19_CR10","first-page":"31","volume-title":"CSF 2007","author":"C. Fournet","year":"2007","unstructured":"Fournet, C., Gordon, A.D., Maffeis, S.: A type discipline for authorization in distributed systems. In: CSF 2007, pp. 31\u201348. IEEE Computer Society, Los Alamitos (2007)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Fournet, C., Gordon, A.D., Maffeis, S.: A type discipline for authorization policies. ACM Trans. Program. Lang. Syst.\u00a029(5) (2007)","DOI":"10.1145\/1275497.1275500"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jlap.2004.01.003","volume":"63","author":"M. Hennessy","year":"2005","unstructured":"Hennessy, M.: The security pi-calculus and non-interference. J. Log. Algebr. Program\u00a063(1), 3\u201334 (2005)","journal-title":"J. Log. Algebr. Program"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N.: A uniform type structure for secure information flow. ACM Trans. Program. Lang. Syst.\u00a029(6) (2007)","DOI":"10.1145\/1286821.1286822"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order pi-calculus revisited. LMCS\u00a01(1:4) (2005)","DOI":"10.2168\/LMCS-1(1:4)2005"},{"key":"19_CR15","unstructured":"Koutavas, V., Hennessy, M.: First-order reasoning for higher-order concurrency (February 2010) (manuscript)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/11944836_38","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"J. Laird","year":"2006","unstructured":"Laird, J.: Game semantics for higher-order concurrency. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 417\u2013428. Springer, Heidelberg (2006)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-540-88313-5_36","volume-title":"Computer Security - ESORICS 2008","author":"S. Maffeis","year":"2008","unstructured":"Maffeis, S., Abadi, M., Fournet, C., Gordon, A.D.: Code-carrying authorization. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol.\u00a05283, pp. 563\u2013579. Springer, Heidelberg (2008)"},{"key":"19_CR18","volume-title":"Comunicating and Mobile Systems: the \u03c0-Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Comunicating and Mobile Systems: the \u03c0-Calculus. Cambridge University Press, Cambridge (1999)"},{"key":"19_CR19","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, Univ. of Edinburgh (1992)"},{"key":"19_CR20","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 1993: Theory and Practice of Software Development","author":"D. Sangiorgi","year":"1993","unstructured":"Sangiorgi, D.: From pi-calculus to higher-order pi-calculus\u2013and back. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 151\u2013166. Springer, Heidelberg (1993)"},{"issue":"2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/inco.1996.0096","volume":"131","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: Bisimulation for higher-order process calculi. Information and Computation\u00a0131(2), 141\u2013178 (1996)","journal-title":"Information and Computation"},{"issue":"5","key":"19_CR22","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0960129598002527","volume":"8","author":"D. Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. Mathematical Structures in Comp. Sci.\u00a08(5), 447\u2013479 (1998)","journal-title":"Mathematical Structures in Comp. Sci."},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: LICS (2007)","DOI":"10.1109\/LICS.2007.17"},{"key":"19_CR24","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":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-10672-9_22","volume-title":"Programming Languages and Systems","author":"N. Sato","year":"2009","unstructured":"Sato, N., Sumii, E.: The higher-order, call-by-value applied pi-calculus. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol.\u00a05904, pp. 311\u2013326. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19718-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T01:30:36Z","timestamp":1578533436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19718-5_19"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642197178","9783642197185"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19718-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}