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