Author:
Endrullis Joerg,Hendriks Dimitri
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference32 articles.
1. B. Alarcón, F. Emmes, C. Fuhs, J. Giesl, R. Gutiérrez, S. Lucas, P. Schneider-Kamp, and R. Thiemann. Improving Context-Sensitive Dependency Pairs. InProc. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2008), volume 5330 ofLNCS, pages 636-651. Springer, 2008.
2. Termination of term rewriting using dependency pairs
3. B. Alarcón, R. Gutiérrez, and S. Lucas. Context-Sensitive Dependency Pairs. InProc. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2006), volume 4337 ofLNCS, pages 297-308. Springer, 2006.
4. H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. http://www.grappa.univ-lille3.fr/tata, 2007.
5. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude.Electronic Notes in Theoretical Computer Science, 4, 1996.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献