Worst-case Path Analysis
Worst-Case Path Analysis is a static program analysis technique that identifies the longest feasible execution path in a software program under worst-case timing assumptions, distinguishing itself from other path analysis methods by focusing exclusively on execution paths that maximize processor cycle count for real-time system timing guarantees.
91
Publications
5K
Citations
222
Authors
93
Institutions
Publications per year
2017–2026
4
91
WCET analysis of probabilistic hard real-time systems
Guillem Bernat, A. Colin, Stefan M. Petters · 2003 · 339 citations
1–5 of 91
222
4
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 222
93

TU Wien
Vienna, Austria
5 h-index
10 publications
468 citations

Furman University
Greenville, United States
4 h-index
4 publications
116 citations
Florida State University
Tallahassee, United States
4 h-index
8 publications
202 citations

University of York
York, United Kingdom
4 h-index
10 publications
1.5K citations
Intel (United States)
Santa Clara, United States
4 h-index
13 publications
698 citations
Mälardalen University
Västerås, Sweden
3 h-index
5 publications
171 citations

Uppsala University
Uppsala, Sweden
3 h-index
3 publications
115 citations
North Carolina State University
Raleigh, United States
3 h-index
3 publications
61 citations
1–8 of 93
Repository · 4 publications · 65 citations
4
h-index
3 publications · 504 citations
3
h-index
TSE · 2 publications · 230 citations
2
h-index
2 publications · 70 citations
2
h-index
Conference · 2 publications · 37 citations
2
h-index
1–5