Modular and Incremental Automated Termination Proofs
Author:
- 1 December 2004
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 32 (4) , 315-355
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Simplification and termination of strategies in rule-based languages2003
- Induction for termination with local strategiesElectronic Notes in Theoretical Computer Science, 2001
- Termination of term rewriting using dependency pairsTheoretical Computer Science, 2000
- Complete Monotonic Semantic Path OrderingsLecture Notes in Computer Science, 2000
- Transforming Context-Sensitive Rewrite SystemsLecture Notes in Computer Science, 1999
- Modularity of termination using dependency pairsLecture Notes in Computer Science, 1998
- Hierarchical termination1995
- Generalized sufficient conditions for modular termination of rewritingApplicable Algebra in Engineering, Communication and Computing, 1994
- Recursive Applicative Program Schemes1990
- Termination of rewritingJournal of Symbolic Computation, 1987