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

Merging Techniques for Faster Derivation of WCET Flow Information using Abstract Execution

Fulltext:


Authors:

Jan Gustafsson, Andreas Ermedahl

Note:

Conference homepage: http://www.artist-embedded.org/artist/WCET-08.html

Research group:

Programming Languages

Publication Type:

Conference/Workshop Paper

Venue:

Proceedings of the 8th International Workshop on Worst-Case Execution Time Analysis (WCET08)

Abstract

Static Worst-Case Execution Time (WCET) analysis derives 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. We have previously introduced abstract execution (AE), a method capable of deriving very precise flow information. This paper present different merging techniques that can be used by AE for trading analysis time for flow information precision. It also presents a new technique, ordered merging, which may radically shorten AE analysis times, especially when analyzing large programs with many possible input variable values.

Bibtex

@inproceedings{Gustafsson1296,
author = {Jan Gustafsson and Andreas Ermedahl},
title = {Merging Techniques for Faster Derivation of WCET Flow Information using Abstract Execution},
note = {Conference homepage: http://www.artist-embedded.org/artist/WCET-08.html},
month = {July},
year = {2008},
booktitle = {Proceedings of the 8th International Workshop on Worst-Case Execution Time Analysis (WCET08)},
url = {http://www.es.mdu.se/publications/1296-}
}