System description: The dependency pair method

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

Volumn 1833, Issue , 2000, Pages 261-264

  Arts, Thomas ^a  

^a ERICSSON RESEARCH   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84937426338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10721975_18     Document Type: Conference Paper

References (8)

1. T. Arts and J. Giesl. Modularity of termination using dependency pairs. In Proc. of RTA-98, LNCS 1379, pages 226–240, Tsukuba, Japan, March/April 1998. Springer Verlag, Berlin.
2. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science 236:133-178, 2000.
3. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
4. CiME 2 (1999). Pre-release at http://www.lri.fr/~demons/cime-2.0.html.
5. D. Detlefs and R. Forgaard. A Procedure for Automatically Proving Termination of a Set of Rewrite Rules. In Proc. of RTA-85, LNCS 202, pages 255–270, Dijon, France, May 1985, Springer Verlag, Berlin.
6. J. Giesl. Generating polynomial orderings for termination proofs. In Proc. of RTA - 9 5, LNCS 914, pages 426–431, Kaiserslautern, Germany, 1995. Springer Verlag, Berlin.
7. J. Giesl and T. Arts. Verification of Erlang Processes by Dependency Pairs Applicable Algebra in Engineering, Communication, and Computing, to appear. Preliminary version appeared as Technical Report IBN 00/52, Darmstadt University of Technology, Germany. http://www.inferenzsysteme.informatik.tu-darmstadt.de/~reports/notes/ibn-00-52.ps.
8. B. Gramlich. Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae, 24:3–23, 1995.