9 citations · 25 across the 14 of their papers we have counts for
19 papers
Vertical Atomic Broadcast and Passive Replication (Extended Version)
Manuel Bravo, Gregory Chockler, Alexey Gotsman +2
Atomic broadcast is a reliable communication abstraction ensuring that all processes deliver the same set of messages in a common global order. It is a fundamental building block f…
Fault-Tolerant Computing with Unreliable Channels (Extended Version)
Alejandro Naser-Pastoriza, Gregory Chockler, Alexey Gotsman
We study implementations of basic fault-tolerant primitives, such as consensus and registers, in message-passing systems subject to process crashes and a broad range of communicati…
Liveness and Latency of Byzantine State-Machine Replication (Extended Version)
Manuel Bravo, Gregory Chockler, Alexey Gotsman
Byzantine state-machine replication (SMR) ensures the consistency of replicated state in the presence of malicious replicas and lies at the heart of the modern blockchain technolog…
UniStore: A fault-tolerant marriage of causal and strong consistency (extended version)
Manuel Bravo, Alexey Gotsman, Borja de Régil +1
Modern online services rely on data stores that replicate their data across geographically distributed data centers. Providing strong consistency in such data stores results in hig…
Efficient Replication via Timestamp Stability (Extended Version)
Vitor Enes, Carlos Baquero, Alexey Gotsman +1
Modern web applications replicate their data across the globe and require strong consistency guarantees for their most critical data. These guarantees are usually provided via stat…
Making Byzantine Consensus Live (Extended Version)
Manuel Bravo, Gregory Chockler, Alexey Gotsman
Partially synchronous Byzantine consensus protocols typically structure their execution into a sequence of views, each with a designated leader process. The key to guaranteeing liv…
State-Machine Replication for Planet-Scale Systems (Extended Version)
Vitor Enes, Carlos Baquero, Tuanir França Rezende +3
Online applications now routinely replicate their data at multiple sites around the world. In this paper we present Atlas, the first state-machine replication protocol tailored for…
Privatization-Safe Transactional Memories (Extended Version)
Artem Khyzha, Hagit Attiya, Alexey Gotsman
Transactional memory (TM) facilitates the development of concurrent applications by letting the programmer designate certain code blocks as atomic. Programmers using a TM often wou…
Reconfigurable Atomic Transaction Commit (Extended Version)
Manuel Bravo, Alexey Gotsman
Modern data stores achieve scalability by partitioning data into shards and fault-tolerance by replicating each shard across several servers. A key component of such systems is a T…
White-Box Atomic Multicast (Extended Version)
Alexey Gotsman, Anatole Lefort, Gregory Chockler
Atomic multicast is a communication primitive that delivers messages to multiple groups of processes according to some total order, with each group receiving the projection of the…
Federated Byzantine Quorum Systems (Extended Version)
Álvaro García-Pérez, Alexey Gotsman
Some of the recent blockchain proposals, such as Stellar and Ripple, use quorum-like structures typical for Byzantine consensus while allowing for open membership. This is achieved…
Multi-Shot Distributed Transaction Commit (Extended Version)
Gregory Chockler, Alexey Gotsman
Atomic Commit Problem (ACP) is a single-shot agreement problem similar to consensus, meant to model the properties of transaction commit protocols in fault-prone distributed system…
Paxos Consensus, Deconstructed and Abstracted (Extended Version)
Álvaro García-Pérez, Alexey Gotsman, Yuri Meshman +1
Lamport's Paxos algorithm is a classic consensus protocol for state machine replication in environments that admit crash failures. Many versions of Paxos exploit the protocol's int…
Compositional Verification of Compiler Optimisations on Relaxed Memory
Mike Dodds, Mark Batty, Alexey Gotsman
A valid compiler optimisation transforms a block in a program without introducing new observable behaviours to the program as a whole. Deciding which optimisations are valid can be…
Safe Privatization in Transactional Memory
Artem Khyzha, Hagit Attiya, Alexey Gotsman +1
Transactional memory (TM) facilitates the development of concurrent applications by letting the programmer designate certain code blocks as atomic. Programmers using a TM often wou…
Consistency models with global operation sequencing and their composition (extended version)
Alexey Gotsman, Sebastian Burckhardt
Modern distributed systems often achieve availability and scalability by providing consistency guarantees about the data they manage weaker than linearizability. We consider a clas…
Proving Linearizability Using Partial Orders (Extended Version)
Artem Khyzha, Mike Dodds, Alexey Gotsman +1
Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization…
A Generic Logic for Proving Linearizability (Extended Version)
Artem Khyzha, Alexey Gotsman, Matthew Parkinson
Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms, and recent years have seen a number of proposals of program logics for proving…
Linearizability with Ownership Transfer
Alexey Gotsman, Hongseok Yang
Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and its client…