Recoverable Lock-Free Locks
Hagit Attiya, Panagiota Fatourou, Eleftherios Kosmas, Yuanhao Wei

TL;DR
This paper introduces a novel transformation that converts lock-based implementations into recoverable, lock-free versions, supporting nested locks and ensuring correctness and recoverability.
Contribution
It presents the first transformation that achieves both lock-freedom and recoverability from lock-based code, supporting nested locks.
Findings
Provides a recoverable, lock-free substitution for lock acquire and release.
Supports nested locks without compromising correctness.
Ensures recoverability in lock-free transformations.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
