A Dependency Pair Framework for A OR C-Termination

The development of powerful techniques for proving termination of rewriting modulo a set of equations is essential when dealing with rewriting logic-based programming languages like CafeOBJ, Maude, OBJ, etc. One of the most important techniques for proving termination over a wide range of variants of rewriting (strategies) is the dependency pair approach. Several works have tried to adapt it to rewriting modulo associative and commutative (AC) equational theories, and even to more general theories. However, as we discuss in this paper, no appropriate notion of minimality (and minimal chain of dependency pairs) which is well-suited to develop a dependency pair framework has been proposed to date. In this paper we carefully analyze the structure of infinite rewrite sequences for rewrite theories whose equational part is a (free) combination of associative and commutative axioms which we call A∨C-rewrite theories. Our analysis leads to a more accurate and optimized notion of dependency pairs through the new notion of stably minimal term. Then, we have developed a suitable dependency pair framework for proving termination of A∨C-rewrite theories.

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

[2]  Claude Marché,et al.  Modular and incremental proofs of AC-termination , 2004, J. Symb. Comput..

[3]  Stephan Falke,et al.  Automated Termination Analysis for Equational Rewriting , 2004 .

[4]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[5]  Nachum Dershowitz,et al.  Termination by Abstraction , 2004, ICLP.

[6]  Nao Hirokawa,et al.  Dependency Pairs Revisited , 2004, RTA.

[7]  Terese.  Term rewriting systems , 2003, Cambridge tracts in theoretical computer science.

[8]  Keiichirou Kusakari,et al.  Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems , 2000 .

[9]  Albert Rubio.  A Fully Syntactic AC-RPO , 1999, RTA.

[10]  Xavier Urbain,et al.  Modular and Incremental Automated Termination Proofs , 2004, Journal of Automated Reasoning.

[11]  José Meseguer,et al.  Operational Termination of Membership Equational Programs: the Order-Sorted Way , 2009, WRLA.

[12]  Jürgen Giesl,et al.  Dependency Pairs for Equational Rewriting , 2001, RTA.

[13]  Keiichirou Kusakari.  On Proving AC-Termination by AC-Dependency Paris , 1998 .

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

[15]  Alice Feller.  Termination , 2009 .

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

[17]  Yoshihito Toyama,et al.  Elimination Transformations for Associative-Commutative Rewriting Systems , 2006, J. Autom. Reason..

[18]  Salvador Lucas,et al.  Proving Termination Properties with mu-term , 2010, AMAST.

[19]  Raúl Gutiérrez,et al.  Proving Termination of Context-Sensitive Rewriting with MU-TERM , 2007, PROLE.

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

[21]  Nao Hirokawa,et al.  Automating the Dependency Pair Method , 2005, CADE.

[22]  Nakamura Masaki,et al.  Elimination Transformations for Associative–Commutative Rewriting Systems , 2006 .

[23]  Jürgen Giesl,et al.  Improved Modular Termination Proofs Using Dependency Pairs , 2004, IJCAR.

[24]  Francisco Durán,et al.  Termination Modulo Combinations of Equational Theories , 2009, FroCoS.

[25]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[26]  Francisco Durán,et al.  Proving operational termination of membership equational programs , 2008, High. Order Symb. Comput..

[27]  Enno Ohlebusch,et al.  Advanced Topics in Term Rewriting , 2002, Springer New York.

[28]  Claude Marché,et al.  Proving Termination of Rewriting with C i ME , 2003 .

[29]  Claude Marché,et al.  Termination of Associative-Commutative Rewriting by Dependency Pairs , 1998, RTA.