On the correctness of highly available systems in the presence of failures

tom's Hardware Business Wire Abadi, 2012, Consistency tradeoffs in modern distributed database system design: CAP is only part of the story, Computer, 45, 10.1109/MC.2012.33 Alfatafta, 2020 Almeida, 2014, Scalable and accurate causality tracking for eventually consistent stores Alpern, 1987, Recognizing safety and liveness, Distrib. Comput., 2, 117, 10.1007/BF01782772 Alquraan, 2018, An analysis of network-partitioning failures in cloud systems Attiya, 2015, Limitations of highly-available eventually-consistent data stores Attiya, 2016, Specification and complexity of collaborative text editing, 259 Attiya, 2017, Limitations of highly-available eventually-consistent data stores, IEEE Trans. Parallel Distrib. Syst., 28, 141, 10.1109/TPDS.2016.2556669 Bailis, 2013, Eventual consistency today: limitations, extensions, and beyond, Queue, 11, 20, 10.1145/2460276.2462076 Bailis, 2013, Highly available transactions: virtues and limitations, Proc. VLDB Endow., 7, 181, 10.14778/2732232.2732237 Bernstein, 2013, Rethinking eventual consistency Bonér Bouajjani, 2014, Verifying eventual consistency of optimistic replication systems Brewer, 2000, Towards robust distributed systems (abstract) Brzezinski, 2004, From session causality to causal consistency, 152 Burckhardt, 2014, Principles of eventual consistency, Found. Trends Program. Lang., 1, 1 Burckhardt, 2014, Replicated data types: specification, verification, optimality Burckhardt, 2013 Cachin, 2011 DeCandia, 2007, Dynamo: Amazon's highly available key-value store, Oper. Syst. Rev., 41, 205, 10.1145/1323293.1294281 Gilbert, 2002, Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services, SIGACT News, 33, 51, 10.1145/564585.564601 Gill, 2011, Understanding network failures in data centers: measurement, analysis, and implications, 350 Girault, 2018, Monotonic prefix consistency in distributed systems Gomes, 2017, Verifying strong eventual consistency in distributed systems, 1, 1 Gotsman, 2016, ‘Cause I'm strong enough: reasoning about consistency choices in distributed systems Greenough, 1976 Guerraoui, 2014, A paradox of eventual linearizability in shared memory Herlihy, 1991, Wait-free synchronization, ACM Trans. Program. Lang. Syst., 13, 124, 10.1145/114005.102808 Herlihy, 1990, Linearizability: a correctness condition for concurrent objects, ACM Trans. Program. Lang. Syst., 12, 463, 10.1145/78969.78972 Imine, 2003, Proving correctness of transformation functions in real-time groupware, 277 Karger, 1997, Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web, 654 Kokociński, 2022, On mixing eventual and strong consistency: acute cloud types, IEEE Trans. Parallel Distrib. Syst., 33, 1338, 10.1109/TPDS.2021.3090318 Lakshman, 2010, Cassandra: a decentralized structured storage system, Oper. Syst. Rev., 44, 35, 10.1145/1773912.1773922 Lamport, 1977, Proving the correctness of multiprocess programs, IEEE Trans. Softw. Eng., SE-3, 125, 10.1109/TSE.1977.229904 Lamport, 1998, The part-time parliament, ACM Trans. Comput. Syst., 16, 10.1145/279227.279229 Lamport, 1978, Time, clocks, and the ordering of events in a distributed system, Commun. ACM, 21, 10.1145/359545.359563 Lamport, 1979, How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE Trans. Comput., C-28, 10.1109/TC.1979.1675439 Li, 2012, Making geo-replicated systems fast as possible, consistent when necessary Li, 2018, Fine-Grained Consistency for Geo-Replicated Systems, vol. ‘18 Liu, 2014, Formal modeling and analysis of Cassandra in Maude, vol. 8829, 332 Liu, 2020, Verifying replicated data types with typeclass refinements in liquid Haskell, 4, 1 Mahajan, 2012 Mahajan, 2011 Meza, 2018, A large scale study of data center network reliability Netflix Oster, 2005 Papadimitriou, 1979, The serializability of concurrent database updates, J. ACM, 26, 10.1145/322154.322158 Peng, 2019, System evaluation of the Intel Optane byte-addressable NVM, 304 Preguiça Roh, 2011, Replicated abstract data types: building blocks for collaborative applications, J. Parallel Distrib. Comput., 71, 354, 10.1016/j.jpdc.2010.12.006 Rondon, 2008, Liquid types, 159 Rudoff, 2017, Persistent memory programming, Login, 42 Serafini, 2010, Eventually linearizable shared objects Shapiro, 2011, Conflict-free replicated data types Shapiro, 2011 Terry, 1995, Managing update conflicts in Bayou, a weakly connected replicated storage system Terry, 1994, Session guarantees for weakly consistent replicated data Thomas, 1979, A majority consensus approach to concurrency control for multiple copy databases, ACM Trans. Database Syst., 4, 180, 10.1145/320071.320076 Turner, 2012 Vazou, 2014, Refinement types for Haskell, 269 Viotti, 2016, Consistency in non-transactional distributed storage systems, ACM Comput. Surv., 49, 10.1145/2926965 Vogels, 2009, Eventually consistent, Commun. ACM, 52, 10.1145/1435417.1435432 Wang, 2019, Replication-aware linearizability Wenzel, 2008, The Isabelle framework, 33 Wojciechowski, 2017, State-machine and deferred-update replication: analysis and comparison, IEEE Trans. Parallel Distrib. Syst., 28, 891, 10.1109/TPDS.2016.2590422