The following pages link to Term Rewriting and Applications (Q5703847):
Displaying 16 items.
- Reachability, confluence, and termination analysis with state-compatible automata (Q515687) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- FORT 2.0 (Q1799069) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- \texttt{Autowrite}: a tool for term rewrite systems and tree automata (Q2849582) (← links)
- Proving termination of context-sensitive rewriting with MU-TERM (Q2867963) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- Certifying a Termination Criterion Based on Graphs, without Graphs (Q3543658) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Proving Termination with (Boolean) Satisfaction (Q5504589) (← links)
