<bibliography>
 <citation type="inproceedings" key="mu-term">
  <author>Beatriz <surname>Alarc&#243;n</surname></author>
  <author>Ra&#250;l <surname>Guti&#233;rrez</surname></author>
  <author>Salvador <surname>Lucas</surname></author>
  <author>Rafael <surname>Navarro-Marset</surname></author>
  <year>2011</year>
  <title>Proving Termination Properties with MU-TERM</title>
  <booktitle>Proc. 13thAlgebraic Methodology and Software Technology</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>6486</volume>
  <pages>201&#8211;208</pages>
  <doi>10.1007/978-3-642-17796-5_12</doi>
 </citation>
 <citation type="inproceedings" key="ACP">
  <author>Takahito <surname>Aoto</surname></author>
  <author>Junichi <surname>Yoshida</surname></author>
  <author>Yoshihito <surname>Toyama</surname></author>
  <year>2009</year>
  <title>Proving Confluence of Term Rewriting Systems Automatically</title>
  <booktitle>Proc. 20th International Conference on Rewriting Techniques and Applications</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>5595</volume>
  <pages>93&#8211;102</pages>
  <doi>10.1007/978-3-642-02348-4_7</doi>
 </citation>
 <citation type="inproceedings" key="AMS16">
  <author>Martin <surname>Avanzini</surname></author>
  <author>Georg <surname>Moser</surname></author>
  <author>Michael <surname>Schaper</surname></author>
  <year>2016</year>
  <title>TcT: Tyrolean Complexity Tool</title>
  <booktitle>Proc. 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>9636</volume>
  <publisher>Springer</publisher>
  <pages>407&#8211;423</pages>
  <doi>10.1007/978-3-662-49674-9_24</doi>
 </citation>
 <citation type="book" key="BN98">
  <author>Franz <surname>Baader</surname></author>
  <author>Tobias <surname>Nipkow</surname></author>
  <year>1998</year>
  <title>Term Rewriting and All That</title>
  <publisher>Cambridge University Press</publisher>
  <doi>10.1017/CBO9781139172752</doi>
 </citation>
 <citation type="inproceedings" key="DT90">
  <author>Max <surname>Dauchet</surname></author>
  <author>Sophie <surname>Tison</surname></author>
  <year>1990</year>
  <title>The Theory of Ground Rewrite Systems is Decidable</title>
  <booktitle>Proc. 5th IEEE Symposium on Logic in Computer Science</booktitle>
  <pages>242&#8211;248</pages>
  <doi>10.1109/LICS.1990.113750</doi>
 </citation>
 <citation type="incollection" key="DP01">
  <author>Nachum <surname>Dershowitz</surname></author>
  <author>David A. <surname>Plaisted</surname></author>
  <year>2001</year>
  <title>Chapter 9 &#8211; Rewriting</title>
  <booktitle>Handbook of Automated Reasoning</booktitle>
  <publisher>North-Holland</publisher>
  <pages>535&#8211;610</pages>
  <doi>10.1016/B978-044450813-3/50011-4</doi>
 </citation>
 <citation type="inproceedings" key="Fu19">
  <author>Carsten <surname>Fuhs</surname></author>
  <year>2019</year>
  <title>Transforming Derivational Complexity of Term Rewriting to Runtime Complexity</title>
  <booktitle>Proc. 12th International Workshop on Frontiers of Combining Systems</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>11715</volume>
  <publisher>Springer</publisher>
  <pages>348&#8211;364</pages>
  <doi>10.1007/978-3-030-29007-8_20</doi>
 </citation>
 <citation type="article" key="AProVE">
  <author>J&#252;rgen <surname>Giesl</surname></author>
  <author>Cornelius <surname>Aschermann</surname></author>
  <author>Marc <surname>Brockschmidt</surname></author>
  <author>Fabian <surname>Emmes</surname></author>
  <author>Florian <surname>Frohn</surname></author>
  <author>Carsten <surname>Fuhs</surname></author>
  <author>Jera <surname>Hensel</surname></author>
  <author>Carsten <surname>Otto</surname></author>
  <author>Martin <surname>Pl&#252;cker</surname></author>
  <author>Peter <surname>Schneider-Kamp</surname></author>
  <author>Thomas <surname>Ströder</surname></author>
  <author>Stephanie <surname>Swiderski</surname></author>
  <author>René <surname>Thiemann</surname></author>
  <year>2017</year>
  <title>Analyzing Program Termination and Complexity Automatically with AProVE</title>
  <journal>Journal of Automated Reasoning</journal>
  <volume>58</volume>
  <number>1</number>
  <pages>3&#8211;31</pages>
  <doi>10.1007/s10817-016-9388-y</doi>
 </citation>
 <citation type="inproceedings" key="HNM18">
  <author>Nao <surname>Hirokawa</surname></author>
  <author>Julian <surname>Nagele</surname></author>
  <author>Aart <surname>Middeldorp</surname></author>
  <year>2018</year>
  <title>Cops and CoCoWeb &#8211; Infrastructure for Confluence Tools</title>
  <booktitle>Proc. 9th International Joint Conference on Automated Reasoning</booktitle>
  <series>Lecture Notes in Artificial Intelligence</series>
  <volume>10900</volume>
  <publisher>Springer</publisher>
  <pages>346&#8211;353</pages>
  <doi>10.1007/978-3-319-94205-6_23</doi>
 </citation>
 <citation type="inproceedings" key="HL89">
  <author>Dieter <surname>Hofbauer</surname></author>
  <author>Clemens <surname>Lautemann</surname></author>
  <year>1989</year>
  <title>Termination Proofs and the Length of Derivations</title>
  <booktitle>Proc. 3rd International Conference on Rewriting Techniques and Applications</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>355</volume>
  <publisher>Springer</publisher>
  <pages>167&#8211;177</pages>
  <doi>10.1007/3-540-51081-8_107</doi>
 </citation>
 <citation type="inproceedings" key="maxcomp">
  <author>Dominik <surname>Klein</surname></author>
  <author>Nao <surname>Hirokawa</surname></author>
  <year>2011</year>
  <title>Maximal Completion</title>
  <booktitle>Proc. 22nd International Conference on Rewriting Techniques and Applications</booktitle>
  <series>Leibniz International Proceedings in Informatics</series>
  <volume>10</volume>
  <pages>71&#8211;80</pages>
  <doi>10.4230/LIPIcs.RTA.2011.71</doi>
 </citation>
 <citation type="incollection" key="KB70">
  <author>Donald E. <surname>Knuth</surname></author>
  <author>Peter B. <surname>Bendix</surname></author>
  <year>1970</year>
  <title>Simple Word Problems in Universal Algebras</title>
  <editor>J. <surname>Leech</surname></editor>
  <booktitle>Computational Problems in Abstract Algebra</booktitle>
  <publisher>Pergamon Press</publisher>
  <pages>263&#8211;297</pages>
  <doi>10.1016/B978-0-08-012975-4.50028-X</doi>
 </citation>
 <citation type="inproceedings" key="wanda">
  <author>Cynthia <surname>Kop</surname></author>
  <year>2019</year>
  <title>A short overview of Wanda</title>
  <booktitle>Joint Proceedings of the 10th Workshop on Higher-Order Rewriting and the 8th International Workshop on Confluence</booktitle>
  <pages>21&#8211;25</pages>
  <note>Available from http://cl-informatik.uibk.ac.at/iwc/hor-iwc2019.pdf</note>
 </citation>
 <citation type="inproceedings" key="KSZM09">
  <author>Martin <surname>Korp</surname></author>
  <author>Christian <surname>Sternagel</surname></author>
  <author>Harald <surname>Zankl</surname></author>
  <author>Aart <surname>Middeldorp</surname></author>
  <year>2009</year>
  <title>Tyrolean Termination Tool 2</title>
  <booktitle>Proc. 20th International Conference on Rewriting Techniques and Applications</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>5595</volume>
  <publisher>Springer</publisher>
  <pages>295&#8211;304</pages>
  <doi>10.1007/978-3-642-02348-4_21</doi>
 </citation>
 <citation type="inproceedings" key="MNS19">
  <author>Aart <surname>Middeldorp</surname></author>
  <author>Julian <surname>Nagele</surname></author>
  <author>Kiraku <surname>Shintani</surname></author>
  <year>2019</year>
  <title>Confluence Competition 2019</title>
  <booktitle>Proc. 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>11429</volume>
  <publisher>Springer</publisher>
  <pages>25&#8211;40</pages>
  <doi>10.1007/978-3-030-17502-3_2</doi>
 </citation>
 <citation type="mastersthesis" key="M18">
  <author>Fabian <surname>Mitterwallner</surname></author>
  <year>2018</year>
  <title>Automating Rewrite Strategies</title>
  <type>bachelor thesis</type>
  <school>University of Innsbruck</school>
 </citation>
 <citation type="inproceedings" key="NFM17">
  <author>Julian <surname>Nagele</surname></author>
  <author>Bertram <surname>Felgenhauer</surname></author>
  <author>Aart <surname>Middeldorp</surname></author>
  <year>2017</year>
  <title>CSI: New Evidence &#8211; A Progress Report</title>
  <booktitle>Proc. 26th International Conference on Automated Deduction</booktitle>
  <series>Lecture Notes in Artificial Intelligence</series>
  <volume>10395</volume>
  <publisher>Springer</publisher>
  <pages>385&#8211;397</pages>
  <doi>10.1007/978-3-319-63046-5_24</doi>
 </citation>
 <citation type="article" key="N42">
  <author>Max H. A. <surname>Newman</surname></author>
  <year>1942</year>
  <title>On Theories with a Combinatorial Definition of Equivalence</title>
  <journal>Annals of Mathematics</journal>
  <volume>43</volume>
  <number>2</number>
  <pages>223&#8211;243</pages>
  <doi>10.2307/1968867</doi>
 </citation>
 <citation type="incollection" key="OV03">
  <author>Vincent van <surname>Oostrom</surname></author>
  <author>Roel de <surname>Vrijer</surname></author>
  <year>2003</year>
  <title>Strategies</title>
  <editor>Terese</editor>
  <booktitle>Term Rewriting Systems</booktitle>
  <series>Cambridge Tracts in Theoretical Computer Science</series>
  <volume>55</volume>
  <publisher>Cambridge University Press</publisher>
  <chapter>9</chapter>
  <pages>475&#8211;547</pages>
 </citation>
 <citation type="article" key="NTI">
  <author>&#201;tienne <surname>Payet</surname></author>
  <author>Frédéric <surname>Mesnard</surname></author>
  <year>2006</year>
  <title>Nontermination Inference of Logic Programs</title>
  <journal>ACM Transactions on Programming Languages and Systems</journal>
  <volume>28</volume>
  <number>2</number>
  <pages>256&#8211;289</pages>
  <doi>10.1145/1119479.1119481</doi>
 </citation>
 <citation type="article" key="PS81">
  <author>Gerald E. <surname>Peterson</surname></author>
  <author>Mark E. <surname>Stickel</surname></author>
  <year>1981</year>
  <title>Complete Sets of Reductions for Some Equational Theories</title>
  <journal>Journal of the ACM</journal>
  <volume>28</volume>
  <number>2</number>
  <pages>233&#8211;264</pages>
  <doi>10.1145/322248.322251</doi>
 </citation>
 <citation type="inproceedings" key="vdP01">
  <author>Jaco van de <surname>Pol</surname></author>
  <year>2001</year>
  <title>Just-in-time: On Strategy Annotations</title>
  <booktitle>Proc. 1st International Workshop on Reduction Strategies in Rewriting and Programming</booktitle>
  <series>Electronic Notes in Theoretical Computer Science</series>
  <volume>57</volume>
  <pages>41&#8211;63</pages>
  <doi>10.1016/S1571-0661(04)00267-1</doi>
 </citation>
 <citation type="inproceedings" key="vdP02">
  <author>Jaco van de <surname>Pol</surname></author>
  <year>2002</year>
  <title>JITty: A Rewriter with Strategy Annotations</title>
  <booktitle>Proc. 13th International Conference on Rewriting Techniques and Applications</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>2378</volume>
  <publisher>Springer</publisher>
  <pages>367&#8211;370</pages>
  <doi>10.1007/3-540-45610-4_26</doi>
 </citation>
 <citation type="article" key="NWT05">
  <author><surname>Prijsvraag</surname></author>
  <year>2015</year>
  <title>Het Cola-gen</title>
  <journal>Natuur, Wetenschap &#38; Techniek</journal>
  <volume>73</volume>
  <number>1</number>
  <pages>65</pages>
 </citation>
 <citation type="inproceedings" key="RM16">
  <author>Franziska <surname>Rapp</surname></author>
  <author>Aart <surname>Middeldorp</surname></author>
  <year>2016</year>
  <title>Automating the First-Order Theory of Left-Linear Right-Ground Term Rewrite Systems</title>
  <booktitle>Proc. 1st International Conference on Formal Structures for Computation and Deduction</booktitle>
  <series>Leibniz International Proceedings in Informatics</series>
  <volume>52</volume>
  <publisher>Schloss Dagstuhl &#8211; Leibniz-Zentrum f&#252;r Informatik</publisher>
  <pages>36:1&#8211;36:12</pages>
  <doi>10.4230/LIPIcs.FSCD.2016.36</doi>
 </citation>
 <citation type="inproceedings" key="RM18">
  <author>Franziska <surname>Rapp</surname></author>
  <author>Aart <surname>Middeldorp</surname></author>
  <year>2018</year>
  <title>FORT 2.0</title>
  <booktitle>Proc. 9th International Joint Conference on Automated Reasoning</booktitle>
  <series>Lecture Notes in Artificial Intelligence</series>
  <volume>10900</volume>
  <publisher>Springer</publisher>
  <pages>81&#8211;88</pages>
  <doi>10.1007/978-3-319-94205-6_6</doi>
 </citation>
 <citation type="article" key="R73">
  <author>Barry K. <surname>Rosen</surname></author>
  <year>1973</year>
  <title>Tree-Manipulating Systems and Church-Rosser Theorems</title>
  <journal>Journal of the ACM</journal>
  <volume>20</volume>
  <number>1</number>
  <pages>160&#8211;187</pages>
  <doi>10.1145/321738.321750</doi>
 </citation>
 <citation type="article" key="SS18">
  <author>Jonas <surname>Sch&#246;pf</surname></author>
  <author>Christian <surname>Sternagel</surname></author>
  <year>2018</year>
  <title>TTT2 with Termination Templates for Teaching</title>
  <journal>The Computing Research Repository</journal>
  <volume>abs/1806.05040</volume>
  <url>http://arxiv.org/abs/1806.05040</url>
 </citation>
 <citation type="inproceedings" key="CollSaigawa">
  <author>Kiraku <surname>Shintani</surname></author>
  <author>Nao <surname>Hirokawa</surname></author>
  <year>2019</year>
  <title>CoLL-Saigawa 1.3: A Joint Confluence Tool</title>
  <booktitle>Joint Proceedings of the 10th Workshop on Higher-Order Rewriting and the 8th International Workshop on Confluence</booktitle>
  <pages>57</pages>
  <note>Available from http://cl-informatik.uibk.ac.at/iwc/hor-iwc2019.pdf</note>
 </citation>
 <citation type="inproceedings" key="ST14">
  <author>Christian <surname>Sternagel</surname></author>
  <author>Ren&#233; <surname>Thiemann</surname></author>
  <year>2014</year>
  <title>The Certification Problem Format</title>
  <booktitle>Proc. 11th Workshop on User Interfaces for Theorem Provers (UITP)</booktitle>
  <series>Electronic Proceedings in Computer Science</series>
  <volume>167</volume>
  <pages>61&#8211;72</pages>
  <doi>10.4204/EPTCS.167.8</doi>
 </citation>
 <citation type="inproceedings" key="SZ12">
  <author>Thomas <surname>Sternagel</surname></author>
  <author>Harald <surname>Zankl</surname></author>
  <year>2012</year>
  <title>KBCV &#8211; Knuth&#8211;Bendix Completion Visualizer</title>
  <booktitle>Proc. 6th International Joint Conference on Automated Reasoning</booktitle>
  <series>Lecture Notes in Artificial Intelligence</series>
  <volume>7364</volume>
  <pages>530&#8211;536</pages>
  <doi>10.1007/978-3-642-31365-3_41</doi>
 </citation>
 <citation type="book" key="TeReSe">
  <editor><surname>Terese</surname></editor>
  <year>2003</year>
  <title>Term Rewriting Systems</title>
  <series>Cambridge Tracts in Theoretical Computer Science</series>
  <volume>55</volume>
  <publisher>Cambridge University Press</publisher>
 </citation>
 <citation type="inproceedings" key="CETA">
  <author>Ren&#233; <surname>Thiemann</surname></author>
  <author>Christian <surname>Sternagel</surname></author>
  <year>2009</year>
  <title>Certification of Termination Proofs using CeTA</title>
  <booktitle>Proc. 22th International Conference on Theorem Proving in Higher Order Logics</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>5674</volume>
  <publisher>Springer</publisher>
  <pages>452&#8211;468</pages>
  <doi>10.1007/978-3-642-03359-9_31</doi>
 </citation>
 <citation type="inproceedings" key="To98">
  <author>H&#233;l&#232;ne <surname>Touzet</surname></author>
  <year>1998</year>
  <title>Encoding the Hydra Battle as a Rewrite System</title>
  <booktitle>Proc. 23rd Mathematical Foundations of Computer Science</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>1450</volume>
  <publisher>Springer</publisher>
  <pages>267&#8211;276</pages>
  <doi>10.1007/BFb0055776</doi>
 </citation>
 <citation type="inproceedings" key="maedmax">
  <author>Sarah <surname>Winkler</surname></author>
  <author>Georg <surname>Moser</surname></author>
  <year>2018</year>
  <title>MaedMax: A Maximal Ordered Completion Tool</title>
  <booktitle>Proc. 9th International Joint Conference on Automated Reasoning</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>10900</volume>
  <pages>472&#8211;480</pages>
  <doi>10.1007/978-3-319-94205-6_31</doi>
 </citation>
 <citation type="article" key="WSMK13">
  <author>Sarah <surname>Winkler</surname></author>
  <author>Haruhiko <surname>Sato</surname></author>
  <author>Aart <surname>Middeldorp</surname></author>
  <author>Masahito <surname>Kurihara</surname></author>
  <year>2013</year>
  <title>Multi-Completion with Termination Tools</title>
  <journal>Journal of Automated Reasoning</journal>
  <volume>50</volume>
  <number>3</number>
  <pages>317&#8211;354</pages>
  <doi>10.1007/s10817-012-9249-2</doi>
 </citation>
 <citation type="inproceedings" key="NaTT">
  <author>Akihisa <surname>Yamada</surname></author>
  <author>Keiichirou <surname>Kusakari</surname></author>
  <author>Toshiki <surname>Sakabe</surname></author>
  <year>2014</year>
  <title>Nagoya Termination Tool</title>
  <booktitle>Proc. 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>8560</volume>
  <pages>466&#8211;475</pages>
  <doi>10.1007/978-3-319-08918-8_32</doi>
 </citation>
 <citation type="inproceedings" key="ZFM11">
  <author>Harald <surname>Zankl</surname></author>
  <author>Bertram <surname>Felgenhauer</surname></author>
  <author>Aart <surname>Middeldorp</surname></author>
  <year>2011</year>
  <title>CSI &#8211; A Confluence Tool</title>
  <booktitle>Proc. 22nd International Conference on Automated Deduction</booktitle>
  <series>Lecture Notes in Artificial Intelligence</series>
  <volume>6803</volume>
  <publisher>Springer</publisher>
  <pages>499&#8211;505</pages>
  <doi>10.1007/978-3-642-22438-6_38</doi>
 </citation>
 <citation type="article" key="ZWM15">
  <author>Harald <surname>Zankl</surname></author>
  <author>Sarah <surname>Winkler</surname></author>
  <author>Aart <surname>Middeldorp</surname></author>
  <year>2015</year>
  <title>Beyond Polynomials and Peano Arithmetic &#8211; Automation of Elementary and Ordinal Interpretations</title>
  <journal>Journal of Symbolic Computation</journal>
  <volume>69</volume>
  <pages>129&#8211;158</pages>
  <doi>10.1016/j.jsc.2014.09.033</doi>
 </citation>
</bibliography>
