Towards Concurrent Quantitative Separation Logic

07/06/2022
by   Ira Fesefeldt, et al.
0

In this paper, we develop a novel verification technique to reason about programs featuring concurrency, pointers and randomization. While the integration of concurrency and pointers is well studied, little is known about the combination of all three paradigms. To close this gap, we combine two kinds of separation logic – Quantitative Separation Logic and Concurrent Separation Logic – into a new separation logic that enables reasoning about lower bounds of the probability to realise a postcondition by executing such a program.

READ FULL TEXT

page 1

page 3

page 5

page 9

page 13

page 15

page 17

page 35

research
02/08/2018

A Separation Logic for Concurrent Randomized Programs

We present a concurrent separation logic with support for probabilistic ...
research
02/28/2018

Quantitative Separation Logic

We present quantitative separation logic (QSL). In contrast to classical...
research
10/06/2017

A Game Semantics of Concurrent Separation Logic

In this paper, we develop a game-theoretic account of concurrent separat...
research
02/14/2022

Quantitative Strongest Post

We present a novel strongest-postcondition-style calculus for quantitati...
research
09/09/2023

Leaf: Modularity for Temporary Sharing in Separation Logic (Extended Version)

In concurrent verification, separation logic provides a strong story for...
research
09/16/2023

Dynamic Separation Logic

This paper introduces a dynamic logic extension of separation logic. The...
research
08/19/2020

Formalizing and Verifying Decentralized Systems with Extended Concurrent Separation Logic

Decentralized techniques are becoming crucial and ubiquitous with the ra...

Please sign up or login with your details

Forgot password? Click here to reset