Improving dependency pairs
From MaRDI portal
Publication:3408137
Recommendations
Cited in
(24)- On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
- Match-bounds revisited
- On proving \(C_E\)-termination of rewriting by size-change termination
- Relaxing monotonicity for innermost termination
- scientific article; zbMATH DE number 1765702 (Why is no real title available?)
- Context-Sensitive Dependency Pairs
- Enhancing dependency pair method using strong computability in simply-typed term rewriting
- Automating the dependency pair method
- Proving weak properties of rewriting
- Dependent pairs
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving
- Frontiers of Combining Systems
- Proving termination by dependency pairs and inductive theorem proving
- Logic for Programming, Artificial Intelligence, and Reasoning
- Automating the dependency pair method.
- Elimination transformations for associative-commutative rewriting systems
- Termination of Narrowing Using Dependency Pairs
- Modular termination proofs for rewriting using dependency pairs
- The derivational complexity induced by the dependency pair method
- Improving the context-sensitive dependency graph
- Mechanizing and improving dependency pairs
- Tyrolean termination tool: techniques and features
- The size-change principle and dependency pairs for termination of term rewriting
- Rewriting Techniques and Applications
This page was built for publication: Improving dependency pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408137)
