Safety-liveness exclusion in distributed computing

DOI10.1145/2767386.2767401MaRDI QIDQ2796260zbMATH OpenOpenAlexFDO

Authors Victor Bushkov, Rachid Guerraoui

Publication date 23 March 2016

Published in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2767386.2767401

zbMATH Keywords

consensusconcurrencyimpossibility resultssafetylivenesstransactional memory

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)

Recommendations

• Local safety and local liveness for distributed systems
• Ensuring liveness properties of distributed systems: open problems
• On the refinement of liveness properties of distributed systems
• A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
• Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms
• Proving the safety of highly-available distributed objects
• Safe ambients: Abstract machine and distributed implementation
• Safety and Liveness in Concurrent Pointer Programs

Cites work

• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• Memorization and Association on a Realistic Neural Model

Cited in

(6)

• scientific article; zbMATH DE number 1759635 (Why is no real title available?)
• Safe ambients: Abstract machine and distributed implementation
• A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
• On the refinement of liveness properties of distributed systems
• The computational structure of progress conditions and shared objects
• Progress-space tradeoffs in single-writer memory implementations

This page was built for publication: Safety-liveness exclusion in distributed computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796260)