English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Linearizability is a commonly accepted correctness criterion for concurrentdata structures. However, verifying linearizability of highly concurrent datastructures is still a challenging task. In this paper, we present a simple andcomplete proof technique for verifying linearizability of concurrent stacks.Our proof technique reduces linearizability of concurrent stacks toestablishing a set of conditions. These conditions are based on thehappened-before order of operations, intuitively express the LIFO semantics andcan be proved by simple arguments. Designers of concurrent data structures caneasily and quickly learn to use the proof technique. We have successfullyapplied the method to several challenging concurrent stacks: the TS stack, theHSY stack, and the FA stack, etc.

A Simple Way to Verify Linearizability of Concurrent Stacks