{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:03:28Z","timestamp":1742972608847,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030890506"},{"type":"electronic","value":"9783030890513"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89051-3_15","type":"book-chapter","created":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T09:30:38Z","timestamp":1634031038000},"page":"265-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Termination Analysis for the $$\\pi $$-Calculus by Reduction to Sequential Program Termination"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8164-0995","authenticated-orcid":false,"given":"Tsubasa","family":"Shoshi","sequence":"first","affiliation":[]},{"given":"Takuma","family":"Ishikawa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0537-0604","authenticated-orcid":false,"given":"Naoki","family":"Kobayashi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3238-9279","authenticated-orcid":false,"given":"Ken","family":"Sakayori","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8679-2747","authenticated-orcid":false,"given":"Ryosuke","family":"Sato","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2824-8708","authenticated-orcid":false,"given":"Takeshi","family":"Tsukada","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,12]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-72019-3_3","volume-title":"Programming Languages and Systems","author":"P Baillot","year":"2021","unstructured":"Baillot, P., Ghyselen, A.: Types for complexity of parallel computation in pi-calculus. In: ESOP 2021. LNCS, vol. 12648, pp. 59\u201386. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72019-3_3"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Baillot, P., Ghyselen, A., Kobayashi, N.: Sized types with usages for parallel complexity of pi-calculus processes. In: Proceedings of CONCUR 2021. LIPIcs, vol. 203, pp. 34:1\u201334:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2021.34","DOI":"10.4230\/LIPIcs.CONCUR.2021.34"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"38","DOI":"10.4204\/eptcs.101.4","volume":"101","author":"P Baltazar","year":"2012","unstructured":"Baltazar, P., Mostrous, D., Vasconcelos, V.T.: Linearly refined session types. Electron. Proc. Theoret. Comput. Sci. 101, 38\u201349 (2012). https:\/\/doi.org\/10.4204\/eptcs.101.4","journal-title":"Electron. Proc. Theoret. Comput. Sci."},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-23534-9_2","volume-title":"Fields of Logic and Computation II","author":"N Bj\u00f8rner","year":"2015","unstructured":"Bj\u00f8rner, N., Gurfinkel, A., McMillan, K., Rybalchenko, A.: Horn clause solvers for program verification. In: Beklemishev, L.D., Blass, A., Dershowitz, N., Finkbeiner, B., Schulte, W. (eds.) Fields of Logic and Computation II. LNCS, vol. 9300, pp. 24\u201351. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23534-9_2"},{"issue":"7","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1007\/s10817-020-09571-y","volume":"64","author":"A Champion","year":"2020","unstructured":"Champion, A., Chiba, T., Kobayashi, N., Sato, R.: ICE-based refinement type discovery for higher-order functional programs. J. Autom. Reason. 64(7), 1393\u20131418 (2020). https:\/\/doi.org\/10.1007\/s10817-020-09571-y","journal-title":"J. Autom. Reason."},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Proving thread termination. In: Proceedings of PLDI 2007, pp. 320\u2013330. ACM Press (2007). https:\/\/doi.org\/10.1145\/1250734.1250771","DOI":"10.1145\/1250734.1250771"},{"issue":"5","key":"15_CR7","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/1941487.1941509","volume":"54","author":"B Cook","year":"2011","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Proving program termination. Commun. ACM 54(5), 88\u201398 (2011). https:\/\/doi.org\/10.1145\/1941487.1941509","journal-title":"Commun. ACM"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Das, A., Hoffmann, J., Pfenning, F.: Parallel complexity analysis with temporal session types. Proc. ACM Program. Lang. 2(ICFP), 91:1\u201391:30 (2018). https:\/\/doi.org\/10.1145\/3236786","DOI":"10.1145\/3236786"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Das, A., Hoffmann, J., Pfenning, F.: Work analysis with resource-aware session types. In: Proceedings of LICS 2018, pp. 305\u2013314. ACM (2018). https:\/\/doi.org\/10.1145\/3209108.3209146","DOI":"10.1145\/3209108.3209146"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-78663-4_11","volume-title":"Trustworthy Global Computing","author":"R Demangeon","year":"2008","unstructured":"Demangeon, R., Hirschkoff, D., Kobayashi, N., Sangiorgi, D.: On the complexity of termination inference for processes. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol. 4912, pp. 140\u2013155. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78663-4_11"},{"issue":"7","key":"15_CR12","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.jlap.2010.07.007","volume":"79","author":"R Demangeon","year":"2010","unstructured":"Demangeon, R., Hirschkoff, D., Sangiorgi, D.: Termination in higher-order concurrent calculi. J. Log. Algebraic Methods Program. 79(7), 550\u2013577 (2010). https:\/\/doi.org\/10.1016\/j.jlap.2010.07.007","journal-title":"J. Log. Algebraic Methods Program."},{"issue":"7","key":"15_CR13","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. Info. Comput. 204(7), 1045\u20131082 (2006). https:\/\/doi.org\/10.1016\/j.ic.2006.03.002","journal-title":"Info. Comput."},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-96145-3_7","volume-title":"Computer Aided Verification","author":"G Fedyukovich","year":"2018","unstructured":"Fedyukovich, G., Zhang, Y., Gupta, A.: Syntax-guided termination analysis. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 124\u2013143. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_7"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-38088-4_13","volume-title":"NASA Formal Methods","author":"D Griffith","year":"2013","unstructured":"Griffith, D., Gunter, E.L.: LiquidPi: inferrable dependent session types. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 185\u2013197. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38088-4_13"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-662-48288-9_12","volume-title":"Static Analysis","author":"K Hashimoto","year":"2015","unstructured":"Hashimoto, K., Unno, H.: Refinement type inference via horn constraint optimization. In: Blazy, S., Jensen, T. (eds.) SAS 2015. LNCS, vol. 9291, pp. 199\u2013216. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48288-9_12"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1007\/978-3-662-49674-9_68","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Heizmann","year":"2016","unstructured":"Heizmann, M., et al.: Ultimate automizer with two-track proofs. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 950\u2013953. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_68"},{"key":"15_CR18","unstructured":"Kobayashi, N.: TyPiCal: a type-based static analyzer for the pi-calculus (2005). Tool available at https:\/\/www-kb.is.s.u-tokyo.ac.jp\/~koba\/typical\/"},{"issue":"5","key":"15_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1745312.1745313","volume":"32","author":"N Kobayashi","year":"2010","unstructured":"Kobayashi, N., Sangiorgi, D.: A hybrid type system for lock-freedom of mobile processes. ACM Trans. Prog. Lang. Syst. 32(5), 1\u201349 (2010). https:\/\/doi.org\/10.1145\/1745312.1745313","journal-title":"ACM Trans. Prog. Lang. Syst."},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10703-016-0249-4","volume":"48","author":"A Komuravelli","year":"2016","unstructured":"Komuravelli, A., Gurfinkel, A., Chaki, S.: SMT-based model checking for recursive programs. Formal Methods Syst. Des. 48(3), 175\u2013205 (2016). https:\/\/doi.org\/10.1007\/s10703-016-0249-4","journal-title":"Formal Methods Syst. Des."},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-54833-8_21","volume-title":"Programming Languages and Systems","author":"T Kuwahara","year":"2014","unstructured":"Kuwahara, T., Terauchi, T., Unno, H., Kobayashi, N.: Automatic termination verification for higher-order functional programs. In: Shao, Z. (ed.) ESOP 2014. LNCS, vol. 8410, pp. 392\u2013411. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54833-8_21"},{"key":"15_CR22","doi-asserted-by":"publisher","unstructured":"Milner, R.: The polyadic $$\\pi $$-calculus: a tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification, pp. 203\u2013246. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-3-642-58041-3_6","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"15_CR23","doi-asserted-by":"publisher","unstructured":"Podelski, A., Rybalchenko, A.: Transition invariants. In: Proceedings of LICS 2004, pp. 32\u201341 (2004). https:\/\/doi.org\/10.1109\/LICS.2004.1319598","DOI":"10.1109\/LICS.2004.1319598"},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Rondon, P.M., Kawaguchi, M., Jhala, R.: Liquid types. In: PLDI 2008, pp. 159\u2013169 (2008). https:\/\/doi.org\/10.1145\/1375581.1375602","DOI":"10.1145\/1375581.1375602"},{"issue":"1","key":"15_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129505004810","volume":"16","author":"D Sangiorgi","year":"2006","unstructured":"Sangiorgi, D.: Termination of processes. Math. Struct. Comput. Sci. 16(1), 1\u201339 (2006). https:\/\/doi.org\/10.1017\/S0960129505004810","journal-title":"Math. Struct. Comput. Sci."},{"key":"15_CR26","unstructured":"Shoshi, T., Ishikawa, T., Kobayashi, N., Sakayori, K., Sato, R., Tsukada, T.: Termination analysis for the $$\\pi $$-calculus by reduction to sequential program termination (2021). https:\/\/arxiv.org\/abs\/2109.00311. An extended version"},{"key":"15_CR27","doi-asserted-by":"publisher","unstructured":"Unno, H., Kobayashi, N.: Dependent type inference with interpolants. In: Proceedings of PPDP 2009, pp. 277\u2013288. ACM (2009). https:\/\/doi.org\/10.1145\/1599410.1599445","DOI":"10.1145\/1599410.1599445"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-49727-7_9","volume-title":"Static Analysis","author":"A Venet","year":"1998","unstructured":"Venet, A.: Automatic determination of communication topologies in mobile systems. In: Levi, G. (ed.) SAS 1998. LNCS, vol. 1503, pp. 152\u2013167. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49727-7_9"},{"issue":"2","key":"15_CR29","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. Info. Comput. 191(2), 145\u2013202 (2004). https:\/\/doi.org\/10.1016\/j.ic.2003.08.004","journal-title":"Info. Comput."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89051-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T09:58:07Z","timestamp":1634032687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89051-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030890506","9783030890513"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89051-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"12 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCrp","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}