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

Authors

136

  1. SL
    Salvador Lucas

    Universitat Politècnica de València, Spain

    13 publications · 315 citations

    13

    h-index

  2. JG
    Jürgen Giesl

    RWTH Aachen University, Germany

    5 publications · 282 citations

    5

    h-index

  3. AM
    Aart Middeldorp

    University of Tsukuba, Japan

    5 publications · 201 citations

    5

    h-index

  4. JM
    José Meseguer

    University of Illinois Urbana-Champaign, United States

    5 publications · 98 citations

    5

    h-index

  5. MS
    Masahiko Sakai

    Kyoto University, Japan

    4 publications · 88 citations

    4

    h-index

1–5 of 136

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 14 publications · 287 citations

    13

    h-index

  2. Theoretical Computer Science

    9 publications · 333 citations

    9

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 7 publications · 184 citations

    7

    h-index

  4. Fundamenta Informaticae

    4 publications · 356 citations

    4

    h-index

  5. 4

    h-index

1–5