Advanced Topics in Termination – Further Reading
Polynomial Interpretations
Testing Positiveness of Polynomials
Hoon Hong and Dalibor Jakuš
Journal of Automated Reasoning 21(1), pp. 23 – 38, 2004
Hoon Hong and Dalibor Jakuš
Journal of Automated Reasoning 21(1), pp. 23 – 38, 2004
On the Relative Power of Polynomials with Real, Rational, and Integer
Coefficients in Proofs of Termination of Rewriting
Salvador Lucas
Applicable Algebra in Engineering, Communication and Computing 17(1), pp. 49 – 73, 2006
Salvador Lucas
Applicable Algebra in Engineering, Communication and Computing 17(1), pp. 49 – 73, 2006
Polynomials over the Reals in Proofs of Termination: From Theory to
Practice
Salvador Lucas
RAIRO Theoretical Informatics and Applications 39, pp. 547 – 586, 2005
Salvador Lucas
RAIRO Theoretical Informatics and Applications 39, pp. 547 – 586, 2005
Matrix Interpretations
Matrix Interpretations for Proving Termination of Term Rewriting
Jörg Endrullis, Johannes Waldmann and Hans Zantema
Journal of Automated Reasoning 40(2,3), pp. 195 – 220, 2008
Jörg Endrullis, Johannes Waldmann and Hans Zantema
Journal of Automated Reasoning 40(2,3), pp. 195 – 220, 2008
Arctic Termination … Below Zero
Adam Koprowski and Johannes Waldmann
Proc. of the 19th International Conference on Rewriting Techniques and Applications (RTA 2008), LNCS 5117, pp. 202 – 216, 2008
Adam Koprowski and Johannes Waldmann
Proc. of the 19th International Conference on Rewriting Techniques and Applications (RTA 2008), LNCS 5117, pp. 202 – 216, 2008
Dependency Pairs
Termination of Term Rewriting using Dependency Pairs
Thomas Arts and Jürgen Giesl
Theoretical Computer Science 236(1,2), pp. 133 – 178, 2000
Thomas Arts and Jürgen Giesl
Theoretical Computer Science 236(1,2), pp. 133 – 178, 2000
Automating the Dependency Pair Method
Nao Hirokawa and Aart Middeldorp
Information and Computation 199(1,2), pp. 172 – 199, 2006
Nao Hirokawa and Aart Middeldorp
Information and Computation 199(1,2), pp. 172 – 199, 2006
Tyrolean Termination Tool: Techniques and Features
Nao Hirokawa and Aart Middeldorp
Information and Computation 205(4), pp. 474 – 511, 2007
Nao Hirokawa and Aart Middeldorp
Information and Computation 205(4), pp. 474 – 511, 2007
The Dependency Pair Framework: Combining Techniques for Automated
Termination Proofs
Jürgen Giesl, René Thiemann and Peter Schneider-Kamp
Proc. of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), LNCS 3452, pp. 301 – 331, 2005
Jürgen Giesl, René Thiemann and Peter Schneider-Kamp
Proc. of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), LNCS 3452, pp. 301 – 331, 2005
Mechanizing and Improving Dependency Pairs
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp and Stephan Falke
Journal of Automated Reasoning 37(3), pp. 155 – 203, 2006
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp and Stephan Falke
Journal of Automated Reasoning 37(3), pp. 155 – 203, 2006
Match-Bounds
On Tree Automata that Certify Termination of Left-Linear Term Rewriting
Systems
Alfons Geser, Dieter Hofbauer, Johannes Waldmann and Hans Zantema
Information and Computation 205(4), pp. 512 – 534, 2007
Alfons Geser, Dieter Hofbauer, Johannes Waldmann and Hans Zantema
Information and Computation 205(4), pp. 512 – 534, 2007
Semantic Labeling
Termination of Term Rewriting by Semantic Labelling
Hans Zantema
Fundamenta Informatica 24(1,2), pp. 89 – 105, 1995
Hans Zantema
Fundamenta Informatica 24(1,2), pp. 89 – 105, 1995
Innermost Termination of Rewrite Systems by Labeling
René Thiemann and Aart Middeldorp
Proc. of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007), ENTCS 204, pp. 3 – 19, 2008
René Thiemann and Aart Middeldorp
Proc. of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007), ENTCS 204, pp. 3 – 19, 2008
Root-Labeling
Christian Sternagel and Aart Middeldorp
Proc. of the 19th International Conference on Rewriting Techniques and Applications (RTA 2008), LNCS 5117, pp. 336 – 350, 2008
Christian Sternagel and Aart Middeldorp
Proc. of the 19th International Conference on Rewriting Techniques and Applications (RTA 2008), LNCS 5117, pp. 336 – 350, 2008
Derivational Complexity
Termination Proofs and the Length of Derivations
Dieter Hofbauer and Clemens Lautemann
Proc. of the 3rd International Conference on Rewriting Techniques and Applications (RTA 1989), LNCS 355, pp. 167 – 177, 1989
Dieter Hofbauer and Clemens Lautemann
Proc. of the 3rd International Conference on Rewriting Techniques and Applications (RTA 1989), LNCS 355, pp. 167 – 177, 1989
Termination Proofs by Context-Dependent Interpretations
Dieter Hofbauer
Proc. of the 12th International Conference on Rewriting Techniques and Applications (RTA 2001), LNCS 2051, pp. 108 – 121, 2001
Dieter Hofbauer
Proc. of the 12th International Conference on Rewriting Techniques and Applications (RTA 2001), LNCS 2051, pp. 108 – 121, 2001
Proving Quadratic Derivational Complexities Using Context Dependent
Interpretations
Georg Moser and Andreas Schnabl
Proc. of the 18th International Conference on Rewriting Techniques and Applications (RTA 2008), LNCS 5117, pp. 276 – 290, 2008
Georg Moser and Andreas Schnabl
Proc. of the 18th International Conference on Rewriting Techniques and Applications (RTA 2008), LNCS 5117, pp. 276 – 290, 2008
Complexity Analysis of Term Rewriting Based on Matrix and Context
Dependent Interpretations
Georg Moser, Andreas Schnabl and Johannes Waldmann
Proc. of the 28th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008), Leibniz International Proceedings in Informatics 2, pp. 304 – 315, 2008
Georg Moser, Andreas Schnabl and Johannes Waldmann
Proc. of the 28th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008), Leibniz International Proceedings in Informatics 2, pp. 304 – 315, 2008
Decidable Classes
Termination of Rewriting with Right-Flat Rules
Guillem Godoy, Eduard Huntingford and Ashish Tiwari
Proc. of the 18th International Conference on Rewriting Techniques and Applications (RTA 2007), LNCS 4533, pp. 200 – 213, 2007
Guillem Godoy, Eduard Huntingford and Ashish Tiwari
Proc. of the 18th International Conference on Rewriting Techniques and Applications (RTA 2007), LNCS 4533, pp. 200 – 213, 2007
Certification
Certification of Termination Proofs using CeTA
René Thiemann and Christian Sternagel
Proc. of the 22nd International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2009), LNCS 5674, 2009, to appear
René Thiemann and Christian Sternagel
Proc. of the 22nd International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2009), LNCS 5674, 2009, to appear
Applications
Automated Termination Proofs for Logic Programs by Term Rewriting
Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik and René Thiemann
ACM Transactions on Computational Logic, 2009, to appear
Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik and René Thiemann
ACM Transactions on Computational Logic, 2009, to appear
Automated Termination Analysis for Haskell: From Term Rewriting to
Programming Languages
Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp and René Thiemann
Proc. of the 17th International Conference on Rewriting Techniques and Applications (RTA 2006), LNCS 4098, pp. 297 – 312, 2006
Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp and René Thiemann
Proc. of the 17th International Conference on Rewriting Techniques and Applications (RTA 2006), LNCS 4098, pp. 297 – 312, 2006
Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
Ian Wehrman, Aaron Stump and Edwin Westbrook
Proc. of the 17th International Conference on Rewriting Techniques and Applications (RTA 2006), LNCS 4098, pp. 287 – 296, 2006
Ian Wehrman, Aaron Stump and Edwin Westbrook
Proc. of the 17th International Conference on Rewriting Techniques and Applications (RTA 2006), LNCS 4098, pp. 287 – 296, 2006
Multi-Completion with Termination Tools (System Description)
Haruhiko Sato, Sarah Winkler, Masahito Kurihara and Aart Middeldorp
Proc. of the 4th International Joint Conference on Automated Reasoning (IJCAR 2008), LNAI 5195, pp. 306 – 312, 2008
Haruhiko Sato, Sarah Winkler, Masahito Kurihara and Aart Middeldorp
Proc. of the 4th International Joint Conference on Automated Reasoning (IJCAR 2008), LNAI 5195, pp. 306 – 312, 2008