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