Name
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 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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-99336-8_3 | PROGRAMMING LANGUAGES AND SYSTEMS, ESOP 2022 |
DocType | Volume | ISSN |
Conference | 13240 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kevin Batz | 1 | 2 | 2.39 |
| Ira Fesefeldt | 2 | 0 | 0.34 |
| Marvin Jansen | 3 | 0 | 0.34 |
| Joost-Pieter Katoen | 4 | 7 | 4.45 |
| Florian Kessler | 5 | 0 | 0.34 |
| Christoph Matheja | 6 | 0 | 0.34 |
| Thomas Noll | 7 | 326 | 27.79 |