Tyrolean termination tool
From MaRDI portal
Recommendations
Cited in
(21)- FORT 2.0
- Proving operational termination of membership equational programs
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
- \texttt{Autowrite}: a tool for term rewrite systems and tree automata
- Proving termination of context-sensitive rewriting with MU-TERM
- TPA: Termination Proved Automatically
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
- MTT: The Maude Termination Tool (System Description)
- Certifying a Termination Criterion Based on Graphs, without Graphs
- Real_Impl
- Tsukuba termination tool
- Reachability, confluence, and termination analysis with state-compatible automata
- Nagoya termination tool
- Polynomials over the reals in proofs of termination : from theory to practice
- Proving Termination with (Boolean) Satisfaction
- Proving termination of context-sensitive rewriting by transformation
- Tyrolean termination tool: techniques and features
- On tree automata that certify termination of left-linear term rewriting systems
- Mechanizing and improving dependency pairs
- Termination of just/fair computations in term rewriting
- Matrix interpretations for proving termination of term rewriting
This page was built for publication: Tyrolean termination tool
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703847)