Validating Persistency Semantics with Memory Hierarchy Timing Attack
Memory persistency models define how Non-Volatile Memory (NVM) writes are handled. Though well-defined for Intel-x86 and Arm architectures, they lack empirical validation on real hardware. Traditional methods fall short, as test programs cannot reliably distinguish between volatile cache reads and NVM reads. Physical bus probing also faces limitations due to the persistence domain extending into unmonitored buffers within the memory controller.
To address the challenge of navigating the memory hierarchy for insights into persistency behaviours, we propose a methodical \emph{memory hierarchy timing attack}. By time-stamping instructions, we capture subtle timing variations that provide clues about the access destination within the memory hierarchy. Interpreting these timing patterns, however, requires a comprehensive understanding of both the underlying architecture and the specific characteristics of the application in use.
To further automate the validation process, we advocate the use of \emph{model learning} techniques. These techniques allow for the iterative refinement of models through black-box observations, facilitating a more scalable and dynamic approach to persistency validation across diverse hardware platforms.
Mon 30 JunDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
14:00 - 15:45 | Concurrency and TypesTechnical Papers at Auditorium M003 Chair(s): João Costa Seco NOVA-LINCS; Nova University of Lisbon | ||
14:00 21mTalk | Contrasting Deadlock-Free Session Processes Technical Papers DOI | ||
14:21 21mTalk | Fair Termination of Asynchronous Binary Sessions Technical Papers Luca Padovani Department of Computer Science and Engineering - Università di Bologna, Gianluigi Zavattaro Department of Computer Science and Engineering - Università di Bologna | ||
14:42 21mTalk | Incremental Computing by Differential Execution Technical Papers | ||
15:03 21mTalk | Multiparty Asynchronous Session Types: A Mechanised Proof of Subject Reduction Technical Papers Dawit Tirore IT University of Copenhagen, Denmark, Jesper Bengtson IT University of Copenhagen, Marco Carbone IT University of Copenhagen | ||
15:24 21mTalk | Validating Persistency Semantics with Memory Hierarchy Timing Attack Technical Papers Vasileios Klimis Queen Mary University of London |