论文信息 - Consistency Anchor Formalization and Correctness Proofs

Consistency Anchor Formalization and Correctness Proofs

This is report contains the formal proofs for the techniques for increasing the consistency of cloud storage as presented in "Bessani et al. SCFS: A Cloud-backed File System. Proc. of the 2014 USENIX Annual Technical Conference. June 2014."

Correia Miguel | Alysson Bessani | A. Bessani | Correia Miguel

[1] Hagit Attiya,et al. Sharing memory robustly in message-passing systems , 1990, PODC '90.

[2] Rodrigo Rodrigues,et al. Tolerating Byzantine Faulty Clients in a Quorum System , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[3] Werner Vogels,et al. Building reliable distributed systems at a worldwide scale demands trade-offs between consistency and availability. , 2022 .

[4] Leslie Lamport,et al. Interprocess Communication , 2020, Practical System Programming with C.

[5] Michael J. Freedman,et al. Don't settle for eventual: scalable causal consistency for wide-area storage with COPS , 2011, SOSP.

[6] Miguel Correia,et al. SCFS: A Shared Cloud-backed File System , 2014, USENIX Annual Technical Conference.

[7] Michael Burrows,et al. The Chubby Lock Service for Loosely-Coupled Distributed Systems , 2006, OSDI.

[8] Vignesh Ravindran. The Chubby Lock Service , 2011 .

[9] Miguel Correia,et al. DepSky: Dependable and Secure Storage in a Cloud-of-Clouds , 2013, TOS.

[10] Maurice Herlihy,et al. Wait-free synchronization , 1991, TOPL.

[11] Miguel Correia,et al. DepSpace: a byzantine fault-tolerant coordination service , 2008, Eurosys '08.

[12] Dan Dobre,et al. Eventually linearizable shared objects , 2010, PODC '10.

[13] Maurice Herlihy,et al. Linearizability: a correctness condition for concurrent objects , 1990, TOPL.