Termination of Rewriting with and Automated Synthesis of Forbidden Patterns

We introduce a modified version of the well-known dependency pair framework that is suitable forthe termination analysis of rewriting under forbidden pattern restrictions. By attaching contexts todependency pairs that represent the calling contexts of the corresponding recursive function calls,it is possible to incorporate the forbidden pattern restrictions in the (adapted) notion of dependencypair chains, thus yielding a sound and complete approach to termination analysis. Building uponthis contextual dependency pair framework we introduce a dependency pair processor that simplifiesproblems by analyzing the contextual information of the dependency pairs. Moreover, we show howthis processor can be used to synthesize forbidden patterns suitable for a given term rewriting systemon-the-fly during the termination analysis.

[1]  Bernhard Gramlich,et al.  VMTL-A Modular Termination Laboratory , 2009, RTA.

[2]  Bernhard Gramlich,et al.  Extending Context-Sensitivity in Term Rewriting , 2010, WRS.

[3]  Raúl Gutiérrez,et al.  Context-sensitive dependency pairs , 2006, Inf. Comput..

[4]  Raúl Gutiérrez Gil,et al.  Automatic proofs of termination of context-sensitive rewriting , 2010 .

[5]  Aart Middeldorp,et al.  Beyond Dependency Graphs , 2009, CADE.

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

[7]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

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

[9]  Raúl Gutiérrez,et al.  Improving Context-Sensitive Dependency Pairs , 2008, LPAR.

[10]  Bernhard Gramlich.  Outermost Termination via Contextual Dependency Pairs , 2010 .

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

[12]  Raúl Gutiérrez,et al.  Proving Termination in the Context-Sensitive Dependency Pair Framework , 2010, WRLA.

[13]  René Thiemann,et al.  From Outermost Termination to Innermost Termination , 2009, SOFSEM.

[14]  Jörg Endrullis,et al.  From Outermost to Context-Sensitive Rewriting , 2009, RTA.

[15]  Hans Zantema,et al.  A Transformational Approach to Prove Outermost Termination Automatically , 2009, Electron. Notes Theor. Comput. Sci..

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

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

[18]  Aart Middeldorp,et al.  Tyrolean Termination Tool 2 , 2009, RTA.

[19]  Salvador Lucas,et al.  Termination of on-demand rewriting and termination of OBJ programs , 2001, PPDP '01.