MU-TERM

swMATH10015MaRDI QIDQ21990

No author found.

Described by source

• Proving Termination of Context-Sensitive Rewriting with MU-TERM

Related Items (33)

Proving termination of context-sensitive rewriting by transformation ⋮ Polynomials over the reals in proofs of termination : from theory to practice ⋮ Multi-completion with termination tools ⋮ Twenty years of rewriting logic ⋮ Sufficient completeness verification for conditional and constrained TRS ⋮ SAT modulo linear arithmetic for solving polynomial constraints ⋮ Usable Rules for Context-Sensitive Rewrite Systems ⋮ Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs ⋮ Termination of just/fair computations in term rewriting ⋮ MTT: The Maude Termination Tool (System Description) ⋮ Term Rewriting and Applications ⋮ Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing ⋮ The recursive path and polynomial ordering for first-order and higher-order terms ⋮ Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications ⋮ From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals ⋮ Lazy productivity via termination ⋮ Operational Termination of Membership Equational Programs: the Order-Sorted Way ⋮ Proving Termination in the Context-Sensitive Dependency Pair Framework ⋮ On the Completeness of Context-Sensitive Order-Sorted Specifications ⋮ Characterizing and proving operational termination of deterministic conditional term rewriting systems ⋮ Proving operational termination of membership equational programs ⋮ 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 ⋮ Context-sensitive dependency pairs ⋮ Proving Termination Properties with mu-term ⋮ Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting ⋮ Methods for Proving Termination of Rewriting-based Programming Languages by Transformation ⋮ Multi-dimensional interpretations for termination of term rewriting ⋮ Termination of Narrowing Using Dependency Pairs ⋮ Search Techniques for Rational Polynomial Orders ⋮ Tuple interpretations for termination of term rewriting ⋮ Term orderings for non-reachability of (conditional) rewriting ⋮ Improving the Context-sensitive Dependency Graph

This page was built for software: MU-TERM