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

Authors

222

  1. DW
    David Whalley

    Florida State University, United States

    4 publications · 116 citations

    4

    h-index

  2. SM
    Stefan M. Petters

    Polytechnic Institute of Porto, Portugal

    4 publications · 524 citations

    4

    h-index

  3. AE
    Andreas Ermedahl

    Mälardalen University, Sweden

    4 publications · 156 citations

    4

    h-index

  4. CH
    Christopher Healy

    Florida State University, United States

    4 publications · 116 citations

    4

    h-index

  5. PP
    Peter Puschner

    TU Wien, Austria

    4 publications · 238 citations

    4

    h-index

1–5 of 222

Venues

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

    Repository · 4 publications · 65 citations

    4

    h-index

  2. Real-Time Systems

    3 publications · 504 citations

    3

    h-index

  3. IEEE Transactions on Software Engineering

    TSE · 2 publications · 230 citations

    2

    h-index

  4. 2

    h-index

  5. 2

    h-index

1–5