Safe Upper Bounds

Safe Upper Bounds is a worst-case execution time analysis metric that provides a guaranteed upper limit on the execution time of a program task, ensuring that actual execution durations never exceed this bound under any feasible operational condition.

44

Publications

2K

Citations

117

Authors

64

Institutions

Publications per year

2017–2026

3

Authors

117

  1. BL
    Björn Lisper

    Mälardalen University, Sweden

    5 publications · 368 citations

    5

    h-index

  2. RE
    Rolf Ernst

    Technische Universität Braunschweig, Germany

    3 publications · 142 citations

    3

    h-index

  3. HF
    Heiko Falk

    TU Dortmund University, Germany

    3 publications · 179 citations

    3

    h-index

  4. AE
    Andreas Ermedahl

    Mälardalen University, Sweden

    3 publications · 257 citations

    3

    h-index

  5. BN
    Borislav Nikolić

    Polytechnic Institute of Porto, Portugal

    2 publications · 48 citations

    2

    h-index

1–5 of 117

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 3 publications · 110 citations

    3

    h-index

  2. Mathematical Programming

    1 publications · 165 citations

    1

    h-index

  3. 1

    h-index

  4. 1

    h-index

  5. BMJ

    1 publications · 26 citations

    1

    h-index

1–5