Loop Bound Analysis
Loop Bound Analysis is a static analysis method used in worst-case execution time analysis that determines the maximum number of iterations a loop can execute by identifying loop-specific constraints and control flow properties, thereby enabling precise bounding of cyclic behavior in real-time systems.
43
Publications
1.8K
Citations
92
Authors
48
Institutions
Publications per year
2017–2026
2
43
Control-flow refinement and progress invariants for bound analysis
Sumit Gulwani, Sagar Jain, Eric Koskinen · 2009 · 130 citations
Supporting Timing Analysis by Automatic Bounding of Loop Iterations
Christopher Healy, Mikael Sjödin, V. Rustagi et al. · Real-Time Systems · 2000 · 128 citations
Time and Parallel Processor Bounds for Fortran-Like Loops
Banerjee, Shyh-Ching Chen, Kuck et al. · IEEE Transactions on Computers · 1979 · 119 citations
The reachability-bound problem
Sumit Gulwani, Florian Zuleger · 2010 · 116 citations
1–5 of 43
92
6
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 92
48
Mälardalen University
Västerås, Sweden
5 h-index
16 publications
1.1K citations
Microsoft (United States)
Redmond, United States
5 h-index
5 publications
333 citations

TU Wien
Vienna, Austria
4 h-index
6 publications
203 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
8 publications
526 citations
Nanyang Technological University
Singapore, Singapore
2 h-index
4 publications
156 citations
Louisiana State University
Baton Rouge, United States
2 h-index
2 publications
75 citations
Florida State University
Tallahassee, United States
2 h-index
1 publications
15 citations
University of Cambridge
Cambridge, United Kingdom
2 h-index
2 publications
161 citations
1–8 of 48
Repository · 5 publications · 190 citations
5
h-index
2 publications · 137 citations
2
h-index
2 publications · 52 citations
2
h-index
TECS · 1 publications · 15 citations
1
h-index
1 publications · 12 citations
1
h-index
1–5