Term Rewriting with Logical Constraints

This publication has 10 references indexed in Scilit:

• Rewriting Induction + Linear Arithmetic = Decision Procedure
  Lecture Notes in Computer Science, 2012
• Termination Analysis of Imperative Programs Using Bitvector Arithmetic
  2012
• Proving Termination by Dependency Pairs and Inductive Theorem Proving
  Journal of Automated Reasoning, 2011
• On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs
  2011
• Automated termination proofs for haskell by term rewriting
  ACM Transactions on Programming Languages and Systems, 2011
• Automated termination analysis for logic programs with cut
  Theory and Practice of Logic Programming, 2010
• Termination Graphs for Java Bytecode
  Lecture Notes in Computer Science, 2010
• A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
  2009
• Proving Termination of Integer Term Rewriting
  Lecture Notes in Computer Science, 2009
• Orderings for term-rewriting systems
  Theoretical Computer Science, 1982