2015 IEEE Real-Time Systems Symposium 2015
DOI: 10.1109/rtss.2015.39
|View full text |Cite
|
Sign up to set email alerts
|

EPC: Extended Path Coverage for Measurement-Based Probabilistic Timing Analysis

Abstract: Abstract-Measurement-based probabilistic timing analysis (MBPTA) computes trustworthy upper bounds to the execution time of software programs. MBPTA has the connotation, typical of measurement-based techniques, that the bounds computed with it only relate to what is observed in actual program traversals, which may not include the effective worst-case phenomena. To overcome this limitation, we propose Extended Path Coverage (EPC), a novel technique that allows extending the representativeness of the bounds comp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
40
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
2
1

Relationship

6
1

Authors

Journals

citations
Cited by 24 publications
(54 citation statements)
references
References 26 publications
(39 reference statements)
0
40
0
Order By: Relevance
“…A more informed application of EVT to the so ware domain is advocated instead in [23], restricting EVT to using exponential tail distribution [2] on the account that it has been argued to be the most stable (and always overapproximating) distribution to model worst-case execution of real-time so ware [2,27]. A universally recognized issue in the application of EVT is related to identifying an exhaustively representative input sample [13,32,38]: our work directly responds to this challenge by synthetically deriving a path-upperbounding version of the target program and de ning the minimum number of observations to be collected on such version.…”
Section: Related Workmentioning
confidence: 99%
“…A more informed application of EVT to the so ware domain is advocated instead in [23], restricting EVT to using exponential tail distribution [2] on the account that it has been argued to be the most stable (and always overapproximating) distribution to model worst-case execution of real-time so ware [2,27]. A universally recognized issue in the application of EVT is related to identifying an exhaustively representative input sample [13,32,38]: our work directly responds to this challenge by synthetically deriving a path-upperbounding version of the target program and de ning the minimum number of observations to be collected on such version.…”
Section: Related Workmentioning
confidence: 99%
“…Representativeness of execution paths: Assuring sufficient path coverage is a widely acknowledged requirement of all timing analysis approaches based on measurements [26], [27]. In contrast with static timing analyses, the results computed by measurement-based methods hold only for the execution paths observed at analysis.…”
Section: Probability Distribution Of Multi-path Programsmentioning
confidence: 99%
“…Path identification and generation of the respective input vectors remain a non-trivial problem for the end users. When PTC information is not available (or is considered unreliable), it is still possible to build a synthetic upper-bounding path [28] or use the measurements from several paths to artificially derive measurements for all unobserved paths [27].…”
Section: Probability Distribution Of Multi-path Programsmentioning
confidence: 99%
See 2 more Smart Citations