Revisiting Safety and Liveness in the Context of Failures

Authors:
Bernadette Charron-Bost;Sam Toueg;Anindya Basu
Affiliations:
-;-;-
Venue:
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Year:
2000

Citing 8
Cited 1

On the minimal synchronism needed for distributed consensus

Journal of the ACM (JACM)
Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Automatically increasing the fault-tolerance of distributed algorithms

Journal of Algorithms
The weakest failure detector for solving consensus

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Distributed computing: fundamentals, simulations and advanced topics

Distributed computing: fundamentals, simulations and advanced topics
Distributed Algorithms

Distributed Algorithms
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Robustness in Interaction Systems

FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Safety and liveness are two fundamental concepts for proving the correctness of concurrent programs. In the context of failures, however, we observe that some properties that are commonly believed to be safety properties are actually liveness properties. In this paper, we propose refinements of the concepts of safety and liveness that avoid this counterintuitive classification.