TPA: Termination Proved Automatically
From MaRDI portal
Publication:3527299
DOI10.1007/11805618_19zbMath1151.68635OpenAlexW1953115831MaRDI QIDQ3527299
Publication date: 25 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11805618_19
Related Items (14)
Relative termination via dependency pairs ⋮ Reducing Relative Termination to Dependency Pair Problems ⋮ Tyrolean termination tool: techniques and features ⋮ Mechanizing and improving dependency pairs ⋮ Maximal Termination ⋮ Arctic Termination ...Below Zero ⋮ Root-Labeling ⋮ Termination of just/fair computations in term rewriting ⋮ Termination of narrowing via termination of rewriting ⋮ Certification of Proving Termination of Term Rewriting by Matrix Interpretations ⋮ Methods for Proving Termination of Rewriting-based Programming Languages by Transformation ⋮ TPA ⋮ Transforming SAT into Termination of Rewriting ⋮ Innermost Termination of Rewrite Systems by Labeling
This page was built for publication: TPA: Termination Proved Automatically