Pages that link to "Item:Q2583289"
From MaRDI portal
The following pages link to Modular and incremental automated termination proofs (Q2583289):
Displaying 14 items.
- 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)
- Twenty years of rewriting logic (Q1931904) (← links)
- Stability of termination and sufficient-completeness under pushouts via amalgamation (Q2215962) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195) (← links)
- Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications (Q5403069) (← links)
