Tolerating corrupted communication
From MaRDI portal
Publication:5401417
DOI10.1145/1281100.1281136zbMath1283.68079OpenAlexW1966009626MaRDI QIDQ5401417
Martin Biely, Bernadette Charron-Bost, Antoine Gaillard, Josef Widder, Martin Hutle, André Schiper
Publication date: 13 March 2014
Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/124883
Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (13)
The Heard-Of model: computing in distributed systems with benign faults ⋮ Cardinality constraints for arrays (decidability results and applications) ⋮ Bosco: One-Step Byzantine Asynchronous Consensus ⋮ On the impact of link faults on Byzantine agreement ⋮ Randomization can be a healer: consensus with dynamic omission failures ⋮ Reachability in Parameterized Systems: All Flavors of Threshold Automata ⋮ Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Consensus when all processes may be Byzantine for some time ⋮ Synchronous consensus under hybrid process and link failures ⋮ Higher-order quantifier elimination, counter simulations and fault-tolerant systems ⋮ Counting Constraints in Flat Array Fragments ⋮ Characterizing Consensus in the Heard-Of Model ⋮ Making Byzantine consensus live
This page was built for publication: Tolerating corrupted communication
