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

Authors

92

  1. BL
    Björn Lisper

    Mälardalen University, Sweden

    6 publications · 394 citations

    6

    h-index

  2. JG
    Jan Gustafsson

    Mälardalen University, Sweden

    5 publications · 360 citations

    5

    h-index

  3. AE
    Andreas Ermedahl

    Mälardalen University, Sweden

    5 publications · 370 citations

    5

    h-index

  4. CS
    Christer Sandberg

    Mälardalen University, Sweden

    4 publications · 319 citations

    4

    h-index

  5. SG
    Sumit Gulwani

    Microsoft (United States), United States

    4 publications · 298 citations

    4

    h-index

1–5 of 92

Venues

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

    Repository · 5 publications · 190 citations

    5

    h-index

  2. IEEE Transactions on Computers

    2 publications · 137 citations

    2

    h-index

  3. ACM SIGPLAN Notices

    2 publications · 52 citations

    2

    h-index

  4. ACM Transactions on Embedded Computing Systems

    TECS · 1 publications · 15 citations

    1

    h-index

  5. International Journal of Control

    1 publications · 12 citations

    1

    h-index

1–5