{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:11Z","timestamp":1760202491311,"version":"3.30.2"},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5688,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1998]]},"DOI":"10.1016\/s1571-0661(04)00144-6","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"225-247","source":"Crossref","is-referenced-by-count":23,"title":["A Generalized Deadlock-Free Process Calculus"],"prefix":"10.1016","volume":"16","author":[{"given":"Eijiro","family":"Sumii","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB1","unstructured":"Standard ML of New Jersey version 110. Available from http:\/\/cm.bell-labs.com\/cm\/cs\/what\/smlnj\/NEWS\/110-README.html."},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB2","doi-asserted-by":"crossref","unstructured":"G\u00e9rard Boudol. Typing the use of resources in a concurrent calculus (extended abstract). In The Third Asian Computing Science Conference (ASIAN '97), volume 1345 of Lecture Notes in Computer Science, pages 239\u2013253, 1997.","DOI":"10.1007\/3-540-63875-X_56"},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Simon J. Gay. A sort inference algorithm for the polyadic \u03c0-calculus. In Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 429\u2013438, 1993.","DOI":"10.1145\/158511.158701"},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB4","unstructured":"Naoki Kobayashi. Concurrent Linear Logic Programming. PhD thesis, Department of Information Science, Graduate School of Science, University of Tokyo, 1996."},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Naoki Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2): 436\u2013482, 1998. A preliminary version appeared in Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 128\u2013139, 1997.","DOI":"10.1109\/LICS.1997.614941"},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. In Conference Record of POPL '96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 358\u2013371, 1996.","DOI":"10.1145\/237721.237804"},{"issue":"4","key":"10.1016\/S1571-0661(04)00144-6_NEWBIB7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/j.1096-9942.1995.tb00020.x","article-title":"Towards foundations for concurrent object-oriented programming \u2013- types and language design","volume":"1","author":"Kobayashi","year":"1995","journal-title":"Theory and Practice of Object Systems"},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(90)90038-J","article-title":"Proof systems for satisfiability in Hennessy-Milner logic with recursion","volume":"72","author":"Kim Larsen","year":"1990","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB9","series-title":"Logic and Algebra of Specification","article-title":"The polyadic \u03c0-calculus: a tutorial","author":"Milner","year":"1993"},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes, I, II","volume":"100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB11","doi-asserted-by":"crossref","unstructured":"Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. In Eighth Annual IEEE Symposium on Logic in Computer Science, pages 376\u2013385, 1993. Full version in Mathematical Structures in Computer Science, Vol. 6, No. 5, pages 409\u2013453, 1996.","DOI":"10.1109\/LICS.1993.287570"},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Benjamin C. Pierce and David N. Turner. Concurrent objects in a process calculus. In Takayasu Ito and Akinori Yonezawa, editors, Theory and Practice of Parallel Programming, volume 907 of Lecture Notes in Computer Science, pages 187\u2013215. Springer-Verlag, 1994.","DOI":"10.1007\/BFb0026570"},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB13","unstructured":"Benjamin C. Pierce and David N. Turner. Pict: A programming language based on the pi-calculus. Technical Report CSCI 476, Computer Science Department, Indiana University, 1997. To appear in Proof, Language and Interaction: Essays in Honour of Robin Milner, Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, MIT Press."},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB14","doi-asserted-by":"crossref","unstructured":"John H. Reppy. CML: A higher-order concurrent language. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 293\u2013305, 1991.","DOI":"10.1145\/113445.113470"},{"issue":"3","key":"10.1016\/S1571-0661(04)00144-6_NEWBIB15","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/72551.72555","article-title":"The family of concurrent logic programming languages","volume":"21","author":"Shapiro","year":"1989","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB16","unstructured":"Toshihiro Shimizu and Naoki Kobayashi. Optimization of concurrent programs using type system for deadlock-freedom. Technical report, Department of Information Science, Faculty of Science, University of Tokyo. To appear."},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB17","unstructured":"Eijiro Sumii and Naoki Kobayashi. A generalized deadlock-free process calculus. Technical report, Department of Information Science, Faculty of Science, University of Tokyo. To appear. Will be available from http:\/\/www.is.s.u-tokyo.ac.jp\/~sumii\/pub\/."},{"issue":"1","key":"10.1016\/S1571-0661(04)00144-6_NEWBIB18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF03038307","article-title":"Moded flat GHC and its message-oriented implementation technique","volume":"13","author":"Ueda","year":"1994","journal-title":"New Generation Computing"},{"issue":"2","key":"10.1016\/S1571-0661(04)00144-6_NEWBIB19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1006\/inco.1995.1018","article-title":"Objects in the \u03c0-calculus","volume":"116","author":"Walker","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00144-6_NEWBIB20","doi-asserted-by":"crossref","unstructured":"Nobuko Yoshida. Graph types for monadic mobile processes. In V. Chandru and V. Vinay, editors, Foundations of Software Technology and Theoretical Computer Science, volume 1180 of Lecture Notes in Computer Science, pages 371\u2013386. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-62034-6_64"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001446?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001446?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T01:41:55Z","timestamp":1734226915000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998]]}},"alternative-id":["S1571066104001446"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00144-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]}}}