paperbot · PL 论文追踪

全部论文 待读 收藏

P2 CRDT Emulation, Simulation, and Representation Independence

CRDT 仿真、模拟与表示独立性
ICFP 9(ICFP)2025匹配度 1/10 · 论文研究 CRDT 仿真的形式化、弱模拟与表示独立性,属于分布式系统/形式语义方向;与用户关注的静态分析、LLM/Agent、浮点程序分析、贝叶斯程序分析及其交叉均无直接关系。虽然涉及形式化验证,但未涉及 LLM/Agent 改进验证或程序分析。引用 0 inbox
Nathan Liittschwager, Jonathan Castello, Stelios Tsampas, Lindsey Kuper
crossref: 2026-09-10

AI 速览

一句话:将 CRDT 仿真形式化为迁移系统间的弱模拟,刻画保持的性质并证明表示独立性。

状态基与操作基 CRDT 在文献中常被视为等价,因为存在让二者互相仿真的算法,但“互相仿真”从未被精确定义。二者对网络消息的因果投递顺序和消息粒度要求不同,使仿真并非显然。本文把 CRDT 及其与网络的交互建模为迁移系统,用弱模拟关系精确形式化 CRDT 仿真,并证明仿真可理解为原 CRDT 系统与仿真系统之间的弱模拟。作者进一步刻画弱模拟所保持的性质,从而说明哪些性质可由仿真算法保持。最后,利用该仿真结果证明 CRDT 的一般表示独立性:客户端无法区分自己交互的是状态基还是操作基 CRDT。

问题
状态基与操作基 CRDT 常因可互相仿真而被视为等价,但相互仿真的含义未被精确形式化;二者对网络因果序与消息粒度要求不同,使仿真非平凡。
方法
将 CRDT 及其与网络的交互建模为迁移系统,用弱模拟关系刻画 CRDT 仿真,并分析该弱模拟所保持的性质。
评估
通过形式化定义与证明给出一般性结论,而非实现或实验评估:证明弱模拟保持特定性质,并由此导出 CRDT 的表示独立性。
原文摘要(Abstract)

Conflict-free replicated data types (CRDTs) are distributed data structures designed for fault tolerance and high availability. CRDTs have historically been taxonomized into state-based CRDTs, in which replicas apply updates locally and periodically broadcast their state to other replicas over the network, and operation-based (or op-based ) CRDTs, in which every state-updating operation is individually broadcast. In the literature, state-based and op-based CRDTs are considered equivalent due to the existence of algorithms that let them emulate each other, and verification techniques and results that apply to one kind of CRDT are said to apply to the other thanks to this equivalence. However, what it means for state-based and op-based CRDTs to emulate each other has never been made fully precise. Emulation is nontrivial since state-based and op-based CRDTs place different requirements on the underlying network with regard to both the causal ordering of message delivery, and the granularity of the messages themselves. We specify and formalize CRDT emulation in terms of simulation by modeling CRDTs and their interactions with the network as transition systems. We show that emulation can be understood as weak simulations between the transition systems of the original and emulating CRDT systems, thus closing a gap in the CRDT literature. We precisely characterize which properties of CRDT systems are preserved by our weak simulations, and therefore which properties can be said to be preserved by emulation algorithms. Finally, we leverage our emulation results to obtain a general representation independence result for CRDTs: intuitively, clients of a CRDT cannot tell whether they are interacting with a state-based or op-based CRDT in particular.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@article{paperbot3033,
  title = {CRDT Emulation, Simulation, and Representation Independence},
  author = {Nathan Liittschwager and Jonathan Castello and Stelios Tsampas and Lindsey Kuper},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {9},
  number = {ICFP},
  year = {2025},
  doi = {10.1145/3747528}
}