Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. T. Arts and J. Giesl. Termination of constructor systems. In Proceedings of the Seventh Conference on Rewriting Techniques and Applications, vol. 1103 of Lecture Notes in Computer Science, pp. 63–77, New Brunswick, USA, 1996.
2. T. Arts and J. Giesl. Automatically Proving Termination Where Simplification Orderings Fail. In Proc. Colloquium on Trees in Algebra and Programming, vol. 1214 of Lecture Notes in Computer Science, pp. 261–272, Lille, France, 1997.
3. L. Bachmair and N. Dershowitz. Communication, transformation and termination. In Proceedings of the Eighth CADE, vol. 230 of Lecture Notes in Computer Science, pp. 52–60, Oxford, July 1986.
4. F. Bellegarde and P. Lescanne. Termination by completion. Applicable Algebra in Engineering, Communication and Computing, vol. 1, pp. 79–96, 1990.
5. N. Dershowitz. Orderings for term rewriting systems. TCS, 17(3), pp. 279–301, 1982.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Termination-checking for LLVM peephole optimizations;Proceedings of the 38th International Conference on Software Engineering;2016-05-14
2. Nagoya Termination Tool;Lecture Notes in Computer Science;2014
3. Uncurrying for Termination and Complexity;Journal of Automated Reasoning;2012-04-25
4. Uncurrying for Termination;Logic for Programming, Artificial Intelligence, and Reasoning;2008
5. Complete Monotonic Semantic Path Orderings;Automated Deduction - CADE-17;2000