{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:38:14Z","timestamp":1743136694119,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031726200"},{"type":"electronic","value":"9783031726217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-72621-7_5","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T07:02:34Z","timestamp":1726729354000},"page":"54-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On\u00a0Solving\u00a0All-Path\u00a0Reachability\u00a0Problems\u00a0for Starvation\u00a0Freedom\u00a0of\u00a0Concurrent\u00a0Rewrite Systems\u00a0Under\u00a0Process\u00a0Fairness"],"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":[[2024,9,18]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-45620-1_17","volume-title":"Automated Deduction\u2014CADE-18","author":"G Audemard","year":"2002","unstructured":"Audemard, G., Bertoli, P., Cimatti, A., Korni\u0142owicz, A., Sebastiani, R.: A SAT based approach for solving formulas over Boolean and linear mathematical propositions. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 195\u2013210. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45620-1_17"},{"key":"5_CR2","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":"5_CR3","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":"5_CR4","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":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jlamp.2023.100894","volume":"135","author":"\u015e Ciob\u00e2c\u0103","year":"2023","unstructured":"Ciob\u00e2c\u0103, \u015e, Lucanu, D., Buruiana, A.: Operationally-based program equivalence proofs using LCTRSs. J. Log. Algebraic Methods Program. 135, 1\u201322 (2023). https:\/\/doi.org\/10.1016\/j.jlamp.2023.100894","journal-title":"J. Log. Algebraic Methods Program."},{"key":"5_CR6","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":"5_CR7","doi-asserted-by":"publisher","unstructured":"Fern\u00e1ndez, M.: Programming Languages and Operational Semantics - A Concise Overview. Undergraduate Topics in Computer Science. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-1-4471-6368-8","DOI":"10.1007\/978-1-4471-6368-8"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Fuhs, C., Kop, C., Nishida, N.: Verifying procedural programs via constrained rewriting induction. ACM Trans. Comput. Log. 18(2), 14:1\u201314:50 (2017). https:\/\/doi.org\/10.1145\/3060143","DOI":"10.1145\/3060143"},{"key":"5_CR9","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.\u00a0289, pp. 34\u201352. Open Publishing Association (2019)","DOI":"10.4204\/EPTCS.289.3"},{"key":"5_CR10","unstructured":"Kanazawa, Y., Nishida, N., Sakai, M.: On representation of structures and unions in logically constrained rewriting. IEICE Technical Report SS2018-38, the Institute of Electronics, Information and Communication Engineers, vol. 118, no. 385, pp. 67\u201372 (2019). In Japanese"},{"key":"5_CR11","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":"5_CR12","unstructured":"Kojima, M., Nishida, N.: On reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting. In: Ciobaca, S., Nakano, K. (eds.) Informal Proceedings of the 9th International Workshop on Rewriting Techniques for Program Transformations and Evaluation, pp. 1\u201316 (2022). https:\/\/easychair.org\/publications\/preprint\/TM7q"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-031-24841-2_11","volume-title":"Practical Aspects of Declarative Languages","author":"M Kojima","year":"2023","unstructured":"Kojima, M., Nishida, N.: From starvation freedom to all-path reachability problems in constrained rewriting. In: Hanus, M., Inclezan, D. (eds.) PADL 2023. LNCS, vol. 13880, pp. 161\u2013179. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-24841-2_11"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jlamp.2023.100903","volume":"135","author":"M Kojima","year":"2023","unstructured":"Kojima, M., Nishida, N.: Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting. J. Log. Algebraic Methods Program. 135, 1\u201319 (2023). https:\/\/doi.org\/10.1016\/j.jlamp.2023.100903","journal-title":"J. Log. Algebraic Methods Program."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"417","DOI":"10.2197\/ipsjjip.32.417","volume":"32","author":"M Kojima","year":"2024","unstructured":"Kojima, M., Nishida, N.: A sufficient condition of logically constrained term rewrite systems for decidability of all-path reachability problems with constant destinations. J. Inf. Process. 32, 417\u2013435 (2024). https:\/\/doi.org\/10.2197\/ipsjjip.32.417","journal-title":"J. Inf. Process."},{"key":"5_CR16","unstructured":"Kojima, M., Nishida, N., Matsubara, Y.: Transforming concurrent programs with semaphores into logically constrained term rewrite systems. In: Riesco, A., Nigam, V. (eds.) Informal Proceedings of the 7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation, pp. 1\u201312 (2020)"},{"key":"5_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":"5_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":"5_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":"5_CR20","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":"5_CR21","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, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-1-4757-3661-8"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"GL Peterson","year":"1981","unstructured":"Peterson, G.L.: Myths about the mutual exclusion problem. Inf. Process. Lett. 12(3), 115\u2013116 (1981). https:\/\/doi.org\/10.1016\/0020-0190(81)90106-X","journal-title":"Inf. Process. Lett."},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-52885-7_86","volume-title":"10th International Conference on Automated Deduction","author":"US Reddy","year":"1990","unstructured":"Reddy, U.S.: Term rewriting induction. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 162\u2013177. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52885-7_86"},{"issue":"6","key":"5_CR24","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 Methods Program. 79(6), 397\u2013434 (2010). https:\/\/doi.org\/10.1016\/j.jlap.2010.03.012","journal-title":"J. Log. Algebraic Methods Program."},{"key":"5_CR25","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":"5_CR26","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":"5_CR27","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. Leibniz International Proceedings in Informatics, vol.\u00a0108, pp. 30:1\u201330:18. Schloss Dagstuhl\u2013Leibniz-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","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-72621-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T07:06:29Z","timestamp":1726729589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-72621-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031726200","9783031726217"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-72621-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easychair.org\/smart-program\/RP24\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}