DeepAI AI Chat
Log In Sign Up

A Separation Logic for Concurrent Randomized Programs

by   Joseph Tassarotti, et al.

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.


page 1

page 2

page 3

page 4


Towards Concurrent Quantitative Separation Logic

In this paper, we develop a novel verification technique to reason about...

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

Much recent research has been devoted to modeling effects within type th...

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

Concurrent Kleene Algebra is an elegant tool for equational reasoning ab...

A Concurrent Program Logic with a Future and History

Verifying fine-grained optimistic concurrent programs remains an open pr...

Extending Concurrent Separation Logic to Enhance Modular Formalization

Nowadays, numerous services based on large-scale distributed systems hav...

Subjective Simulation as a Notion of Morphism for Composing Concurrent Resources

Recent approaches to verifying programs in separation logics for concurr...

On the construction of multi-valued concurrent dynamic logic

Dynamic logic is a powerful framework for reasoning about imperative pro...