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
Eliminating Annotations by Automatic Flow Analysis of Real-Time Programs
Publication Type:
Conference/Workshop Paper
Venue:
Proceedings of the 7th international conference on Real-Time Computing Systems and Applications (RTCSA00)
Abstract
There is an increasing demand for methods that calculate the worst case execution time (WCET) of real-time programs. The calculations are typically based on path information for the program, such as the maximum number of iterations in loops and identification of infeasible paths. Most often, this information is given as manual annotations by the programmer.Our method calculates path information automatically for real-time programs, thereby relieving the programmer from tedious and error-prone work. The method, based on abstract interpretation, generates a safe approximation of the path information. A trade-off between quality and calculation cost is made, since finding the exact information is a complex, often intractable problem for non-trivial programs.We describe the method by a simple, worked example. We show that our prototype tool is capable of analyzing a number of program examples from the WCET literature, without using any extra information or consideration of special cases, needed in other approaches.
Bibtex
@inproceedings{Gustafsson230,
author = {Jan Gustafsson},
title = {Eliminating Annotations by Automatic Flow Analysis of Real-Time Programs},
editor = {D. C. Young},
pages = {511--516},
month = {December},
year = {2000},
booktitle = {Proceedings of the 7th international conference on Real-Time Computing Systems and Applications (RTCSA00)},
publisher = {IEEE},
url = {http://www.es.mdu.se/publications/230-}
}