{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:44Z","timestamp":1761611204568},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_27","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:20:53Z","timestamp":1178371253000},"page":"365-389","source":"Crossref","is-referenced-by-count":11,"title":["Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Kobayashi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"G. Boudol. Typing the use of resources in a concurrent calculus. In Proceedings of ASIAN\u201997, pages 239\u2013253, 1997.","DOI":"10.1007\/3-540-63875-X_56"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"K. Crary and S. Weirich. Resource bound certification. In Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pages 184\u2013198, 2000.","DOI":"10.1145\/325694.325716"},{"key":"27_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-48320-9_21","volume-title":"CONCUR\u201999","author":"C. Flanagan","year":"1999","unstructured":"C. Flanagan and M. Abadi. Object types against races. In CONCUR\u201999, LNCS 1664, pages 288\u2013303. Springer-Verlag, 1999."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"S. J. Gay. A sort inference algorithm for the polyadic \u03c0-calculus. In Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pages 429\u2013438, 1993.","DOI":"10.1145\/158511.158701"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"M. Hofmann. Linear types and non-size-increasing polynomial time computation. In Proceedings of IEEE Symposium on Logic in Computer Science, pages 464\u2013473, 1999.","DOI":"10.1109\/LICS.1999.782641"},{"issue":"2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1145\/276393.278524","volume":"20","author":"N. Kobayashi","year":"1998","unstructured":"N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436\u2013482, 1998. A preliminary summary appeared in Proceedings of LICS\u201997, pages 128\u2013139.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"N. Kobayashi. Quasi-linear types. In Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pages 29\u201342, 1999.","DOI":"10.1145\/292540.292546"},{"key":"27_CR9","unstructured":"N. Kobayashi. A livelock-free typed process calculus. Technical report, Dept. Info. Sci., Univ. of Tokyo, 2000. To appear. Available at http:\/\/www.yl.is.s.utokyo.ac.jp\/~koba\/publications.html ."},{"issue":"5","key":"27_CR10","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1145\/330249.330251","volume":"21","author":"N. Kobayashi","year":"1999","unstructured":"N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. ACM Transactions on Programming Languages and Systems, 21(5):914\u2013947, 1999. Preliminary summary appeared in Proceedings of POPL\u201996, pp.358-371.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"27_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44466-1","volume-title":"Technical Report TR00-01","author":"N. Kobayashi","year":"2000","unstructured":"N. Kobayashi, S. Saito, and E. Sumii. An implicitly-typed deadlock-free process calculus. Technical Report TR00-01, Dept. Info. Sci., Univ. of Tokyo, January 2000. Available at http:\/\/www.yl.is.s.u-tokyo.ac.jp\/~koba\/publications.html . A summary will appear in Proceedings of CONCUR 2000, LNCS, Springer-Verlag."},{"issue":"4","key":"27_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/j.1096-9942.1995.tb00020.x","volume":"1","author":"N. Kobayashi","year":"1995","unstructured":"N. Kobayashi and A. Yonezawa. Towards foundations for concurrent object-Oriented programming-types and language design. Theory and Practice of Object Systems, 1(4):243\u2013268, 1995.","journal-title":"Theory and Practice of Object Systems"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"R. Milner. The polyadic \u03c0-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"27_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I, II. Information and Computation, 100:1\u201377, September 1992.","journal-title":"Information and Computation"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"U. Nestmann. What is a \u2018good\u2019 encoding of guarded choice? In EXPRESS\u201997, volume 7 of ENTCS. Elsevier Science Publishers, September 1997.","DOI":"10.7146\/brics.v4i45.19266"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"S. Peyton Jones. Concurrent Haskell. In Proceedings of ACM SIGPLAN\/SIGACT Symposium on Principles of Programming Languages, pages 295\u2013308, 1996.","DOI":"10.1145\/237721.237794"},{"issue":"5","key":"27_CR17","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S096012950007002X","volume":"6","author":"B. Pierce","year":"1996","unstructured":"B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409\u2013454, 1996.","journal-title":"Mathematical Structures in Computer Science"},{"key":"27_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BFb0026570","volume-title":"Theory and Practice of Parallel Programming (TPPP), Sendai, Japan (Nov. 1994)","author":"B. C. Pierce","year":"1995","unstructured":"B. C. Pierce and D. N. Turner. Concurrent objects in a process calculus. In Theory and Practice of Parallel Programming (TPPP), Sendai, Japan (Nov. 1994), LNCS 907, pages 187\u2013215. Springer-Verlag, 1995."},{"key":"27_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0053387","volume-title":"Proceedings of ECOOP\u201997","author":"F. Puntigam","year":"1997","unstructured":"F. Puntigam. Coordination requirements expressed in types for active objects. In Proceedings of ECOOP\u201997, LNCS 1241, pages 367\u2013388, 1997."},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"F. Puntigam and C. Peter. Changeable interfaces and promised messages for concurrent components. In Proceedings of the 1999 ACM Symposium on Applied Computing, pages 141\u2013145, 1999.","DOI":"10.1145\/298151.298223"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"J. H. Reppy. CML: A higher-order concurrent language. In Proceedings of the ACM SIGPLAN\u201991 Conference on Programming Language Design and Implementation, pages 293\u2013305, 1991.","DOI":"10.1145\/113446.113470"},{"key":"27_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/3-540-63165-8_187","volume-title":"Proceedings of ICALP\u201997","author":"D. Sangiorgi","year":"1997","unstructured":"D. Sangiorgi. The name discipline of uniform receptiveness (extended abstract). In Proceedings of ICALP\u201997, LNCS 1256, pages 303\u2013313, 1997."},{"key":"27_CR23","first-page":"55","volume":"16","author":"E. Sumii","year":"1998","unstructured":"E. Sumii and N. Kobayashi. A generalized deadlock-free process calculus. In Proc. of Workshop on High-Level Concurrent Language (HLCL\u201998), volume 16(3) of ENTCS, pages 55\u201377, 1998.","journal-title":"Proc. of Workshop on High-Level Concurrent Language (HLCL\u201998)"},{"key":"27_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1007\/3-540-57208-2_36","volume-title":"CONCUR\u201993","author":"V. T. Vasconcelos","year":"1993","unstructured":"V. T. Vasconcelos and K. Honda. Principal typing schemes in a polyadic \u03c0-calculus. In CONCUR\u201993, LNCS 715, pages 524\u2013538. Springer-Verlag, 1993."},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"A. Yonezawa and M. Tokoro. Object-Oriented Concurrent Programming. The MIT Press, 1987.","DOI":"10.1145\/28697.28722"},{"key":"27_CR26","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":"N. Yoshida. Graph types for monadic mobile processes. In FST\/TCS\u201916, LNCS 1180, pages 371\u2013387. Springer-Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T19:14:15Z","timestamp":1587496455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}