YoVDO

DisLog: A Separation Logic for Disentanglement

Offered By: ACM SIGPLAN via YouTube

Tags

Formal Verification Courses Parallel Programming Courses Memory Management Courses Concurrent Programming Courses Coq Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 17-minute conference talk from POPL 2024 introducing DisLog, a novel separation logic for verifying disentanglement in parallel programs. Delve into the first static approach for ensuring memory access patterns are disentangled, facilitating task-local reasoning and enabling high-performance parallel memory management. Discover how DisLog enriches concurrent separation logic with fork-join reasoning, and learn about DisLog+, a simplified version for programs that are disentangled by construction. Examine case studies, including parallel deduplication implementations, to see practical applications of these logics. Gain insights into the mechanization of results using the Coq proof assistant and Iris, and understand the implications for optimizing parallel program performance and correctness.

Syllabus

[POPL'24] DisLog: A Separation Logic for Disentanglement


Taught by

ACM SIGPLAN

Related Courses

SPARK 2014
AdaCore via Independent
Automated Reasoning: Symbolic Model Checking
EIT Digital via Coursera
Software Testing and Verification
University System of Maryland via edX
Haskell for Imperative Programmers
YouTube
Model Checking and Temporal Logic - E. Allen Emerson's Turing Award Lecture
Association for Computing Machinery (ACM) via YouTube