YoVDO

A Proof Recipe for Linearizability in Relaxed Memory Separation Logic

Offered By: ACM SIGPLAN via YouTube

Tags

Concurrent Programming Courses Coq Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking 19-minute video presentation from PLDI 2024 that introduces a novel proof recipe for linearizability in relaxed memory separation logic. Delve into the challenges of verifying concurrent objects under relaxed memory consistency and discover how the proposed object modification order (OMO) concept addresses event reordering and view transfer tracking. Learn about the innovative commit-with relation that enables proof reuse in concurrent libraries. Witness the first-time verification of linearizability for the Michael–Scott queue, elimination stack, and Folly's MPMC queue in relaxed memory consistency, as well as stronger specifications for spinlocks and atomic reference counting. Access the accompanying article and supplementary archive for a comprehensive understanding of this significant advancement in concurrent separation logic.

Syllabus

[PLDI24] A Proof Recipe for Linearizability in Relaxed Memory Separation Logic


Taught by

ACM SIGPLAN

Related Courses

Pattern-Oriented Software Architectures: Programming Mobile Services for Android Handheld Systems
Vanderbilt University via Coursera
Paradigms of Computer Programming
Université catholique de Louvain via edX
Introduction to Operating Systems
Georgia Institute of Technology via Udacity
Programming Mobile Services for Android Handheld Systems: Content
Vanderbilt University via Coursera
Advanced Software Construction in Java
Massachusetts Institute of Technology via edX