Journal article · 2025 · Open access

Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability

Armando Castañeda, Gilde Valeria Rodríguez

Journal of the ACM, 73(1), 1–37 · Published 17 November 2025 · DOI 10.1145/3777409

Open PDFView at the publisherCite this paper

In brief

“Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability” is a 2025 journal article by Armando Castañeda and Gilde Valeria Rodríguez, published in Journal of the ACM. OpenAlex counts 3 citations as of 17 November 2026, which puts it in the top 4% of works published in 2025 by citations. It is open access: the full text is free to read at Journal of the ACM.

Citations
3
Most cited in
2026 (3)
Field-weighted impact
0.90
References
97
Authors
2

Abstract

This article presents a theoretical study of the problem of verifying linearizability at runtime, where one seeks for a concurrent algorithm for verifying that the current execution of a given concurrent shared object implementation is linearizable. It shows that it is impossible to runtime verify linearizability for some common sequential objects, regardless of the consensus power of base objects. Then, it argues that a variant of the problem, which we call predictive verification, can be solved, if linearizability is verified indirectly. Namely, it shows that (1) linearizability of a class of concurrent implementations can be predictively verified using only read/write base objects (i.e., without the need of consensus), and (2) any implementation can be transformed to its counterpart in the class using only read/write objects. As far as we know, this is the first runtime verification algorithm for any correctness condition that is fully asynchronous and fault-tolerant. As a by-product, it is obtained a simple and generic methodology for deriving linearizable implementations that runtime verify their responses, and are able to produce a history certifying this, properties that allows the design of concurrent systems in a modular manner with accountable and forensic guarantees. We call such implementations self-enforced linearizable. The results hold not only for linearizability but for a correctness condition that includes generalizations of it such as set-linearizability and interval-linearizability.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Castañeda, A., & Rodríguez, G. V. (2025). Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. Journal of the ACM, 73(1), 1–37. https://doi.org/10.1145/3777409

MLA 9

Castañeda, Armando, and Gilde Valeria Rodríguez. “Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability.” Journal of the ACM, vol. 73, no. 1, 2025, pp. 1–37. https://doi.org/10.1145/3777409.

Chicago

Castañeda, Armando and Gilde Valeria Rodríguez. 2025. “Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability.” Journal of the ACM 73 (1): 1–37. https://doi.org/10.1145/3777409.

Harvard

Castañeda, A. and Rodríguez, G. V. (2025) ‘Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability’, Journal of the ACM, 73(1), pp. 1–37. doi:10.1145/3777409.

IEEE

A. Castañeda and G. V. Rodríguez, “Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability,” Journal of the ACM, vol. 73, no. 1, pp. 1–37, 2025, doi: 10.1145/3777409.

BibTeX

@article{castaneda2025asynchronous,
  title     = {{Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability}},
  author    = {Castañeda, Armando and Rodríguez, Gilde Valeria},
  journal   = {Journal of the ACM},
  year      = {2025},
  volume    = {73},
  number    = {1},
  pages     = {1--37},
  doi       = {10.1145/3777409},
  url       = {https://doi.org/10.1145/3777409}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance

  • linearizability
  • runtime verification
  • wait-free algorithms
  • fault tolerance
  • consensus
  • correctness conditions

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Castañeda, A., & Rodríguez, G. V. (2025). Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. Journal of the ACM, 73(1), 1–37. https://doi.org/10.1145/3777409

How many times has this paper been cited?

3 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Journal of the ACM: sign in and open the PDF from this page.

Who wrote this paper?

Armando Castañeda, Gilde Valeria Rodríguez.

What is the DOI of this paper?

10.1145/3777409, permanently at https://doi.org/10.1145/3777409. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.