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

Algorithms for Infeasible Path Calculation

Fulltext:


Note:

Satellite Workshop held in conjunction with the 18th International Real-Time Systems Conference (ECRTS2006)

Research group:


Publication Type:

Conference/Workshop Paper

Venue:

Sixth International Workshop on Worst-Case Execution Time Analysis, (WCET2006)


Abstract

Static Worst-Case Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component in static WCET analysis is to derive flow information, such as loop bounds and infeasible paths.Such flow information can be provided as either as annotations by the user, can be automatically calculated by a flow analysis, or by a combination of both. To make the analysis as simple, automatic and safe as possible, this flow information should be calculated automatically with no or very limited user interaction.In this paper we present three novel algorithms to calculate infeasible paths. The algorithms are all designed to be simple and efficient, both in terms of generated flow facts and in analysis running time. The algorithms have been implemented and tested for a set of WCET benchmarks programs.

Bibtex

@inproceedings{Gustafsson953,
author = {Jan Gustafsson and Andreas Ermedahl and Bj{\"o}rn Lisper},
title = {Algorithms for Infeasible Path Calculation},
note = {Satellite Workshop held in conjunction with the 18th International Real-Time Systems Conference (ECRTS2006)},
month = {July},
year = {2006},
booktitle = {Sixth International Workshop on Worst-Case Execution Time Analysis, (WCET2006)},
url = {http://www.es.mdh.se/publications/953-}
}