Term Rewriting with Logical Constraints

In recent works on program analysis, transformations of various programming languages to term rewriting are used. In this setting, constraints appear naturally. Several definitions which combine rewriting with logical constraints, or with separate rules for integer functions, have been proposed. This paper seeks to unify and generalise these proposals.

[1]  Christian von Essen,et al.  Automated Termination Analysis of Java Bytecode by Term Rewriting , 2010, RTA.

[2]  Nachum Dershowitz.  Orderings for Term-Rewriting Systems , 1979, FOCS.

[3]  Deepak Kapur,et al.  Rewriting Induction + Linear Arithmetic = Decision Procedure , 2012, IJCAR.

[4]  Deepak Kapur,et al.  Termination Analysis of C Programs Using Compiler Intermediate Languages , 2011, RTA.

[5]  Renate A. Schmidt.  Automated Deduction - CADE-22, 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings , 2009, CADE.

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

[7]  C. Kirchner,et al.  Deduction with symbolic constraints , 1990 .

[8]  Jürgen Giesl,et al.  Automated termination analysis for logic programs with cut , 2010, Theory Pract. Log. Program..

[9]  Mario Rodríguez-Artalejo,et al.  Functional and Constraint Logic Programming , 2001, CCL.

[10]  Deepak Kapur,et al.  Termination Analysis of Imperative Programs Using Bitvector Arithmetic , 2012, VSTTE.

[11]  Nachum Dershowitz,et al.  Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[12]  Jürgen Giesl,et al.  Proving Termination of Integer Term Rewriting , 2009, RTA.

[13]  Toshiki Sakabe,et al.  On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs , 2011, WFLP.

[14]  Masahiko Sakai,et al.  Lemma Generation Method in Rewriting Induction for Constrained Term Rewriting Systems , 2012 .

[15]  Deepak Kapur,et al.  A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs , 2009, CADE.

[16]  Jürgen Giesl,et al.  Automated termination proofs for haskell by term rewriting , 2011, TOPL.

[17]  Jürgen Giesl,et al.  Proving Termination by Dependency Pairs and Inductive Theorem Proving , 2011, Journal of Automated Reasoning.