YoVDO

Modular Verification of Op-Based CRDTs in Separation Logic

Offered By: ACM SIGPLAN via YouTube

Tags

Distributed Systems Courses Concurrency Courses Coq Courses Conflict-Free Replicated Data Types Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 15-minute conference talk from ACM SIGPLAN's OOPSLA that delves into a framework for verifying safety properties of Operation-based Conflict-free Replicated Data Types (op-based CRDTs) using separation logic. Learn about the two-library framework, consisting of a Reliable Causal Broadcast (RCB) protocol and an "OpLib" library, which simplifies the creation and correctness proofs of op-based CRDTs. Discover how this approach allows for implementing new CRDTs as purely-functional data structures without the need to reason about network operations, concurrency control, and mutable state. Gain insights into the implementation of 12 example CRDTs from literature, including replicated registers, sets, CRDT combinators, and use cases of the map combinator. Understand the significance of this technique as the first modular verification approach for op-based CRDTs targeting executable implementations, with proofs conducted in the Aneris distributed separation logic and formalized in Coq.

Syllabus

[OOPSLA] Modular Verification of Op-Based CRDTs in Separation Logic


Taught by

ACM SIGPLAN

Related Courses

Verifying the LLVM
Strange Loop Conference via YouTube
Beweisbar sichere Software
media.ccc.de via YouTube
RustBelt: A Quick Dive Into the Abyss - Formalizing Rust's Safety Story
Rust via YouTube
Building Measure Theory Using Hierarchy Builder
Hausdorff Center for Mathematics via YouTube
Using Formal Methods to Eliminate Exploitable Bugs - YOW! 2015
GOTO Conferences via YouTube