Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing

We introduce a linear concurrent separation logic, called LinearActris, designed to guarantee deadlock and leak freedom for message-passing concurrency. LinearActris combines the strengths of session types and concurrent separation logic, allowing for the verification of challenging higher-order pro...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of ACM on programming languages Ročník 8; číslo POPL; s. 1385 - 1417
Hlavní autoři: Jacobs, Jules, Hinrichsen, Jonas Kastberg, Krebbers, Robbert
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 02.01.2024
Témata:
Program verification
Programming logic
Separation logic
Theory of computation
Iris
session types
Message passing
Coq
deadlocks
separation logic
ISSN:2475-1421, 2475-1421
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We introduce a linear concurrent separation logic, called LinearActris, designed to guarantee deadlock and leak freedom for message-passing concurrency. LinearActris combines the strengths of session types and concurrent separation logic, allowing for the verification of challenging higher-order programs with mutable state through dependent protocols. The key challenge is to prove the adequacy theorem of LinearActris, which says that the logic indeed gives deadlock and leak freedom “for free” from linearity. We prove this theorem by defining a step-indexed model of separation logic, based on connectivity graphs. To demonstrate the expressive power of LinearActris, we prove soundness of a higher-order (GV-style) session type system using the technique of logical relations. All our results and examples have been mechanized in Coq.
ISSN:2475-1421
2475-1421
DOI:10.1145/3632889