Predicated Worst-Case Execution-Time Analysis
A. Marref and G. Bernat
Tightness in WCET estimation is highly desirable for an efficient utilisation of resources. In order to obtain accurate WCET values, more program execution history must be accounted for. In this paper we propose the use of Predicated WCET Analysis with constraint logic-programming to model context sensitive execution-times of program segments. Our method achieves considerable tightness in comparison to traditional calculation methods that exceeded 20% in some cases during evaluation. Computing the WCET of programs modeled using our approach reveals a great ease of expressing execution-time dependencies and manageable WCET-calculation time-complexity.
Download Not Available
BibTex Entry
@inproceedings{Marref2009,
author = {A. Marref and G. Bernat},
booktitle = {Proceedings of Reliable Software Technologies - Ada-Europe 2009},
editor = {F. Kordon and Y Kermarrec},
pages = {134-148},
publisher = {Springer},
title = {{P}redicated {W}orst-{C}ase {E}xecution-{T}ime {A}nalysis},
volume = {LNCS 5570},
year = {2009}
}