  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.
