Towards Concurrent Quantitative Separation Logic

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.