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 Derivation of Exact Program-Flow Constraints for a Tighter Worst-Case Execution-Time Analysis

Authors:


Research group:


Publication Type:

Conference/Workshop Paper

Venue:

Proceedings of the 11th IEEE International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS XI)

Publisher:

IEEE


Abstract

Obtaining tight worst-case execution-time (WCET) estimations of real-time tasks is crucial since overly-pessimistic estimations are deemed impractical. One way of making WCET estimations tighter is to incorporate more program-flow information e.g., context-sensitive loop bounds, infeasible-path and same-path information, etc.In this paper we present and evaluate a completely automatic analysis that dynamically derives program-flow information to use in WCET analysis. Flow information is derived by a combination of test-data generation and parsing of program-execution traces to obtain flow-fact hypotheses which are then fed to a model checker to establish their correctness. Experimental evaluation shows that our method help achieve considerable tightness in WCET estimations at a manageable cost.

Bibtex

@inproceedings{Marref2086,
author = {Amine Marref},
title = {Fully-Automatic Derivation of Exact Program-Flow Constraints for a Tighter Worst-Case Execution-Time Analysis},
month = {July},
year = {2011},
booktitle = {Proceedings of the 11th IEEE International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS XI)},
publisher = {IEEE},
url = {http://www.es.mdh.se/publications/2086-}
}