{"ID":2830750,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2512.09710","arxiv_id":"2512.09710","title":"Recoverable Lock-Free Locks","abstract":"This paper presents the first transformation that introduces both lock-freedom and recoverability. Our transformation starts with a lock-based implementation, and provides a recoverable, lock-free substitution to lock acquire and lock release operations. The transformation supports nested locks for generality and ensures recoverability without jeopardising the correctness of the lock-based implementation it is applied on.","short_abstract":"This paper presents the first transformation that introduces both lock-freedom and recoverability. Our transformation starts with a lock-based implementation, and provides a recoverable, lock-free substitution to lock acquire and lock release operations. The transformation supports nested locks for generality and ensur...","url_abs":"https://arxiv.org/abs/2512.09710","url_pdf":"https://arxiv.org/pdf/2512.09710v1","authors":"[\"Hagit Attiya\",\"Panagiota Fatourou\",\"Eleftherios Kosmas\",\"Yuanhao Wei\"]","published":"2025-12-10T14:57:51Z","proceeding":"cs.DC","tasks":"[\"cs.DC\"]","methods":"[]","has_code":false}