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...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of ACM on programming languages Vol. 3; no. POPL; pp. 1 - 30
Main Authors: Tassarotti, Joseph, Harper, Robert
Format: Journal Article
Language:English
Published: New York, NY, USA ACM 02.01.2019
Subjects:
Logic
Program reasoning
Program verification
Semantics and reasoning
Separation logic
Theory of computation
probability
separation logic
concurrency
ISSN:2475-1421, 2475-1421
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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