29:06 [Doctoral Symposium] Formally Verified Resource Bounds through Implicit Computational Complexity ACM SIGPLAN
27:52 [Doctoral Symposium] Proving Obliviousness of Probabilistic Algorithms with Formal Verification ACM SIGPLAN