English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For applications in worst-case execution time analysis and in security, it isdesirable to statically classify memory accesses into those that result incache hits, and those that result in cache misses. Among cache replacementpolicies, the least recently used (LRU) policy has been studied the most and isconsidered to be the most predictable. The state-of-the-art in LRU cacheanalysis presents a tradeoff between precision and analysis efficiency: Theclassical approach to analyzing programs running on LRU caches, an abstractinterpretation based on a range abstraction, is very fast but can be imprecise.An exact analysis was recently presented, but, as a last resort, it calls amodel checker, which is expensive. In this paper, we develop an analysis basedon abstract interpretation that comes close to the efficiency of the classicalapproach, while achieving exact classification of all memory accesses as themodel-checking approach. Compared with the model-checking approach we observespeedups of several orders of magnitude. As a secondary contribution we showthat LRU cache analysis problems are in general NP-complete.

Fast and exact analysis for LRU caches