{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:05Z","timestamp":1725486245988},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_29","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:53:52Z","timestamp":1181350432000},"page":"417-433","source":"Crossref","is-referenced-by-count":10,"title":["Linearity and Bisimulation"],"prefix":"10.1007","author":[{"given":"Nobuko","family":"Yoshida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kohei","family":"Honda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Berger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"issue":"5","key":"29_CR1","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/324133.324266","volume":"46","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Secrecy by typing in security protocols. Journal of the ACM, 46(5):749\u2013786, 1999.","journal-title":"Journal of the ACM"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Secrecy in programming-language semantics, MFPS XV, ENTCS, 20 (April 1999).","DOI":"10.1016\/S1571-0661(04)80068-9"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Abadi, M., Banerjee, A., Heintze, N. and Riecke, J., A core calculus of dependency, POPL\u201999, ACM, 1999.","DOI":"10.1145\/292540.292555"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R. and Malacaria, P., Full Abstraction for PCF. Info. & Comp. 163(2000), 409\u2013470.","journal-title":"Info. & Comp."},{"key":"29_CR5","unstructured":"Boreale, M. and Sangiorgi, D. Bisimulation in name-passing calculi without matching. LICS\u201998, IEEE, 1998."},{"key":"29_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-45413-6_7","volume-title":"TLCA\u201901","author":"M. Berger","year":"2001","unstructured":"Berger, M., Honda, K. and Yoshida, N., Sequentiality and the \u03c0-Calculus, TLCA\u201901, LNCS 2044, 29\u201345, Springer, 2001. The full version available at http:\/\/www.dcs.qmw.ac.uk\/~kohei ."},{"key":"29_CR7","series-title":"Lect Notes Comput Sci","volume-title":"ICALP\u201901","author":"G. Boudol","year":"2001","unstructured":"Boudol, G. and Castellani, I., Noninterference for Concurrent Programs, ICALP\u201901, LNCS, Springer, 2001."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1145\/359636.359712","volume":"20","author":"D. Denning","year":"1997","unstructured":"Denning, D. and Denning, P., Certification of programs for secure information flow. Communication of ACM, ACM, 20:504\u2013513, 1997.","journal-title":"Communication of ACM"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Focardi, R. and Gorrieri, R., The compositional security checker: A tool for the verification of information flow security properties. IEEE Transactions on Software Engineering, 23(9), 1997.","DOI":"10.1109\/32.629493"},{"key":"29_CR10","series-title":"Lect Notes Comput Sci","volume-title":"ICALP\u201900","author":"R. Focardi","year":"2000","unstructured":"Focardi, R., Gorrieri, R. and Martinelli, F., Non-interference for the analysis of cryptographic protocols. ICALP\u201900, LNCS 1853, Springer, 2000."},{"key":"29_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-49099-X_6","volume-title":"ESOP\u201999","author":"S. Gay","year":"1999","unstructured":"Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP\u201999, LNCS 1576, 74\u201390, Springer, 1999."},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y., Linear Logic, TCS, 50, 1\u2013102, 1987.","journal-title":"TCS"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Hennessy, M. and Rathke, J., Typed behavioural equivalences for processes in the presence of subtyping, To appear in Proc. CATS 2002.","DOI":"10.1016\/S1571-0661(04)00309-3"},{"key":"29_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-45022-X_35","volume-title":"ICALP\u201900","author":"M. Hennessy","year":"2000","unstructured":"Hennessy, M. and Riely, J., Information flow vs resource access in the asynchronous pi-calculus, ICALP\u201900, LNCS 1853, 415\u2013427, Springer, 2000."},{"key":"29_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/3-540-57208-2_35","volume-title":"CONCUR\u201993","author":"K. Honda","year":"1993","unstructured":"Honda, K., Types for Dyadic Interaction. CONCUR\u201993, LNCS 715, 509\u2013523, 1993."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Honda, K., Composing Processes, POPL\u201996, 344\u2013357, ACM, 1996.","DOI":"10.1145\/237721.237802"},{"key":"29_CR17","unstructured":"Honda, K., Notes on Linear Typing for Free Outputs, May, 2001."},{"key":"29_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/BFb0053567","volume-title":"ESOP\u201998","author":"K. Honda","year":"1998","unstructured":"Honda, K., Kubo, M. and Vasconcelos, V., Language Primitives and Type Discipline for Structured Communication-Based Programming. ESOP\u201998, LNCS 1381, 122\u2013138. Springer-Verlag, 1998."},{"key":"29_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"ECOOP\u201991","author":"K. Honda","year":"1991","unstructured":"Honda, K. and Tokoro, M. An object calculus for asynchronous communication. ECOOP\u201991, LNCS 512, 133\u2013147, 1991."},{"key":"29_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-46425-5_12","volume-title":"ESOP\u201900","author":"K. Honda","year":"2000","unstructured":"Honda, K., Vasconcelos, V. and Yoshida, N., Secure Information Flow as Typed Process Behaviour, ESOP\u201900, LNCS 1782, 180\u2013199, 2000."},{"key":"29_CR21","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"151","author":"K. Honda","year":"1995","unstructured":"Honda, K. and Yoshida, N. On Reduction-Based Process Semantics. TCS, 151, 437\u2013486, 1995.","journal-title":"TCS"},{"issue":"1999","key":"29_CR22","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0304-3975(99)00039-0","volume":"221","author":"K. Honda","year":"1999","unstructured":"Honda, K. and Yoshida, N., Game-theoretic analysis of call-by-value computation. TCS, 221 (1999), 393\u2013456, 1999.","journal-title":"TCS"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Honda, K. and Yoshida, N., A uniform type structure for secure information flow, To appear in POPL\u201902, ACM, 2002.","DOI":"10.1145\/503272.503281"},{"issue":"2000","key":"29_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"M. Hyland","year":"2000","unstructured":"Hyland, M. and Ong, L., \u201cOn Full Abstraction for PCF\u201d: I, II and III. Info. & Comp. 163(2000), 285\u2013408, 2000.","journal-title":"Info. & Comp."},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Pierce, B., and Turner, D., Linearity and the \u03c0-calculus, POPL\u201996, 358\u2013371, 1996.","DOI":"10.1145\/237721.237804"},{"issue":"2","key":"29_CR26","first-page":"119","volume":"2","author":"R. Milner","year":"1992","unstructured":"Milner, R., Functions as Processes. MSCS, 2(2), 119\u2013146, CUP, 1992.","journal-title":"MSCS"},{"key":"29_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"ICALP\u201992","author":"R. Milner","year":"1992","unstructured":"Milner, R. and Sangiorgi, D., Barbed Bisimulation, ICALP\u201992, LNCS 623, 685\u2013695, Springer, 1992."},{"key":"29_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/3-540-63165-8_188","volume-title":"ICALP\u201997","author":"A. Philippou","year":"1997","unstructured":"Philippou, A. and Walker, D., On confluence in the \u03c0-Calculus, ICALP\u201997, LNCS 1256, 314\u2013324, Springer, 1997."},{"issue":"2","key":"29_CR29","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(96)00075-8","volume":"167","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D. \u03c0-calculus, internal mobility, and agent-passing calculi. TCS, 167(2):235\u2013271, 1996.","journal-title":"TCS"},{"key":"29_CR30","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0304-3975(99)00040-7","volume":"221","author":"D. Sangiorgi","year":"1999","unstructured":"Sangiorgi, D., The name discipline of uniform receptiveness, TCS, 221, 457\u2013493, 1999.","journal-title":"TCS"},{"key":"29_CR31","series-title":"Lect Notes Comput Sci","volume-title":"ESOP\u201999","author":"A. Sabelfield","year":"1999","unstructured":"Sabelfield, A. and Sands, D. A per model of secure information flow in sequential programs. ESOP\u201999, LNCS 1576, Springer, 1999."},{"key":"29_CR32","doi-asserted-by":"crossref","unstructured":"Smith, G. and Volpano, D., Secure information flow in a multi-threaded imperative language, 355\u2013364, POPL\u201998, ACM, 1998.","DOI":"10.1145\/268946.268975"},{"key":"29_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/BFb0052178","volume-title":"ECOOP\u201994","author":"V. Vasconcelos","year":"1994","unstructured":"Vasconcelos, V., Typed concurrent objects. ECOOP\u201994, LNCS 821, 100\u2013117. Springer, 1994."},{"key":"29_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/3-540-62034-6_64","volume-title":"FST\/TCS\u201916","author":"N. Yoshida","year":"1996","unstructured":"Yoshida, N. Graph Types for Mobile Processes. FST\/TCS\u201916, LNCS 1180, 371\u2013386, Springer, 1996."},{"key":"29_CR35","unstructured":"Yoshida, N., Berger, M. and Honda, K., Strong Normalisation in the \u03c0-Calculus, LICS\u201901, IEEE, 2001. The full version as MCS technical report, 2001-09, University of Leicester, 2001. Available at http:\/\/www.mcs.le.ac.uk\/~nyoshida\/paper.html ."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45931-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:19:40Z","timestamp":1556479180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}