Subject
General Computer Science,Theoretical Computer Science
Reference48 articles.
1. T. Arts, Termination by absence of infinite chains of dependency pairs, in: H. Kirchner (Ed.), Proc. 21st Internat. Colloquium on Trees in Algebra and Programming, CAAP ’96, Lecture Notes in Computer Science, vol. 1059, Linköping, Sweden, April, Springer, Berlin, 1986, pp. 196–210.
2. T. Arts, Automatically proving termination and innermost normalisation of term rewriting systems, Ph.D. Thesis, Utrecht University, The Netherlands, May 1997.
3. T. Arts, J. Giesl, Termination of constructor systems, in: H. Ganzinger (Ed.), Proc. 7th Internat. Conf. on Rewriting Techniques and Applications, RTA-96, Lecture Notes in Computer Science, vol. 1103, New Brunswick, NJ, USA, July, Springer, Berlin, 1996, pp. 63–77.
4. T. Arts, J. Giesl, Automatically proving termination where simplification orderings fail, in: M. Dauchet (Ed.), Proc. 7th Internat. Joint Conf. on the Theory and Practice of Software Development, TAPSOFT ’97, Lecture Notes in Computer Science, vol. 1214, Lille, France, April, Springer, Berlin, 1997, pp. 261–272.
5. T. Arts, J. Giesl, Proving innermost normalisation automatically, in: H. Comon (Ed.), Proc. 8th Internat. Conf. on Rewriting Techniques and Applications, RTA-97, Lecture Notes in Computer Science, vol. 1232, Sitges, Spain, June, Springer, Berlin, 1997, pp. 157–171.
Cited by
341 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献