Proving Termination of Integer Term Rewriting

When using rewrite techniques for termination analysis of programs, a main problem are pre-defined data types like integers. We extend term rewriting by built-in integers and adapt the dependency pair framework to prove termination of integer term rewriting automatically.

[1]  Andreas Podelski,et al.  A Complete Method for the Synthesis of Linear Ranking Functions , 2004, VMCAI.

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

[3]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[4]  Joao Marques-Silva,et al.  Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings , 2007, SAT.

[5]  Henny B. Sipma,et al.  Linear Ranking with Reachability , 2005, CAV.

[6]  Matt Brown,et al.  Invited talk , 2007 .

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

[8]  Sumit Gulwani,et al.  Constraint-Based Approach for Analysis of Hybrid Systems , 2008, CAV.

[9]  Jürgen Giesl,et al.  Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages , 2006, RTA.

[10]  Nao Hirokawa,et al.  Tyrolean termination tool: Techniques and features , 2007, Inf. Comput..

[11]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[12]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

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

[14]  Andreas Podelski,et al.  Transition invariants , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[15]  Hoon Hong,et al.  Testing Positiveness of Polynomials , 1998, Journal of Automated Reasoning.

[16]  Andreas Podelski,et al.  Abstraction Refinement for Termination , 2005, SAS.

[17]  Alexander Serebrenik,et al.  Inference of termination conditions for numerical loops , 2001, ArXiv.

[18]  Alexander Serebrenik,et al.  Inference of termination conditions for numerical loops in Prolog , 2004, Theory Pract. Log. Program..

[19]  Henny B. Sipma,et al.  Termination of Polynomial Programs , 2005, VMCAI.

[20]  Henny B. Sipma,et al.  Synthesis of Linear Ranking Functions , 2001, TACAS.

[21]  Deepak Kapur,et al.  Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures , 2008, RTA.

[22]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[23]  Jürgen Giesl,et al.  Automated termination proofs for logic programs by term rewriting , 2008, TOCL.

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

[25]  Jürgen Giesl,et al.  Maximal Termination , 2008, RTA.

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

[27]  Alexander Serebrenik,et al.  Inference of Termination Conditions for Numerical Loops in Prolog , 2001, LPAR.

[28]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

[29]  Jürgen Giesl,et al.  SAT Solving for Termination Analysis with Polynomial Interpretations , 2007, SAT.

[30]  Enno Ohlebusch,et al.  Termination of Logic Programs: Transformational Methods Revisited , 2001, Applicable Algebra in Engineering, Communication and Computing.

[31]  Andreas Podelski,et al.  Termination proofs for systems code , 2006, PLDI '06.

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

[33]  Henny B. Sipma,et al.  Practical Methods for Proving Program Termination , 2002, CAV.

[34]  Sumit Gulwani,et al.  Ranking Abstractions , 2008, ESOP.

[35]  Frank Pfenning,et al.  Automated Deduction - CADE-21, 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings , 2007, CADE.

[36]  Jürgen Giesl,et al.  Proving Termination by Bounded Increase , 2007, CADE.

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

[38]  Philip Wadler.  Call-by-Value Is Dual to Call-by-Name - Reloaded , 2005, RTA.