Bounding Techniques
Bounding Techniques is a methodological framework within worst-case execution time analysis that distinguishes itself by providing systematic approaches to compute upper bounds on program execution times through static and dynamic analysis, thereby enabling safe and reliable timing predictions for real-time systems.
526
Publications
34.4K
Citations
1.2K
Authors
520
Institutions
Publications per year
2017–2026
62
526
Bounds on Multiprocessing Timing Anomalies
Ron Graham · SIAM Journal on Applied Mathematics · 1969 · 2.4K citations
Bounds for Certain Multiprocessing Anomalies
Ronald Graham · Bell System Technical Journal · 1966 · 1.6K citations
Srđjan Čapkun, Levente Buttyán, Jean‐Pierre Hubaux · 2003 · 414 citations · Full text
1–5 of 526
1.2K
7
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 1.2K
520
Carnegie Mellon University
Pittsburgh, United States
12 h-index
22 publications
1.5K citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
25 publications
544 citations

University of Bologna
Bologna, Italy
11 h-index
24 publications
2.8K citations
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
18 publications
712 citations
University of California, Berkeley
Berkeley, United States
10 h-index
21 publications
4.8K citations
North Carolina State University
Raleigh, United States
10 h-index
25 publications
718 citations

University of Waterloo
Waterloo, Canada
8 h-index
10 publications
266 citations

Imperial College London
London, United Kingdom
8 h-index
18 publications
601 citations
1–8 of 520
19 publications · 1.6K citations
16
h-index
15 publications · 486 citations
14
h-index
11 publications · 316 citations
11
h-index
9 publications · 235 citations
9
h-index
8 publications · 235 citations
8
h-index
1–5