18 citations · 25 across the 7 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2021★ 18 cited
A Separation Logic for Negative Dependence
Jialu Bao, Marco Gaboardi, Justin Hsu +1
Formal reasoning about hashing-based probabilistic data structures often requires reasoning about random variables where when one variable gets larger (such as the number of elemen…
cs.PL2021★ 2 cited
Data-Driven Invariant Learning for Probabilistic Programs
Jialu Bao, Nitesh Trivedi, Drashti Pathak +2
Morgan and McIver's weakest pre-expectation framework is one of the most well-established methods for deductive verification of probabilistic programs. Roughly, the idea is to gene…