Rewrite System Termination
Rewrite System Termination is a formal property of rewrite systems in theoretical computer science and mathematical logic, signifying the absence of infinite reduction sequences and thus ensuring that every rewriting process eventually halts.
98
Publications
3.8K
Citations
136
Authors
83
Institutions
Publications per year
2017–2026
1
Variants
Termination Of Rewrite Systems
Parents
98
Proving termination with multiset orderings
Nachum Dershowitz, Zohar Manna · Communications of the ACM · 1979 · 540 citations · Full text
TERMINATION OF TERM REWRITING BY SEMANTIC LABELLING
Hans Zantema · Fundamenta Informaticae · 1995 · 153 citations · Full text
Computer experiments with the <i>REVE</i> term rewriting system generator
Pierre Lescanne · 1983 · 126 citations
1–5 of 98
136
13
h-index
5
h-index
5
h-index
5
h-index
4
h-index
1–5 of 136
83
Universitat Politècnica de València
Valencia, Spain
13 h-index
18 publications
420 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
11 h-index
12 publications
236 citations
University of Illinois Urbana-Champaign
Urbana, United States
9 h-index
11 publications
408 citations

Universität Innsbruck
Innsbruck, Austria
6 h-index
9 publications
228 citations
RWTH Aachen University
Aachen, Germany
6 h-index
11 publications
560 citations
Laboratoire Lorrain de Recherche en Informatique et ses Applications
Nancy, France
5 h-index
7 publications
145 citations
University of Kaiserslautern
Kaiserslautern, Germany
5 h-index
5 publications
222 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
7 publications
120 citations
1–8 of 83
ENTCS · 14 publications · 287 citations
13
h-index
9 publications · 333 citations
9
h-index
Repository · 7 publications · 184 citations
7
h-index
4 publications · 356 citations
4
h-index
4 publications · 135 citations
4
h-index
1–5