The size-change principle and dependency pairs for termination of term rewriting-Reference-Cited by-同舟云学术

The size-change principle and dependency pairs for termination of term rewriting

Published:2005-06-22 Issue:4 Volume:16 Page:229-270
ISSN:0938-1279
Container-title:Applicable Algebra in Engineering, Communication and Computing
language:en
Short-container-title:AAECC

Author:

Thiemann René,Giesl Jürgen

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Algebra and Number Theory

Link

http://link.springer.com/content/pdf/10.1007/s00200-005-0179-7.pdf

Reference32 articles.

1. Anderson, H., Khoo, S. C.: Affine-based size-change termination. In: Proc. 1st APLAS, LNCS 2895, 2003, pp 122–140

2. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236, 133–178 (2000)

3. Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-09, RWTH Aachen, Germany, 2001. Available from http://aib.informatik.rwth-aachen.de

4. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, 1998

5. Borralleras, C., Ferreira, M., Rubio, A.: Complete monotonic semantic path orderings. In: Proc. 17th CADE, LNAI 1831, 2000, pp 346–364

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Formal Verification of Termination Criteria for First-Order Recursive Functions;Journal of Automated Reasoning;2023-11-29

2. Formalizing the dependency pair criterion for innermost termination;Science of Computer Programming;2020-09

3. Size-based termination of higher-order rewriting;Journal of Functional Programming;2018

4. The Strength of the SCT Criterion;Lecture Notes in Computer Science;2017

5. The Certification Problem Format;Electronic Proceedings in Theoretical Computer Science;2014-10-29