YoVDO

Optimal Reads-From Consistency Checking for C11-Style Memory Models

Offered By: ACM SIGPLAN via YouTube

Tags

Concurrency Courses Algorithm Design Courses Complexity Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 15-minute video presentation from the PLDI 2023 conference that delves into the complexity of consistency checking for C11-style memory models. Learn about the researchers' study on reads-from consistency checking for popular variants of the C11 memory model, including RC20, release-acquire (RA), strong and weak RA, and the Relaxed fragment of RC20. Discover the rich complexity landscape drawn by the team, including nearly-linear-time algorithms for certain variants, fine-grained optimality results, and matching upper and lower bounds for others. Understand how this work characterizes the complexity of consistency checking for C11 memory models and its implications for applications in testing and model checking. Gain insights into the implementation of these algorithms in the TruSt model checker and C11Tester testing tool, and their performance improvements on standard benchmarks.

Syllabus

[PLDI'23] Optimal Reads-From Consistency Checking for C11-Style Memory Models


Taught by

ACM SIGPLAN

Related Courses

Natural Language Processing
Columbia University via Coursera
Intro to Algorithms
Udacity
Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera
Paradigms of Computer Programming
Université catholique de Louvain via edX
Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX