On the public citation graph

Fast and exact analysis for LRU caches

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.
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/11817963_5openalex-snapshot
Antichains: A New Algorithm for Checking Universality of Finite Automata
inferredcites →https://doi.org/10.1007/978-1-4020-8157-6_29openalex-snapshot
aiT: Worst-Case Execution Time Prediction by Static Program Analysis
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_2openalex-snapshot
Ascertaining Uncertainty for Efficient Exact Cache Analysis
inferredcites →https://doi.org/10.1007/978-3-540-88387-6_21openalex-snapshot
Alaska
inferredcites →https://doi.org/10.1007/978-3-642-03237-0_10openalex-snapshot
Abstract Interpretation of FIFO Replacement
inferredcites →https://doi.org/10.1007/978-3-642-16256-5_6openalex-snapshot
OTAWA: An Open Toolbox for Adaptive WCET Analysis
inferredcites →https://doi.org/10.1007/bf01379404openalex-snapshot
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
inferredcites →https://doi.org/10.1007/bf01407835openalex-snapshot
Some efficient solutions to the affine scheduling problem. I. One-dimensional time
inferredcites →https://doi.org/10.1007/s100090100038openalex-snapshot
Zero-suppressed BDDs and their applications
inferredcites →https://doi.org/10.1007/s100090100042openalex-snapshot
Efficient manipulation of decision diagrams
inferredcites →https://doi.org/10.1007/s11241-007-9032-3openalex-snapshot
Timing predictability of cache replacement policies
inferredcites →https://doi.org/10.1007/s11241-013-9178-0openalex-snapshot
Scalable and precise refinement of cache timing analysis via path-sensitive verification
inferredcites →https://doi.org/10.1007/s13389-017-0152-yopenalex-snapshot
CacheBleed: a timing attack on OpenSSL constant-time RSA
inferredcites →https://doi.org/10.1016/j.sysarc.2004.09.004openalex-snapshot
Generating cache hints for improved program efficiency
inferredcites →https://doi.org/10.1023/a:1008186323068openalex-snapshot
Efficient and Precise Cache Behavior Prediction for Real-Time Systems
inferredcites →https://doi.org/10.1109/ecrts.2010.8openalex-snapshot
Precise and Efficient FIFO-Replacement Analysis Based on Static Phase Detection
inferredcites →https://doi.org/10.1109/real.1999.818824openalex-snapshot
Timing anomalies in dynamically scheduled microprocessors
inferredcites →https://doi.org/10.1109/rtas.2016.7461358openalex-snapshot
Precise Cache Timing Analysis via Symbolic Execution
inferredcites →https://doi.org/10.1109/simsym.1995.393589openalex-snapshot
Fast instruction cache analysis via static cache simulation
inferredcites →https://doi.org/10.1109/simsym.2001.922105openalex-snapshot
Proceedings. 34th Annual Simulation Symposium
inferredcites →https://doi.org/10.1109/sp.2015.43openalex-snapshot
Last-Level Cache Side-Channel Attacks are Practical
inferredcites →https://doi.org/10.1109/sp.2019.00002openalex-snapshot
Spectre Attacks: Exploiting Speculative Execution
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/2381913.2381917openalex-snapshot
Are AES x86 cache timing attacks still feasible?
inferredcites →https://doi.org/10.1145/2584655openalex-snapshot
WCET analysis with MRU cache
inferredcites →https://doi.org/10.1145/263699.263719openalex-snapshot
Maximizing parallelism and minimizing synchronization with affine transforms
inferredcites →https://doi.org/10.1145/2756550openalex-snapshot
CacheAudit
inferredcites →https://doi.org/10.1145/3062341.3062388openalex-snapshot
Rigorous analysis of software countermeasures against cache attacks
inferredcites →https://doi.org/10.1145/3158120openalex-snapshot
Analytical modeling of cache behavior for affine programs
inferredcites →https://doi.org/10.1145/325478.325479openalex-snapshot
Cache miss equations
inferredcites →https://doi.org/10.1145/378795.378859openalex-snapshot
Exact analysis of the cache behavior of nested loops
inferredcites →https://doi.org/10.1145/782814.782836openalex-snapshot
Estimating cache misses and locality using stack distances
inferredcites →https://doi.org/10.15480/882.3083openalex-snapshot
TACLeBench : a benchmark collection to support worst-case execution time research
inferredcites →https://doi.org/10.4230/lites-v003-i001-a005openalex-snapshot
A Survey on Static Cache Analysis for Real-Time Systems
inferredcites →https://doi.org/10.4230/oasics.wcet.2006.671openalex-snapshot
A Definition and Classification of Timing Anomalies

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-54997-8_21openalex-snapshot
An Abstract Semantics of Speculative Execution for Reasoning About Security Vulnerabilities
inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_20openalex-snapshot
Deconstructing Subset Construction
inferred← citeshttps://doi.org/10.1007/978-981-19-9601-6_6openalex-snapshot
Completeness in Static Analysis by Abstract Interpretation: A Personal Point of View
inferred← citeshttps://doi.org/10.1007/s00607-025-01601-0openalex-snapshot
An adaptive NLP-driven access control framework for northbound interface in software defined network
inferred← citeshttps://doi.org/10.1007/s10703-022-00392-wopenalex-snapshot
The complexity gap in the static analysis of cache accesses grows if procedure calls are added
inferred← citeshttps://doi.org/10.1007/s11241-019-09341-zopenalex-snapshot
Design and analysis of SIC: a provably timing-predictable pipelined processor core
inferred← citeshttps://doi.org/10.1007/s11241-021-09372-5openalex-snapshot
Precise, efficient, and context-sensitive cache analysis
inferred← citeshttps://doi.org/10.1007/s11241-024-09430-8openalex-snapshot
Timing-aware analysis of shared cache interference for non-preemptive scheduling
inferred← citeshttps://doi.org/10.1016/j.comcom.2022.07.008openalex-snapshot
Effective data management strategy and RDD weight cache replacement strategy in Spark
inferred← citeshttps://doi.org/10.1109/dynamics68764.2025.11302187openalex-snapshot
Experimental Research of the Caching Algorithms Effectiveness
inferred← citeshttps://doi.org/10.1109/icadeis65852.2025.10933468openalex-snapshot
Optimization of Object Relational Mapping: Query Profiling Integration Based on Frequency and Timestamps Implementation in LRU
inferred← citeshttps://doi.org/10.1109/iccae55086.2022.9762451openalex-snapshot
Cache Replacement Strategy Based on User Behaviour Analysis for a Massive Small File Storage System
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00207openalex-snapshot
Competitive Consistent Caching for Transactions
inferred← citeshttps://doi.org/10.1109/icect61618.2024.10581186openalex-snapshot
Integration and Verification of L1 Data Cache in SweRV EH1
inferred← citeshttps://doi.org/10.1109/isie51358.2023.10228033openalex-snapshot
Improving the Execution Time of Industrial Applications through Planned Cache Eviction Policy Selection
inferred← citeshttps://doi.org/10.1109/rtas65571.2025.00018openalex-snapshot
A Unified Framework for Quantitative Cache Analysis
inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00049openalex-snapshot
Cache Persistence Analysis: Finally Exact
inferred← citeshttps://doi.org/10.1109/rtss59052.2023.00029openalex-snapshot
Leveraging LLVM's ScalarEvolution for Symbolic Data Cache Analysis
inferred← citeshttps://doi.org/10.1109/rtss66672.2025.00046openalex-snapshot
Tight Cache Contention Analysis for WCET Estimation on Multicore Systems
inferred← citeshttps://doi.org/10.1109/tac.2024.3395521openalex-snapshot
Exact Worst-Case Execution-Time Analysis for Implicit Model Predictive Control
inferred← citeshttps://doi.org/10.1145/3314221.3314606openalex-snapshot
A fast analytical model of fully associative caches
inferred← citeshttps://doi.org/10.1145/3366018openalex-snapshot
On the Complexity of Cache Analysis for Different Replacement Policies
inferred← citeshttps://doi.org/10.1145/3394810.3394811openalex-snapshot
Precise and Efficient Analysis of Context-Sensitive Cache Conflict Sets
inferred← citeshttps://doi.org/10.1145/3519939.3523714openalex-snapshot
Warping cache simulation of polyhedral programs
inferred← citeshttps://doi.org/10.1145/3575757.3593643openalex-snapshot
Analysis of Shared Cache Interference in Multi-Core Systems using Event-Arrival Curves
inferred← citeshttps://doi.org/10.1145/3695768openalex-snapshot
Towards Analysing Cache-Related Preemption Delay in Non-Inclusive Cache Hierarchies
inferred← citeshttps://doi.org/10.1145/3808252openalex-snapshot
Path-Sensitive Abstract Interpretation for WCET Estimation
inferred← citeshttps://doi.org/10.4230/lipics.ecrts.2026.13openalex-snapshot
CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays
inferred← citeshttps://doi.org/10.48550/arxiv.1904.11170openalex-snapshot
Abstract Interpretation under Speculative Execution
inferred← citeshttps://doi.org/10.70675/06b824a0z206cz4e2fz8188zef497573a039openalex-snapshot
Analyse et contrôle des interférences liées à la cohérence de cache dans les multi-coeurs COTS
inferred← citeshttps://doi.org/10.70675/3aae1dacz8e78z4548zb112z283138654eb5openalex-snapshot
Efficient tree-based symbolic WCET computation
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.