{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:11:38Z","timestamp":1762459898037,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030510534"},{"type":"electronic","value":"9783030510541"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51054-1_28","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T19:02:39Z","timestamp":1593457359000},"page":"436-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["mu-term: Verify Termination Properties Automatically (System Description)"],"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"}]},{"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":[[2020,6,24]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-540-89439-1_44","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"B Alarc\u00f3n","year":"2008","unstructured":"Alarc\u00f3n, B., et al.: Improving context-sensitive dependency pairs. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 636\u2013651. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-89439-1_44"},{"issue":"8","key":"28_CR2","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.ic.2010.03.003","volume":"208","author":"B Alarc\u00f3n","year":"2010","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Lucas, S.: Context-sensitive dependency pairs. Inf. Comput. 208(8), 922\u2013968 (2010). \nhttps:\/\/doi.org\/10.1016\/j.ic.2010.03.003","journal-title":"Inf. Comput."},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-17796-5_12","volume-title":"Algebraic Methodology and Software Technology","author":"B Alarc\u00f3n","year":"2011","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Lucas, S., Navarro-Marset, R.: Proving termination properties with mu-term. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol. 6486, pp. 201\u2013208. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-17796-5_12"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-16310-4_4","volume-title":"Rewriting Logic and Its Applications","author":"B Alarc\u00f3n","year":"2010","unstructured":"Alarc\u00f3n, B., Lucas, S., Meseguer, J.: A dependency pair framework for $${A} \\vee {C}$$-termination. In: \u00d6lveczky, P.C. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 35\u201351. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-16310-4_4"},{"issue":"1\u20132","key":"28_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1\u20132), 133\u2013178 (2000). \nhttps:\/\/doi.org\/10.1016\/S0304-3975(99)00207-8","journal-title":"Theor. Comput. Sci."},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71999-1","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M Clavel","year":"2007","unstructured":"Clavel, M., et al.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-71999-1"},{"issue":"2\u20133","key":"28_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10817-007-9087-9","volume":"40","author":"J Endrullis","year":"2008","unstructured":"Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. J. Autom. Reasoning 40(2\u20133), 195\u2013220 (2008). \nhttps:\/\/doi.org\/10.1007\/s10817-007-9087-9","journal-title":"J. Autom. Reasoning"},{"issue":"1\/2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s002000100063","volume":"12","author":"J Giesl","year":"2001","unstructured":"Giesl, J., Arts, T.: Verification of erlang processes by dependency pairs. Appl. Algebra Eng. Commun. Comput. 12(1\/2), 39\u201372 (2001). \nhttps:\/\/doi.org\/10.1007\/s002000100063","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/11559306_12","volume-title":"Frontiers of Combining Systems","author":"J Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: Gramlich, B. (ed.) FroCoS 2005. LNCS (LNAI), vol. 3717, pp. 216\u2013231. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11559306_12"},{"issue":"3","key":"28_CR10","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). \nhttps:\/\/doi.org\/10.1007\/s10817-006-9057-7","journal-title":"J. Autom. Reasoning"},{"issue":"2","key":"28_CR11","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). \nhttps:\/\/doi.org\/10.1016\/0304-3975(92)90302-V","journal-title":"Theor. Comput. Sci."},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-23165-5_15","volume-title":"Logic, Rewriting, and Concurrency","author":"R Guti\u00e9rrez","year":"2015","unstructured":"Guti\u00e9rrez, R., Lucas, S.: Function calls at frozen positions in termination of context-sensitive rewriting. In: Mart\u00ed-Oliet, N., \u00d6lveczky, P.C., Talcott, C. (eds.) Logic, Rewriting, and Concurrency. LNCS, vol. 9200, pp. 311\u2013330. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23165-5_15"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-16310-4_3","volume-title":"Rewriting Logic and Its Applications","author":"R Guti\u00e9rrez","year":"2010","unstructured":"Guti\u00e9rrez, R., Lucas, S.: Proving termination in the context-sensitive dependency pair framework. In: \u00d6lveczky, P.C. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 18\u201334. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-16310-4_3"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-030-29436-6_17","volume-title":"Automated Deduction \u2013 CADE 27","author":"R Guti\u00e9rrez","year":"2019","unstructured":"Guti\u00e9rrez, R., Lucas, S.: Automatic generation of logical models with AGES. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 287\u2013299. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29436-6_17"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez, R., Lucas, S.: Automatically proving and disproving feasibility conditions. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNAI, vol. 12167, pp. 416\u2013435. Springer, Heidelberg (2020)","DOI":"10.1007\/978-3-030-51054-1_27"},{"key":"28_CR16","unstructured":"Lucas, S.: Context-sensitive computations in functional and functional logic programs. J. Funct. Log. Program. 1998(1), 1\u201361 (1998). \nhttp:\/\/danae.uni-muenster.de\/lehre\/kuchen\/JFLP\/articles\/1998\/A98-01\/A98-01.html"},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1006\/inco.2002.3176","volume":"178","author":"S Lucas","year":"2002","unstructured":"Lucas, S.: Context-sensitive rewriting strategies. Inf. Comput. 178(1), 294\u2013343 (2002). \nhttps:\/\/doi.org\/10.1006\/inco.2002.3176","journal-title":"Inf. Comput."},{"key":"28_CR18","doi-asserted-by":"publisher","unstructured":"Lucas, S.: Proving semantic properties as first-order satisfiability. Artif. Intell. 277 (2019). \nhttps:\/\/doi.org\/10.1016\/j.artint.2019.103174","DOI":"10.1016\/j.artint.2019.103174"},{"issue":"4","key":"28_CR19","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10817-017-9419-3","volume":"60","author":"S Lucas","year":"2017","unstructured":"Lucas, S., Guti\u00e9rrez, R.: Automatic synthesis of logical models for order-sorted first-order theories. J. Autom. Reasoning 60(4), 465\u2013501 (2017). \nhttps:\/\/doi.org\/10.1007\/s10817-017-9419-3","journal-title":"J. Autom. Reasoning"},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ipl.2018.04.002","volume":"136","author":"S Lucas","year":"2018","unstructured":"Lucas, S., Guti\u00e9rrez, R.: Use of logical models for proving infeasibility in term rewriting. Inf. Process. Lett. 136, 90\u201395 (2018). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2018.04.002","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"28_CR21","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). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2005.05.002","journal-title":"Inf. Process. Lett."},{"key":"28_CR22","doi-asserted-by":"publisher","unstructured":"Lucas, S., Meseguer, J.: Order-sorted dependency pairs. In: Antoy, S., Albert, E. (eds.) Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 15\u201317 July 2008, Valencia, Spain, pp. 108\u2013119. ACM (2008). \nhttps:\/\/doi.org\/10.1145\/1389449.1389463","DOI":"10.1145\/1389449.1389463"},{"issue":"1","key":"28_CR23","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. Algebraic Methods Program. 86(1), 236\u2013268 (2017). \nhttps:\/\/doi.org\/10.1016\/j.jlamp.2016.03.003","journal-title":"J. Log. Algebraic Methods Program."},{"key":"28_CR24","doi-asserted-by":"publisher","unstructured":"Lucas, S., Meseguer, J., Guti\u00e9rrez, R.: The 2D dependency pair framework for conditional rewrite systems. Part I: Definition and basic processors. J. Comput. Syst. Sci. 96, 74\u2013106 (2018). \nhttps:\/\/doi.org\/10.1016\/j.jcss.2018.04.002","DOI":"10.1016\/j.jcss.2018.04.002"},{"key":"28_CR25","doi-asserted-by":"publisher","unstructured":"Lucas, S., Meseguer, J., Guti\u00e9rrez, R.: The 2D dependency pair framework for conditional rewrite systems\u2014part II: advanced processors and implementation techniques. J. Autom. Reasoning (2020). \nhttps:\/\/doi.org\/10.1007\/s10817-020-09542-3","DOI":"10.1007\/s10817-020-09542-3"},{"key":"28_CR26","unstructured":"McCune, W.: Prover9 & Mace4. Technical report (2005\u20132010). \nhttp:\/\/www.cs.unm.edu\/~mccune\/prover9\/"},{"key":"28_CR27","doi-asserted-by":"publisher","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer (2002). \nhttps:\/\/doi.org\/10.1007\/978-1-4757-3661-8\n\n. \nhttp:\/\/www.springer.com\/computer\/swe\/book\/978-0-387-95250-5","DOI":"10.1007\/978-1-4757-3661-8"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-61735-3_6","volume-title":"Algebraic and Logic Programming","author":"PC \u00d6lveczky","year":"1996","unstructured":"\u00d6lveczky, P.C., Lysne, O.: Order-sorted termination: the unsorted way. In: Hanus, M., Rodr\u00edguez-Artalejo, M. (eds.) ALP 1996. LNCS, vol. 1139, pp. 92\u2013106. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61735-3_6"},{"issue":"1","key":"28_CR29","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/jsco.1994.1003","volume":"17","author":"H Zantema","year":"1994","unstructured":"Zantema, H.: Termination of term rewriting: interpretation and type elimination. J. Symb. Comput. 17(1), 23\u201350 (1994). \nhttps:\/\/doi.org\/10.1006\/jsco.1994.1003","journal-title":"J. Symb. Comput."},{"key":"28_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-62950-5_69","volume-title":"Rewriting Techniques and Applications","author":"H Zantema","year":"1997","unstructured":"Zantema, H.: Termination of context-sensitive rewriting. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 172\u2013186. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/3-540-62950-5_69"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51054-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T21:12:59Z","timestamp":1593465179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51054-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030510534","9783030510541"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51054-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcar2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijcar2020.org\/","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":"150","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":"46","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":"5","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":"31% - 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.03","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":"7.38","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11 system descriptions are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}