Proving innermost normalisation automatically-Reference-Cited by-同舟云学术

Proving innermost normalisation automatically

Published:1997 Issue: Volume: Page:157-171
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/3-540-62950-5_68.pdf

Reference24 articles.

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

2. T. Arts and J. Giesl. Proving innermost normalisation automatically. Tech. Report IBN 96/39, TH Darmstadt, 1996. http://kirmes.inferenzsysteme. informatik.th-darmstadt.de/∼reports/notes/ibn-96-39.ps

3. T. Arts and J. Giesl. Automatically proving termination where simplification orderings fail. In Proceedings of CAAP'97, LNCS, 1997.

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

5. T. Arts and H. Zantema. Termination of logic programs using semantic unification. In Proceedings of LoPSTr'95, LNCS 1048, pages 219–233, 1995.

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

1. Using Well-Founded Relations for Proving Operational Termination;Journal of Automated Reasoning;2019-02-11

2. Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting;Lecture Notes in Computer Science;2015

3. Termination of Priority Rewriting;Language and Automata Theory and Applications;2009

4. A Proof of Weak Termination Providing the Right Way to Terminate;Theoretical Aspects of Computing - ICTAC 2004;2005

5. Program Generation, Termination, and Binding-Time Analysis;Generative Programming and Component Engineering;2002