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
Parents
35
From program verification to program synthesis
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Foster · 2010 · 268 citations
Finding Invariant assertions for proving programs
Michel Caplain · ACM SIGPLAN Notices · 1975 · 43 citations · Full text
1–5 of 35
75
3
h-index
2
h-index
Commissariat à l'Énergie Atomique et aux Énergies Alternatives, France
2 publications · 69 citations
2
h-index
2
h-index
2
h-index
1–5 of 75
42
Commissariat à l'Énergie Atomique et aux Énergies Alternatives
Paris, France
2 h-index
2 publications
69 citations
University of Maryland, College Park
College Park, United States
2 h-index
4 publications
670 citations
University of Oxford
Oxford, United Kingdom
2 h-index
5 publications
147 citations
Princeton University
Princeton, United States
2 h-index
3 publications
66 citations
KU Leuven
Leuven, Belgium
2 h-index
3 publications
97 citations
Microsoft (United States)
Redmond, United States
2 h-index
2 publications
335 citations
Korea Atomic Energy Research Institute
Daejeon, South Korea
1 h-index
4 publications
108 citations

Queensland University of Technology
Brisbane, Australia
1 h-index
2 publications
28 citations
1–8 of 42
JAPA · 2 publications · 22 citations
2
h-index
2 publications · 110 citations
2
h-index
1 publications · 28 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 41 citations
1
h-index
1–5