A Revised and Verified Proof of the Scalable Commutativity Rule
Lillian Tsai, Eddie Kohler, M. Frans Kaashoek, and Nickolai Zeldovich
TL;DR
This paper identifies a flaw in the original proof of the Scalable Commutativity Rule, provides a revised and formally verified proof using Coq, and discusses insights and open questions from this process.
Contribution
It offers a corrected, formally verified proof of the SCR, addressing previous flaws and enhancing the rigor of the original proof.
Findings
The original SCR proof contained a flaw.
A revised proof was successfully formalized in Coq.
The process revealed new insights and open questions.
Abstract
This paper explains a flaw in the published proof of the Scalable Commutativity Rule (SCR), presents a revised and formally verified proof of the SCR in the Coq proof assistant, and discusses the insights and open questions raised from our experience proving the SCR.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Logic, programming, and type systems · Parallel Computing and Optimization Techniques