Mechanizing and improving dependency pairs
From MaRDI portal
Recommendations
- Improving dependency pairs
- Improving Context-Sensitive Dependency Pairs
- Automating the dependency pair method
- Rewriting Techniques and Applications
- Automating the dependency pair method.
- Improving the context-sensitive dependency graph
- Context-sensitive dependency pairs
- Context-Sensitive Dependency Pairs
- A static higher-order dependency pair framework
Cites work
- scientific article; zbMATH DE number 1614707 (Why is no real title available?)
- scientific article; zbMATH DE number 1615245 (Why is no real title available?)
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 1487842 (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?)
- scientific article; zbMATH DE number 794240 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- A general framework for automatic termination analysis od logic programs
- Approximations for strategies and termination
- Artificial Intelligence and Symbolic Computation
- Automated Reasoning
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
- Automated Termination Analysis for Logic Programs by Term Rewriting
- Automating the dependency pair method
- Counterexamples to termination for the direct sum of term rewriting systems
- Frontiers of Combining Systems
- Generalized sufficient conditions for modular termination of rewriting
- Improving dependency pairs
- Logic for Programming, Artificial Intelligence, and Reasoning
- Match-bounded string rewriting systems
- Mechanizing and improving dependency pairs
- Modular and incremental automated termination proofs
- Modular termination proofs for rewriting using dependency pairs
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
- Polynomials over the reals in proofs of termination : from theory to practice
- Proofs by induction in equational theories with constructors
- Rewriting Techniques and Applications
- TPA: Termination Proved Automatically
- Term Rewriting and All That
- Term Rewriting and Applications
- Termination of rewriting
- Termination of string rewriting proved automatically
- Termination of term rewriting using dependency pairs
- Testing positiveness of polynomials
- The size-change principle and dependency pairs for termination of term rewriting
- The size-change principle for program termination
- Verification of Erlang processes by dependency pairs
Cited in
(72)- Proving Confluence of Term Rewriting Systems Automatically
- Proving termination properties with \textsc{mu-term}
- Generalized and formalized uncurrying
- Termination of Narrowing in Left-Linear Constructor Systems
- Match-bounds revisited
- Fast offline partial evaluation of logic programs
- scientific article; zbMATH DE number 7559275 (Why is no real title available?)
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Tuple interpretations for termination of term rewriting
- Multi-dimensional interpretations for termination of term rewriting
- Automatic generation of logical models with AGES
- Automatically Proving and Disproving Feasibility Conditions
- mu-term: Verify Termination Properties Automatically (System Description)
- Increasing Interpretations
- Harnessing first order termination provers using higher order dependency pairs
- Term orderings for non-reachability of (conditional) rewriting
- Context-Sensitive Dependency Pairs
- Uncurrying for termination and complexity
- Pattern eliminating transformations
- Automating the dependency pair method
- Using well-founded relations for proving operational termination
- Termination of narrowing via termination of rewriting
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Reducing relative termination to dependency pair problems
- Beyond Dependency Graphs
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving
- Frontiers of Combining Systems
- Dependency triples for improving termination analysis of logic programs with cut
- Proving termination by dependency pairs and inductive theorem proving
- Logic for Programming, Artificial Intelligence, and Reasoning
- Automating the dependency pair method.
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Search Techniques for Rational Polynomial Orders
- Size-based termination of higher-order rewriting
- Argument filterings and usable rules for simply typed dependency pairs
- Root-Labeling
- Certifying a Termination Criterion Based on Graphs, without Graphs
- Relative termination via dependency pairs
- KBO orientability
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
- Applications and extensions of context-sensitive rewriting
- Termination of Narrowing Using Dependency Pairs
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Improving dependency pairs
- Deciding Innermost Loops
- A dependency pair framework for innermost complexity analysis of term rewrite systems
- Reachability analysis of innermost rewriting
- Proving confluence in the confluence framework with confident
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
- From innermost to full almost-sure termination of probabilistic term rewriting
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- An automated approach to the Collatz conjecture
- Localized operational termination in general logics
- An automated approach to the Collatz conjecture
- Dependency pairs for proving termination properties of conditional term rewriting systems
- Increasing interpretations
- Proving Termination of Integer Term Rewriting
- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
- Using context-sensitive rewriting for proving innermost termination of rewriting
- Maximal Termination
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Mechanizing and improving dependency pairs
- Context-sensitive dependency pairs
- Usable Rules for Context-Sensitive Rewrite Systems
- Automated Complexity Analysis Based on the Dependency Pair Method
- From Outermost Termination to Innermost Termination
- Rewriting Techniques and Applications
- Termination Analysis of Logic Programs Based on Dependency Graphs
- Derivational complexity and context-sensitive Rewriting
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates
- Innermost termination of rewrite systems by labeling
This page was built for publication: Mechanizing and improving dependency pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877836)
