Emerging non-volatile memory (NVM) technologies promise the durability of disks with the performance of volatile memory (RAM). To describe the persistency guarantees of NVM, several memory persistency models have been proposed in the literature. However, the formal semantics of such persistency models in the context We demonstrate that the two characterisations of PTSO are equivalent. We then formulate the notion of persistent linearisability to establish the correctness of library implementations in the context of persistent memory. To showcase our formalism, we develop two persistent implementations of a queue library, and apply persistent linearisability to show their correctness.
Thu 8 NovDisplayed time zone: Guadalajara, Mexico City, Monterrey change
Thu 8 Nov
Displayed time zone: Guadalajara, Mexico City, Monterrey change
10:30 - 12:00 | |||
10:30 22mTalk | Optimal Stateless Model Checking under the Release-Acquire Semantics OOPSLA Parosh Aziz Abdulla Uppsala University, Sweden, Mohamed Faouzi Atig Uppsala University, Bengt Jonsson Uppsala University, Tuan Phong Ngo Uppsala University | ||
10:52 22mTalk | Towards Understanding the Costs of Avoiding Out-of-Thin-Air Results OOPSLA | ||
11:15 22mTalk | Persistence Semantics for Weak Memory OOPSLA | ||
11:37 22mTalk | Identifying Refactoring Opportunities for Replacing Type Code with Subclass and State OOPSLA |