Nagoya Termination Tool

DOI10.1007/978-3-319-08918-8_32zbMath1416.68183arXiv1404.6626OpenAlexW2183669711MaRDI QIDQ5170837

Toshiki Sakabe, Akihisa Yamada, Keiichirou Kusakari

Publication date: 24 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.6626

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (11)

Relative termination via dependency pairs ⋮ Encoding Dependency Pair Techniques and Control Strategies for Maximal Completion ⋮ Reducing Relative Termination to Dependency Pair Problems ⋮ Satisfiability Checking: Theory and Applications ⋮ Unnamed Item ⋮ Automated termination analysis of polynomial probabilistic programs ⋮ Multi-dimensional interpretations for termination of term rewriting ⋮ Confluence by critical pair analysis revisited ⋮ Nagoya Termination Tool ⋮ Tuple interpretations for termination of term rewriting ⋮ Term orderings for non-reachability of (conditional) rewriting

Uses Software

• NaTT

This page was built for publication: Nagoya Termination Tool