Characterizing and proving operational termination of deterministic conditional term rewriting systems

We investigate the practically crucial property of operational termination of deterministic conditional term rewriting systems (DCTRSs), an important declarative programming paradigm. We show that operational termination can be equivalently characterized by the newly introduced notion of context-sensitive quasi-reductivity. Based on this characterization and an unraveling transformation of DCTRSs into context-sensitive (unconditional) rewrite systems (CSRSs), context-sensitive quasi-reductivity of a DCTRS is shown to be equivalent to termination of the resulting CSRS on original terms (i.e. terms over the signature of the DCTRS). This result enables both proving and disproving operational termination of given DCTRSs via transformation into CSRSs. A concrete procedure for this restricted termination analysis (on original terms) is proposed and encouraging benchmarks obtained by the termination tool VMTL, that utilizes this approach, are presented. Finally, we show that the contextsensitive unraveling transformation is sound and complete for collapseextended termination, thus solving an open problem of [Duran et al. 2008].

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

[2]  Masahiko Sakai,et al.  Transformation for Refining Unraveled Conditional Term Rewriting Systems , 2007, Electron. Notes Theor. Comput. Sci..

[3]  Harald Ganzinger,et al.  Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems , 1992, CTRS.

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

[5]  José Meseguer,et al.  Operational termination of conditional term rewriting systems , 2005, Inf. Process. Lett..

[6]  Jörg Endrullis,et al.  Local Termination , 2009, RTA.

[7]  Bernhard Gramlich,et al.  Transformations of Conditional Rewrite Systems Revisited , 2009, WADT.

[8]  Hélène Kirchner,et al.  CARIBOO: A Multi-Strategy Termination Proof Tool Based on Induction , 2003 .

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

[10]  Claude Kirchner,et al.  ELAN from a rewriting logic point of view , 2002, Theor. Comput. Sci..

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

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

[13]  Enno Ohlebusch,et al.  Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems , 1999, LPAR.

[14]  Narciso Martí-Oliet,et al.  The Maude 2.0 System , 2003, RTA.

[15]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

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

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

[18]  Raúl Gutiérrez,et al.  Improving the Context-sensitive Dependency Graph , 2007, PROLE.

[19]  Jürgen Giesl,et al.  Automated Termination Analysis for Logic Programs by Term Rewriting , 2006, LOPSTR.

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

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

[22]  Salvador Lucas,et al.  Modular termination of context-sensitive rewriting , 2002, PPDP '02.

[23]  Michael Leuschel.  Proceedings of the 2003 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2003, San Diego, California, USA, June 7, 2003 , 2003, PEPM.

[24]  Jürgen Giesl,et al.  Automated Termination Proofs with AProVE , 2004, RTA.

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

[26]  Richard Kennaway,et al.  A Conflict Between Call-by-Need Computation and Parallelism , 1994, CTRS.

[27]  Grigore Rosu,et al.  Computationally Equivalent Elimination of Conditions , 2006, RTA.

[28]  Massimo Marchiori,et al.  Unravelings and Ultra-properties , 1996, ALP.

[29]  Michael Hanus,et al.  Conditional narrowing without conditions , 2003, PPDP '03.

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

[31]  Massimo Marchiori,et al.  On Deterministic Conditional Rewriting , 1997 .

[32]  Salvador Lucas,et al.  Context-sensitive Computations in Functional and Functional Logic Programs , 1998, J. Funct. Log. Program..

[33]  Francisco Durán,et al.  Proving termination of membership equational programs , 2004, PEPM '04.

[34]  Masahiko Sakai,et al.  Partial Inversion of Constructor Term Rewriting Systems , 2005, RTA.

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

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

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