1. Sheshansh Agrawal, Krishnendu Chatterjee, and Petr Novotný. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. Proc. ACM Program. Lang., 2, POPL (2018).
2. A pre-expectation calculus for probabilistic sensitivity
3. Alejandro Aguirre Gilles Barthe Justin Hsu and Alexandra Silva. 2018. Almost Sure Productivity. In ICALP.
4. Synthesizing coupling proofs of differential privacy
5. Ali Asadi, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, and Mohammad Mahdavi. 2021. Polynomial reachability witnesses via Stellensätze. In PLDI.