Tyrolean Termination Tool-Reference-Cited by-同舟云学术

Tyrolean Termination Tool

Published:2005 Issue: Volume: Page:175-184
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Hirokawa Nao,Middeldorp Aart

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-32033-3_14.pdf

Reference19 articles.

1. Lecture Notes in Computer Science;T. Aoto,2003

2. Aoto, T., Yamada, T.: Termination of simply-typed applicative term rewriting systems. In: Proc. 2nd HOR, Technical Report AIB-2004-03, RWTH Aachen, pp. 61–65 (2004)

3. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)

4. Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-09, RWTH Aachen (2001)

5. Contejean, E., Marché, C., Monate, B., Urbain, X.: CiME version 2 (2000), Available at http://cime.lri.fr/

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reachability Analysis with State-Compatible Automata;Language and Automata Theory and Applications;2014

2. Proving operational termination of membership equational programs;Higher-Order and Symbolic Computation;2008-04-26

3. Proving Termination with (Boolean) Satisfaction;Logic-Based Program Synthesis and Transformation;2008

4. Certifying a Termination Criterion Based on Graphs, without Graphs;Lecture Notes in Computer Science;2008

5. Matrix Interpretations for Proving Termination of Term Rewriting;Journal of Automated Reasoning;2007-12-11