Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems
RAIRO. Inform. théor., 16 4 (1982) 331-347
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Full-program induction: verifying array programs sans loop invariants
Supratik Chakraborty, Ashutosh Gupta and Divyesh UnadkatInternational Journal on Software Tools for Technology Transfer 24 (5) 843 (2022)
https://doi.org/10.1007/s10009-022-00676-w
Strategy based semantics for mobility with time and access permissions
Gabriel Ciobanu, Maciej Koutny and Jason StegglesFormal Aspects of Computing 27 (3) 525 (2015)
https://doi.org/10.1007/s00165-014-0324-9
Mathematical Foundations of Computer Science 2013
Jean Goubault-LarrecqLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2013 8087 22 (2013)
https://doi.org/10.1007/978-3-642-40313-2_3
Symbolic Rewriting Techniques
Ursula MartinSymbolic Rewriting Techniques 209 (1998)
https://doi.org/10.1007/978-3-0348-8800-4_10
A path ordering for proving termination of AC rewrite systems
Deepak Kapur, G. Sivakumar and Hantao ZhangJournal of Automated Reasoning 14 (2) 293 (1995)
https://doi.org/10.1007/BF00881859
Formal aspects of computing: LATEX style guide for authors
Christiane Notarmarco and Rod MulveyFormal Aspects of Computing 3 (4) 367 (1991)
https://doi.org/10.1007/BF01642509
What's so special about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theory
Jean H. GallierAnnals of Pure and Applied Logic 53 (3) 199 (1991)
https://doi.org/10.1016/0168-0072(91)90022-E
Rewriting Techniques
STEPHANE KAPLAN and JEAN-LUC REMYRewriting Techniques 141 (1989)
https://doi.org/10.1016/B978-0-12-046371-8.50011-0
Path of subterms ordering and recursive decomposition ordering revisited
Michael RusinowitchJournal of Symbolic Computation 3 (1-2) 117 (1987)
https://doi.org/10.1016/S0747-7171(87)80023-8
Termination of rewriting
Nachum DershowitzJournal of Symbolic Computation 3 (1-2) 69 (1987)
https://doi.org/10.1016/S0747-7171(87)80022-6
Proof of termination of the rewriting system subst on CCL
Thérèse Hardin and Alain LavilleTheoretical Computer Science 46 305 (1986)
https://doi.org/10.1016/0304-3975(86)90035-6
Rewriting Techniques and Applications
Nachum DershowitzLecture Notes in Computer Science, Rewriting Techniques and Applications 202 180 (1985)
https://doi.org/10.1007/3-540-15976-2_9
An algorithm for finding a minimal recursive path ordering
Hassan Aït-KaciRAIRO. Informatique théorique 19 (4) 359 (1985)
https://doi.org/10.1051/ita/1985190403591
7th International Conference on Automated Deduction
Pierre LescanneLecture Notes in Computer Science, 7th International Conference on Automated Deduction 170 166 (1984)
https://doi.org/10.1007/978-0-387-34768-4_10
Automata, Languages and Programming
P. Lescanne and J. M. SteyaertLecture Notes in Computer Science, Automata, Languages and Programming 154 466 (1983)
https://doi.org/10.1007/BFb0036930