Keyword

linearizability

Description: A correctness property for concurrent and distributed systems requiring operations to appear atomic and consistent with real-time ordering.

Primary topic: Distributed systems and fault tolerance (61%)

Wikidata ID: wiki/Q513932

OpenAlex ID: keywords/linearizability

Linearizability: a correctness condition for concurrent objects

1990 · Maurice P. Herlihy, Jeannette M. Wing · ACM Transactions on Programming Languages and Systems · 3,176

PDF

ZooKeeper: wait-free coordination for internet-scale systems

2010 · P. G. Hunt, Mahadev Konar, et al. · 1,356

A Pragmatic Implementation of Non-blocking Linked-lists

2001 · Timothy L. Harris · Lecture notes in computer science · 459

High performance dynamic lock-free hash tables and list-based sets

2002 · Maged M. Michael · 420

Transactional boosting

2008 · Maurice Herlihy, Eric Koskinen · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · 305

Verdi: a framework for implementing and formally verifying distributed systems

2015 · James R. Wilcox, Doug Woos, et al. · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 271

PDF

Sequential consistency versus linearizability

1994 · Hagit Attiya, Jennifer L. Welch · ACM Transactions on Computer Systems · 266

PDF

The Center and Cyclicity Problems: A Computational Algebra Approach

2009 · Valery G. Romanovski, Douglas S. Shafer · Medical Entomology and Zoology · 254

Attested append-only memory

2007 · Byung-Gon Chun, Petros Maniatis, et al. · 247

A scalable lock-free stack algorithm

2004 · Danny Hendler, Nir Shavit, et al. · 208

A practical concurrent binary search tree

2010 · Nathan G. Bronson, Jared Casper, et al. · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · 197

Efficient Byzantine-tolerant erasure-coded storage

2004 · G.R. Goodson, J.J. Wylie, et al. · IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) · 197

Non-blocking binary search trees

2010 · Faith Ellen, Panagiota Fatourou, et al. · 190

Testing Shared Memories

1997 · Phillip B. Gibbons, Ephraim Korach · SIAM Journal on Computing · 177

Axioms for concurrent objects

1987 · M. P. Herlihy, J. M. Wing · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · 175

Scalable consistency in Scatter

2011 · Lisa Glendenning, Ivan Beschastnikh, et al. · 150

Line-up

2010 · Sebastian Burckhardt, Chris Dern, et al. · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 148

Direct reduction and differential constraints

1994 · Peter J. Olver · Proceedings of the Royal Society of London Series A Mathematical and Physical Sciences · 147

Abstraction for concurrent objects

2010 · Ivana Filipović, Peter O’Hearn, et al. · Theoretical Computer Science · 138

PDF

Automatically Proving Linearizability

2010 · Viktor Vafeiadis · Lecture notes in computer science · 133

Principles of Eventual Consistency

2014 · Sebastian Burckhardt · Foundations and Trends® in Programming Languages · 131

Planning for change in a formal verification of the raft consensus protocol

2016 · Doug Woos, James R. Wilcox, et al. · 129

PDF

Using elimination to implement scalable and lock-free FIFO queues

2005 · Mark Moir, Daniel Nussbaum, et al. · 122

Consistency in Non-Transactional Distributed Storage Systems

2016 · Paolo Viotti, Marko Vukolić · ACM Computing Surveys · 113

Comparison Under Abstraction for Verifying Linearizability

2007 · Daphna Amit, Noam Rinetzky, et al. · Springer eBooks · 112

Works count: 1,499

Citation count: 21,330