MU-TERM

swMATH10015MaRDI QIDQ21990FDOQ21990

Author name not available (Why is that?)

Described by source

• Proving termination of context-sensitive rewriting with MU-TERM

Cited In (33)

• Twenty years of rewriting logic
• Tuple interpretations for termination of term rewriting
• Multi-dimensional interpretations for termination of term rewriting
• Proving Termination in the Context-Sensitive Dependency Pair Framework
• 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
• Polynomials over the reals in proofs of termination : from theory to practice
• On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
• Proving Termination Properties with mu-term
• SAT modulo linear arithmetic for solving polynomial constraints
• 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
• Methods for proving termination of rewriting-based programming languages by transformation
• On the Completeness of Context-Sensitive Order-Sorted Specifications
• Operational Termination of Membership Equational Programs: the Order-Sorted Way
• Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
• Improving the context-sensitive dependency graph
• Multi-completion with termination tools
• 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
• Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
• Usable Rules for Context-Sensitive Rewrite Systems
• Context-sensitive dependency pairs
• Termination of just/fair computations in term rewriting

This page was built for software: MU-TERM