Automatically proving termination where simplification orderings fail-Reference-Cited by-同舟云学术

Automatically proving termination where simplification orderings fail

Published:1997 Issue: Volume: Page:261-272
ISSN:0302-9743
Container-title:TAPSOFT '97: Theory and Practice of Software Development
language:
Short-container-title:

Author:

Arts Thomas,Giesl Jürgen

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0030602

Reference23 articles.

1. T. Arts and J. Giesl. Termination of constructor systems. In Proceedings of RTA-96, LNCS 1103, pages 63–77, July 1996.

2. T. Arts and J. Giesl. Automatically proving termination where simplification orderings fail. Technical Report UU-CS-1996-44, Utrecht University, Utrecht, October 1996

3. T. Arts and J. Giesl. Proving innermost normalisation automatically. In Proceedings of RTA '97, June 2–4, 1997.

4. T. Arts. Termination by absence of infinite chains of dependency pairs. In Proceedings of CAAP'96, LNCS 1059, pages 196–210, April 1996.

5. A. Ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137–159, 1987.

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

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

2. On automating the extraction of programs from proofs using product types;Electronic Notes in Theoretical Computer Science;2002-10

3. Verification of Erlang Processes by Dependency Pairs;Applicable Algebra in Engineering, Communication and Computing;2001-06-01

4. Dependency Pairs for Equational Rewriting;Rewriting Techniques and Applications;2001

5. Termination of term rewriting using dependency pairs;Theoretical Computer Science;2000-04