On the public citation graph
Automatic accurate time-bound analysis for high-level languages
0 signed · 62 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/978-1-4471-3166-3_5openalex-snapshot
Complexity Analysis for a Lazy Higher-Order Language
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/bfb0002886openalex-snapshot
Deriving annotations for tight calculation of execution time
inferredcites →https://doi.org/10.1007/bfb0057776openalex-snapshot
Integrating path and timing analysis using instruction-level simulation techniques
inferredcites →https://doi.org/10.1007/bfb0057778openalex-snapshot
Automatic accurate time-bound analysis for high-level languages
inferredcites →https://doi.org/10.1016/0167-6423(94)00031-9openalex-snapshot
Systematic derivation of incremental programs
inferredcites →https://doi.org/10.1016/0304-3975(91)90145-ropenalex-snapshot
Automatic average-case analysis of algorithms
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.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/emwrts.1998.685079openalex-snapshot
Facilitating worst-case execution times analysis for optimized code
inferredcites →https://doi.org/10.1109/rttas.1998.683183openalex-snapshot
Bounding loop iterations for timing analysis
inferredcites →https://doi.org/10.1145/235543.235545openalex-snapshot
Analysis of benchmark characteristics and benchmark performance prediction
inferredcites →https://doi.org/10.1145/291889.291895openalex-snapshot
Static caching for incremental computation
inferredcites →https://doi.org/10.1145/42190.42347openalex-snapshot
ACE: an automatic complexity evaluator
inferredcites →https://doi.org/10.1145/73560.73571openalex-snapshot
Strictness analysis aids time analysis
inferredcites →https://doi.org/10.1145/93542.93585openalex-snapshot
Analysis of pointers and structures
inferredcites →https://doi.org/10.1145/989393.989429openalex-snapshot
Analysis of pointers and structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45142-0_7openalex-snapshot
Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_19openalex-snapshot
Dynamic Programming via Static Incrementalization
inferred← citeshttps://doi.org/10.1007/978-1-4020-6585-9_9openalex-snapshot
Dynamic Programming via Static Incrementalization
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-642-04027-6_24openalex-snapshot
Efficient Type-Checking for Amortised Heap-Space Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-15331-0_2openalex-snapshot
Improvements to a Resource Analysis for Hume
inferred← citeshttps://doi.org/10.1007/bfb0057775openalex-snapshot
Languages, Compilers, and Tools for Embedded Systems
inferred← citeshttps://doi.org/10.1007/bfb0057776openalex-snapshot
Integrating path and timing analysis using instruction-level simulation techniques
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.1016/s0167-6423(01)00003-xopenalex-snapshot
Strengthening invariants for efficient computation
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:1008119209479openalex-snapshot
Source-to-Source Instrumentation for the Optimization of an Automatic Reading System
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:1026547031739openalex-snapshot
Efficiency by Incrementalization: An Introduction
inferred← citeshttps://doi.org/10.1109/43.918207openalex-snapshot
Compact and efficient code generation through program restructuring on limited memory embedded DSPs
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/isqed.2013.6523665openalex-snapshot
Performance validation through implicit removal of infeasible paths of the behavioral description
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.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/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/tc.2001.970569openalex-snapshot
Automatic accurate cost-bound analysis for high-level languages
inferred← citeshttps://doi.org/10.1109/tcset.2018.8336405openalex-snapshot
A model for estimating firmware execution time based on peripherals' time behavior
inferred← citeshttps://doi.org/10.1145/1159861.1159874openalex-snapshot
Towards an automatic complexity analysis for generic programs
inferred← citeshttps://doi.org/10.1145/1542431.1542451openalex-snapshot
Parametric heap usage analysis for functional programs
inferred← citeshttps://doi.org/10.1145/1706299.1706327openalex-snapshot
Static determination of quantitative resource usage for higher-order programs
inferred← citeshttps://doi.org/10.1145/375212.375223openalex-snapshot
Performance specification of software components
inferred← citeshttps://doi.org/10.1145/384196.384212openalex-snapshot
Automatic Accurate Live Memory Analysis for Garbage-Collected Languages
inferred← citeshttps://doi.org/10.1145/503032.503039openalex-snapshot
Automatic time-bound analysis for a higher-order language
inferred← citeshttps://doi.org/10.1145/507635.507666openalex-snapshot
Cost recurrences for DML programs
inferred← citeshttps://doi.org/10.1145/604131.604148openalex-snapshot
Static prediction of heap space usage for first-order functional programs
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.25916/sut.26269096openalex-snapshot
Towards a framework for reasoning about the performance of component software
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2006.667openalex-snapshot
Algorithms for Infeasible Path Calculation
inferred← citeshttps://doi.org/10.48550/arxiv.1307.2473openalex-snapshot
From bounded affine types to automatic timing analysis
inferred← citeshttps://doi.org/10.5555/823453.823845openalex-snapshot
Exact runtime analysis using automata-based symbolic simulation
inferred← citeshttps://doi.org/10.5815/ijisa.2018.06.03openalex-snapshot
A Model for Estimating Firmware Execution Time Taking Into Account Peripheral Behavior
inferred← citeshttps://doi.org/10.7146/brics.v8i25.21685openalex-snapshot
Cost Recurrences for DML Programs
showing the first 39 of 40 · page through all 40
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.