.png){kind=icon}
返回
Checking causal consistency of distributed databases
.png){kind=icon}
OA
AI
DOI：10.1007/s00607-021-00911-3.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The CAP Theorem shows that (strong) consistency, availability, and partition tolerance are impossible to be ensured together. Causal consistency is one of the weak consistency models that can be implemented to ensure availability and partition tolerance in distributed systems. In this work, we propose a tool to check automatically the conformance of distributed/concurrent systems executions to causal consistency models. Our approach consists in reducing the problem of checking if an execution is causally consistent to solving datalog queries. The reduction is based on complete characterizations of the executions violating causal consistency in terms of the existence of cycles in suitably defined relations between the operations occurring in these executions. We have implemented the reduction in a testing tool for distributed databases, and carried out several experiments on real case studies, showing the efficiency of the suggested approach.
Keyword:
Causal consistency
Causal memory
Causal convergence
Distributed databases
Formal verification
Testing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
引用论文
Racial/ethnic disparities in sleep health and health care: Importance of the sociocultural context..png)
IF0
PREAI
分享收藏
查看更多内容