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

Faster WCET Flow Analysis by Program Slicing

Fulltext:


Authors:

Christer Sandberg, Andreas Ermedahl, Jan Gustafsson, Björn Lisper

Research group:

Programming Languages

Publication Type:

Conference/Workshop Paper

Venue:

ACM SIGPLAN Conference on Languages, Compilers and Tools for Embedded Systems (LCTES2006)

Publisher:

ACM

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. WCET analysis needs a program flow analysis to derive constraints on the possible execution paths of the analysed program, like iteration bounds for loops and dependences between conditionals.Current WCET analysis tools typically obtain flow information through manual annotations. Better support for automatic flow analysis would eliminate much of the need for this laborious work. However, to automatically derive high-quality flow information is hard, and solution techniques with large time and space complexity are often required.In this paper we describe how to use program slicing to reduce the computational need of flow analysis methods. The slicing identifes statements and variables which are guaranteed not to influence the program flow. When these are removed, the calculation time of our different flow analyses decreases, in some cases considerably.We also show how program slicing can be used to identify the input variables and globals that control the outcome of a particular loop or conditional. This should be valuable aid when performing WCET analysis and systematic testing of large and complex real-time programs.

Bibtex

@inproceedings{Sandberg952,
author = {Christer Sandberg and Andreas Ermedahl and Jan Gustafsson and Bj{\"o}rn Lisper},
title = {Faster WCET Flow Analysis by Program Slicing},
month = {June},
year = {2006},
booktitle = {ACM SIGPLAN Conference on Languages, Compilers and Tools for Embedded Systems (LCTES2006)},
publisher = {ACM},
url = {http://www.es.mdu.se/publications/952-}
}