Pengbo Yan
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Toby Murrayonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Proving Obliviousness of Probabilistic Algorithms with Formal Verification | SPLASH 2022 Doctoral Symposium | 2022-12-06 |
Claims a practical extension to PSL that supports random-loop conditions and dynamic random choice so probabilistic obliviousness can be proved for algorithms… | ||
| SecRSL: Security Separation Logic for C11 Release-Acquire Concurrency | OOPSLA 2021 | 2021-10-17 |
SecRSL is a separation logic that proves information-flow security for C11’s Release-Acquire fragment under an axiomatic memory model and is mechanized in Coq… | ||
| nothing matches | ||