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
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Publication Type:
Conference/Workshop Paper
Venue:
Proc. Third International Workshop on Worst-Case Execution Time (WCET) Analysis
Abstract
Worst-Case Execution Time (WCET) analysis means to compute a safe upper
bound to the execution time of a piece of code. Parametric WCET
analysis yields symbolic upper bounds: expressions that may contain
parameters. These parameters may represent, for instance, values of input
parameters to the program, or maximal iteration counts for loops. We
describe a technique for fully automatic parametric WCET analysis, which is
based on known mathematical methods: an abstract interpretation to calculate
parametric constraints on program flow, a symbolic method to count integer
points in polyhedra, and a symbolic ILP technique to solve the subsequent
IPET calculation of WCET bound. The technique is capable of handling
unstructured code, and it can find upper bounds to loop iteration counts
Bibtex
@inproceedings{Lisper525,
author = {Bj{\"o}rn Lisper},
title = {Fully Automatic, Parametric Worst-Case Execution Time Analysis},
editor = {Jan Gustafsson},
pages = {77--80},
month = {July},
year = {2003},
booktitle = {Proc. Third International Workshop on Worst-Case Execution Time (WCET) Analysis},
url = {http://www.es.mdu.se/publications/525-}
}