Cited in
(54)- Proving termination properties with \textsc{mu-term}
- Twenty years of rewriting logic
- Operational termination of membership equational programs: the order-sorted way
- Tuple interpretations for termination of term rewriting
- Multi-dimensional interpretations for termination of term rewriting
- Proving operational termination of membership equational programs
- Term orderings for non-reachability of (conditional) rewriting
- Term Rewriting and Applications
- Lazy productivity via termination
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
- SAT modulo linear arithmetic for solving polynomial constraints
- Goal-directed and relative dependency pairs for proving the termination of narrowing
- Polynomials over the reals in proofs of termination : from theory to practice
- Proving termination of context-sensitive rewriting by transformation
- Search Techniques for Rational Polynomial Orders
- MTT: The Maude Termination Tool (System Description)
- Termination of Narrowing Using Dependency Pairs
- Proving termination in the context-sensitive dependency pair framework
- CLEAN
- OBJ3
- CafeOBJ
- AProVE
- Tyrolean
- MTT
- CiME
- CARIBOO
- SCC
- mkbTT
- Jambox
- InvX
- Matchbox
- Slothrop
- VMTL
- TPDB
- TPA
- Tsukuba
- term-rewriting
- REVE
- Methods for proving termination of rewriting-based programming languages by transformation
- On the Completeness of Context-Sensitive Order-Sorted Specifications
- Multi-completion with termination tools
- Improving the context-sensitive dependency graph
- Sufficient completeness verification for conditional and constrained TRS
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
- The recursive path and polynomial ordering for first-order and higher-order terms
- Using context-sensitive rewriting for proving innermost termination of rewriting
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals
- Context-sensitive dependency pairs
- NaTT
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
- Usable Rules for Context-Sensitive Rewrite Systems
- Termination of just/fair computations in term rewriting
This page was built for software: MU-TERM
