Formal Verification of Consensus Algorithms Tolerating Malicious Faults
暂无分享,去创建一个
Stephan Merz | Bernadette Charron-Bost | Henri Debrat | Stephan Merz | Bernadette Charron-Bost | Henri Debrat
[1] Doron A. Peled,et al. Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator , 1997, Inf. Process. Lett..
[2] Stephan Merz,et al. Proving the Correctness of Disk Paxos , 2005, Arch. Formal Proofs.
[3] Ulrich Schmid,et al. Formally verified Byzantine agreement in presence of link faults , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.
[4] Danny Dolev,et al. Shifting gears: changing algorithms on the fly to expedite Byzantine agreement , 1987, PODC '87.
[5] Tatsuhiro Tsuchiya,et al. Model Checking of Consensus Algorit , 2007, 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007).
[6] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[7] Wim H. Hesselink,et al. The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract , 1999, Formal Aspects of Computing.
[8] Tobias Nipkow,et al. A Proof Assistant for Higher-Order Logic , 2002 .
[9] Stephan Merz,et al. Formal Verification of a Consensus Algorithm in the Heard-Of Model , 2009, Int. J. Softw. Informatics.
[10] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[11] Nancy A. Lynch,et al. Automated implementation of complex distributed algorithms specified in the IOA language , 2009, International Journal on Software Tools for Technology Transfer.
[12] Leslie Lamport,et al. What Good is Temporal Logic? , 1983, IFIP Congress.
[13] Tatsuhiro Tsuchiya,et al. Using Bounded Model Checking to Verify Consensus Algorithms , 2008, DISC.
[14] Lawrence Charles Paulson,et al. Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .
[15] Tatsuhiro Tsuchiya,et al. Model Checking of Consensus Algorithms , 2007 .
[16] Stephan Merz,et al. Specifying and Verifying Fault-Tolerant Systems , 1994, FTRTFT.
[17] André Schiper,et al. The Heard-Of model: computing in distributed systems with benign faults , 2009, Distributed Computing.
[18] Nissim Francez,et al. Decomposition of Distributed Programs into Communication-Closed Layers , 1982, Sci. Comput. Program..
[19] André Schiper,et al. Tolerating corrupted communication , 2007, PODC '07.
[20] Stephan Merz,et al. A Reduction Theorem for the Verification of Round-Based Distributed Algorithms , 2009, RP.
[21] Leslie Lamport,et al. Byzantizing Paxos by Refinement , 2011, DISC.
[22] Joost-Pieter Katoen,et al. A probabilistic extension of UML statecharts: Specification and Verification. , 2002 .
[23] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.