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

SWEET – a Tool for WCET Flow Analysis

Fulltext:


Authors:

Björn Lisper

Research group:

Programming Languages

Publication Type:

Conference/Workshop Paper

Venue:

6th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation

Publisher:

Springer-Verlag

DOI:

10.1007/978-3-662-45231-8_38

Abstract

An important part of Worst-Case Execution Time (WCET) analysis is to find constraints on the possible program flows. Upper bounds on the number of loop iterations are necessary to bound the execution time at all, and other kinds of constraints can help increasing the precision of the WCET analysis significantly by ruling out certain paths. Thus, methods and tools to find such constraints are sorely needed. Without such tools, such constraints must be provided manually by the user: this can be tedious and error-prone, and the soundness of the WCET analysis may be compromised if unsound program flow constraints are specified.SWEET (SWEdish Execution Time tool) is a tool that derives such program flow constraints, encoded as arithmetic constraints on execution counters (so-called "Flow Facts"), automatically. SWEET can compute a variety of Flow Facts, from simple loop iteration bounds to complex infeasible path constraints. It can analyze a variety of code formats through translation into an intermediate format. In this talk we will describe the capabilities of SWEET, the algorithms used, and its architecture.

Bibtex

@inproceedings{Lisper3693,
author = {Bj{\"o}rn Lisper},
title = {SWEET – a Tool for WCET Flow Analysis},
isbn = {978-3-662-45230-1},
editor = {Bernhard Steffen},
pages = {482--485},
month = {October},
year = {2014},
booktitle = {6th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation},
publisher = {Springer-Verlag},
url = {http://www.es.mdu.se/publications/3693-}
}