Termination Of Imperative Programs
Termination of Imperative Programs is a formal method in program analysis that determines whether a given imperative program will always halt under all possible execution paths by analyzing its control flow and loop structures to ensure finite execution.
29
Publications
1.3K
Citations
54
Authors
32
Institutions
Publications per year
2017–2026
5
Parents
29
Eliminating covert flows with minimum typings
Dennis Volpano, Geoffrey Smith · 2002 · 150 citations
Abstract debugging of higher-order imperative languages
François Bourdoncle · 1993 · 147 citations
Bart Jacobs, Frank Piessens · Lirias (KU Leuven) · 2008 · 104 citations · Full text
Automatic numeric abstractions for heap-manipulating programs
S. Magill, Ming-Hsien Tsai, Peter Lee et al. · 2010 · 79 citations
1–5 of 29
54
Institute of Science and Technology Austria, Austria
3 publications · 126 citations
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 54
32
Institute of Science and Technology Austria
Klosterneuburg, Austria
3 h-index
5 publications
224 citations

TU Wien
Vienna, Austria
2 h-index
6 publications
219 citations
National University of Singapore
Singapore, Singapore
2 h-index
4 publications
102 citations
University of Verona
Verona, Italy
2 h-index
2 publications
29 citations

Shenzhen University
Shenzhen, China
2 h-index
2 publications
51 citations
Teesside University
Middlesbrough, United Kingdom
2 h-index
2 publications
51 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
6 publications
234 citations

National Taiwan University
Taipei, Taiwan
2 h-index
4 publications
182 citations
1–8 of 32
4 publications · 95 citations
4
h-index
PACMPL · 2 publications · 94 citations
2
h-index
1 publications · 31 citations
1
h-index
Repository · 1 publications · 16 citations
1
h-index
ENTCS · 1 publications · 13 citations
1
h-index
1–5