Dynamic Worst-Case Execution Time Analysis is a method of determining the upper bound on execution time of a program by analyzing observed program behaviors during runtime, differing from static approaches through its reliance on empirical execution traces and measurement-based inference.
30
Publications
955
Citations
85
Authors
37
Institutions
Publications per year
2017–2026
1
Variants
Dynamic Wcet Analysis
Publications
30
Efficient worst case timing analysis of data caching
Sung-Kwan Kim, Sang Lyul Min, Rhan Ha · 2002 · 94 citations
Real-Time Object Detection System with Multi-Path Neural Networks
Seonyeong Heo, Sungjun Cho, Youngsok Kim et al. · 2020 · 58 citations
1–5 of 30
Authors
85
- JE
3
h-index
- AE
3
h-index
- BR
2
h-index
- FS
2
h-index
- PP
2
h-index
1–5 of 85
Institutions
37
TU Wien
Vienna, Austria
4 h-index
6 publications
149 citations
TU Dortmund University
Dortmund, Germany
2 h-index
3 publications
129 citations
Paderborn University
Paderborn, Germany
2 h-index
5 publications
57 citations
Seoul National University
Seoul, South Korea
2 h-index
8 publications
382 citations
UNSW Sydney
Sydney, Australia
2 h-index
5 publications
91 citations
Information Technology University
Lahore, Pakistan
1 h-index
1 publications
15 citations
GALAB Laboratories (Germany)
Hamburg, Germany
1 h-index
2 publications
34 citations
University of Portsmouth
Portsmouth, United Kingdom
1 h-index
1 publications
12 citations
1–8 of 37
Venues
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Repository · 2 publications · 40 citations
2
h-index
- Design, Automation, and Test in Europe
Conference · 2 publications · 78 citations
2
h-index
- SAE technical papers on CD-ROM/SAE technical paper series
1 publications · 28 citations
1
h-index
- Information and Software Technology
1 publications · 17 citations
1
h-index
- Proceedings - Euromicro Workshop on Real-Time Systems/Proceedings
1 publications · 95 citations
1
h-index
1–5