Guaranteed Loop Bound Identification from Program Traces for WCET

Authors:
Mark Bartlett;Iain Bate;Dimitar Kazakov
Affiliations:
-;-;-
Venue:
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Year:
2009

Citing 0
Cited 2

Approximate Worst-Case Execution Time Analysis for Early Stage Embedded Systems Development

SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
Mesh independent loop fusion for unstructured mesh applications

Proceedings of the 9th conference on Computing Frontiers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Static analysis can be used to determine safe estimates of Worst Case Execution Time. However, overestimation of the number of loop iterations, particularly in nested loops, can result in substantial pessimism in the overall estimate. This paper presents a method of determining exact parametric values of the number of loop iterations for a particular class of arbitrarily deeply nested loops. It is proven that values are guaranteed to be correct using information obtainable from a finite and quantifiable number of program traces. Using the results of this proof, a tool is constructed and its scalability assessed.