A separation logic for concurrent randomized programs

We present Polaris, a concurrent separation logic with support for probabilistic reasoning. As part of our logic, we extend the idea of coupling, which underlies recent work on probabilistic relational logics, to the setting of programs with both probabilistic and non-deterministic choice. To demons...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of ACM on programming languages Ročník 3; číslo POPL; s. 1 - 30
Hlavní autori: Tassarotti, Joseph, Harper, Robert
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY, USA ACM 02.01.2019
Predmet:
Logic
Program reasoning
Program verification
Semantics and reasoning
Separation logic
Theory of computation
probability
separation logic
concurrency
ISSN:2475-1421, 2475-1421
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We present Polaris, a concurrent separation logic with support for probabilistic reasoning. As part of our logic, we extend the idea of coupling, which underlies recent work on probabilistic relational logics, to the setting of programs with both probabilistic and non-deterministic choice. To demonstrate Polaris, we verify a variant of a randomized concurrent counter algorithm and a two-level concurrent skip list. All of our results have been mechanized in Coq.
ISSN:2475-1421
2475-1421
DOI:10.1145/3290377