43 citations · 57 across the 5 of their papers we have counts for
5 papers
What's Live? Understanding Distributed Consensus
Saksham Chand, Yanhong A Liu
Distributed consensus algorithms such as Paxos have been studied extensively. They all use the same definition of safety. Liveness is especially important in practice despite well-…
High-level Cryptographic Abstractions
Christopher Kane, Bo Lin, Saksham Chand +2
The interfaces exposed by commonly used cryptographic libraries are clumsy, complicated, and assume an understanding of cryptographic algorithms. The challenge is to design high-le…
Simpler Specifications and Easier Proofs of Distributed Algorithms Using History Variables
Saksham Chand, Yanhong A. Liu
This paper studies specifications and proofs of distributed algorithms when only message history variables are used, using the Basic Paxos and Multi-Paxos algorithms for distribute…
Moderately Complex Paxos Made Simple: High-Level Executable Specification of Distributed Algorithms
Yanhong A. Liu, Saksham Chand, Scott D. Stoller
This paper describes the application of a high-level language and method in developing simpler specifications of more complex variants of the Paxos algorithm for distributed consen…
Formal Verification of Multi-Paxos for Distributed Consensus
Saksham Chand, Yanhong A. Liu, Scott D. Stoller
Paxos is an important algorithm for a set of distributed processes to agree on a single value or a sequence of values, for which it is called Basic Paxos or Multi-Paxos, respective…