Loop Termination

Loop Termination is a formal method in program analysis that belongs to the class of termination analysis techniques, specifically concerned with proving that a loop construct in a program will terminate after a finite number of iterations under all valid initial conditions.

35

Publications

1.3K

Citations

75

Authors

42

Institutions

Publications per year

2017–2026

4

Authors

75

  1. SG
    Samir Genaim

    Universidad Complutense de Madrid, Spain

    3 publications · 46 citations

    3

    h-index

  2. JO
    Joël Ouaknine

    University of Oxford, United Kingdom

    2 publications · 62 citations

    2

    h-index

  3. MC
    Michel Caplain

    Commissariat à l'Énergie Atomique et aux Énergies Alternatives, France

    2 publications · 69 citations

    2

    h-index

  4. ZK
    Zachary Kincaid

    University of Toronto, Canada

    2 publications · 50 citations

    2

    h-index

  5. SS
    Saurabh Srivastava

    University of Maryland, College Park, United States

    2 publications · 335 citations

    2

    h-index

1–5 of 75

Venues

  1. Journal of the American Psychoanalytic Association

    JAPA · 2 publications · 22 citations

    2

    h-index

  2. ACM SIGPLAN Notices

    2 publications · 110 citations

    2

    h-index

  3. Mathematics Magazine

    1 publications · 28 citations

    1

    h-index

  4. 1

    h-index

  5. Parallel Computing

    1 publications · 41 citations

    1

    h-index

1–5