Dependency Pairs Revisited
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 249-268
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Automated Termination Proofs with AProVELecture Notes in Computer Science, 2004
- Tsukuba Termination ToolLecture Notes in Computer Science, 2003
- Automating the Dependency Pair MethodLecture Notes in Computer Science, 2003
- Improving Dependency PairsLecture Notes in Computer Science, 2003
- Modular Termination Proofs for Rewriting Using Dependency PairsJournal of Symbolic Computation, 2002
- Complete Monotonic Semantic Path OrderingsLecture Notes in Computer Science, 2000
- Term Rewriting and All That1998
- 33 Examples of terminationLecture Notes in Computer Science, 1995
- Generalized sufficient conditions for modular termination of rewritingApplicable Algebra in Engineering, Communication and Computing, 1994
- Commutation, transformation, and termination1986