2000 character limit reached
Recoverable Lock-Free Locks
Published 10 Dec 2025 in cs.DC | (2512.09710v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.