A. Doudou, B. Garbinato, R. Guerraoui, and A. Schiper. Muteness failure detectors: Specication and implementation. In European Dependable Computing Conference, pages 71-87, 1999. 21 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Polynomial Time Synthesis of Byzantine Agreement - Kulkarni, Arora, Chippada (Correct)
....choice then the fault tolerant program will be synthesized in polynomial time. We demonstrate the applicability of our heuristics in synthesizing the byzantine agreement program [2] The byzantine agreement problem has been recognized as an important but dicult problem in the literature (e.g. [3, 4]) However, due to the inherent diculties in the agreement problem and the diculties in characterizing byzantine faults during the synthesis algorithm, previous synthesis algorithms have not been able to automate the design of byzantine agreement. To deal with these diculties, we introduce ....
A. Doudou, B. Garbinato, R. Guerraoui, and A. Schiper. Muteness failure detectors: Specication and implementation. In European Dependable Computing Conference, pages 71-87, 1999. 21
Random Oracles in Constantinople: Practical Asynchronous.. - Cachin, Kursawe, Shoup (2000) (31 citations) (Correct)
....Reiter s protocol ensures correctness only as long as the network is suitably well behaved it is easily defeated by an adversary that completely controls network scheduling. Indeed, it has been recognized that extending the modular failure detector approach to the Byzantine model is dicult (e.g. [20]) Reiter s work [34] and related work, seems to be motivated by the fact that probabilistic agreement protocols have a reputation for being impractical. However, it is not at all clear if this reputation is well justi ed we know of no empirical, comparative studies in the literature. Much of the ....
A. Doudou, B. Garbinato, R. Guerraoui, and A. Schiper. Muteness failure detectors: Specication and implementation. In J. Hlavicka, E. Maehle, and A. Pataricza, editors, Proc. 3rd European Dependable Computing Conference (EDCC-3), volume 1667 of Lecture Notes in Computer Science, pages 71-87. Springer, 1999.
Random Oracles in Constantinople: Practical Asynchronous.. - Cachin, Kursawe, Shoup (2000) (31 citations) (Correct)
....Reiter s protocol ensures correctness only as long as the network is suitably well behaved it is easily defeated by an adversary that completely controls network scheduling. Indeed, it has been recognized that extending the modular failure detector approach to the Byzantine model is dicult (e.g. [DGGS99]) The work of [Rei96] and related work, seems to be motivated by the fact that probabilistic agreement protocols have a reputation for being impractical. However, it is not at all clear if this reputation is well justi ed we know of no empirical, comparative studies in the literature. Much of ....
A. Doudou, B. Garbinato, R. Guerraoui, and A. Schiper, Muteness failure detectors: Specication and implementation, Proc. 3rd European Dependable Computing Conference (EDCC-3) (J. Hlavicka, E. Maehle, and A. Pataricza, eds.), Lecture Notes in Computer Science, vol. 1667, Springer, 1999, pp. 71-87.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC