Author:
Alarcón Beatriz,Lucas Salvador
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Lecture Notes in Computer Science;B. Alarcón,2006
2. Alarcón, B., Gutiérrez, R., Lucas, S.: Improving the context-sensitive dependency graph. Electronic Notes in Theoretical Computer Science (to appear, 2007)
3. Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236, 133–178 (2000)
4. Borralleras, C.: Ordering-based methods for proving termination automatically. PhD Thesis, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya (May 2003)
5. Giesl, J., Arts, T., Ohlebusch, E.: Modular Termination Proofs for Rewriting Using Dependency Pairs. Journal of Symbolic Computation 34(1), 21–58 (2002)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Proving Termination Properties with mu-term;Algebraic Methodology and Software Technology;2011
2. Improving Context-Sensitive Dependency Pairs;Logic for Programming, Artificial Intelligence, and Reasoning;2008
3. Usable Rules for Context-Sensitive Rewrite Systems;Rewriting Techniques and Applications