On the public citation graph
Using measurements to derive the worst-case execution time
0 signed · 32 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45245-1_12openalex-snapshot
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
inferredcites →https://doi.org/10.1007/bf00571421openalex-snapshot
Calculating the maximum execution time of real-time programs
inferredcites →https://doi.org/10.1023/a:1008119029962openalex-snapshot
Guest Editorial: A Review of Worst-Case Execution-Time Analysis
inferredcites →https://doi.org/10.1109/32.392980openalex-snapshot
An accurate worst case timing analysis for RISC processors
inferredcites →https://doi.org/10.1109/emwrts.1996.557827openalex-snapshot
On the false path problem in hard real-time programs
inferredcites →https://doi.org/10.1109/iccad.1997.643600openalex-snapshot
Embedded program timing analysis based on path clustering and architecture classification
inferredcites →https://doi.org/10.1109/real.1995.495219openalex-snapshot
Efficient microarchitecture modeling and path analysis for real-time software
inferredcites →https://doi.org/10.1109/real.1998.739738openalex-snapshot
Testing the results of static worst-case execution-time analysis
inferredcites →https://doi.org/10.1109/rtcsa.1999.811197openalex-snapshot
Pipeline timing analysis using a trace-driven simulator
inferredcites →https://doi.org/10.1109/rtcsa.1999.811296openalex-snapshot
Making worst case execution time analysis for hard real-time tasks on state of the art processors feasible
inferredcites →https://doi.org/10.1145/267580.267590openalex-snapshot
Software unit test coverage and adequacy
inferredcites →https://doi.org/10.5555/266388.266562openalex-snapshot
Embedded program timing analysis based on path clustering and architecture classification
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2183openalex-snapshot
Guidelines for supporting real‐time multi‐touch applications
inferred← citeshttps://doi.org/10.1007/978-3-642-28540-0_5openalex-snapshot
Failure-Dependent Timing Analysis - A New Methodology for Probabilistic Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.1109/iccsit.2009.5234725openalex-snapshot
Algorithm classification using Worst-Case Execution Time
inferred← citeshttps://doi.org/10.1109/icps59941.2024.10640034openalex-snapshot
Sparse Measurement Algorithm Execution Time Prediction on Heterogeneous Edge Devices for Early Stage Software-Hardware Matching
inferred← citeshttps://doi.org/10.1109/isola.2006.64openalex-snapshot
Cost-Efficient Worst-Case Execution Time Analysis in Industrial Practice
inferred← citeshttps://doi.org/10.1109/rtas.2009.16openalex-snapshot
Model Identification for WCET Analysis
inferred← citeshttps://doi.org/10.1109/rtcsa.2006.49openalex-snapshot
Portable Execution Time Analysis Method
inferred← citeshttps://doi.org/10.1109/rtcsa.2007.32openalex-snapshot
Contract-Based ReusableWorst-Case Execution Time Estimate
inferred← citeshttps://doi.org/10.1109/rtcsa.2007.49openalex-snapshot
Modeling Real-time Garbage Collection Cost
inferred← citeshttps://doi.org/10.1134/s0361768816010059openalex-snapshot
Estimation of the execution time in real-time systems
inferred← citeshttps://doi.org/10.22028/d291-25778openalex-snapshot
Control flow graphs for real-time systems analysis: reconstruction from binary executables and usage in ILP-based path analysis
inferred← citeshttps://doi.org/10.22456/2175-2745.55723openalex-snapshot
O Potencial do Uso de Estimativas de Desempenho na Exploração de Conjuntos de Otimizações
inferred← citeshttps://doi.org/10.3844/jcssp.2005.521.529openalex-snapshot
BDD Path Length Minimization Based on Initial Variable Ordering
inferred← citeshttps://doi.org/10.3844/jcssp.2006.236.244openalex-snapshot
Empirical Analysis and Mathematical Representation of the Path Length Complexity in Binary Decision Diagrams
inferred← citeshttps://doi.org/10.5281/zenodo.1077869openalex-snapshot
Estimating Shortest Circuit Path Length Complexity
inferred← citeshttps://doi.org/10.5281/zenodo.1334446openalex-snapshot
Learning Monte Carlo Data For Circuit Path Length
inferred← citeshttps://doi.org/10.70675/7fc6dd90z37a9z4d85z96b2z173edc6efe2fopenalex-snapshot
Calcul du pire temps d'exécution : méthode formelle s'adaptant à la sophistication croissante des architectures matérielles
inferred← citeshttps://doi.org/10.70675/d470e870z7104z4fa3z99daze9a26a46137dopenalex-snapshot
Étude de l'application de la théorie des valeurs extrêmes pour l'estimation fiable et robuste du pire temps d'exécution probabiliste
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.