Showing cs.PLShow all
2 papers · 1 filter
cs.PL2024
Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms (Extended Version)
Pengbo Yan, Toby Murray, Olga Ohrimenko +2
We consider the problem of how to verify the security of probabilistic oblivious algorithms formally and systematically. Unfortunately, prior program logics fail to support a numbe…
cs.PL2021
Compositional Vulnerability Detection with Insecurity Separation Logic (Extended Version)
Toby Murray, Pengbo Yan, Gidon Ernst
Memory-safety issues and information leakage are known to be depressingly common. We consider the compositional static detection of these kinds of vulnerabilities in first-order C-…