Author:
Dershowitz Nachum,Hoot Charles
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Ahlem Ben Cherifa and Pierre Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137–159, 1987.
2. Robert M. Burstall. Proving properties of programs by structural induction. Computing J., 12(1):41–48, February 1969.
3. Paul J. Cohen. Decision procedures for real and p-adic fields. Comm. Pure and Applied Math, 22(2): 279–301, March 1969.
4. Nachum Dershowitz. Termination of linear rewriting systems. In Proceedings of the Eighth International Colloquium on Automata, Languages and Programming, pages 448–458, Acre, Israel, July 1981. European Association of Theoretical Computer Science. Vol. 115 of Lecture Notes in Computer Science, Springer-Verlag, Berlin.
5. Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279–301, March 1982.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS;International Journal of Foundations of Computer Science;2005-06
2. Termination Proofs for String Rewriting Systems via Inverse Match-Bounds;Journal of Automated Reasoning;2005-05
3. Proving Termination with Adornments;Logic Based Program Synthesis and Transformation;2004
4. Match-Bounded String Rewriting Systems;Mathematical Foundations of Computer Science 2003;2003
5. Acceptability with General Orderings;Computational Logic: Logic Programming and Beyond;2002