Termination Proofs

Termination Proofs is a formal method in program verification that belongs to the class of proof techniques in termination analysis and specifically establishes that a program or computational process will inevitably reach a final state in finite time under all valid execution paths.

236

Publications

10.7K

Citations

342

Authors

190

Institutions

Publications per year

2017–2026

17

Authors

342

  1. JG
    Jürgen Giesl

    RWTH Aachen University, Germany

    11 publications · 536 citations

    11

    h-index

  2. SL
    Salvador Lucas

    Universitat Politècnica de València, Spain

    10 publications · 305 citations

    10

    h-index

  3. BC
    Byron Cook

    Microsoft Research (United Kingdom), United Kingdom

    10 publications · 940 citations

    10

    h-index

  4. AR
    Andrey Rybalchenko

    Max Planck Institute for Informatics, Germany

    8 publications · 1.4K citations

    8

    h-index

  5. PS
    Peter Schneider–Kamp

    University of Southern Denmark, Denmark

    8 publications · 368 citations

    8

    h-index

1–5 of 342

Venues

  1. Journal of Automated Reasoning

    11 publications · 425 citations

    11

    h-index

  2. 10

    h-index

  3. ACM SIGPLAN Notices

    10 publications · 692 citations

    10

    h-index

  4. Electronic Notes in Theoretical Computer Science

    ENTCS · 10 publications · 178 citations

    10

    h-index

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

    Repository · 8 publications · 224 citations

    8

    h-index

1–5