Proving termination of (conditional) rewrite systems-Reference-Cited by-同舟云学术

Proving termination of (conditional) rewrite systems

Published:1993-06 Issue:6 Volume:30 Page:537-568
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Bevers Eddy,Lewi Johan

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

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

Reference42 articles.

1. Apt, K.R., Pedreschi, D.: Studies in pure prolog: termination. In: Lloyd, J.W. (ed.) Proc. Esprit Symposium on Computational Logic, pp. 150?176, 1990

2. Avenhaus, J., Madlener, K.: Term rewriting and equational reasoning. In: Banerji, R.B. (ed.) Formal techniques in artificial intelligence. A sourcebook, pp. 1?44. Amsterdam: Elsevier 1990

3. Lect. Notes Comput. Sci.;L. Bachmair,1986

4. Bachmair, L.: Proof methods for equational theories. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1987

5. Lect. Notes Comput. Sci.;F. Bellegarde,1987

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

1. Verification of Programs with Mutual Recursion in Pifagor Language;Automatic Control and Computer Sciences;2018-12

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

3. A formal specification of geometric refinements;The Visual Computer;1999-10-01

4. Termination of nested and mutually recursive algorithms;Journal of Automated Reasoning;1997

5. Term rewrite systems to derive set boolean operations on 2D objects;FME '97: Industrial Applications and Strengthened Foundations of Formal Methods;1997