연구 분야: Analysis
학회: PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
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 two previously undocumented cache replacement policies.
| 발행 연도 | 2020년 |
|---|---|
| 인용수 | 26 |
| 출판 국가 | Spain, Germany |
| 사이트 | ACM |
| 좋아요 수 | 0 |