The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The worst-case execution-time problem—overview of methods and survey of tools
Abstract
The determination of upper bounds on execution times, commonly called worst-case execution times (WCETs), is a necessary step in the development and validation process for hard real-time systems. This problem is hard if the underlying processor architecture has components, such as caches, pipelines, branch prediction, and other speculative components. This article describes different approaches to this problem and surveys several commercially available tools 1 and research prototypes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
Cited by
A survey of hard real-time scheduling for multiprocessor systems
Davis, R. I., & Burns, A. (2011) · ACM Computing Surveys · doi:10.1145/1978802.1978814 · Cited by 907
Performance evaluation of component-based software systems: A survey
Koziolek, H. (2010) · Performance Evaluation · doi:10.1016/j.peva.2009.07.007 · Cited by 329
Hardware/Software Codesign: The Past, the Present, and Predicting the Future
Teich, J. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2182009 · Cited by 313
Development of Autonomous Car—Part I: Distributed System Architecture and Development Process
Jo, K., Kim, J., Kim, D., Jang, C., & Sunwoo, M. (2014) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2014.2321342 · Cited by 277
Ascertaining Uncertainty for Efficient Exact Cache Analysis
Touzeau, V., Maïza, C., Monniaux, D., & Reineke, J. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63390-9_2 · Cited by 267
Metadata
- Authors
- Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., Mueller, F., Puaut, I., Puschner, P., Staschulat, J., & Stenström, P.
- Venue
- ACM Transactions on Embedded Computing Systems
- Published
- 2008-04
- Volume
- 7
- Issue
- 3
- Pages
- 1-53
- ISSN
- 1539-9087 (ISSN-L)
- 1558-3465
- OpenAlex
- W2076285066
- Cited by
- 1,871
- References
- 1
- FWCI
- 248.41
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The worst-case execution-time problem—overview of methods and survey of tools. https://app.cochat.ai/papers/10.1145/1347375.1347389
- The paper
- Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., Mueller, F., Puaut, I., Puschner, P., Staschulat, J., & Stenström, P. (2008). The worst-case execution-time problem—overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems. https://doi.org/10.1145/1347375.1347389
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
