Volume
OASIcs, Volume 30
13th International Workshop on Worst-Case Execution Time Analysis
-
Part of:
Series:
Open Access Series in Informatics (OASIcs)
Conference: Workshop on Worst-Case Execution Time Analysis (WCET)
Event
WCET 2013, July 9, 2013, Paris, FranceEditor
Publication Details
- published at: 2013-07-08
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-939897-54-5
- DBLP: db/conf/wcet/wcet2013
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 30, WCET'13, Complete Volume
Abstract
OASIcs, Volume 30, WCET'13, Complete Volume
Cite as
13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@Proceedings{maiza:OASIcs.WCET.2013,
title = {{OASIcs, Volume 30, WCET'13, Complete Volume}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013},
URN = {urn:nbn:de:0030-drops-41333},
doi = {10.4230/OASIcs.WCET.2013},
annote = {Keywords: Performance Analysis and Design Aids, Real-time and embedded systems, Software/Program Verification}
}
Document
Front Matter
Frontmatter, Table of Contents, Preface, Workshop Organization
Abstract
Frontmatter, Table of Contents, Preface, Workshop Organization
Cite as
13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. i-x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{maiza:OASIcs.WCET.2013.i,
author = {Maiza, Claire},
title = {{Frontmatter, Table of Contents, Preface, Workshop Organization}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
pages = {i--x},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.i},
URN = {urn:nbn:de:0030-drops-41162},
doi = {10.4230/OASIcs.WCET.2013.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Workshop Organization}
}
Document
Evaluation of resource arbitration methods for multi-core real-time systems
Abstract
Multi-core systems have become prevalent in the last years, because of their favorable properties in terms of energy consumption, computing power and design complexity. First attempts have been made to devise WCET analyses for multi-core processors, which have to deal with the problem that the cores may experience interferences during accesses to shared resources. To limit these interferences, the vast amount of previous work is proposing a strict TDMA (time division
multiple access) schedule for arbitrating shared resources. Though this type of arbitration yields a high predictability, this advantage is paid for with a poor resource utilization. In this work, we compare different arbitration methods with respect to their predictability and average case performance. We show how known WCET analysis techniques can be extended to work with the presented arbitration strategies and perform an evaluation of the resulting ACETs and WCETs on an extensive set of realworld benchmarks. Results show that there are cases when TDMA is not the best strategy, especially when predictability and performance are equally important.
Cite as
Timon Kelter, Tim Harde, Peter Marwedel, and Heiko Falk. Evaluation of resource arbitration methods for multi-core real-time systems. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{kelter_et_al:OASIcs.WCET.2013.1,
author = {Kelter, Timon and Harde, Tim and Marwedel, Peter and Falk, Heiko},
title = {{Evaluation of resource arbitration methods for multi-core real-time systems}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
pages = {1--10},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.1},
URN = {urn:nbn:de:0030-drops-41173},
doi = {10.4230/OASIcs.WCET.2013.1},
annote = {Keywords: WCET analysis, multi-core, arbitration, shared resources}
}
Document
Automatic WCET Analysis of Real-Time Parallel Applications
Abstract
Tomorrow's real-time embedded systems will be built upon multicore architectures. This raises two challenges. First, shared resources should be arbitrated in such a way that the WCET of independent threads running concurrently can be computed: in this paper, we assume that timepredictable multicore architectures are available. The second challenge is to develop software that achieves a high level of performance without impairing timing predictability. We investigate parallel software based on the POSIX threads standard and we show how the WCET of a parallel program can be analysed. We report experimental results obtained for typical parallel programs with an extended version of the OTAWA toolset.
Cite as
Haluk Ozaktas, Christine Rochange, and Pascal Sainrat. Automatic WCET Analysis of Real-Time Parallel Applications. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 11-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{ozaktas_et_al:OASIcs.WCET.2013.11,
author = {Ozaktas, Haluk and Rochange, Christine and Sainrat, Pascal},
title = {{Automatic WCET Analysis of Real-Time Parallel Applications}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
pages = {11--20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.11},
URN = {urn:nbn:de:0030-drops-41186},
doi = {10.4230/OASIcs.WCET.2013.11},
annote = {Keywords: WCET analysis, parallel programming, thread synchronisation}
}
Document
Integrated Worst-Case Execution Time Estimation of Multicore Applications
Abstract
Worst-case execution time (WCET) analysis has reached a high level of precision in the analysis of sequential programs executing on single-cores. In this paper we extend a state-of-the-art WCET analysis technique to compute tight WCETs estimates of parallel applications running on multicores. The proposed technique is termed integrated because it considers jointly the sequential code regions running on the cores and the communications between them. This allows to capture
the hardware effects across code regions assigned to the same core, which significantly improves analysis precision. We demonstrate that our analysis produces tighter execution time bounds than classical techniques which first determine the WCET of sequential code regions and then compute the global response time by integrating communication costs. Comparison is done on two embedded control applications, where the gain is of 21% on average.
Cite as
Dumitru Potop-Butucaru and Isabelle Puaut. Integrated Worst-Case Execution Time Estimation of Multicore Applications. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 21-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{potopbutucaru_et_al:OASIcs.WCET.2013.21,
author = {Potop-Butucaru, Dumitru and Puaut, Isabelle},
title = {{Integrated Worst-Case Execution Time Estimation of Multicore Applications}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
pages = {21--31},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.21},
URN = {urn:nbn:de:0030-drops-41193},
doi = {10.4230/OASIcs.WCET.2013.21},
annote = {Keywords: WCET estimation, multicore architectures, parallel programming}
}
Document
Program Semantics in Model-Based WCET Analysis: A State of the Art Perspective
Abstract
Advanced design techniques of safety-critical applications use specialized development model based methods. Under this setting, the application exists at several levels of description, as the result of a sequence of transformations. On the positive side, the application is developed in a systematic way, while on the negative side, its high-level semantics may be obfuscated when represented at the lower levels. The application should provide certain functional and non-functional guarantees. When the application is a hard real-time program, such guarantees could be deadlines, thus making the computation of worst-case execution time (WCET) bounds mandatory.
This paper overviews, in the context of WCET analysis, what are the existing techniques to extract, express and exploit the program semantics along the model-based development workflow.
Cite as
Mihail Asavoae, Claire Maiza, and Pascal Raymond. Program Semantics in Model-Based WCET Analysis: A State of the Art Perspective. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 32-41, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{asavoae_et_al:OASIcs.WCET.2013.32,
author = {Asavoae, Mihail and Maiza, Claire and Raymond, Pascal},
title = {{Program Semantics in Model-Based WCET Analysis: A State of the Art Perspective}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
pages = {32--41},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.32},
URN = {urn:nbn:de:0030-drops-41209},
doi = {10.4230/OASIcs.WCET.2013.32},
annote = {Keywords: survey, WCET analysis, program semantics, model-based design, infeasible paths}
}
Document
Multi-architecture Value Analysis for Machine Code
Abstract
Safety verification of critical real-time embedded systems requires Worst Case Execution Time information (WCET). Among the existing approaches to estimate the WCET, static analysis at the machine code level has proven to get safe results. A lot of different architectures are used in real-time systems but no generic solution provides the ability to perform static analysis of values handled by machine instructions. Nonetheless, results of such analyses are worth to improve the precision of other analyzes like data cache, indirect branches, etc. This paper proposes a semantic language aimed at expressing semantics of machine instructions whatever the underlying instruction set is. This ensures abstraction and portability of the
value analysis or any analysis based on the semantic expression of the instructions. As a proof of concept, we adapted and refined an existing analysis representing values as Circular-Linear Progression (CLP), that is, as a sparse integer interval effective to model pointers. In addition, we show how our semantic instructions allow to build back conditions of loop in order to refine the CLP values and improve the precision of the analysis.Both contributions have been implemented in our framework, OTAWA, and experimented on the Malärdalen benchmark to desmonstrate the effectiveness of the approach.
Cite as
Hugues Cassé, Florian Birée, and Pascal Sainrat. Multi-architecture Value Analysis for Machine Code. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 42-52, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{casse_et_al:OASIcs.WCET.2013.42,
author = {Cass\'{e}, Hugues and Bir\'{e}e, Florian and Sainrat, Pascal},
title = {{Multi-architecture Value Analysis for Machine Code}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
pages = {42--52},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.42},
URN = {urn:nbn:de:0030-drops-41211},
doi = {10.4230/OASIcs.WCET.2013.42},
annote = {Keywords: machine code, static analysis, value analysis, semantics}
}
Document
The Auspicious Couple: Symbolic Execution and WCET Analysis
Abstract
We have recently shown that symbolic execution together with the implicit path enumeration technique can successfully be applied in the Worst-Case Execution Time (WCET) analysis of programs. Symbolic
execution offers a precise framework for program analysis and tracks complex program properties by analyzing single program paths in isolation. This path-wise program exploration of symbolic execution is, however, computationally expensive, which often prevents full symbolic analysis of larger applications: the number of paths in a program increases exponentially with the number of conditionals, a situation denoted as the path explosion problem. Therefore, for applying symbolic execution in the timing analysis of programs, we propose to use WCET analysis as a guidance for symbolic execution in order to avoid full symbolic coverage of the program. By focusing only on paths or program fragments that are relevant for WCET analysis, we keep the computational costs of symbolic execution low. Our WCET analysis also profits from the precise results derived via symbolic execution. In this article we describe how use-cases of symbolic execution are materialized in the r-TuBound toolchain
and present new applications of WCET-guided symbolic execution for WCET analysis. The new applications of selective symbolic execution are based on reducing the effort of symbolic analysis by focusing
only on relevant program fragments. By using partial symbolic program coverage obtained by selective symbolic execution, we improve the WCET analysis and keep the effort for symbolic execution low.
Cite as
Armin Biere, Jens Knoop, Laura Kovács, and Jakob Zwirchmayr. The Auspicious Couple: Symbolic Execution and WCET Analysis. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 53-63, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{biere_et_al:OASIcs.WCET.2013.53,
author = {Biere, Armin and Knoop, Jens and Kov\'{a}cs, Laura and Zwirchmayr, Jakob},
title = {{The Auspicious Couple: Symbolic Execution and WCET Analysis}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
pages = {53--63},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.53},
URN = {urn:nbn:de:0030-drops-41225},
doi = {10.4230/OASIcs.WCET.2013.53},
annote = {Keywords: WCET analysis, Symbolic execution, WCET refinement, Flow Facts}
}
Document
Upper-bounding Program Execution Time with Extreme Value Theory
Abstract
In this paper we discuss the limitations of and the precautions to account for when using Extreme Value Theory (EVT) to compute upper bounds to the execution time of programs. We analyse the requirements
placed by EVT on the observations to be made of the events of interest, and the conditions that render safe the computations of execution time upper bounds. We also study the requirements that a recent EVT-based timing analysis technique, Measurement-Based Probabilistic Timing Analysis (MBPTA), introduces, besides those imposed by EVT, on the computing system under analysis to increase the trustworthiness of the upper bounds that it computes.
Cite as
Francisco J. Cazorla, Tullio Vardanega, Eduardo Quiñones, and Jaume Abella. Upper-bounding Program Execution Time with Extreme Value Theory. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 64-76, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{cazorla_et_al:OASIcs.WCET.2013.64,
author = {Cazorla, Francisco J. and Vardanega, Tullio and Qui\~{n}ones, Eduardo and Abella, Jaume},
title = {{Upper-bounding Program Execution Time with Extreme Value Theory}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
pages = {64--76},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.64},
URN = {urn:nbn:de:0030-drops-41232},
doi = {10.4230/OASIcs.WCET.2013.64},
annote = {Keywords: WCET, Extreme Value Theory, Probabilistic, Deterministic}
}
Document
PRADA: Predictable Allocations by Deferred Actions
Abstract
Modern hard real-time systems still employ static memory management. However, dynamic storage allocation (DSA) can improve the flexibility and readability of programs as well as drastically shorten their development times. But allocators introduce unpredictability that makes deriving tight bounds on an application's worst-case execution time even more challenging. Especially their statically unpredictable influence on the cache, paired with zero knowledge about the cache
set mapping of dynamically allocated objects leads to prohibitively large overestimations of execution times when dynamic memory allocation is employed. Recently, a cache-aware memory allocator, called CAMA, was proposed that gives strong guarantees about its cache influence and the cache set mapping of allocated objects. CAMA itself is rather complex due to its cache-aware implementations of split and merge operations. This paper proposes PRADA, a lighter but less general dynamic memory allocator with equally strong guarantees about its influence on the cache. We compare the memory consumption of
PRADA and CAMA for a small set of real-time applications as well as synthetical (de-) allocation sequences to investigate whether a simpler approach to cache awareness is still sufficient for the
current generation of real-time applications.
Cite as
Florian Haupenthal and Jörg Herter. PRADA: Predictable Allocations by Deferred Actions. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 77-86, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{haupenthal_et_al:OASIcs.WCET.2013.77,
author = {Haupenthal, Florian and Herter, J\"{o}rg},
title = {{PRADA: Predictable Allocations by Deferred Actions}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
pages = {77--86},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.77},
URN = {urn:nbn:de:0030-drops-41243},
doi = {10.4230/OASIcs.WCET.2013.77},
annote = {Keywords: Dynamic Memory Allocation, Worst-Case Execution-Time, Cache Predictability}
}
Document
Static analysis of WCET in a satellite software subsystem
Abstract
This paper describes the authors’ experience with static analysis of both WCET and stack usage of a satellite on-board software subsystem. The work is a continuation of a previous case study that used a dynamic WCET analysis tool on an earlier version of the same software system. In particular, the AbsInt aiT tool has been evaluated by analysing both C and Ada code generated by Simulink within the UPMSat-2 project. Some aspects of the aiT tool, specifically those dealing with SPARC register windows, are compared to another static analysis tool, Bound-T. The results of the analysis are discussed, and some conclusions on the use of static WCET analysis tools on
the SPARC architecture are commented in the paper.
Cite as
Jorge Garrido, Juan Zamorano, and Juan A. de la Puente. Static analysis of WCET in a satellite software subsystem. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 87-96, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{garrido_et_al:OASIcs.WCET.2013.87,
author = {Garrido, Jorge and Zamorano, Juan and de la Puente, Juan A.},
title = {{Static analysis of WCET in a satellite software subsystem}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
pages = {87--96},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.87},
URN = {urn:nbn:de:0030-drops-41259},
doi = {10.4230/OASIcs.WCET.2013.87},
annote = {Keywords: Real-time systems, embedded systems, timing analysis, WCET calculation, static analysis}
}
Document
Applying Measurement-Based Probabilistic Timing Analysis to Buffer Resources
Abstract
The use of complex hardware makes it difficult for current timing analysis techniques to compute trustworthy and tight worst-case execution time (WCET) bounds. Those techniques require detailed knowledge of the internal operation and state of the platform, at both the software and hardware level. Obtaining that information for modern hardware platforms is increasingly difficult. Measurement-Based Probabilistic Timing Analysis (MBPTA) reduces the cost of acquiring the knowledge needed for computing trustworthy and tight WCET bounds. MBPTA based on Extreme Value Theory requires the execution time of processor instructions to be independent and identically distributed (i.i.d.), which can be achieved with some hardware support. Previous proposals show how those properties can be achieved for caches. This paper considers, for the first time, the implications on MBPTA of using buffer resources. Buffers in general, and first-come first-served (FCFS) buffers in particular, are of
paramount importance as the complexity of hardware increases, since they allow managing contention in those resources where multiple requests may be pending. We show how buffers can be used in the context of MBPTA and provide illustrative examples.
Cite as
Leonidas Kosmidis, Tullio Vardanega, Jaume Abella, Eduardo Quiñones, and Francisco J. Cazorla. Applying Measurement-Based Probabilistic Timing Analysis to Buffer Resources. In 13th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 30, pp. 97-108, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{kosmidis_et_al:OASIcs.WCET.2013.97,
author = {Kosmidis, Leonidas and Vardanega, Tullio and Abella, Jaume and Qui\~{n}ones, Eduardo and Cazorla, Francisco J.},
title = {{Applying Measurement-Based Probabilistic Timing Analysis to Buffer Resources}},
booktitle = {13th International Workshop on Worst-Case Execution Time Analysis},
pages = {97--108},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-54-5},
ISSN = {2190-6807},
year = {2013},
volume = {30},
editor = {Maiza, Claire},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2013.97},
URN = {urn:nbn:de:0030-drops-41269},
doi = {10.4230/OASIcs.WCET.2013.97},
annote = {Keywords: WCET, Buffer, Probabilistic Timing Analysis}
}