Tsukuba termination tool

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2706, Issue , 2003, Pages 311-320

  Hirokawa, Nao ^a   Middeldorp, Aart ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

DEPENDENCY PAIR METHODS; FIRST ORDER; HIGH QUALITY; REWRITE SYSTEMS; WEB INTERFACE;

ARTIFICIAL INTELLIGENCE;

EID: 84947714965     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44881-0_22     Document Type: Conference Paper

References (19)

1. T. Arts. System description: The dependency pair method. In Proc. 11th RTA, volume 1833 of LNCS, pages 261–264, 2001.
2. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133–178, 2000.
3. T. Arts and J. Giesl.: A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-09, RWTH Aachen, 2001. Available at http://aib.informatik.rwth-aachen.de/.
4. C. Borralleras, M. Ferreira, and A. Rubio. Complete monotonic semantic path orderings. In Proc. 17th CADE, volume 1831 of LNAI, pages 346–364, 2000.
5. E. Contejean, C. Marchè, B. Monate, and X. Urbain. CiME version 2, 2000. Available at http://cime.lri.fr/.
6. N. Dershowitz 33 Examples of termination. In French Spring School of Theoretical Computer Science, volume 909 of LNCS, pages 16–26, 1995.
7. J. Giesl, T. Arts, and E. Ohlebusch. Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation, 34(1):21–58, 2002.
8. http://www.research.att.com/sw/tools/graphviz/.
9. N. Hirokawa and A. Middeldorp. Automating the dependency pair method. In Proc. 19th CADE, LNAI, 2003. To appear.
10. D.J. King and J. Launchbury. Structuring depth-first search algorithms in Haskell. In Proc. 22nd POPL, pages 344–354, 1995.
11. K. Korovin and A. Voronkov. Verifying orientability of rewrite rules using the Knuth-Bendix order. In Proc. 12th RTA, volume 2051 of LNCS, pages 137–153, 2001.
12. A. Middeldorp. Approximations for strategies and termination. In Proc. 2nd WRS, volume 70(6) of Electronic Notes in Theoretical Computer Science, 2002.
13. http://caml.inria.fr/ocaml/.
14. E. Ohlebusch. Hierarchical termination revisited. Information Processing Letters, 84(4):207–214, 2002.
15. J. Steinbach. Automatic termination proofs with transformation orderings. In Proc. 6th RTA, volume 914 of LNCS, pages 11–25, 1995.
16. J. Steinbach and U. Kühler. Check your ordering – termination proofs and open problems. Technical Report SR-90-25, Universität Kaiserslautern, 1990.
17. Joachim Steinbach. Simplification orderings: History of results. Fundamenta Informaticae, 24:47–87, 1995.
18. X. Urbain. Automated incremental termination proofs for hierarchically defined term rewriting systems. In Proc. IJCAR, volume 2083 of LNAI, pages 485–498, 2001.
19. X. Urbain. Modular & incremental automated termination proofs. Journal of Automated Reasoning, 2003. To appear.