A Separation Logic for Concurrent Randomized Programs

02/08/2018
by   Joseph Tassarotti, et al.
0

We present 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 our logic, we verify a variant of a recent randomized concurrent counter algorithm. All of our results have been mechanized in Coq.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2022

Towards Concurrent Quantitative Separation Logic

In this paper, we develop a novel verification technique to reason about...
research
11/30/2021

SteelCore: An Extensible Concurrent Separation Logic for Effectful Dependently Typed Programs

Much recent research has been devoted to modeling effects within type th...
research
10/31/2019

Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra

Concurrent Kleene Algebra is an elegant tool for equational reasoning ab...
research
07/27/2020

Extending Concurrent Separation Logic to Enhance Modular Formalization

Nowadays, numerous services based on large-scale distributed systems hav...
research
09/22/2017

Subjective Simulation as a Notion of Morphism for Composing Concurrent Resources

Recent approaches to verifying programs in separation logics for concurr...
research
11/01/2019

On the construction of multi-valued concurrent dynamic logic

Dynamic logic is a powerful framework for reasoning about imperative pro...
research
09/19/2022

S2TD: a Separation Logic Verifier that Supports Reasoning of the Absence and Presence of Bugs

Heap-manipulating programs are known to be challenging to reason about. ...

Please sign up or login with your details

Forgot password? Click here to reset