{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:38:05Z","timestamp":1725536285026},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033582"},{"type":"electronic","value":"9783642033599"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03359-9_14","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T01:46:12Z","timestamp":1250732772000},"page":"180-195","source":"Crossref","is-referenced-by-count":0,"title":["Formalising Observer Theory for Environment-Sensitive Bisimulation"],"prefix":"10.1007","author":[{"given":"Jeremy E.","family":"Dawson","sequence":"first","affiliation":[]},{"given":"Alwen","family":"Tiu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","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"},{"issue":"4","key":"14_CR2","first-page":"267","volume":"5","author":"M. Abadi","year":"1998","unstructured":"Abadi, M., Gordon, A.D.: A bisimulation method for cryptographic protocols. Nord. J. Comput.\u00a05(4), 267\u2013303 (1998)","journal-title":"Nord. J. Comput."},{"issue":"1","key":"14_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. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"14_CR4","unstructured":"Baudet, M.: S\u00e9curit\u00e9 des protocoles cryptographiques: aspects logiques et calculatoires. PhD thesis, \u00c9cole Normale Sup\u00e9rieure de Cachan, France (2007)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/3-540-48224-5_55","volume-title":"Automata, Languages and Programming","author":"M. Boreale","year":"2001","unstructured":"Boreale, M.: Symbolic trace analysis of cryptographic protocols. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 667\u2013681. Springer, Heidelberg (2001)"},{"issue":"3","key":"14_CR6","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":"14_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)"},{"issue":"3","key":"14_CR8","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. Mathematical Structures in Computer Science\u00a015(3), 487\u2013552 (2005)","journal-title":"Mathematical Structures in Computer Science"},{"key":"14_CR9","unstructured":"Dawson, J.E., Gor\u00e9, R.: Formalising cut-admissibility for provability logic (submitted, 2009)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Dolev, D., Yao, A.: On the security of public-key protocols. IEEE Transactions on Information Theory\u00a02(29) (1983)","DOI":"10.1109\/TIT.1983.1056650"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-69407-6_33","volume-title":"Logic and Theory of Algorithms","author":"T. Kahsai","year":"2008","unstructured":"Kahsai, T., Miculan, M.: Implementing spi calculus using nominal techniques. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol.\u00a05028, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Part II. Information and Computation, 41\u201377 (1992)","DOI":"10.1016\/0890-5401(92)90009-5"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Inf.\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Inf."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-76637-7_25","volume-title":"Programming Languages and Systems","author":"A. Tiu","year":"2007","unstructured":"Tiu, A.: A trace based bisimulation for the spi calculus: An extended abstract. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol.\u00a04807, pp. 367\u2013382. Springer, Heidelberg (2007)"},{"key":"14_CR15","unstructured":"Tiu, A.: A trace based bisimulation for the spi calculus. Preprint (2009), http:\/\/arxiv.org\/pdf\/0901.2166v1"},{"key":"14_CR16","unstructured":"Tiu, A., Gor\u00e9., R.: A proof theoretic analysis of intruder theories. In: Proceedings of RTA 2009 (to appear, 2009)"},{"key":"14_CR17","first-page":"45","volume-title":"LICS","author":"C. Urban","year":"2008","unstructured":"Urban, C., Cheney, J., Berghofer, S.: Mechanizing the metatheory of LF. In: LICS, pp. 45\u201356. IEEE Computer Society, Los Alamitos (2008)"}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03359-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:48:14Z","timestamp":1558493294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03359-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033582","9783642033599"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03359-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}