Automating the dependency pair method
From MaRDI portal
Publication:2486583
Recommendations
Cites work
- scientific article; zbMATH DE number 1614707 (Why is no real title available?)
- scientific article; zbMATH DE number 1615243 (Why is no real title available?)
- scientific article; zbMATH DE number 2043537 (Why is no real title available?)
- scientific article; zbMATH DE number 1765702 (Why is no real title available?)
- scientific article; zbMATH DE number 794237 (Why is no real title available?)
- Approximations for strategies and termination
- Artificial Intelligence and Symbolic Computation
- Automated Reasoning
- Automatic termination proofs with transformation orderings
- Context-sensitive rewriting strategies
- Counterexamples to termination for the direct sum of term rewriting systems
- Hierarchical termination revisited.
- Improving dependency pairs
- Modular and incremental proofs of AC-termination
- Modular termination proofs for rewriting using dependency pairs
- Rewriting Techniques and Applications
- Termination by completion
- Termination of term rewriting using dependency pairs
- Transformation techniques for context-sensitive rewrite systems
- Verification of Erlang processes by dependency pairs
Cited in
(35)- Context-sensitive dependency pairs
- KBO orientability
- Term orderings for non-reachability of (conditional) rewriting
- Automating the dependency pair method.
- Mechanizing and improving dependency pairs
- Monotonicity criteria for polynomial interpretations over the naturals
- Tyrolean termination tool: techniques and features
- Proving termination by dependency pairs and inductive theorem proving
- Pattern eliminating transformations
- Increasing interpretations
- Match-bounds revisited
- Using context-sensitive rewriting for proving innermost termination of rewriting
- Termination Analysis of Logic Programs Based on Dependency Graphs
- Size-based termination of higher-order rewriting
- A dependency pair framework for innermost complexity analysis of term rewrite systems
- Increasing Interpretations
- Elimination transformations for associative-commutative rewriting systems
- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
- Maximal Termination
- Certification of Termination Proofs Using CeTA
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
- Dependency triples for improving termination analysis of logic programs with cut
- The Derivational Complexity Induced by the Dependency Pair Method
- Matrix interpretations for proving termination of term rewriting
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Search Techniques for Rational Polynomial Orders
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Uncurrying for termination and complexity
- Harnessing first order termination provers using higher order dependency pairs
- Proving Termination of Integer Term Rewriting
- Root-Labeling
- Beyond Dependency Graphs
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving
- Automatic generation of make dependencies
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates
This page was built for publication: Automating the dependency pair method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486583)
