Year: 2025
Type: article
Abstract: Waitfree linearization of data objects was introduced by Herlihy in 1991. The present article proposes an algorithm for waitfree linearization of a possibly nondeterministic data object in bounded memory, together with a complete proof of correctness supported by the proof assistant PVS. The project is exceptional in that the proofs of 70 invariants are recorded systematically, and that waitfree progress is quantified in waitfree complexity and is formally proved.
Source: Formal Aspects of Computing
DOI: 10.1145/3725535
Author: Wim Hendrik Hesselink
Institution: University of Groningen
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,780
OpenAlex ID: W4409144824