Accurate Determination of Loop Iterations for Worst-Case Execution Time Analysis

Mark Bartlett; Iain Bate; Dimitar Kazakov

doi:10.1109/TC.2010.59

Accurate Determination of Loop Iterations for Worst-Case Execution Time Analysis

Mark Bartlett, Iain Bate, Dimitar Kazakov

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

Determination of accurate estimates for the Worst-Case Execution Time of a program is essential for guaranteeing the correct temporal behavior of any Real-Time System. Of particular importance is tightly bounding the number of iterations of loops in the program or excessive undue pessimism can result. This paper presents a novel approach to determining the number of iterations of a loop for such analysis. Program traces are collected and analyzed allowing the number of loop executions to be parametrically determined safely and precisely under certain conditions. The approach is mathematically proved to be safe and its practicality is demonstrated on a series of benchmarks.

Original language	English
Article number	5432156
Pages (from-to)	1520-1532
Number of pages	13
Journal	IEEE Transactions on Computers
Volume	59
Issue number	11
DOIs	https://doi.org/10.1109/TC.2010.59
Publication status	Published - 1 Nov 2010

Keywords

Real-time and embedded systems, performance of systems, testing and debugging, deduction and theorem proving, knowledge processing.

Access to Document

10.1109/TC.2010.59

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5432156

Cite this

@article{937041b438de419fa7d0c7a101fdf1fa,

title = "Accurate Determination of Loop Iterations for Worst-Case Execution Time Analysis",

abstract = "Determination of accurate estimates for the Worst-Case Execution Time of a program is essential for guaranteeing the correct temporal behavior of any Real-Time System. Of particular importance is tightly bounding the number of iterations of loops in the program or excessive undue pessimism can result. This paper presents a novel approach to determining the number of iterations of a loop for such analysis. Program traces are collected and analyzed allowing the number of loop executions to be parametrically determined safely and precisely under certain conditions. The approach is mathematically proved to be safe and its practicality is demonstrated on a series of benchmarks.",

keywords = "Real-time and embedded systems, performance of systems, testing and debugging, deduction and theorem proving, knowledge processing.",

author = "Mark Bartlett and Iain Bate and Dimitar Kazakov",

year = "2010",

month = nov,

day = "1",

doi = "10.1109/TC.2010.59",

language = "English",

volume = "59",

pages = "1520--1532",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "11",

}

TY - JOUR

T1 - Accurate Determination of Loop Iterations for Worst-Case Execution Time Analysis

AU - Bartlett, Mark

AU - Bate, Iain

AU - Kazakov, Dimitar

PY - 2010/11/1

Y1 - 2010/11/1

N2 - Determination of accurate estimates for the Worst-Case Execution Time of a program is essential for guaranteeing the correct temporal behavior of any Real-Time System. Of particular importance is tightly bounding the number of iterations of loops in the program or excessive undue pessimism can result. This paper presents a novel approach to determining the number of iterations of a loop for such analysis. Program traces are collected and analyzed allowing the number of loop executions to be parametrically determined safely and precisely under certain conditions. The approach is mathematically proved to be safe and its practicality is demonstrated on a series of benchmarks.

AB - Determination of accurate estimates for the Worst-Case Execution Time of a program is essential for guaranteeing the correct temporal behavior of any Real-Time System. Of particular importance is tightly bounding the number of iterations of loops in the program or excessive undue pessimism can result. This paper presents a novel approach to determining the number of iterations of a loop for such analysis. Program traces are collected and analyzed allowing the number of loop executions to be parametrically determined safely and precisely under certain conditions. The approach is mathematically proved to be safe and its practicality is demonstrated on a series of benchmarks.

KW - Real-time and embedded systems, performance of systems, testing and debugging, deduction and theorem proving, knowledge processing.

UR - http://www.scopus.com/inward/record.url?scp=77957579293&partnerID=8YFLogxK

U2 - 10.1109/TC.2010.59

DO - 10.1109/TC.2010.59

M3 - Article

SN - 0018-9340

VL - 59

SP - 1520

EP - 1532

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 11

M1 - 5432156

ER -

Accurate Determination of Loop Iterations for Worst-Case Execution Time Analysis

Abstract

Keywords

Access to Document

Other files and links

Using Learning to Support the Development of Embedded Systems

Cite this

Accurate Determination of Loop Iterations for Worst-Case Execution Time Analysis

Abstract

Keywords

Access to Document

Other files and links

Projects

Using Learning to Support the Development of Embedded Systems

Cite this