On the public citation graph
Integrating path and timing analysis using instruction-level simulation techniques
0 signed · 66 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/bf00571421openalex-snapshot
Calculating the maximum execution time of real-time programs
inferredcites →https://doi.org/10.1007/bfb0002886openalex-snapshot
Deriving annotations for tight calculation of execution time
inferredcites →https://doi.org/10.1007/bfb0057778openalex-snapshot
Automatic accurate time-bound analysis for high-level languages
inferredcites →https://doi.org/10.1016/s1383-7621(99)00010-7openalex-snapshot
Complete worst-case execution time analysis of straight-line hard real-time programs
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/real.1994.342726openalex-snapshot
An accurate worst case timing analysis technique for RISC processors
inferredcites →https://doi.org/10.1109/real.1995.495218openalex-snapshot
Integrating the timing analysis of pipelining and instruction caching
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.1996.563722openalex-snapshot
Cache modeling for real-time software: beyond direct mapped instruction caches
inferredcites →https://doi.org/10.1109/rttas.1996.509540openalex-snapshot
Efficient worst case timing analysis of data caching
inferredcites →https://doi.org/10.1109/rttas.1997.601358openalex-snapshot
Timing analysis for data caches and set-associative caches
inferredcites →https://doi.org/10.1109/rttas.1998.683183openalex-snapshot
Bounding loop iterations for timing analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1015openalex-snapshot
Parametric timing estimation with Newton–Gregory formulae
inferred← citeshttps://doi.org/10.1007/11604655_53openalex-snapshot
Analyzing Loop Paths for Execution Time Estimation
inferred← citeshttps://doi.org/10.1007/3-540-45789-5_22openalex-snapshot
Pipeline Modeling for Timing Analysis
inferred← citeshttps://doi.org/10.1007/978-0-387-35599-3_18openalex-snapshot
Bottom-Up Performance Analysis of HW/SW Platforms
inferred← citeshttps://doi.org/10.1007/978-3-319-11863-5_9openalex-snapshot
Real-World Loops Are Easy to Predict
inferred← citeshttps://doi.org/10.1007/bfb0057778openalex-snapshot
Automatic accurate time-bound analysis for high-level languages
inferred← citeshttps://doi.org/10.1007/s00165-003-0019-0openalex-snapshot
Linear Approximation of Execution-Time Constraints
inferred← citeshttps://doi.org/10.1007/s100090100054openalex-snapshot
Worst-case execution-time analysis for embedded real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-015-9240-1openalex-snapshot
Calculating WCET estimates from timed traces
inferred← citeshttps://doi.org/10.1007/s11241-017-9286-3openalex-snapshot
High-assurance timing analysis for a high-assurance real-time operating system
inferred← citeshttps://doi.org/10.1016/j.scico.2015.06.006openalex-snapshot
Certifying execution time in multicores
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)39931-7openalex-snapshot
An Approach to Symbolic Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.1023/a:1008189014032openalex-snapshot
Supporting Timing Analysis by Automatic Bounding of Loop Iterations
inferred← citeshttps://doi.org/10.1023/b:time.0000048933.15922.f9openalex-snapshot
Modeling Control Speculation for Timing Analysis
inferred← citeshttps://doi.org/10.1049/ip-sen:20010834openalex-snapshot
Semantic characterisation of dead control-flow paths
inferred← citeshttps://doi.org/10.1109/dac.2006.229300openalex-snapshot
Efficient detection and exploitation of infeasible paths for software timing analysis
inferred← citeshttps://doi.org/10.1109/date.2003.1186386openalex-snapshot
Exact high level WCET analysis of synchronous programs by symbolic state space exploration
inferred← citeshttps://doi.org/10.1109/date.2003.1253608openalex-snapshot
Exact high level WCET analysis of synchronous programs by symbolic state space exploration
inferred← citeshttps://doi.org/10.1109/dsn.2003.1209972openalex-snapshot
An abstract interpretation-based timing validation of hard real-time avionics software
inferred← citeshttps://doi.org/10.1109/jproc.2003.814618openalex-snapshot
The influence of processor architecture on the design and the results of WCET tools
inferred← citeshttps://doi.org/10.1109/memcod.2003.1210100openalex-snapshot
Exact runtime analysis using automata-based symbolic simulation
inferred← citeshttps://doi.org/10.1109/pccc.2000.830347openalex-snapshot
Tighten the computation of worst-case execution-time by detecting feasible paths
inferred← citeshttps://doi.org/10.1109/real.2000.896006openalex-snapshot
Modeling complex flows for worst-case execution time analysis
inferred← citeshttps://doi.org/10.1109/real.2003.1253272openalex-snapshot
Generating formal models for real-time verification by exact low-level runtime analysis of synchronous programs
inferred← citeshttps://doi.org/10.1109/real.2004.33openalex-snapshot
Modeling Out-of-Order Processors for Software Timing Analysis
inferred← citeshttps://doi.org/10.1109/rtas.2005.29openalex-snapshot
Improving WCET by Optimizing Worst-Case Paths
inferred← citeshttps://doi.org/10.1109/rtcsa.2000.896435openalex-snapshot
Eliminating annotations by automatic flow analysis of real-time programs
inferred← citeshttps://doi.org/10.1109/rttas.1999.777660openalex-snapshot
Static properties of commercial embedded real-time programs, and their implication for worst-case execution time analysis
inferred← citeshttps://doi.org/10.1109/rttas.1999.777663openalex-snapshot
Tighter timing predictions by automatic detection and exploitation of value-dependent constraints
inferred← citeshttps://doi.org/10.1109/tc.2001.970569openalex-snapshot
Automatic accurate cost-bound analysis for high-level languages
inferred← citeshttps://doi.org/10.1109/tools.2000.848751openalex-snapshot
An interactive environment for real-time software development
inferred← citeshttps://doi.org/10.1109/tse.2002.1027799openalex-snapshot
Automatic detection and exploitation of branch constraints for timing analysis
inferred← citeshttps://doi.org/10.1145/1113841.1113842openalex-snapshot
Improving WCET by applying a WC code-positioning optimization
inferred← citeshttps://doi.org/10.1145/1134650.1134666openalex-snapshot
Faster WCET flow analysis by program slicing
inferred← citeshttps://doi.org/10.1145/1146909.1147002openalex-snapshot
Efficient detection and exploitation of infeasible paths for software timing analysis
inferred← citeshttps://doi.org/10.1145/1176887.1176929openalex-snapshot
Modeling a system controller for timing analysis
inferred← citeshttps://doi.org/10.1145/1324969.1324973openalex-snapshot
Data cache locking for tight timing calculations
inferred← citeshttps://doi.org/10.1145/314403.314432openalex-snapshot
Pipeline behavior prediction for superscalar processors by abstract interpretation
inferred← citeshttps://doi.org/10.1145/314403.314440openalex-snapshot
Live memory analysis for garbage collection in embedded systems
inferred← citeshttps://doi.org/10.1145/384196.384211openalex-snapshot
Interval-Based Analysis of Software Processes
inferred← citeshttps://doi.org/10.1145/502217.502240openalex-snapshot
Efficient longest executable path search for programs with complex flows and pipeline effects
inferred← citeshttps://doi.org/10.1145/503032.503039openalex-snapshot
Automatic time-bound analysis for a higher-order language
inferred← citeshttps://doi.org/10.1145/581199.581229openalex-snapshot
Timing analysis of embedded software for speculative processors
inferred← citeshttps://doi.org/10.1145/996566.996602openalex-snapshot
Abstraction of assembler programs for symbolic worst case execution time analysis
inferred← citeshttps://doi.org/10.11606/d.3.2011.tde-13012012-103355openalex-snapshot
Arquitetura de software para sistemas de tempo real.
inferred← citeshttps://doi.org/10.12694/scpe.v4i2.237openalex-snapshot
Ensuring Integrity and Service Availability in a Web-Based Control Laboratory
inferred← citeshttps://doi.org/10.22028/d291-26385openalex-snapshot
Symbolic representations in WCET analysis
inferred← citeshttps://doi.org/10.26083/tuprints-00002338openalex-snapshot
Static Analysis of x86 Executables
inferred← citeshttps://doi.org/10.4018/978-1-60960-086-0.ch005openalex-snapshot
Measurement-Based Timing Analysis for Reconfigurable Embedded Systems
inferred← citeshttps://doi.org/10.5555/823453.823845openalex-snapshot
Exact runtime analysis using automata-based symbolic simulation
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
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.