Cited in
(18)- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
- Termination of narrowing via termination of rewriting
- Reducing relative termination to dependency pair problems
- Transforming SAT into termination of rewriting
- Relative termination via dependency pairs
- Modular and certified semantic labeling and unlabeling
- TALP
- Tyrolean
- Jambox
- Matchbox
- Tsukuba
- Max/Plus tree automata for termination of term rewriting
- Methods for proving termination of rewriting-based programming languages by transformation
- Mechanizing and improving dependency pairs
- Tyrolean termination tool: techniques and features
- NaTT
- Termination of just/fair computations in term rewriting
- Innermost termination of rewrite systems by labeling
This page was built for software: TPA
