On the public citation graph
Static Probabilistic Timing Analysis for Multi-path Programs
0 signed · 46 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/s11241-008-9053-6openalex-snapshot
Stochastic analysis of real-time systems under preemptive priority-driven scheduling
inferredcites →https://doi.org/10.1007/s11241-011-9129-6openalex-snapshot
Making DRAM refresh predictable
inferredcites →https://doi.org/10.1007/s11241-014-9218-4openalex-snapshot
Static probabilistic timing analysis for real-time systems using random replacement caches
inferredcites →https://doi.org/10.1023/a:1008141130870openalex-snapshot
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
inferredcites →https://doi.org/10.1109/ecrts.2009.30openalex-snapshot
Using Randomized Caches in Probabilistic Real-Time Systems
inferredcites →https://doi.org/10.1109/ecrts.2012.31openalex-snapshot
Measurement-Based Probabilistic Timing Analysis for Multi-path Programs
inferredcites →https://doi.org/10.1109/ecrts.2013.27openalex-snapshot
Analysis of Probabilistic Cache Related Pre-emption Delays
inferredcites →https://doi.org/10.1109/emrts.2001.933995openalex-snapshot
A modular and retargetable framework for tree-based WCET analysis
inferredcites →https://doi.org/10.1109/emrts.2004.1311024openalex-snapshot
Static determination of probabilistic execution times
inferredcites →https://doi.org/10.1109/real.2002.1181582openalex-snapshot
WCET analysis of probabilistic hard real-time systems
inferredcites →https://doi.org/10.1109/rtas.2011.27openalex-snapshot
Scope-Aware Data Cache Analysis for WCET Estimation
inferredcites →https://doi.org/10.1145/1347375.1347389openalex-snapshot
The worst-case execution-time problem—overview of methods and survey of tools
inferredcites →https://doi.org/10.1145/1391469.1391551openalex-snapshot
Cache modeling in probabilistic execution time analysis
inferredcites →https://doi.org/10.1145/2392987.2393001openalex-snapshot
Re-sampling for statistical timing analysis of real-time systems
inferredcites →https://doi.org/10.1145/2659787.2659809openalex-snapshot
Static Probabilistic Timing Analysis of Random Replacement Caches using Lossy Compression
inferredcites →https://doi.org/10.4230/lites-v001-i001-a003openalex-snapshot
Randomized Caches Considered Harmful in Hard Real-Time Systems
inferredcites →https://doi.org/10.4230/oasics.wcet.2006.671openalex-snapshot
A Definition and Classification of Timing Anomalies
inferredcites →https://doi.org/10.4230/oasics.wcet.2012.25openalex-snapshot
Computing Same Block Relations for Relational Cache Analysis
inferredcites →https://doi.org/10.7873/date.2013.116openalex-snapshot
A Cache Design for Probabilistically Analysable Real-time Systems
inferredcites →https://doi.org/10.7873/date.2014.110openalex-snapshot
Time-critical computing on a single-chip massively parallel processor
inferredcites →https://doi.org/10.7873/date2014.039openalex-snapshot
On the correctness, optimality and precision of Static Probabilistic Timing Analysis
inferredcites →https://doi.org/10.7873/date2014.110openalex-snapshot
Time-critical computing on a single-chip massively parallel processor
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11241-017-9295-2openalex-snapshot
On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
inferred← citeshttps://doi.org/10.1016/j.jss.2019.03.001openalex-snapshot
Execution allowance based fixed priority scheduling for probabilistic real-time systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2019.01.001openalex-snapshot
Workload-aware harmonic partitioned scheduling for fixed-priority probabilistic real-time tasks on multiprocessors
inferred← citeshttps://doi.org/10.1049/iet-cdt.2018.5043openalex-snapshot
Probabilistic timing analysis of time‐randomised caches with fault detection mechanisms
inferred← citeshttps://doi.org/10.1109/dft.2016.7684067openalex-snapshot
Effects of online fault detection mechanisms on Probabilistic Timing Analysis
inferred← citeshttps://doi.org/10.1109/ecrts.2016.20openalex-snapshot
Extreme Value Theory for Estimating Task Execution Time Bounds: A Careful Look
inferred← citeshttps://doi.org/10.1109/rtas.2019.00009openalex-snapshot
Deterministic Memory Hierarchy and Virtualization for Modern Multi-Core Embedded Systems
inferred← citeshttps://doi.org/10.1109/rtcsa50079.2020.9203594openalex-snapshot
Identification and Validation of Markov Models with Continuous Emission Distributions for Execution Times
inferred← citeshttps://doi.org/10.1109/sies.2016.7509422openalex-snapshot
Static probabilistic timing analysis in presence of faults
inferred← citeshttps://doi.org/10.1109/sies.2017.7993373openalex-snapshot
Static probabilistic timing analysis with a permanent fault detection mechanism
inferred← citeshttps://doi.org/10.1145/2834848.2834858openalex-snapshot
A framework for the evaluation of measurement-based timing analyses
inferred← citeshttps://doi.org/10.1145/3123877openalex-snapshot
An Adaptive Markov Model for the Timing Analysis of Probabilistic Caches
inferred← citeshttps://doi.org/10.1145/3139258.3139276openalex-snapshot
Probabilistic analysis for mixed criticality systems using fixed priority preemptive scheduling
inferred← citeshttps://doi.org/10.1145/3297280.3297339openalex-snapshot
On assessing the viability of probabilistic scheduling with dependent tasks
inferred← citeshttps://doi.org/10.1145/3301283openalex-snapshot
Probabilistic Worst-Case Timing Analysis
inferred← citeshttps://doi.org/10.22215/etd/2024-16354openalex-snapshot
Black-Box Worst Case Execution Time Analysis on Real-Time Robotic Algorithms
inferred← citeshttps://doi.org/10.4230/lites-v006-i001-a003openalex-snapshot
A Survey of Probabilistic Timing Analysis Techniques for Real-Time Systems
inferred← citeshttps://doi.org/10.4230/lites-v006-i001-a004openalex-snapshot
A Survey of Probabilistic Schedulability Analysis Techniques for Real-Time Systems
inferred← citeshttps://doi.org/10.70675/bc65bbe9z586cz4cbazb9c3zf7d04ff10bddopenalex-snapshot
Statistical models for the optimization of energy consumption in cyber-physical systems
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
inferred← citeshttps://doi.org/10.70675/f1894b23zae90z48dfz8ecazf8c4317a738eopenalex-snapshot
Probabilistic study of end-to-end constraints in real-time systems
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.