TPA
From MaRDI portal
Software:22083
swMATH10114MaRDI QIDQ22083FDOQ22083
Author name not available (Why is that?)
Cited In (12)
- 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
- Modular and certified semantic labeling and unlabeling
- Relative termination via dependency pairs
- 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
- Termination of just/fair computations in term rewriting
- Innermost termination of rewrite systems by labeling
This page was built for software: TPA
