{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:54:51Z","timestamp":1725504891207},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540786627"},{"type":"electronic","value":"9783540786634"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78663-4_11","type":"book-chapter","created":{"date-parts":[[2008,3,8]],"date-time":"2008-03-08T06:00:01Z","timestamp":1204956001000},"page":"140-155","source":"Crossref","is-referenced-by-count":9,"title":["On the Complexity of Termination Inference for Processes"],"prefix":"10.1007","author":[{"given":"Romain","family":"Demangeon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Hirschkoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Sangiorgi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"The Terminator Project: proof tools for termination and liveness (2007), http:\/\/research.microsoft.com\/terminator\/"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1145\/1250734.1250771","volume-title":"Proc. of PLDI 2007","author":"B. Cook","year":"2007","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Proving Thread Termination. In: Proc. of PLDI 2007, pp. 320\u2013330. ACM Press, New York (2007)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Cook, B., Gotsman, A., Podelski, A., Rybalchenko, A., Vardi, M.Y.: Proving that programs eventually do something good, pp. 265\u2013276 (2007)","DOI":"10.1145\/1190215.1190257"},{"issue":"7","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.ic.2006.03.002","volume":"204","author":"Y. Deng","year":"2006","unstructured":"Deng, Y., Sangiorgi, D.: Ensuring Termination by Typability. Information and Computation\u00a0204(7), 1045\u20131082 (2006)","journal-title":"Information and Computation"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-63141-0_14","volume-title":"CONCUR\u201997: Concurrency Theory","author":"C. Fournet","year":"1997","unstructured":"Fournet, C., Laneve, C., Maranget, L., R\u00e9my, D.: Implicit Typing \u00e0 la ML for the Join-Calculus. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 196\u2013212. Springer, Heidelberg (1997)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1145\/158511.158701","volume-title":"Proc. of POPL 1993","author":"S.J. Gay","year":"1993","unstructured":"Gay, S.J.: A Sort Inference Algorithm for the Polyadic Pi-Calculus. In: Proc. of POPL 1993, pp. 429\u2013438. ACM Press, New York (1993)"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","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. Information and Computation\u00a0161(1), 1\u201344 (2000)","journal-title":"Information and Computation"},{"key":"11_CR8","unstructured":"Kobayashi, N.: TyPiCal: Type-based static analyzer for the Pi-Calculus (2007), http:\/\/www.kb.ecei.tohoku.ac.jp\/~koba\/typical\/"},{"key":"11_CR9","unstructured":"Kobayashi, N., Sangiorgi, D.: From Deadlock-Freedom and Termination to Lock-Freedom (submitted 2007)"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0167-6423(99)00011-8","volume":"35","author":"J. Rehof","year":"1999","unstructured":"Rehof, J., Mogensen, T.: Tractable Constraints in Finite Semilattices. Science of Computer Programming\u00a035(2), 191\u2013221 (1999)","journal-title":"Science of Computer Programming"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129505004810","volume":"16","author":"D. Sangiorgi","year":"2006","unstructured":"Sangiorgi, D.: Termination of Processes. Mathematical Structures in Computer Science\u00a016(1), 1\u201339 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","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":"Vasconcelos, V.T., Honda, K.: Principal Typing Schemes in a Polyadic pi-Calculus. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 524\u2013538. Springer, Heidelberg (1993)"},{"issue":"2","key":"11_CR13","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","Trustworthy Global Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78663-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:17:44Z","timestamp":1619522264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78663-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540786627","9783540786634"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78663-4_11","relation":{},"subject":[]}}