{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:24:49Z","timestamp":1742955889290,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031712937"},{"type":"electronic","value":"9783031712944"}],"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-71294-4_12","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:03:47Z","timestamp":1725631427000},"page":"202-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rewriting Induction for\u00a0Higher-Order Constrained Term Rewriting Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-2382-0559","authenticated-orcid":false,"given":"Kasper","family":"Hagens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6337-2544","authenticated-orcid":false,"given":"Cynthia","family":"Kop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-662-53413-7_8","volume-title":"Static Analysis","author":"E De Angelis","year":"2016","unstructured":"De Angelis, E., Fioravanti, F., Pettorossi, A., Proietti, M.: Relational verification through horn clause transformation. In: Rival, X. (ed.) SAS 2016. LNCS, vol. 9837, pp. 147\u2013169. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53413-7_8"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Aoto, T., Nishida, N., Sch\u00f6pf, J.: Equational theories and validity for logically constrained term rewriting. In: Proceedings of the FSCD\u00a02024. LIPIcs, vol.\u00a0299, pp. 31:1\u201331:21 (2024). https:\/\/doi.org\/10.4230\/LIPICS.FSCD.2024.31","DOI":"10.4230\/LIPICS.FSCD.2024.31"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Aoto, T., Yamada, T., Chiba, Y.: Natural inductive theorems for higher-order rewriting. In: Proceedings of the RTA\u00a02011. LIPIcs, vol.\u00a010, pp. 107\u2013121 (2011). https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2011.107","DOI":"10.4230\/LIPIcs.RTA.2011.107"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-25979-4_19","volume-title":"Rewriting Techniques and Applications","author":"T Aoto","year":"2004","unstructured":"Aoto, T., Yamada, T., Toyama, Y.: Inductive theorems for higher-order rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 269\u2013284. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25979-4_19"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Chiba, Y., Aoto, T., Toyama, Y.: Program transformation templates for tupling based on term rewriting. IEICE Trans. Inf. Syst. E93-D(5), 963\u2013973 (2010). https:\/\/doi.org\/10.1587\/transinf.E93.D.963","DOI":"10.1587\/transinf.E93.D.963"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-030-32304-2_12","volume-title":"Static Analysis","author":"D Delmas","year":"2019","unstructured":"Delmas, D., Min\u00e9, A.: Analysis of software patches using numerical abstract interpretation. In: Chang, B.-Y.E. (ed.) SAS 2019. LNCS, vol. 11822, pp. 225\u2013246. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_12"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-31365-3_20","volume-title":"Automated Reasoning","author":"S Falke","year":"2012","unstructured":"Falke, S., Kapur, D.: Rewriting induction + linear arithmetic = decision procedure. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 241\u2013255. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31365-3_20"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Felsing, D., Grebing, S., Klebanov, V., R\u00fcmmer, P., Ulbrich, M.: Automating regression verification. In: Proceedings of the ASE\u00a02014, pp. 349\u2013360. ACM (2014). https:\/\/doi.org\/10.1145\/2642937.2642987","DOI":"10.1145\/2642937.2642987"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Fuhs, C., Kop, C., Nishida, N.: Verifying procedural programs via constrained rewriting induction. ACM Trans. Comput. Logic (TOCL) 18(2), 14:1\u201314:50 (2017). https:\/\/doi.org\/10.1145\/3060143","DOI":"10.1145\/3060143"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00236-008-0075-2","volume":"45","author":"B Godlin","year":"2008","unstructured":"Godlin, B., Strichman, O.: Inference rules for proving the equivalence of recursive procedures. Acta Informatica 45(6), 403\u2013439 (2008). https:\/\/doi.org\/10.1007\/s00236-008-0075-2","journal-title":"Acta Informatica"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Guo, L., Hagens, K., Kop, C., Vale, D.: Higher-order constrained dependency pairs for (universal) computability. In: Proceedings of the MFCS\u00a02024 (2024, to Appear). https:\/\/doi.org\/10.48550\/arXiv.2406.19379","DOI":"10.48550\/arXiv.2406.19379"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Guo, L., Kop, C.: Higher-order LCTRSs and their termination. In: Weirich, S. (ed.) ESOP 2024. LNCS, vol. 14577, pp. 331\u2013357. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57267-8_13","DOI":"10.1007\/978-3-031-57267-8_13"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Hagens, K., Kop, C.: Rewriting induction for higher-order constrained term rewriting systems (2024). https:\/\/www.cs.ru.nl\/~cynthiakop\/lopstr24.pdf; pre-editing copy of this paper including appendix","DOI":"10.1007\/978-3-031-71294-4_12"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Huth, M., Ryan, M.D.: Modelling and Reasoning About Systems. Cambridge University Press (2004). https:\/\/doi.org\/10.1017\/CBO9780511810275","DOI":"10.1017\/CBO9780511810275"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Koike, H., Toyama, Y.: Inductionless induction and rewriting induction. Comput. Softw. 17(6), 509\u2013520 (2000). https:\/\/doi.org\/10.11309\/jssst.17.509. (in Japanese)","DOI":"10.11309\/jssst.17.509"},{"key":"12_CR16","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-642-40885-4_24"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Kop, C., Nishida, N.: Constrained term rewriting tooL. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 549\u2013557. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48899-7_38","DOI":"10.1007\/978-3-662-48899-7_38"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Kop, C., Raamsdonk, F.v.: Dynamic dependency pairs for algebraic functional systems. LMCS 8(2), 1\u201351 (2012). https:\/\/doi.org\/10.2168\/LMCS-8(2:10)2012","DOI":"10.2168\/LMCS-8(2:10)2012"},{"key":"12_CR19","unstructured":"Kusakari, K.: On proving termination of term rewriting systems with higher-order variables. IPSJ Trans. Program. 42(7), 35\u201345 (2001). http:\/\/id.nii.ac.jp\/1001\/00016864\/"},{"key":"12_CR20","unstructured":"Nakabayashi, N., Nishida, N., Kusakari, K., Sakabe, T., Sakai, M.: Lemma generation method in rewriting induction for constrained term rewriting systems. Comput. Softw. 28(1), 173\u2013189 (2010). https:\/\/www.trs.css.i.nagoya-u.ac.jp\/crisys\/nakabayashi10.pdf"},{"key":"12_CR21","unstructured":"Nishida, N., Kojima, M., Kato, T.: On transforming imperative programs into logically constrained term rewrite systems via injective functions from configurations to terms. In: Proceedings of the WPTE\u00a02022 (2022). https:\/\/wvvw.easychair.org\/publications\/preprint_download\/DbM2"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Partush, N., Yahav, E.: Abstract semantic differencing via speculative correlation. In: Proceedings of the OOPSLA\u00a02014, pp. 811\u2013828. ACM (2014). https:\/\/doi.org\/10.1145\/2660193.2660245","DOI":"10.1145\/2660193.2660245"},{"key":"12_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"}],"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-71294-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T21:15:14Z","timestamp":1732742114000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71294-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031712937","9783031712944"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71294-4_12","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":"7 September 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.fm24.polimi.it\/?page_id=63#lopstrppdp2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}