
This artifact contains an Isabelle/HOL formalisation of an extension of Probabilistic Separation Logic and its soundness proof corresponding to Section 3.2, Section 4, and Appendix A of the paper "Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms". We have tested it with Isabelle2022 on Windows and MacOS. We also provide a Linux VM including all the codes and dependency.
Formal method, Probabilistic Algorithms
Formal method, Probabilistic Algorithms
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
