{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:16:58Z","timestamp":1762460218165,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031167669"},{"type":"electronic","value":"9783031167676"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-16767-6_2","type":"book-chapter","created":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T16:02:40Z","timestamp":1662825760000},"page":"24-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Confluence Framework: Proving Confluence with\u00a0CONFident"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3984-2868","authenticated-orcid":false,"given":"Ra\u00fal","family":"Guti\u00e9rrez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"V\u00edtores","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9923-2108","authenticated-orcid":false,"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,11]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-02348-4_7","volume-title":"Rewriting Techniques and Applications","author":"T Aoto","year":"2009","unstructured":"Aoto, T., Yoshida, J., Toyama, Y.: Proving confluence of term rewriting systems automatically. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 93\u2013102. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02348-4_7"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-19242-5_3","volume-title":"Conditional Term Rewriting Systems","author":"N Dershowitz","year":"1988","unstructured":"Dershowitz, N., Okada, M., Sivakumar, G.: Confluence of conditional rewrite systems. In: Kaplan, S., Jouannaud, J.-P. (eds.) CTRS 1987. LNCS, vol. 308, pp. 31\u201344. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19242-5_3"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Dur\u00e1n, F., Lucas, S., Meseguer, J., March\u00e9, C., Urbain, X.: Proving termination of membership equational programs. In: Heintze, N., Sestoft, P. (eds.) Proceedings of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation 2004, Verona, Italy, 24\u201325 August 2004, pp. 147\u2013158. ACM (2004). https:\/\/doi.org\/10.1145\/1014007.1014022","DOI":"10.1145\/1014007.1014022"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-32275-7_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: combining techniques for automated termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3452, pp. 301\u2013331. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-32275-7_21"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J Giesl","year":"2006","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. J. Autom. Reasoning 37(3), 155\u2013203 (2006). https:\/\/doi.org\/10.1007\/s10817-006-9057-7","journal-title":"J. Autom. Reasoning"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Gmeiner, K., Gramlich, B., Schernhammer, F.: On soundness conditions for unraveling deterministic conditional rewrite systems. In: Tiwari, A. (ed.) 23rd International Conference on Rewriting Techniques and Applications (RTA 2012), RTA 2012, Nagoya, Japan, 28 May\u20132 June 2012. LIPIcs, vol. 15, pp. 193\u2013208. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2012). https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2012.193","DOI":"10.4230\/LIPIcs.RTA.2012.193"},{"key":"2_CR8","unstructured":"Gmeiner, K., Nishida, N., Gramlich, B.: Proving confluence of conditional term rewriting systems via unravelings. In: 2nd International Workshop on Confluence, IWC 2013, pp. 35\u201339 (2013)"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"JA Goguen","year":"1992","unstructured":"Goguen, J.A., Meseguer, J.: Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theor. Comput. Sci. 105(2), 217\u2013273 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90302-V","journal-title":"Theor. Comput. Sci."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11805618_6","volume-title":"Term Rewriting and Applications","author":"B Gramlich","year":"2006","unstructured":"Gramlich, B., Lucas, S.: Generalizing Newman\u2019s lemma for left-linear rewrite systems. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 66\u201380. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11805618_6"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-030-51054-1_27","volume-title":"Automated Reasoning","author":"R Guti\u00e9rrez","year":"2020","unstructured":"Guti\u00e9rrez, R., Lucas, S.: Automatically proving and disproving feasibility conditions. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 416\u2013435. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_27"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-030-51054-1_28","volume-title":"Automated Reasoning","author":"R Guti\u00e9rrez","year":"2020","unstructured":"Guti\u00e9rrez, R., Lucas, S.: mu-term: verify termination properties automatically (system description). In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 436\u2013447. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_28"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Guti\u00e9rrez, R., Lucas, S., V\u00edtores, M.: Confluence of conditional rewriting in logic form. In: Boja\u0144czy, M., Chekuri, C. (eds.) 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 213, pp. 44:1\u201344:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2021.44","DOI":"10.4230\/LIPIcs.FSTTCS.2021.44"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Kirchner, C., Kirchner, H.: Equational logic and rewriting. In: Siekmann, J.H. (ed.) Computational Logic, Handbook of the History of Logic, vol. 9, pp. 255\u2013282. Elsevier (2014). https:\/\/doi.org\/10.1016\/B978-0-444-51624-4.50006-X","DOI":"10.1016\/B978-0-444-51624-4.50006-X"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Lucas, S.: Proving semantic properties as first-order satisfiability. Artif. Intell. 277 (2019). https:\/\/doi.org\/10.1016\/j.artint.2019.103174","DOI":"10.1016\/j.artint.2019.103174"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Lucas, S.: Context-sensitive rewriting. ACM Comput. Surv. 53(4), 78:1\u201378:36 (2020). https:\/\/doi.org\/10.1145\/3397677","DOI":"10.1145\/3397677"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Lucas, S.: Applications and extensions of context-sensitive rewriting. J. Log. Algebr. Meth. Program. 121, 100680 (2021). https:\/\/doi.org\/10.1016\/j.jlamp.2021.100680","DOI":"10.1016\/j.jlamp.2021.100680"},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ipl.2005.05.002","volume":"95","author":"S Lucas","year":"2005","unstructured":"Lucas, S., March\u00e9, C., Meseguer, J.: Operational termination of conditional term rewriting systems. Inf. Process. Lett. 95(4), 446\u2013453 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jlamp.2015.06.001","volume":"85","author":"S Lucas","year":"2016","unstructured":"Lucas, S., Meseguer, J.: Normal forms and normal theories in conditional rewriting. J. Log. Algebr. Meth. Program. 85(1), 67\u201397 (2016). https:\/\/doi.org\/10.1016\/j.jlamp.2015.06.001","journal-title":"J. Log. Algebr. Meth. Program."},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.jlamp.2016.03.003","volume":"86","author":"S Lucas","year":"2017","unstructured":"Lucas, S., Meseguer, J.: Dependency pairs for proving termination properties of conditional term rewriting systems. J. Log. Algebr. Meth. Program. 86(1), 236\u2013268 (2017). https:\/\/doi.org\/10.1016\/j.jlamp.2016.03.003","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Lucas, S., V\u00edtores, M., Guti\u00e9rrez, R.: Proving and disproving confluence of context-sensitive rewriting. J. Log. Algebr. Meth. Program. 126, 100749 (2022). https:\/\/doi.org\/10.1016\/j.jlamp.2022.100749","DOI":"10.1016\/j.jlamp.2022.100749"},{"key":"2_CR22","unstructured":"McCune, W.: Prover9 & Mace4. Technical report (2005\u20132010). http:\/\/www.cs.unm.edu\/~mccune\/prover9\/"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01190830","volume":"5","author":"A Middeldorp","year":"1994","unstructured":"Middeldorp, A., Hamoen, E.: Completeness results for basic narrowing. Appl. Algebra Eng. Commun. Comput. 5, 213\u2013253 (1994). https:\/\/doi.org\/10.1007\/BF01190830","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Nagele, J., Felgenhauer, B., Middeldorp, A.: CSI: new evidence \u2013 a progress report. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 385\u2013397. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_24","DOI":"10.1007\/978-3-319-63046-5_24"},{"key":"2_CR25","unstructured":"Nishida, N.: CO3 (Version 2.2). In: Mirmram, S., Rocha, C. (eds.) Proceedings of the 10th International Workshop on Confluence, IWC 2021, p. 51 (2021)"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BFb0017487","volume-title":"Trees in Algebra and Programming \u2014 CAAP\u201994","author":"E Ohlebusch","year":"1994","unstructured":"Ohlebusch, E.: On the modularity of confluence of constructor-sharing term rewriting systems. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 261\u2013275. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0017487"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, New York (2002). https:\/\/doi.org\/10.1007\/978-1-4757-3661-8","DOI":"10.1007\/978-1-4757-3661-8"},{"issue":"4","key":"2_CR28","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1145\/322217.322229","volume":"27","author":"J Raoult","year":"1980","unstructured":"Raoult, J., Vuillemin, J.: Operational and semantic equivalence between recursive programs. J. ACM 27(4), 772\u2013796 (1980). https:\/\/doi.org\/10.1145\/322217.322229","journal-title":"J. ACM"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Rapp, F., Middeldorp, A.: FORT 2.0. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 81\u201388. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_6","DOI":"10.1007\/978-3-319-94205-6_6"},{"key":"2_CR30","unstructured":"Shintani, K., Hirokawa, N.: CoLL-Saigawa 1.6: a joint confluence tool. In: Mirmram, S., Rocha, C. (eds.) Proceedings of the 10th International Workshop on Confluence, IWC 2021, p. 51 (2021)"},{"key":"2_CR31","unstructured":"Sternagel, C.: CoCo 2020 participant: ConCon 1.10. In: Ayala-Rinc\u00f3n, M., Mirmram, S. (eds.) Proceedings of the 9th International Workshop on Confluence, IWC 2020, p. 65 (2020)"},{"key":"2_CR32","unstructured":"Sternagel, T.: Reliable confluence analysis of conditional term rewrite systems. Ph.D. thesis, Faculty of Mathematics, Computer Science and Physics, University of Innsbruck, August 2017"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-59200-8_56","volume-title":"Rewriting Techniques and Applications","author":"T Suzuki","year":"1995","unstructured":"Suzuki, T., Middeldorp, A., Ida, T.: Level-confluence of conditional rewrite systems with extra variables in right-hand sides. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, pp. 179\u2013193. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59200-8_56"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Toyama, Y.: On the Church-Rosser property for the direct sum of term rewriting systems. J. ACM 34(1), 128\u2013143 (1987). https:\/\/doi.org\/10.1145\/7531.7534","DOI":"10.1145\/7531.7534"},{"key":"2_CR35","unstructured":"V\u00edtores, M.: CONFident: a tool for confluence analysis of rewriting systems (master thesis). Master\u2019s thesis, Departamento de Sistemas Inform\u00e1ticos y Computaci\u00f3n. Universitat Polit\u00e8cnica de Val\u00e8ncia, Spain, April 2022"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16767-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T23:17:09Z","timestamp":1663197429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16767-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031167669","9783031167676"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16767-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lopstr2022.webs.upv.es","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","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":"8","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":"47% - 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":"3","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)"}}]}}