On the public citation graph

Deriving annotations for tight calculation of execution time

https://doi.org/10.1007/bfb0002886
0 signed · 105 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-55844-6_142openalex-snapshot
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
inferredcites →https://doi.org/10.1007/bf00571421openalex-snapshot
Calculating the maximum execution time of real-time programs
inferredcites →https://doi.org/10.1007/bf01088696openalex-snapshot
Predicting program execution times by analyzing static and dynamic program paths
inferredcites →https://doi.org/10.1007/bf01088803openalex-snapshot
A retargetable technique for predicting execution time of code segments
inferredcites →https://doi.org/10.1016/c2013-0-07627-xopenalex-snapshot
Foundations of Constraint Satisfaction
inferredcites →https://doi.org/10.1109/32.392980openalex-snapshot
An accurate worst case timing analysis for RISC processors
inferredcites →https://doi.org/10.1109/43.664229openalex-snapshot
Performance analysis of embedded software using implicit path enumeration
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.1990.128731openalex-snapshot
Experiments with a program timing tool based on source-level timing schema
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.1145/155090.155095openalex-snapshot
Abstract debugging of higher-order imperative languages
inferredcites →https://doi.org/10.1145/173262.155095openalex-snapshot
Abstract debugging of higher-order imperative languages
inferredcites →https://doi.org/10.1145/192867.192873openalex-snapshot
Static worst-case timing analysis of Ada
inferredcites →https://doi.org/10.1145/217474.217570openalex-snapshot
Performance analysis of embedded software using implicit path enumeration
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/stvr.406openalex-snapshot
A systematic representation of path constraints for implicit path enumeration technique
inferred← citeshttps://doi.org/10.1007/11604655_53openalex-snapshot
Analyzing Loop Paths for Execution Time Estimation
inferred← citeshttps://doi.org/10.1007/3-540-45739-9_9openalex-snapshot
Component-Based Synthesis of Dependable Embedded Software
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/978-3-319-27810-0_4openalex-snapshot
Static Timing Analysis – What is Special?
inferred← citeshttps://doi.org/10.1007/978-3-540-24756-2_5openalex-snapshot
An Integration of Program Analysis and Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_3openalex-snapshot
Static Timing Analysis for Hard Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-22531-4_6openalex-snapshot
A Functional Approach to Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-24349-3_6openalex-snapshot
Improving the Precision of WCET Analysis by Input Constraints and Model-Derived Flow Constraints
inferred← citeshttps://doi.org/10.1007/978-90-481-9929-7_3openalex-snapshot
WCC—WCET-Aware C Compiler
inferred← citeshttps://doi.org/10.1007/bfb0057776openalex-snapshot
Integrating path and timing analysis using instruction-level simulation techniques
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-006-5317-1openalex-snapshot
A Method for Computing the Number of Iterations in Data Dependent Loops
inferred← citeshttps://doi.org/10.1007/s11241-010-9101-xopenalex-snapshot
A compiler framework for the reduction of worst-case execution times
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.03.027openalex-snapshot
WCET Analysis of Data Dependent, Component Oriented, Embedded Software Systems
inferred← citeshttps://doi.org/10.1016/j.scico.2012.01.005openalex-snapshot
A hybrid approach for resource-based comparison of adaptable Java applications
inferred← citeshttps://doi.org/10.1016/j.scico.2015.06.006openalex-snapshot
Certifying execution time in multicores
inferred← citeshttps://doi.org/10.1016/j.sysarc.2010.05.013openalex-snapshot
Branch target buffers: WCET analysis framework and timing predictability
inferred← citeshttps://doi.org/10.1016/j.sysarc.2010.06.009openalex-snapshot
An efficient algorithm for parametric WCET calculation
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.08.003openalex-snapshot
A theory for execution-time derivation in real-time programs
inferred← citeshttps://doi.org/10.1016/s1383-7621(99)00010-7openalex-snapshot
Complete worst-case execution time analysis of straight-line hard real-time programs
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)40589-1openalex-snapshot
Response Time Guarantees for Networked Control Systems
inferred← citeshttps://doi.org/10.1023/a:1008092427865openalex-snapshot
The Slack Method: A New Method for Static Allocation of Hard Real-Time Tasks
inferred← citeshttps://doi.org/10.1023/a:1008138407139openalex-snapshot
An Integrated Path and Timing Analysis Method based on Cycle-Level Symbolic Execution
inferred← citeshttps://doi.org/10.1023/a:1008141130870openalex-snapshot
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
inferred← citeshttps://doi.org/10.1023/a:1008149332687openalex-snapshot
Worst Case Execution Time Analysis for a Processor with Branch Prediction
inferred← citeshttps://doi.org/10.1023/a:1008189014032openalex-snapshot
Supporting Timing Analysis by Automatic Bounding of Loop Iterations
inferred← citeshttps://doi.org/10.1049/ip-sen:20010834openalex-snapshot
Semantic characterisation of dead control-flow paths
inferred← citeshttps://doi.org/10.1109/cgo.2009.17openalex-snapshot
A Fast and Precise Static Loop Analysis Based on Abstract Interpretation, Program Slicing and Polytope Models
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/emrts.2000.853994openalex-snapshot
Worst-case execution times analysis of MPEG-2 decoding
inferred← citeshttps://doi.org/10.1109/emrts.2001.933995openalex-snapshot
A modular and retargetable framework for tree-based WCET analysis
inferred← citeshttps://doi.org/10.1109/emrts.2002.1019184openalex-snapshot
Real-time performance of dynamic memory allocation algorithms
inferred← citeshttps://doi.org/10.1109/emsoft.2013.6658593openalex-snapshot
Path-sensitive resource analysis compliant with assertions
inferred← citeshttps://doi.org/10.1109/emwrts.1998.685079openalex-snapshot
Facilitating worst-case execution times analysis for optimized code
inferred← citeshttps://doi.org/10.1109/hase.2002.1173125openalex-snapshot
An approach to specify and test component-based dependable software
inferred← citeshttps://doi.org/10.1109/icip.2000.899507openalex-snapshot
Estimating decoding times of MPEG-2 video streams
inferred← citeshttps://doi.org/10.1109/jproc.2009.2036747openalex-snapshot
Hardware/Software Codesign of Aerospace and Automotive Systems
inferred← citeshttps://doi.org/10.1109/memcod.2003.1210100openalex-snapshot
Exact runtime analysis using automata-based symbolic simulation
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.1253263openalex-snapshot
Data caches in multitasking hard real-time systems
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/rtas.2009.29openalex-snapshot
Guaranteed Loop Bound Identification from Program Traces for WCET
inferred← citeshttps://doi.org/10.1109/rtas.2016.7461358openalex-snapshot
Precise Cache Timing Analysis via Symbolic Execution
inferred← citeshttps://doi.org/10.1109/rtcsa.1999.811197openalex-snapshot
Pipeline timing analysis using a trace-driven simulator
inferred← citeshttps://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
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/rtcsa.2009.10openalex-snapshot
Flow Analysis on Intermediate Source Code for WCET Estimation of Compiler-Optimized Programs
inferred← citeshttps://doi.org/10.1109/rtcsa.2009.8openalex-snapshot
Branch Target Buffers: WCET Analysis Framework and Timing Predictability
inferred← citeshttps://doi.org/10.1109/rtcsa.2009.9openalex-snapshot
An Efficient Algorithm for Parametric WCET Calculation
inferred← citeshttps://doi.org/10.1109/rttas.1998.683183openalex-snapshot
Bounding loop iterations for timing analysis
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/tc.2010.109openalex-snapshot
Time-Predictable Out-of-Order Execution for Hard Real-Time Systems
inferred← citeshttps://doi.org/10.1109/tc.2010.59openalex-snapshot
Accurate Determination of Loop Iterations for Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.1109/tcad.2009.2013287openalex-snapshot
Memory Hierarchies, Pipelines, and Buses for Future Architectures in Time-Critical Embedded Systems
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.1109/wfcs.1997.634301openalex-snapshot
Response time guarantees for ATM-networked control systems
inferred← citeshttps://doi.org/10.1109/words.2003.1218072openalex-snapshot
A tool for automatic flow analysis of C-programs for WCET calculation
inferred← citeshttps://doi.org/10.1109/words.2005.53openalex-snapshot
Towards a Flow Analysis for Embedded System C Programs
inferred← citeshttps://doi.org/10.1109/wpdrts.1997.637989openalex-snapshot
Automatic derivation of path and loop annotations in object-oriented real-time programs
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/1159861.1159874openalex-snapshot
Towards an automatic complexity analysis for generic programs
inferred← citeshttps://doi.org/10.1145/1324969.1324973openalex-snapshot
Data cache locking for tight timing calculations
inferred← citeshttps://doi.org/10.1145/1629335.1629371openalex-snapshot
Implementing time-predictable load and store operations
inferred← citeshttps://doi.org/10.1145/2038642.2038692openalex-snapshot
Symbolic simulation on complicated loops for WCET path analysis
inferred← citeshttps://doi.org/10.1145/2134254.2134277openalex-snapshot
Identifying hotspots in a program for data parallel architecture
inferred← citeshttps://doi.org/10.1145/2659787.2659825openalex-snapshot
A Compiler Optimization to Increase the Efficiency of WCET Analysis
inferred← citeshttps://doi.org/10.1145/2930957.2930960openalex-snapshot
Timing analysis of P-FRP systems
inferred← citeshttps://doi.org/10.1145/314403.314440openalex-snapshot
Live memory analysis for garbage collection in embedded systems
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/509799.503039openalex-snapshot
Automatic time-bound analysis for a higher-order language
inferred← citeshttps://doi.org/10.1145/513829.513843openalex-snapshot
On systematic design of globally consistent executable assertions in embedded software
inferred← citeshttps://doi.org/10.1145/566225.513843openalex-snapshot
On systematic design of globally consistent executable assertions in embedded software
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.1201/9781420038163.ch14openalex-snapshot
Determining Bounds on Execution Times
inferred← citeshttps://doi.org/10.1201/9781420043839.ch1openalex-snapshot
Worst-Case Execution Time and Energy Analysis
inferred← citeshttps://doi.org/10.12693/aphyspola.139.517openalex-snapshot
Experimental Verification of Semiconductor Diode Aging Based on Thermal Analyzes and Numerical Methods
inferred← citeshttps://doi.org/10.12694/scpe.v1i2.81openalex-snapshot
Automatic derivation of path and loop annotations in object-oriented real-time programs
inferred← citeshttps://doi.org/10.17863/cam.62826openalex-snapshot
A SIMD architecture for hard real-time systems
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2012.13openalex-snapshot
An Empirical Evaluation of the Influence of the Load-Store Unit on WCET Analysis
inferred← citeshttps://doi.org/10.5555/2555754.2555769openalex-snapshot
Path-sensitive resource analysis compliant with assertions
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.