Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing 2011
DOI: 10.1109/isorc.2011.27
|View full text |Cite
|
Sign up to set email alerts
|

Improving the Confidence in Measurement-Based Timing Analysis

Abstract: Measurement-based timing analysis (MBTA) is a hybrid approach that combines execution-time measurements with static program analysis techniques to obtain an estimate of the worst-case execution time (WCET) of a program. The most challenging part of MBTA is test data generation. Choosing an adequate set of test vectors determines safety and efficiency of the overall analysis. So far, there are no feasible criteria that determine how well the worst-case temporal behavior of program parts is covered by a given te… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 18 publications
(19 citation statements)
references
References 18 publications
(15 reference statements)
0
13
0
Order By: Relevance
“…Bünte et al [3] examined the efectiveness of using model checking [10] to produce test suites with enough coverage to provide reliable WCET estimates. Their research focuses on identifying efective coverage metrics to drive a model checking test suite generator.…”
Section: Automatic Test Case Generationmentioning
confidence: 99%
“…Bünte et al [3] examined the efectiveness of using model checking [10] to produce test suites with enough coverage to provide reliable WCET estimates. Their research focuses on identifying efective coverage metrics to drive a model checking test suite generator.…”
Section: Automatic Test Case Generationmentioning
confidence: 99%
“…Some works a empt to reduce programs to a single execution path building on constant-time predicated instructions [28], but its requirements and cost are di cult to leverage with industrial practice. Other approaches, instead, use genetic algorithms and model checking to generate input vectors to achieve full path coverage [4,36], but con dence on the results is limited due to their heuristic nature. In the context of MBPTA, only PUB [14] and EPC [38] have been proposed to achieve full path coverage.…”
Section: Related Workmentioning
confidence: 99%
“…This however poses some requirements on the platform and compiler infrastructure, which might break consolidated industrial practice. On the opposite side of the spectrum of potential solutions, methods based on genetic algorithms and model checking have been proposed, with alternate fortune, in the last years to automatically generate the input vectors required to achieve full path coverage [28], [29]. However, the genetic algorithm these methods rely on are generally exposed to local minima/maxima that can prevent them from being successfully applied.…”
Section: Related Workmentioning
confidence: 99%