{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:10:08Z","timestamp":1775873408796,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540373766","type":"print"},{"value":"9783540373773","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_16","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T15:59:29Z","timestamp":1154534369000},"page":"233-247","source":"Crossref","is-referenced-by-count":98,"title":["A New Type System for Deadlock-Free Processes"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Kobayashi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Deng, Y., Sangiorgi, D.: Ensuring termination by typability. In: Proceedings of IFIP TCS 2004, pp. 619\u2013632 (2004)","DOI":"10.1007\/1-4020-8141-3_47"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Feret, J.: Abstract interpretation of mobile systems. Journal of Logic and Algebraic Programming\u00a063(1) (2005)","DOI":"10.1016\/j.jlap.2004.01.005"},{"key":"16_CR3","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":"16_CR4","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\/"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1145\/276393.278524","volume":"20","author":"N. Kobayashi","year":"1998","unstructured":"Kobayashi, N.: A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems\u00a020(2), 436\u2013482 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR6","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. Information and Computation\u00a0177, 122\u2013159 (2002)","journal-title":"Information and Computation"},{"issue":"4-5","key":"16_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00236-005-0179-x","volume":"42","author":"N. Kobayashi","year":"2005","unstructured":"Kobayashi, N.: Type-based information flow analysis for the pi-calculus. Acta Informatica\u00a042(4-5), 291\u2013347 (2005)","journal-title":"Acta Informatica"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Kobayashi, N.: A new type system for deadlock-free processes (2006), Full version available from: http:\/\/www.kb.ecei.tohoku.ac.jp\/~koba\/","DOI":"10.1007\/11817949_16"},{"issue":"5","key":"16_CR9","doi-asserted-by":"publisher","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 Transactions on Programming Languages and Systems\u00a021(5), 914\u2013947 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"#cr-split#-16_CR10.1","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Saito, S., Sumii, E.: An implicitly-typed deadlock-free process calculus. Technical Report TR00-01, Dept. Info. Sci., Univ. of Tokyo (January 2000);","DOI":"10.1007\/3-540-44618-4_35"},{"key":"#cr-split#-16_CR10.2","doi-asserted-by":"crossref","unstructured":"A summary has appeared In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 489\u2013503. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-44618-4_35"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0032030","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1990","unstructured":"Milner, R.: Function as processes. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 167\u2013180. Springer, Heidelberg (1990)"},{"key":"16_CR12","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, Heidelberg (1993)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Pierce, B., Sangiorgi, D.: Typing and subtyping for mobile processes. In: Proceedings of IEEE Symposium on Logic in Computer Science, pp. 376\u2013385 (1993)","DOI":"10.1109\/LICS.1993.287570"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Sumii, E., Kobayashi, N.: A generalized deadlock-free process calculus. In: Proc. of Workshop on High-Level Concurrent Language (HLCL 1998). ENTCS, vol.\u00a016(3), pp. 55\u201377 (1998)","DOI":"10.1016\/S1571-0661(04)00144-6"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/3-540-62034-6_64","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"N. Yoshida","year":"1996","unstructured":"Yoshida, N.: Graph types for monadic mobile processes. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 371\u2013387. Springer, Heidelberg (1996)"},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ic.2003.08.004","volume":"191","author":"N. Yoshida","year":"2004","unstructured":"Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the pi-calculus. Information and Computation\u00a0191(2), 145\u2013202 (2004)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:15:46Z","timestamp":1605626146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11817949_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}