Mechanizing and Improving Dependency Pairs

Authors:
Jürgen Giesl;René Thiemann;Peter Schneider-Kamp;Stephan Falke
Affiliations:
LuFG Informatik 2, RWTH Aachen, Aachen, Germany 52074;LuFG Informatik 2, RWTH Aachen, Aachen, Germany 52074;LuFG Informatik 2, RWTH Aachen, Aachen, Germany 52074;Computer Science Department, University of New Mexico, Albuquerque, USA 87131
Venue:
Journal of Automated Reasoning
Year:
2006

Citing 25
Cited 68

Counterexamples to termination for the direct sum of term rewriting systems

Information Processing Letters
Termination of rewriting

Journal of Symbolic Computation
Term rewriting and all that

Term rewriting and all that
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Advanced topics in term rewriting

Advanced topics in term rewriting
Testing Positiveness of Polynomials

Journal of Automated Reasoning
Modular termination proofs for rewriting using dependency pairs

Journal of Symbolic Computation
Argument Filtering Transformation

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
TALP: A Tool for the Termination Analysis of Logic Programs

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Approximating Dependency Graphs Using Tree Automata Techniques

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Complete Monotonic Semantic Path Orderings

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Generating Polynomial Orderings for Termination Proofs

RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Match-Bounded String Rewriting Systems

Applicable Algebra in Engineering, Communication and Computing
The size-change principle and dependency pairs for termination of term rewriting

Applicable Algebra in Engineering, Communication and Computing
Automating the dependency pair method

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Termination of String Rewriting Proved Automatically

Journal of Automated Reasoning
Automated termination analysis for logic programs by term rewriting

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving and disproving termination of higher-order functions

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Tyrolean termination tool

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
TPA: termination proved automatically

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Automated termination analysis for Haskell: from term rewriting to programming languages

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems

Fundamenta Informaticae
Termination Of Term Rewriting By Semantic Labelling

Fundamenta Informaticae

Practical use of polynomials over the reals in proofs of termination

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers

Electronic Notes in Theoretical Computer Science (ENTCS)
Innermost Termination of Rewrite Systems by Labeling

Electronic Notes in Theoretical Computer Science (ENTCS)
Order-sorted dependency pairs

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Predictive Labeling with Dependency Pairs Using SAT

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Dependency Pairs for Rewriting with Non-free Constructors

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Proving Termination by Bounded Increase

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Certification of Automated Termination Proofs

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Proving Termination Using Recursive Path Orders and SAT Solving

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Maximal Termination

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Usable Rules for Context-Sensitive Rewrite Systems

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Root-Labeling

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Deciding Innermost Loops

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Search Techniques for Rational Polynomial Orders

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Increasing Interpretations

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Automated Complexity Analysis Based on the Dependency Pair Method

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems

Language and Automata Theory and Applications
Certifying a Termination Criterion Based on Graphs, without Graphs

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Improving Context-Sensitive Dependency Pairs

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Complexity, Graphs, and the Dependency Pair Method

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Uncurrying for Termination

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Termination Analysis of Logic Programs Based on Dependency Graphs

Logic-Based Program Synthesis and Transformation
Termination of Narrowing Using Dependency Pairs

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
From Outermost Termination to Innermost Termination

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
KBO Orientability

Journal of Automated Reasoning
Proving Termination of Integer Term Rewriting

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Proving Confluence of Term Rewriting Systems Automatically

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
VMTL---A Modular Termination Laboratory

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Tyrolean Termination Tool 2

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting

Electronic Notes in Theoretical Computer Science (ENTCS)
Automated termination proofs for logic programs by term rewriting

ACM Transactions on Computational Logic (TOCL)
Termination Analysis by Dependency Pairs and Inductive Theorem Proving

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Beyond Dependency Graphs

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Match-bounds revisited

Information and Computation
Increasing interpretations

Annals of Mathematics and Artificial Intelligence
Improved Matrix Interpretation

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Finding and Certifying Loops

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
SAT solving for termination analysis with polynomial interpretations

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Termination of narrowing in left-linear constructor systems

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Argument filterings and usable rules for simply typed dependency pairs

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Context-sensitive dependency pairs

Information and Computation
Signature extensions preserve termination: an alternative proof via dependency pairs

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Automated termination proofs for haskell by term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving termination in the context-sensitive dependency pair framework

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A dependency pair framework for A∨C-termination

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Lazy abstraction for size-change termination

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Satisfiability of non-linear (Ir)rational arithmetic

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Proving termination properties with MU-TERM

AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs

Theory and Practice of Logic Programming
Dependency triples for improving termination analysis of logic programs with cut

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
A dependency pair framework for innermost complexity analysis of term rewrite systems

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Proving Termination by Dependency Pairs and Inductive Theorem Proving

Journal of Automated Reasoning
Harnessing first order termination provers using higher order dependency pairs

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Generalized and formalized uncurrying

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
The dependency triple framework for termination of logic programs

LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Goal-directed and relative dependency pairs for proving the termination of narrowing

LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Fast and accurate strong termination analysis with an application to partial evaluation

WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
On the domain and dimension hierarchy of matrix interpretations

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Journal of Automated Reasoning
Proving non-looping non-termination automatically

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Automated termination proofs for Java programs with cyclic data

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Probabilistic termination of CHRiSM programs

LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs

Proceedings of the 14th symposium on Principles and practice of declarative programming
Orderings and constraints: theory and practice of proving termination

Rewriting Computation and Proof
Unifying the Knuth-Bendix, recursive path and polynomial orders

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Better termination proving through cooperation

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Formalizing bounded increase

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990s. Dummy elimination, distribution elimination, general dummy elimination, and improved general ...