Pages that link to "Item:Q1864874"
From MaRDI portal
The following pages link to Modular termination proofs for rewriting using dependency pairs (Q1864874):
Displaying 27 items.
- A combination framework for complexity (Q276251) (← links)
- Relaxing monotonicity for innermost termination (Q835006) (← links)
- Knuth-Bendix completion of theories of commuting group endomorphisms (Q844197) (← links)
- Verifying termination and reduction properties about higher-order logic programs (Q850496) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Elimination transformations for associative-commutative rewriting systems (Q877834) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Hierarchical termination revisited. (Q1853138) (← links)
- Transforming orthogonal inductive definition sets into confluent term rewrite systems (Q2141298) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- Arctic Termination ...Below Zero (Q3522019) (← links)
- Automated Complexity Analysis Based on the Dependency Pair Method (Q3541717) (← links)
- TERMINATION OF ABSTRACT REDUCTION SYSTEMS (Q3620615) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- (Q5094148) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
