Skip to main content
Conference ProceedingsOPEN ACCESS

Automatically proving linearizability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6174 LNCS 450-464
DOI: 10.1007/978-3-642-14295-6_40
94Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure implementations. The procedure employs a novel instrumentation to verify logically pure executions, and is evaluated on a number of standard concurrent stack, queue and set algorithms. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Vafeiadis, V. (2010). Automatically proving linearizability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6174 LNCS, pp. 450–464). https://doi.org/10.1007/978-3-642-14295-6_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free