Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems-Reference-Cited by-同舟云学术

Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems

Published:1982 Issue:4 Volume:16 Page:331-347
ISSN:0399-0540
Container-title:RAIRO. Informatique théorique
language:
Short-container-title:RAIRO. Inform. théor.

Author:

Lescanne Pierre

Publisher

EDP Sciences

Link

http://www.rairo-ita.org/10.1051/ita/1982160403311/pdf

Reference19 articles.

1. 1. DERSHOWITZ N., Ordering for Term Rewriting Systems, Proc. 20th Symposium on Foundations of Computer Science, 1979, pp. 123-131, also in Theoritical Computer Science, Vol. 17, 1982, pp. 279-301.6484380525.68054

2. 2. DERSHOWITZ N., A note on Simplification Orderings, Inform. Proc. Ltrs., Vol. 9, 1979, pp. 212-215.5525350433.68044

3. 3. FRANÇON J., VIENNOT G. and VUILLEMIN J., Description and Analysis of an Efficient Priority Queues Representation, Proc. 19th Symposium of Foundations of Computer Science, 1978, pp. 1-7.539825

4. 4. HUET G., A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm, Rapport INRIA 25, 1980.0465.68014636177

5. 5. HUET G. and HULLOT J., Proof by Induction in Equational Theories with Constructors, Proc. 21th Symposium on Foundations of Computer Science, 1980.0532.68041

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

1. Full-program induction: verifying array programs sans loop invariants;International Journal on Software Tools for Technology Transfer;2022-09-29

2. Strategy based semantics for mobility with time and access permissions;Formal Aspects of Computing;2015-05

3. A Constructive Proof of the Topological Kruskal Theorem;Mathematical Foundations of Computer Science 2013;2013

4. New Directions for Syntactic Termination Orderings;Symbolic Rewriting Techniques;1998

5. A path ordering for proving termination of AC rewrite systems;Journal of Automated Reasoning;1995