{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:15:10Z","timestamp":1762460110217,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031248405"},{"type":"electronic","value":"9783031248412"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-24841-2_11","type":"book-chapter","created":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:04:39Z","timestamp":1673222679000},"page":"161-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["From Starvation Freedom to\u00a0All-Path Reachability Problems in\u00a0Constrained Rewriting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5194-3947","authenticated-orcid":false,"given":"Misaki","family":"Kojima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8697-4970","authenticated-orcid":false,"given":"Naoki","family":"Nishida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,8]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","DOI":"10.1145\/505863.505888","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998). https:\/\/doi.org\/10.1145\/505863.505888"},{"key":"11_CR2","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11554554_8","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J Brotherston","year":"2005","unstructured":"Brotherston, J.: Cyclic proofs for first-order logic with inductive definitions. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 78\u201392. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11554554_8"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Buruian\u0103, A.S., Ciob\u00e2c\u0103, \u015e.: Reducing total correctness to partial correctness by a transformation of the language semantics. In: Niehren, J., Sabel, D. (eds.) Proceedings of the 5th International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Electronic Proceedings in Theoretical Computer Science, vol. 289, pp. 1\u201316. Open Publishing Association (2018). https:\/\/doi.org\/10.4204\/EPTCS.289.1","DOI":"10.4204\/EPTCS.289.1"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-94205-6_20","volume-title":"Automated Reasoning","author":"\u015e Ciob\u00e2c\u0103","year":"2018","unstructured":"Ciob\u00e2c\u0103, \u015e, Lucanu, D.: A coinductive approach to proving reachability properties in logically constrained term rewriting systems. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 295\u2013311. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_20"},{"key":"11_CR6","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":"11_CR7","doi-asserted-by":"publisher","unstructured":"Fern\u00e1ndez, M.: Programming Languages and Operational Semantics \u2013 A Concise Overview. Undergraduate Topics in Computer Science. Springer, London (2014). https:\/\/doi.org\/10.1007\/978-1-4471-6368-8","DOI":"10.1007\/978-1-4471-6368-8"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Fuhs, C., Kop, C., Nishida, N.: Verifying procedural programs via constrained rewriting induction. ACM Trans. Computat. Log. 18(2), 14:1\u201314:50 (2017). https:\/\/doi.org\/10.1145\/3060143","DOI":"10.1145\/3060143"},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1016\/j.jsc.2010.01.009","volume":"45","author":"T Genet","year":"2010","unstructured":"Genet, T., Rusu, V.: Equational approximations for tree automata completion. J. Symb. Comput. 45(5), 574\u2013597 (2010). https:\/\/doi.org\/10.1016\/j.jsc.2010.01.009","journal-title":"J. Symb. Comput."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/3-540-45653-8_48","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T Genet","year":"2001","unstructured":"Genet, T., Tong, V.V.T.: Reachability analysis of term rewriting systems with Timbuk. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 695\u2013706. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45653-8_48"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Rewriting Techniques and Applications","author":"F Jacquemard","year":"1996","unstructured":"Jacquemard, F.: Decidable approximations of term rewriting systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 362\u2013376. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61464-8_65"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Kanazawa, Y., Nishida, N.: On transforming functions accessing global variables into logically constrained term rewriting systems. In: Niehren, J., Sabel, D. (eds.) Proceedings of the 5th International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Electronic Proceedings in Theoretical Computer Science, vol. 289, pp. 34\u201352. Open Publishing Association (2019)","DOI":"10.4204\/EPTCS.289.3"},{"key":"11_CR13","unstructured":"Kanazawa, Y., Nishida, N., Sakai, M.: On representation of structures and unions in logically constrained rewriting. In: IEICE Technical Report SS2018-38, IEICE 2019, vol. 118, no. 385, pp. 67\u201372 (2019). In Japanese"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-030-32304-2_20","volume-title":"Static Analysis","author":"N Kobayashi","year":"2019","unstructured":"Kobayashi, N., Nishikawa, T., Igarashi, A., Unno, H.: Temporal verification of programs via first-order fixpoint logic. In: Chang, B.-Y.E. (ed.) SAS 2019. LNCS, vol. 11822, pp. 413\u2013436. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_20"},{"key":"11_CR15","unstructured":"Kojima, M., Nishida, N.: On reducing non-occurrence of specified runtime errors to all-path reachability problems. In: Informal Proceedings of the 9th International Workshop on Rewriting Techniques for Program Transformations and Evaluation, pp. 1\u201316 (2022)"},{"key":"11_CR16","unstructured":"Kojima, M., Nishida, N., Matsubara, Y.: Transforming concurrent programs with semaphores into logically constrained term rewrite systems. In: Informal Proceedings of the 7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation. pp. 1\u201312 (2020)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-40885-4_24","volume-title":"Frontiers of Combining Systems","author":"C Kop","year":"2013","unstructured":"Kop, C., Nishida, N.: Term rewriting with logical constraints. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS (LNAI), vol. 8152, pp. 343\u2013358. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40885-4_24"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-319-12736-1_18","volume-title":"Programming Languages and Systems","author":"C Kop","year":"2014","unstructured":"Kop, C., Nishida, N.: Automatic constrained rewriting induction towards verifying procedural programs. In: Garrigue, J. (ed.) APLAS 2014. LNCS, vol. 8858, pp. 334\u2013353. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12736-1_18"},{"key":"11_CR19","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":"11_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-66167-4_8","volume-title":"Frontiers of Combining Systems","author":"M Naaf","year":"2017","unstructured":"Naaf, M., Frohn, F., Brockschmidt, M., Fuhs, C., Giesl, J.: Complexity analysis for term rewriting by integer transition systems. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 132\u2013150. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66167-4_8"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-03592-1_18","volume-title":"Verified Software. Theories, Tools, and Experiments","author":"N Nishida","year":"2018","unstructured":"Nishida, N., Winkler, S.: Loop detection by logically constrained term rewriting. In: Piskac, R., R\u00fcmmer, P. (eds.) VSTTE 2018. LNCS, vol. 11294, pp. 309\u2013321. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03592-1_18"},{"key":"11_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced Topics in Term Rewriting","author":"E Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, New York (2002). https:\/\/doi.org\/10.1007\/978-1-4757-3661-8"},{"issue":"6","key":"11_CR23","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.jlap.2010.03.012","volume":"79","author":"G Rosu","year":"2010","unstructured":"Rosu, G., Serbanuta, T.: An overview of the K semantic framework. J. Log. Algebraic Program. 79(6), 397\u2013434 (2010). https:\/\/doi.org\/10.1016\/j.jlap.2010.03.012","journal-title":"J. Log. Algebraic Program."},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-08918-8_29","volume-title":"Rewriting and Typed Lambda Calculi","author":"A \u015etef\u0103nescu","year":"2014","unstructured":"\u015etef\u0103nescu, A., Ciob\u00e2c\u0103, \u015e, Mereuta, R., Moore, B.M., \u015eerb\u0103nut\u0103, T.F., Ro\u015fu, G.: All-path reachability logic. In: Dowek, G. (ed.) RTA 2014. LNCS, vol. 8560, pp. 425\u2013440. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08918-8_29"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Stefanescu, A., Ciob\u00e2c\u0103, \u015e., Mereuta, R., Moore, B.M., Serbanuta, T., Rosu, G.: All-path reachability logic. Log. Methods Comput. Sci. 15(2) (2019). https:\/\/doi.org\/10.23638\/LMCS-15(2:5)2019","DOI":"10.23638\/LMCS-15(2:5)2019"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/10721975_17","volume-title":"Rewriting Techniques and Applications","author":"T Takai","year":"2000","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833, pp. 246\u2013260. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10721975_17"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Tsukada, T., Unno, H.: Software model-checking as cyclic-proof search. Proc. ACM Program. Lang. 6(POPL), 1\u201329 (2022). https:\/\/doi.org\/10.1145\/3498725","DOI":"10.1145\/3498725"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Winkler, S., Middeldorp, A.: Completion for logically constrained rewriting. In: Kirchner, H. (ed.) Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction. LIPIcs, vol. 108, pp. 30:1\u201330:18. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2018.30","DOI":"10.4230\/LIPIcs.FSCD.2018.30"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24841-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T14:09:00Z","timestamp":1673273340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24841-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031248405","9783031248412"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24841-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston , MA","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl23.sigplan.org\/home\/PADL-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","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":"15","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":"4","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":"42% - 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":"4","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)"}}]}}