Tighten the computation of Worst-Case Execution-Time by detecting feasible paths Article

Aljifri, HA, Pons, A, Tapia, MA. (2000). Tighten the computation of Worst-Case Execution-Time by detecting feasible paths . 430-436.

cited authors

  • Aljifri, HA; Pons, A; Tapia, MA

abstract

  • The time to compute the Worst-Case Execution-Time (WCET) of a real-time program depends greatly on the technique used to generate paths. A method that is not able to distinguish between executable- and dead-paths could result in overestimation of the WCET. This paper addresses the issues of determining automatically the feasible paths. The algorithm targets the assembly code representation of a super-scalar processor program so that its hardware features can be accounted for during WCET estimation. The method attempts to identify constant values in a real-time program to reduce the amount of user provided information using the concept of partially-known variables.

publication date

  • January 1, 2000

start page

  • 430

end page

  • 436