| Date | Paper | Presenter |
|---|---|---|
| March 26 | Formal Verification of Higher-Order Probabilistic Programs (https://dl.acm.org/ft_gateway.cfm?id=3290351) | n/a |
| April 2 1:30pm | Definitional Proof-Irrelevance without K (https://dl.acm.org/ft_gateway.cfm?id=3290316) | Alex |
| April 9 | Pretend Synchrony (https://dl.acm.org/ft_gateway.cfm?id=3290372) | Robin |
| April 16 1:30pm | A Domain Theory for Statistical Probabilistic Programming (https://dl.acm.org/ft_gateway.cfm?id=3290349) | Nathan |
| April 23 1:30pm | On Testing of Uniform Samplers (https://www.aaai.org/Papers/AAAI/2019/AAAI-ChakrabortySourav.652.pdf) | David |
| May 8 1:30pm | An Abstract Domain for Certifying Neural Networks (https://dl.acm.org/ft_gateway.cfm?id=3290354) | Tim |
QBS paper: A Convenient Category for Higher-Order Probability Theory.
- A Separation Logic for Concurrent Randomized Programs
- Based on / extends the idea of coupling.
- Compiling Markov chain Monte Carlo algorithms for probabilistic modeling
- PLDI'17 (Did we already read this paper?)