'Cause I'm strong enough: reasoning about consistency choices in distributed systems

DOI10.1145/2837614.2837625zbMATH Open1347.68029OpenAlexW2282477915MaRDI QIDQ2828282FDOQ2828282

Authors: Alexey Gotsman, Hongseok Yang, Carla Ferreira, Mahsa Najafzadeh, Marc Shapiro 

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

Recommendations

• Checking causal consistency of distributed databases
• scientific article; zbMATH DE number 7327945
• Robustness against consistency models with atomic visibility
• Replicated data types, specification, verification, optimality
• Chapar: certified causally consistent distributed key-value stores

zbMATH Keywords

replicationcausal consistencyintegrity invariants

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Database theory (68P15) Distributed systems (68M14) Semantics in the theory of computing (68Q55)

Cited In (8)

• Automated detection of serializability violations under weak consistency
• Proving the safety of highly-available distributed objects
• Chapar: certified causally consistent distributed key-value stores
• Checking robustness between weak transactional consistency models
• Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs
• Checking causal consistency of distributed databases
• Title not available (Why is that?)
• Robustness Against Transactional Causal Consistency.

This page was built for publication: 'Cause I'm strong enough: reasoning about consistency choices in distributed systems

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