Foundations for Entailment Checking in Quantitative Separation Logic (extended version)
Abstract
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 \SL, one of the key problems when reasoning with QSL is \emph{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 7
-
Affiliation as printed
Software Modeling and Verification Group , RWTH Aachen University , Germany
-
Affiliation as printed
Software Modeling and Verification Group , RWTH Aachen University , Germany
-
Affiliation as printed
Software Modeling and Verification Group , RWTH Aachen University , Germany
-
Affiliation as printed
Software Modeling and Verification Group , RWTH Aachen University , Germany
-
Affiliation as printed
Software Modeling and Verification Group , RWTH Aachen University , Germany
-
ETH Zurich · Technical University of Denmark
Affiliation as printed
Programming Methodology Group , ETH Zürich , Switzerland
Technical University of Denmark ,
-
Affiliation as printed
Software Modeling and Verification Group , RWTH Aachen University , Germany
Cited by 0 stored of 0
No patents citing this paper on Lens.org (checked 2026-10-06).