Modularity of termination using dependency pairs-Reference-Cited by-同舟云学术

Modularity of termination using dependency pairs

Published:1998 Issue: Volume: Page:226-240
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Arts Thomas,Giesl Jürgen

Publisher

Springer Berlin Heidelberg

Link

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

Reference33 articles.

1. T. Arts & J. Giesl, Termination of constructor systems. In Proc. RTA-96, LNCS 1103, pp. 63–77, New Brunswick, NJ, 1996.

2. T. Arts & J. Giesl, Automatically proving termination where simplification orderings fail. TAPSOFT '97, LNCS 1214, pp. 261–273, Lille, France, 1997.

3. T. Arts & J. Giesl, Proving innermost normalisation automatically. In Proc. RTA-97, LNCS 1232, pp. 157–172, Sitges, Spain, 1997.

4. T. Arts & J. Giesl, Modularity of termination using dependency pairs. Tech. Rep. IBN 97/45, TU Darmstadt, 1997. http://www.inferenzsysteme. informatik.tu-darmstadt.de/~reports/notes/ibn-97-45.ps

5. T. Arts, Termination by absence of infinite chains of dependency pairs. In Proc. CAAP '96, LNCS 1059, pp. 196–210, Linköping, Sweden, 1996.

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

1. Modular and Incremental Automated Termination Proofs;Journal of Automated Reasoning;2004-12

2. Modular Termination Proofs for Rewriting Using Dependency Pairs;Journal of Symbolic Computation;2002-07

3. Approximating Dependency Graphs Using Tree Automata Techniques;Automated Reasoning;2001

4. Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems;Automated Reasoning;2001

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