<--- Back to Details
First PageDocument Content
Logic in computer science / Fault-tolerant computer systems / Distributed algorithms / Mathematical induction / Raft / Formal verification / Consensus / Leader election / Mathematical proof / Paxos / Intuitionistic logic
Date: 2016-01-04 17:45:16
Logic in computer science
Fault-tolerant computer systems
Distributed algorithms
Mathematical induction
Raft
Formal verification
Consensus
Leader election
Mathematical proof
Paxos
Intuitionistic logic

Planning for Change in a Formal Verification of the Raft Consensus Protocol Doug Woos Zachary Tatlock James R. Wilcox

Add to Reading List

Source URL: homes.cs.washington.edu

Download Document from Source Website

File Size: 208,59 KB

Share Document on Facebook

Similar Documents

Quantum Leader Election S. Tani, H. Kobayashi, K. Matsumoto, Y. Okubo, X,-B. Wang, Y.-K. Jiang, A. Tomita LNCS3404, ); arXiv:; PRA77, Quantum Leader Election

Quantum Leader Election S. Tani, H. Kobayashi, K. Matsumoto, Y. Okubo, X,-B. Wang, Y.-K. Jiang, A. Tomita LNCS3404, ); arXiv:; PRA77, Quantum Leader Election

DocID: 1ufoL - View Document

Gathering Asynchronous Oblivious Mobile Robots in a Ring Ralf Klasing1 , Euripides Markou2,? , and Andrzej Pelc3,?? 1  2

Gathering Asynchronous Oblivious Mobile Robots in a Ring Ralf Klasing1 , Euripides Markou2,? , and Andrzej Pelc3,?? 1 2

DocID: 1r6G6 - View Document

On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: +

On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: +

DocID: 1r62H - View Document

The Cost of Unknown Diameter in Dynamic Networks Haifeng Yu Yuda Zhao

The Cost of Unknown Diameter in Dynamic Networks Haifeng Yu Yuda Zhao

DocID: 1qVmW - View Document

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗  Christoph Lenzen

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

DocID: 1qUdZ - View Document