TPA: Termination Proved Automatically

DOI10.1007/11805618_19MaRDI QIDQ3527299zbMATH OpenOpenAlexFDO

Authors Adam Koprowski

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Term Rewriting and Applications
• scientific article; zbMATH DE number 2043537
• Termination Analysis by Dependency Pairs and Inductive Theorem Proving
• Termination of string rewriting proved automatically
• Tyrolean termination tool: techniques and features

Cited in

(16)

• TPA
• Relative termination via dependency pairs
• Methods for proving termination of rewriting-based programming languages by transformation
• Innermost termination of rewrite systems by labeling
• Reducing relative termination to dependency pair problems
• Maximal Termination
• Arctic Termination ...Below Zero
• Root-Labeling
• Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
• Transforming SAT into termination of rewriting
• Certification of Proving Termination of Term Rewriting by Matrix Interpretations
• Term Rewriting and Applications
• Tyrolean termination tool: techniques and features
• Mechanizing and improving dependency pairs
• Termination of just/fair computations in term rewriting
• Termination of narrowing via termination of rewriting

This page was built for publication: TPA: Termination Proved Automatically

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527299)