{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T08:32:24Z","timestamp":1774168344415,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2005,10,14]],"date-time":"2005-10-14T00:00:00Z","timestamp":1129248000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s00236-005-0179-x","type":"journal-article","created":{"date-parts":[[2005,10,15]],"date-time":"2005-10-15T01:03:12Z","timestamp":1129338192000},"page":"291-347","source":"Crossref","is-referenced-by-count":68,"title":["Type-based information flow analysis for the \u03c0-calculus"],"prefix":"10.1007","volume":"42","author":[{"given":"Naoki","family":"Kobayashi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,14]]},"reference":[{"issue":"5","key":"179_CR1","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1145\/324133.324266","volume":"46","author":"M. Abadi","year":"1999","unstructured":"Abadi, M.: Secrecy by typing in security protocols. J. Assoc. Comput. Mach. (JACM) 46(5), 749\u2013786 (1999)","journal-title":"J. Assoc. Comput. Mach. (JACM)"},{"key":"179_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Banerjee, A., Heintze, N., Rieck, J.G.: A core calculus of dependency. In: Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pp. 147\u2013169 (1999)","DOI":"10.1145\/292540.292555"},{"issue":"1","key":"179_CR3","doi-asserted-by":"crossref","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. Inform. Comput. 148(1), 1\u201370 (1999)","journal-title":"Inform. Comput."},{"key":"179_CR4","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Ghelli, G., Gordon, A.D.: Secrecy and group creation. In: Proceedings of CONCUR 2000. Lecture Notes in Computer Science, vol. 1877, pp. 365\u2013379. Springer-Verlag, Berlin Heidelberg New York (2000)","DOI":"10.1007\/3-540-44618-4_27"},{"issue":"7","key":"179_CR5","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1145\/359636.359712","volume":"20","author":"D.E. Denning","year":"1977","unstructured":"Denning, D.E., Denning, P.J.: Certification of programs for secure information flow. Commun. ACM 20(7), 504\u2013513 (1977)","journal-title":"Commun. ACM"},{"key":"179_CR6","doi-asserted-by":"crossref","unstructured":"Fournet, C., Gonthier, G.: The reflexive CHAM and the join-calculus. In: Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pp. 372\u2013385 (1996)","DOI":"10.1145\/237721.237805"},{"key":"179_CR7","doi-asserted-by":"crossref","unstructured":"Heintze, N., Riecke, J.: The slam calculus: programming with secrecy and integrity. In: Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pp. 365\u2013377 (1998)","DOI":"10.1145\/268946.268976"},{"key":"179_CR8","doi-asserted-by":"crossref","unstructured":"Hennessy, M., Riely, J.: Information flow vs. resource access in the information asynchronous pi-calculus. In: Proceedings of ICALP 2000. Lecture Notes in Computer Science, vol. 1853, pp. 415\u2013427. Springer-Verlag, Berlin Heidelberg New York (2000)","DOI":"10.1007\/3-540-45022-X_35"},{"key":"179_CR9","unstructured":"Hennessy, M.: The security picalculus and non-interference. J. Logic Algeb. Program. (in press)A1"},{"key":"179_CR10","doi-asserted-by":"crossref","unstructured":"Honda, K., Vasconcelos, V., Yoshida, N.: Secure information flow as typed process behaviour. In: Proceedings of European Symposium on Programming (ESOP) 2000. Lecture Notes in Computer Science, vol. 1782, pp. 180\u2013199. Springer-Verlag, Berlin Heidelberg New York (2000)","DOI":"10.1007\/3-540-46425-5_12"},{"key":"179_CR11","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N.: A uniform type structure for secure information flow. In: Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pp. 81\u201392 (2002)","DOI":"10.1145\/503272.503281"},{"key":"179_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.2000.2872","volume":"161","author":"A. Igarashi","year":"2000","unstructured":"Igarashi, A., Kobayashi, N.: Type reconstruction for linear pi-calculus with I\/O subtyping. Inform. Comput. 161, 1\u201344 (2000)","journal-title":"Inform. Comput."},{"issue":"1\u20133","key":"179_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0304-3975(03)00325-6","volume":"311","author":"A. Igarashi","year":"2004","unstructured":"Igarashi, A., Kobayashi, N.: A generic type system for the pi-calculus. Theor. Comput. Sci. 311(1\u20133), 121\u2013163 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"179_CR14","unstructured":"Kobayashi, N.: Typical: a type-based static analyzer for the pi-calculus. Tool available at http:\/\/www.kb.ecei.tohoku.ac.jp\/koba\/typical\/"},{"key":"179_CR15","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0890-5401(02)93171-8","volume":"177","author":"N. Kobayashi","year":"2002","unstructured":"Kobayashi, N.: A type system for lock-free processes. Inform. Comput. 177, 122\u2013159 (2002)","journal-title":"Inform. Comput."},{"key":"179_CR16","doi-asserted-by":"crossref","unstructured":"Kobayashi, N.: Useless-code elimination and program slicing for the pi-calculus. In: Proceedings of The First Asian Symposium on Programming Languages and Systems (APLAS'03). Lecture Notes in Computer Science, vol. 2895, pp. 55\u201372 (2003)","DOI":"10.1007\/978-3-540-40018-9_5"},{"issue":"5","key":"179_CR17","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1145\/330249.330251","volume":"21","author":"N. Kobayashi","year":"1999","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. ACM Trans. Program. Language Syst. 21(5), 914\u2013947 (1999)","journal-title":"ACM Trans. Program. Language Syst."},{"key":"179_CR18","unstructured":"Kobayashi, N., Saito, S., Sumii, E.: An implicitly-typed deadlock-free process calculus. Technical Report TR00-01, Department of Inforamtion Sciences, University of Tokyo (2000). A summary has appeared in Proceedings of CONCUR 2000, Springer LNCS1877, pp.489-503, 2000"},{"issue":"2","key":"179_CR19","first-page":"2","volume":"20","author":"N. Kobayashi","year":"2003","unstructured":"Kobayashi, N., Shirane, K.: Type-based information flow analysis for a low-level language. Comput. Software 20(2), 2\u201321 (2003). In Japanese.","journal-title":"Comput. Software"},{"issue":"4","key":"179_CR20","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/j.1096-9942.1995.tb00020.x","volume":"1","author":"N. Kobayashi","year":"1995","unstructured":"Kobayashi, N., Yonezawa, A.: Towards foundations for concurrent object-oriented programming \u2013 types and language design. Theory Pract. Object Syst. 1(4), 243\u2013268 (1995)","journal-title":"Theory Pract. Object Syst."},{"issue":"3","key":"179_CR21","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general petri net reachability problem. SIAM J. Comput. 13(3), 441\u2013461 (1984)","journal-title":"SIAM J. Comput."},{"key":"179_CR22","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"179_CR23","volume-title":"Logic and Algebra of Specification","author":"R. Milner","year":"1993","unstructured":"Milner, R.: The polyadic \u03c0-calculus: a tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. Springer-Verlag, Berlin Heidelberg New York (1993)"},{"key":"179_CR24","volume-title":"Communicating and Mobile Systems: the Pi-Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press, Cambridge (1999)"},{"issue":"5","key":"179_CR25","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S096012950007002X","volume":"6","author":"B. Pierce","year":"1996","unstructured":"Pierce, B., Sangiorgi, D.: Typing and subtyping for mobile processes. Math. Struct. Comput. Sci. 6(5), 409\u2013454 (1996)","journal-title":"Math. Struct. Comput. Sci."},{"key":"179_CR26","doi-asserted-by":"crossref","unstructured":"Pierce, B.C., Turner, D.N.: Concurrent objects in a process calculus. In: Theory and Practice of Parallel Programming (TPPP), Sendai, Japan, November 1994. Lecture Notes in Computer Science, vol. 907, pp. 187\u2013215. Springer-Verlag, Berlin Heidelberg New York (1995)","DOI":"10.1007\/BFb0026570"},{"key":"179_CR27","doi-asserted-by":"crossref","unstructured":"Pottier, F.: A simple view of type-secure information flow in the \u03c0-calculus. In: Proceedings of the 15th IEEE Computer Security Foundations Workshop, pp. 320\u2013330 (2002)","DOI":"10.1109\/CSFW.2002.1021826"},{"key":"179_CR28","doi-asserted-by":"crossref","unstructured":"Pottier, F., Simonet, V.: Information flow inference for ML. In: Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pp. 319\u2013330 (2002)","DOI":"10.1145\/503272.503302"},{"key":"179_CR29","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Mantel, H.: Static confidentiality enforcement for distributed programs. In: Proceedings of the 9th International Static Analysis Symposium. LNCS, vol. 2477, pp. 376\u2013394. Springer-Verlag, Madrid, Spain (2002)","DOI":"10.1007\/3-540-45789-5_27"},{"key":"179_CR30","volume-title":"The Pi-Calculus: A Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"179_CR31","doi-asserted-by":"crossref","unstructured":"Smith, G., Volpano, D.: Secure information flow in a multi-threaded imperative language. In: Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pp. 355\u2013364 (1998)","DOI":"10.1145\/268946.268975"},{"key":"179_CR32","doi-asserted-by":"crossref","unstructured":"Sumii, E., Kobayashi, N.: A generalized deadlock-free process calculus. In: Proceedings of Workshop on High-Level Concurrent Language (HLCL'98). ENTCS, vol. 16, No. 3, pp. 55\u201377 (1998)","DOI":"10.1016\/S1571-0661(04)00144-6"},{"issue":"3","key":"179_CR33","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/JCS-1996-42-304","volume":"4","author":"D. Volpano","year":"1996","unstructured":"Volpano, D., Smith, G., Irvine, C.: A sound type system for secure flow analysis. J. Comput. Security 4(3), 167\u2013187 (1996)","journal-title":"J. Comput. Security"},{"key":"179_CR34","doi-asserted-by":"crossref","unstructured":"Yoshida, N.: Graph types for monadic mobile processes. In: FST\/TCS'16. Lecture Notes in Computer Science, vol. 1180, pp. 371\u2013387. Springer-Verlag, Berlin Heidelberg New York (1996)","DOI":"10.1007\/3-540-62034-6_64"},{"issue":"2\/3","key":"179_CR35","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1020843229247","volume":"15","author":"S. Zdancewic","year":"2002","unstructured":"Zdancewic, S., Myers, A.C.: Secure information flow via linear continuations. Higher-Order Symbol. Comput. 15(2\/3), 209\u2013234 (2002)","journal-title":"Higher-Order Symbol. Comput."},{"key":"179_CR36","doi-asserted-by":"crossref","unstructured":"Zdancewic, S., Myers, A.C.: Observational determinism for concurrent program security. In: Proceedings of the 16th IEEE Computer Security Foundations Workshop pp. 29\u201343 (2003)","DOI":"10.1109\/CSFW.2003.1212703"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0179-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-005-0179-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0179-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T08:58:16Z","timestamp":1586509096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-005-0179-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,14]]},"references-count":36,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["179"],"URL":"https:\/\/doi.org\/10.1007\/s00236-005-0179-x","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,14]]}}}