On the public citation graph
Combining static worst-case timing analysis and program proof
0 signed · 89 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.1002/(sici)1097-024x(199608)26:8<863::aid-spe37>3.0.co;2-4openalex-snapshot
The Compilation of Ada
inferredcites →https://doi.org/10.1002/spe.4380150504openalex-snapshot
Unisex: A unix‐based symbolic executor for pascal
inferredcites →https://doi.org/10.1007/3-540-12328-8openalex-snapshot
The Programming Language Ada Reference Manual American National Standards Institute, Inc. ANSI/MIL-STD-1815A-1983
inferredcites →https://doi.org/10.1007/3540547428_53openalex-snapshot
SESADA: An environment supporting software specialization
inferredcites →https://doi.org/10.1007/978-1-4615-6996-1openalex-snapshot
First Leaves: A Tutorial Introduction to Maple V
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.1007/bf01088834openalex-snapshot
Pipelined processors and worst case execution times
inferredcites →https://doi.org/10.1016/0165-6074(83)90185-0openalex-snapshot
On real-time features available in high-level languages and yet to be implemented
inferredcites →https://doi.org/10.1016/0378-4754(90)90088-zopenalex-snapshot
Algorithms (2nd edition)
inferredcites →https://doi.org/10.1016/0898-1221(93)90322-mopenalex-snapshot
Analysis of an Ada based version of Glassman's general N point fast Fourier transform
inferredcites →https://doi.org/10.1016/0967-0661(93)92107-fopenalex-snapshot
Enabling efficient schedulability analysis through conditional linking and program transformations
inferredcites →https://doi.org/10.1016/b978-0-08-041894-0.50048-4openalex-snapshot
Enabling Efficient Schedulability Analysis through Program Transformations and Restricted Resource Contention
inferredcites →https://doi.org/10.1016/s1474-6670(17)52186-2openalex-snapshot
SYMBAD: A Symbolic Executor of Sequential Ada Programs
inferredcites →https://doi.org/10.1109/2.76286openalex-snapshot
Experiments with a program timing tool based on source-level timing schema
inferredcites →https://doi.org/10.1109/32.29487openalex-snapshot
Reasoning about time in higher-level language software
inferredcites →https://doi.org/10.1109/32.57625openalex-snapshot
State constraints and pathwise decomposition of programs
inferredcites →https://doi.org/10.1109/32.83911openalex-snapshot
Analyzing hard-real-time programs for guaranteed schedulability
inferredcites →https://doi.org/10.1109/emwrt.1989.43442openalex-snapshot
A priori execution time analysis for parallel processes
inferredcites →https://doi.org/10.1109/real.1992openalex-snapshot
[1992] Proceedings Real-Time Systems Symposium
inferredcites →https://doi.org/10.1109/real.1992.242660openalex-snapshot
The programmer's view of MARS
inferredcites →https://doi.org/10.1109/real.1993.393511openalex-snapshot
A dual-mode instruction prefetch scheme for improved worst case and average case program execution times
inferredcites →https://doi.org/10.1109/real.1994.342717openalex-snapshot
Deterministic upperbounds of the worst-case execution times of cached programs
inferredcites →https://doi.org/10.1109/real.1994.342718openalex-snapshot
Bounding worst-case instruction cache performance
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/rtss14353.2008openalex-snapshot
2008 Real-Time Systems Symposium
inferredcites →https://doi.org/10.1109/rtss36808.2015openalex-snapshot
2015 IEEE Real-Time Systems Symposium
inferredcites →https://doi.org/10.1109/tse.1986.6312924openalex-snapshot
An experimental evaluation of the assumption of independence in multiversion programming
inferredcites →https://doi.org/10.1109/tse.1986.6313045openalex-snapshot
Safety analysis of timing properties in real-time systems
inferredcites →https://doi.org/10.1121/1.413756openalex-snapshot
First Leaves: A Tutorial Introduction to Maple V
inferredcites →https://doi.org/10.1145/178243.178254openalex-snapshot
Counting solutions to Presburger formulas
inferredcites →https://doi.org/10.1145/186258.186523openalex-snapshot
Applications of feasible path analysis to program testing
inferredcites →https://doi.org/10.1145/186258.187150openalex-snapshot
Test data generation and feasible path analysis
inferredcites →https://doi.org/10.1145/192867.192873openalex-snapshot
Static worst-case timing analysis of Ada
inferredcites →https://doi.org/10.1145/216633.216668openalex-snapshot
Supporting user-friendly analysis of timing constraints
inferredcites →https://doi.org/10.1145/216636.216668openalex-snapshot
Supporting user-friendly analysis of timing constraints
inferredcites →https://doi.org/10.1145/2363.2366openalex-snapshot
Information-flow and data-flow analysis of while-programs
inferredcites →https://doi.org/10.1145/322261.322272openalex-snapshot
A Unified Approach to Path Problems
inferredcites →https://doi.org/10.1145/356674.356677openalex-snapshot
An Introduction to Proving the Correctness of Programs
inferredcites →https://doi.org/10.2307/2324863openalex-snapshot
Mathematica--A System for Doing Mathematics by Computer.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-024x(199903)29:3<235::aid-spe231>3.0.co;2-7openalex-snapshot
A software process for the construction of predictable on-board embedded real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_31openalex-snapshot
The value of verification: positive experience of Industrial proof
inferred← citeshttps://doi.org/10.1007/978-1-4471-0883-2_8openalex-snapshot
Ada Tasking for High-Integrity Systems
inferred← citeshttps://doi.org/10.1007/bfb0055009openalex-snapshot
Symbolic reaching definitions analysis of Ada programs
inferred← citeshttps://doi.org/10.1007/bfb0055011openalex-snapshot
The Ravenscar tasking profile for high integrity real-time programs
inferred← citeshttps://doi.org/10.1007/s00165-003-0019-0openalex-snapshot
Linear Approximation of Execution-Time Constraints
inferred← citeshttps://doi.org/10.1007/s001650070032openalex-snapshot
ADL: An Activity Description Language for Real-Time Networks
inferred← citeshttps://doi.org/10.1007/s10270-010-0161-0openalex-snapshot
Beyond loop bounds: comparing annotation languages for worst-case execution time analysis
inferred← citeshttps://doi.org/10.1007/s11227-014-1308-5openalex-snapshot
Modeling flow information of loops using compositional condition of controls
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/s1474-6670(17)39931-7openalex-snapshot
An Approach to Symbolic Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)81006-5openalex-snapshot
Formal Semantics for Program Paths
inferred← citeshttps://doi.org/10.1023/a:1008119029962openalex-snapshot
Guest Editorial: A Review of Worst-Case Execution-Time Analysis
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.1023/a:1008193114940openalex-snapshot
Symbolic Cache Analysis for Real-Time Systems
inferred← citeshttps://doi.org/10.1023/a:1014535317056openalex-snapshot
Data-Flow Frameworks for Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.1049/ip-sen:20010834openalex-snapshot
Semantic characterisation of dead control-flow paths
inferred← citeshttps://doi.org/10.1109/32.879807openalex-snapshot
Is proof more cost-effective than testing?
inferred← citeshttps://doi.org/10.1109/emrts.2000.853995openalex-snapshot
Portable worst-case execution time analysis using Java Byte Code
inferred← citeshttps://doi.org/10.1109/iceccs.2001.930162openalex-snapshot
A method for verifying real-time properties of Ada programs
inferred← citeshttps://doi.org/10.1109/iciea54703.2022.10006302openalex-snapshot
The dual-path code paradigm for time-deterministic and efficient networked embedded systems
inferred← citeshttps://doi.org/10.1109/icppw.2006.26openalex-snapshot
Automatic Flow Analysis Using Symbolic Execution and Path Enumeration
inferred← citeshttps://doi.org/10.1109/real.2003.1253252openalex-snapshot
FAST: frequency-aware static timing analysis
inferred← citeshttps://doi.org/10.1109/rtas.2005.53openalex-snapshot
Timing Analysis for Sensor Network Nodes of the Atmega Processor Family
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.2010.21openalex-snapshot
Studying the Applicability of the Scratchpad Memory Management Unit
inferred← citeshttps://doi.org/10.1109/rtcsa.2008.7openalex-snapshot
Parametric Timing Analysis for Complex Architectures
inferred← citeshttps://doi.org/10.1109/rtcsa.2015.11openalex-snapshot
Improving WCET Analysis Precision through Automata Product
inferred← citeshttps://doi.org/10.1109/rtss.2005.33openalex-snapshot
ParaScale: Exploiting Parametric Timing Analysis for Real-Time Schedulers and Dynamic Voltage Scaling
inferred← citeshttps://doi.org/10.1145/1066404.589452openalex-snapshot
Industrial strength exception freedom
inferred← citeshttps://doi.org/10.1145/1880050.1880061openalex-snapshot
Parametric timing analysis and its application to dynamic voltage scaling
inferred← citeshttps://doi.org/10.1145/1967677.1967697openalex-snapshot
Precise and efficient parametric path analysis
inferred← citeshttps://doi.org/10.1145/2016603.1967697openalex-snapshot
Precise and efficient parametric path analysis
inferred← citeshttps://doi.org/10.1145/289524.289525openalex-snapshot
The Ravenscar tasking profile for high integrity real-time programs
inferred← citeshttps://doi.org/10.1145/301687.289525openalex-snapshot
The Ravenscar tasking profile for high integrity real-time programs
inferred← citeshttps://doi.org/10.1145/589451.589452openalex-snapshot
Industrial strength exception freedom
inferred← citeshttps://doi.org/10.1243/09544100jaero60openalex-snapshot
High integrity real-time software
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.4230/oasics.wcet.2006.675openalex-snapshot
Combining Symbolic Execution and Path Enumeration in Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2007.1197openalex-snapshot
WCET Analysis: The Annotation Language Challenge
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2008.1657openalex-snapshot
Towards a Common WCET Annotation Language: Essential Ingredients
inferred← citeshttps://doi.org/10.70675/29c4dcbaz365ez4589zad7ez2e35c1b7665copenalex-snapshot
Maîtrise du temps d'exécution de logiciels déployés dans des dispositifs personnels de confiance
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.