English

CacheQuery: Learning Replacement Policies from Hardware Caches

Programming Languages 2020-05-27 v2 Formal Languages and Automata Theory

Abstract

We show how to infer deterministic cache replacement policies using off-the-shelf automata learning and program synthesis techniques. For this, we construct and chain two abstractions that expose the cache replacement policy of any set in the cache hierarchy as a membership oracle to the learning algorithm, based on timing measurements on a silicon CPU. Our experiments demonstrate an advantage in scope and scalability over prior art and uncover 2 previously undocumented cache replacement policies.

Keywords

Cite

@article{arxiv.1912.09770,
  title  = {CacheQuery: Learning Replacement Policies from Hardware Caches},
  author = {Pepe Vila and Pierre Ganty and Marco Guarnieri and Boris Köpf},
  journal= {arXiv preprint arXiv:1912.09770},
  year   = {2020}
}

Comments

17 pages, 5 tables, 5 figures

R2 v1 2026-06-23T12:52:18.960Z