Volume
OASIcs, Volume 103
20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)
-
Part of:
Series:
Open Access Series in Informatics (OASIcs)
Conference: Workshop on Worst-Case Execution Time Analysis (WCET)
Event
WCET 2022, July 5, 2022, Modena, ItalyEditor
Publication Details
- published at: 2022-07-14
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-95977-244-0
- DBLP: db/conf/wcet/wcet2022
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 103, WCET 2022, Complete Volume
Abstract
OASIcs, Volume 103, WCET 2022, Complete Volume
Cite as
20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022). Open Access Series in Informatics (OASIcs), Volume 103, pp. 1-54, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@Proceedings{ballabriga:OASIcs.WCET.2022,
title = {{OASIcs, Volume 103, WCET 2022, Complete Volume}},
booktitle = {20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)},
pages = {1--54},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-244-0},
ISSN = {2190-6807},
year = {2022},
volume = {103},
editor = {Ballabriga, Cl\'{e}ment},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2022},
URN = {urn:nbn:de:0030-drops-166218},
doi = {10.4230/OASIcs.WCET.2022},
annote = {Keywords: OASIcs, Volume 103, WCET 2022, Complete Volume}
}
Document
Front Matter
Front Matter, Table of Contents, Preface, Conference Organization
Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as
20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022). Open Access Series in Informatics (OASIcs), Volume 103, pp. 0:i-0:x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{ballabriga:OASIcs.WCET.2022.0,
author = {Ballabriga, Cl\'{e}ment},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)},
pages = {0:i--0:x},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-244-0},
ISSN = {2190-6807},
year = {2022},
volume = {103},
editor = {Ballabriga, Cl\'{e}ment},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2022.0},
URN = {urn:nbn:de:0030-drops-166227},
doi = {10.4230/OASIcs.WCET.2022.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
StAMP: Static Analysis of Memory Access Profiles for Real-Time Tasks
Abstract
Accesses to shared resources in multi-core systems raise predictability issues. The delay in accessing a resource for a task executing on a core depends on concurrent resource sharing from tasks executing on the other cores. In this paper, we present StAMP, a compiler technique that splits the code of tasks into a sequence of code intervals intervals, each with a distinct worst-case memory access profile. The intervals identified by StAMP can serve as inputs to scheduling techniques for a tight calculation of worst-case delays of memory accesses. The provided information can also ease the design of mechanisms that avoid and/or control interference between tasks at run-time. An important feature of StAMP compared to related work lies in its ability to link back time intervals to unique locations in the code of tasks, allowing easy implementation of elaborate run-time decisions related to interference management.
Cite as
Théo Degioanni and Isabelle Puaut. StAMP: Static Analysis of Memory Access Profiles for Real-Time Tasks. In 20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022). Open Access Series in Informatics (OASIcs), Volume 103, pp. 1:1-1:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{degioanni_et_al:OASIcs.WCET.2022.1,
author = {Degioanni, Th\'{e}o and Puaut, Isabelle},
title = {{StAMP: Static Analysis of Memory Access Profiles for Real-Time Tasks}},
booktitle = {20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)},
pages = {1:1--1:13},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-244-0},
ISSN = {2190-6807},
year = {2022},
volume = {103},
editor = {Ballabriga, Cl\'{e}ment},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2022.1},
URN = {urn:nbn:de:0030-drops-166231},
doi = {10.4230/OASIcs.WCET.2022.1},
annote = {Keywords: Worst-Case Execution Time Estimation, Static Analysis, Multicore, Interference, Implicit Path Enumeration Technique}
}
Document
LLVMTA: An LLVM-Based WCET Analysis Tool
Abstract
We present llvmta, an academic WCET analysis tool based on the LLVM compiler infrastructure. It aims to enable the evaluation of novel WCET analysis approaches in a state-of-the-art analysis framework without dealing with the complexity of modeling real-world hardware architectures. We discuss the main design decisions and interfaces that allow to implement new analysis approaches. Finally, we highlight various existing research projects whose evaluation has been enabled by llvmta.
Cite as
Sebastian Hahn, Michael Jacobs, Nils Hölscher, Kuan-Hsun Chen, Jian-Jia Chen, and Jan Reineke. LLVMTA: An LLVM-Based WCET Analysis Tool. In 20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022). Open Access Series in Informatics (OASIcs), Volume 103, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{hahn_et_al:OASIcs.WCET.2022.2,
author = {Hahn, Sebastian and Jacobs, Michael and H\"{o}lscher, Nils and Chen, Kuan-Hsun and Chen, Jian-Jia and Reineke, Jan},
title = {{LLVMTA: An LLVM-Based WCET Analysis Tool}},
booktitle = {20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)},
pages = {2:1--2:17},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-244-0},
ISSN = {2190-6807},
year = {2022},
volume = {103},
editor = {Ballabriga, Cl\'{e}ment},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2022.2},
URN = {urn:nbn:de:0030-drops-166242},
doi = {10.4230/OASIcs.WCET.2022.2},
annote = {Keywords: WCET analysis, low-level analysis, LLVM}
}
Document
DELOOP: Automatic Flow Facts Computation Using Dynamic Symbolic Execution
Abstract
Constructing a complete control-flow graph (CGF) and computing upper bounds on loops of a computing system are essential to safely estimate the worst-case execution time (WCET) of real-time tasks. WCETs are required for verifying the timing requirements of a real-time computing system. Therefore, we propose an analysis using dynamic symbolic execution (DSE) that detects and computes upper bounds on the loops, and resolves indirect jumps. The proposed analysis constructs and initializes memory models, then it uses a satisfiability modulo theories (SMT) solver to symbolically execute the instructions. The analysis showed higher precision in bounding loops of the Mälardalen benchmarks comparing to SWEET and oRange. We integrated our analysis with the OTAWA toolbox for performing a WCET analysis. Then, we used the proposed analysis for estimating the WCET of functions in a use case inspired by an aerospace project.
Cite as
Hazem Abaza, Zain Alabedin Haj Hammadeh, and Daniel Lüdtke. DELOOP: Automatic Flow Facts Computation Using Dynamic Symbolic Execution. In 20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022). Open Access Series in Informatics (OASIcs), Volume 103, pp. 3:1-3:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{abaza_et_al:OASIcs.WCET.2022.3,
author = {Abaza, Hazem and Haj Hammadeh, Zain Alabedin and L\"{u}dtke, Daniel},
title = {{DELOOP: Automatic Flow Facts Computation Using Dynamic Symbolic Execution}},
booktitle = {20th International Workshop on Worst-Case Execution Time Analysis (WCET 2022)},
pages = {3:1--3:12},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-244-0},
ISSN = {2190-6807},
year = {2022},
volume = {103},
editor = {Ballabriga, Cl\'{e}ment},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2022.3},
URN = {urn:nbn:de:0030-drops-166256},
doi = {10.4230/OASIcs.WCET.2022.3},
annote = {Keywords: Real-Time, WCET, Symbolic execution}
}