Decision Procedures for Loop Detection

The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitable for disproving termination: loops can be detected more easily. In a second step we analyze how to disprove innermost termination. Here, we present a novel procedure to decide whether a given loop is an innermost loop. All results have been implemented in the termination prover AProVE.

[1]  Hans Zantema,et al.  The Termination Competition , 2007, RTA.

[2]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[3]  Étienne Payet,et al.  Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator , 2006, LOPSTR.

[4]  Jürgen Giesl,et al.  Proving and Disproving Termination of Higher-Order Functions , 2005, FroCoS.

[5]  Deepak Kapur,et al.  On Proving Uniform Termination and Restricted Termination of Rewriting Systems , 1983, SIAM J. Comput..

[6]  Jürgen Giesl,et al.  The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs , 2005, LPAR.

[7]  Alberto Oliart,et al.  A Fast Algorithm for Uniform Semi-Unification , 1998, CADE.

[8]  Xubo Zhang.  Overlap Closures do not Suffice for Termination of General Term Rewriting Systems , 1991, Inf. Process. Lett..

[9]  Jürgen Giesl,et al.  Automatic Termination Proofs in the Dependency Pair Framework , 2006, IJCAR.

[10]  Jürgen Giesl,et al.  Mechanizing and Improving Dependency Pairs , 2006, Journal of Automated Reasoning.

[11]  Paliath Narendran,et al.  Semi-Unification , 1991, Theor. Comput. Sci..

[12]  Hans Zantema.  Termination of String Rewriting Proved Automatically , 2005, Journal of Automated Reasoning.

[13]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[14]  Enno Ohlebusch,et al.  Modular Termination Proofs for Rewriting Using Dependency Pairs , 2002, J. Symb. Comput..

[15]  Johannes Waldmann.  Matchbox: A Tool for Match-Bounded String Rewriting , 2004, RTA.

[16]  René Thiemann,et al.  The DP framework for proving termination of term rewriting , 2007 .