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
Deriving WCET Bounds by Abstract Execution
Publication Type:
Conference/Workshop Paper
Venue:
Proc. 11th International Workshop on Worst-Case Execution Time (WCET) Analysis (WCET 2011)
Publisher:
Austrian Computer Society (OCG)
Abstract
Standard static WCET analysis methods today are based on the IPET technique, where WCET estimation
is formulated as an integer linear programming (ILP) problem subject to linear program flow
constraints with an objective function derived from the hardware timing model. The estimate is then
calculated by an ILP solver. The hardware cost model, as well as the program flow constraints, are
often derived using a static program analysis framework such as abstract interpretation.
An alternative idea to estimate the WCET is to add time as an explicit variable, incremented for each
basic block in the code. The possible values of this variable can then be bound by a value analysis. We
have implemented this idea by integrating the time estimation in our Abstract Execution method for
calculating program flow constraints. This method is in principle a very detailed value analysis. As
it computes intervals bounding variable values, it bounds both the BCET and the WCET. In addition,
it derives the explicit execution paths through the program which correspond to the calculated BCET
and WCET bounds.
We have compared the precision and the analysis time with the traditional IPET technique for a
number of benchmark programs, and show that the new method typically is capable of calculating
as tight or even tighter WCET estimates in shorter time. Our current implementation can handle
simple timing models with constant execution times for basic blocks and edges in the CFG, but it is
straightforward to extend the method to more detailed hardware timing models.
Bibtex
@inproceedings{Ermedahl2202,
author = {Andreas Ermedahl and Jan Gustafsson and Bj{\"o}rn Lisper},
title = {Deriving WCET Bounds by Abstract Execution},
editor = {Chris Healy},
month = {July},
year = {2011},
booktitle = {Proc. 11th International Workshop on Worst-Case Execution Time (WCET) Analysis (WCET 2011)},
publisher = {Austrian Computer Society (OCG)},
url = {http://www.es.mdu.se/publications/2202-}
}