Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Modular Verification of Concurrency-Aware Linearizability
verfasst von : Nir Hemed, Noam Rinetzky, Viktor Vafeiadis
Erschienen in: Distributed Computing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Linearizability is the de facto correctness condition for concurrent objects. Informally, linearizable objects provide the illusion that each operation takes effect
instantaneously
at
a
unique
point
in
time
between its invocation and response. Hence,
by
design
, linearizability cannot describe behaviors of
concurrency
−
aware
concurrent
objects
(CAobjects), objects in which several overlapping operations “seem to take effect
simultaneously
”. In this paper, we introduce
concurrency
−
aware
linearizability
(CAL), a generalized notion of linearizability which allows to formally describe the behavior of CA-objects. Based on CAL, we develop a thread- and procedure-modular verification technique for reasoning about CA-objects and their clients. Using our new technique, we present the first proof of linearizability of the elimination stack of Hendler
et
al
. [10] in which the stack’s elimination subcomponent, which is a general-purpose CA-object, is specified and verified independently of its particular usage by the stack.