Model Checking of Consensus Algorit

@article{Tsuchiya2007ModelCO,
  title={Model Checking of Consensus Algorit},
  author={Tatsuhiro Tsuchiya and Andr{\'e} Schiper},
  journal={2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)},
  year={2007},
  pages={137-148}
}
We show for the first time that standard model checking allows one to completely verify asynchronous algorithms for solving consensus, a fundamental problem in fault-tolerant distributed computing. Model checking is a powerful verification methodology based on state exploration. However it has rarely been applied to consensus algorithms, because these algorithms induce huge, often infinite state spaces. Here we focus on consensus algorithms based on the Heard-Of model, a new computation model… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

Model Checking Round-Based Distributed Algorithms

2010 15th IEEE International Conference on Engineering of Complex Computer Systems • 2010
View 9 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Automatic Verification and Discovery of Byzantine Consensus Protocols

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) • 2007
View 3 Excerpts
Highly Influenced

An Automatic Real-Time Analysis of the Time to Reach Consensus

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) • 2007
View 1 Excerpt

Communication Predicates: A High-Level Abstraction for Coping with Transient and Dynamic Faults

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) • 2007
View 3 Excerpts

Fast Paxos

Distributed Computing • 2006
View 3 Excerpts

From set membership to group membership: a separation of concerns

IEEE Transactions on Dependable and Secure Computing • 2006
View 1 Excerpt

Similar Papers

Loading similar papers…