Mechanizing and Improving Dependency Pairs
Top Cited Papers
- 10 January 2007
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 37 (3) , 155-203
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- Termination of String Rewriting Proved AutomaticallyJournal of Automated Reasoning, 2005
- Polynomials over the reals in proofs of termination : from theory to practiceRAIRO - Theoretical Informatics and Applications, 2005
- Automating the dependency pair methodInformation and Computation, 2005
- Modular and Incremental Automated Termination ProofsJournal of Automated Reasoning, 2004
- Approximations for Strategies and TerminationElectronic Notes in Theoretical Computer Science, 2002
- Termination of term rewriting using dependency pairsTheoretical Computer Science, 2000
- Generalized sufficient conditions for modular termination of rewritingApplicable Algebra in Engineering, Communication and Computing, 1994
- Counterexamples to termination for the direct sum of term rewriting systemsInformation Processing Letters, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Proofs by induction in equational theories with constructorsJournal of Computer and System Sciences, 1982