# Foundations for Entailment Checking in Quantitative Separation Logic (extended version)

Quantitative separation logic (QSL) is an extension of separation logic (SL) for the verification of probabilistic pointer programs. In QSL, formulae evaluate to real numbers instead of truth values, e.g., the probability of memory-safe termination in a given symbolic heap. As with , one of the key problems when reasoning with QSL is entailment: does a formula f entail another formula g? We give a generic reduction from entailment checking in QSL to entailment checking in SL. This allows to leverage the large body of SL research for the automated verification of probabilistic pointer programs. We analyze the complexity of our approach and demonstrate its applicability. In particular, we obtain the first decidability results for the verification of such programs by applying our reduction to a quantitative extension of the well-known symbolic-heap fragment of separation logic.

## Authors

• 9 publications
• 1 publication
• 1 publication
• 56 publications
• 1 publication
• 10 publications
• 3 publications
02/28/2018

### Quantitative Separation Logic

We present quantitative separation logic (QSL). In contrast to classical...
04/26/2022

### On an Invariance Problem for Parameterized Concurrent Systems

We consider concurrent systems consisting of replicated finite-state pro...
04/16/2020

### Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard

The entailment between separation logic formulae with inductive predicat...
06/19/2022

### Two Results on Separation Logic With Theory Reasoning

Two results are presented concerning the entailment problem in Separatio...
02/16/2018

### Decidability for Entailments of Symbolic Heaps with Arrays

This paper presents two decidability results on the validity checking pr...
01/23/2013

### Hybrid Probabilistic Programs: Algorithms and Complexity

Hybrid Probabilistic Programs (HPPs) are logic programs that allow the p...
12/28/2020

### Unifying Decidable Entailments in Separation Logic with Inductive Definitions

The entailment problem φψ in Separation Logic <cit.>, between separated ...
##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.