A Proof of Weak Termination Providing the Right Way to Terminate-Reference-Cited by-同舟云学术

A Proof of Weak Termination Providing the Right Way to Terminate

Published:2005 Issue: Volume: Page:356-371
ISSN:0302-9743
Container-title:Theoretical Aspects of Computing - ICTAC 2004
language:
Short-container-title:

Author:

Fissore Olivier,Gnaedig Isabelle,Kirchner Hélène

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-31862-0_26.pdf

Reference20 articles.

1. Arts, T., Giesl, J.: Proving innermost normalization automatically. Technical Report 96/39, Technische Hochschule Darmstadt, Germany (1996)

2. Lecture Notes in Computer Science;T. Arts,1997

3. Borovanský, P., Kirchner, C., Kirchner, H., Moreau, P.-E., Ringeissen, C.: An overview of ELAN. In: Kirchner, C., Kirchner, H. (eds.) Proceedings of the second International Workshop on Rewriting Logic and Applications, Pont-à-Mousson (France). Electronic Notes in Theoretical Computer Science, vol. 15 (September 1998), Report LORIA 98-R-316, http://www.elsevier.nl/locate/entcs/volume15.html

4. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: Specification and programming in rewriting logic. Theoretical Computer Science 285, 187–243 (2002)

5. Comon, H.: Disunification: a survey. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic. Essays in honor of Alan Robinson, ch. 9, pp. 322–359. The MIT press, Cambridge (1991)

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

1. Proving Positive Almost Sure Termination Under Strategies;Lecture Notes in Computer Science;2006

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