CacheQuery: Learning Replacement Policies from Hardware Caches
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Dec 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 2.
3 papers.
- 2022ALARM: Active LeArning of Rowhammer Mitigationscited by 0
- 2023Conflict-Aware Active Automata Learning (Extended Version)cited by 0
- 2023Conflict-Aware Active Automata Learningcited by 0
- 2023Conflict-Aware Active Automata Learning2 Oct 2023
- 2023Conflict-Aware Active Automata Learning (Extended Version)28 Aug 2023
- 2022ALARM: Active LeArning of Rowhammer Mitigations30 Nov 2022