You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Static WCET Analysis based on Abstract Interpretation and Counting of Elements

Fulltext:


Authors:


Research group:


Publication Type:

Licentiate Thesis

Publisher:

Mälardalen University Press


Abstract

In a real-time system, it is crucial to ensure that all tasks of the system hold their deadlines. A missed deadline in a real-time system means that the system has not been able to function correctly. If the system is safety critical, this can lead to disaster. To ensure that all tasks keep their deadlines, the Worst-Case Execution Time (WCET) of these tasks has to be known. This can be done by measuring the execution times of a task, however, this is inflexible, time consuming and in general not safe (i.e., the worst-casemight not be found). Unless the task is measured with all possible input combinations and configurations, which is in most cases out of the question, there is no way to guarantee that the longest measured time actually corresponds to the real worst case. Static analysis analyses a safe model of the hardware together with the source or object code of a program to derive an estimate of theWCET. This estimate is guaranteed to be equal to or greater than the real WCET. This is done by making calculations which in all steps make sure that the time is exactly or conservatively estimated. In many cases, however, the execution time of a task or a program is highly dependent on the given input. Thus, the estimated worst case may correspond to some input or configuration which is rarely (or never) used in practice. For such systems, where execution time is highly input dependent, a more accurate timing analysis which take input into consideration is desired. In this thesis we present a framework based on abstract interpretation and counting of possible semantic states of a program. This is a general method of WCET analysis, which is language independent and platform independent. The two main applications of this framework are a loop bound analysis and a parametric analysis. The loop bound analysis can be used to quickly find upper bounds for loops in a program while the parametric framework provides an input-dependent estimation of theWCET. The input-dependent estimation can give much more accurate estimates if the input is known at run-time.

Bibtex

@misc{Bygde1789,
author = {Stefan Bygde},
title = {Static WCET Analysis based on Abstract Interpretation and Counting of Elements},
number = {115},
month = {March},
year = {2010},
publisher = {M{\"a}lardalen University Press},
url = {http://www.es.mdh.se/publications/1789-}
}