Home

I’m Kwing Hei Li, or simply Heili. I can run down stairs really fast.

Click HERE for more info about me.

Preprints

• Contextual Refinement of Higher-Order Concurrent Probabilistic Programs
  K. H. Li, A. Aguirre, J. Tassarotti, L. Birkedal
  (arXiv)

Publications

• Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs
  K. H. Li, A. Aguirre, S. O. Gregersen, P. G. Haselwarter, J. Tassarotti, L. Birkedal
  International Conference on Functional Programming 2025
  (PDF)

• Approximate Relational Reasoning for Higher-Order Probabilistic Programs
  P. G. Haselwarter, K. H. Li, A. Aguirre, S. O. Gregersen, J. Tassarotti, L. Birkedal
  Symposium on Principles of Programming Languages 2025
  (PDF)

• Tachis: Higher-Order Separation Logic with Credits for Expected Costs
  P. G. Haselwarter, K. H. Li, M. de Medeiros, S. O. Gregersen, A. Aguirre, J. Tassarotti, L. Birkedal
  Conference on Object-Oriented Programming, Systems, Languages, and Applications 2024
  (PDF)

• Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs
  A. Aguirre, P. G. Haselwarter, M. de Medeiros, K. H. Li, S. O. Gregersen, J. Tassarotti, L. Birkedal
  International Conference on Functional Programming 2024
  (PDF)
  Distinguished Paper Award

• Secure Aggregation for Federated Learning in Flower
  K. H. Li, P. P. B. de Gusmão, D. J. Beutel, N. D. Lane
  International Workshop on Distributed Machine Learning 2021
  (PDF)

Unpublished Notes

• Wait-Free Task Solvability of Asynchronous Distributed Models
  K. H. Li
  Masters thesis, 2023
  (PDF)

• Flower: A Friendly Federated Learning Research Framework
  D. J. Beutel, T. Topal, A. Mathur, X. Qiu, J. Fernandez-Marques, Y. Gao, L. Sani, K. H. Li, T. Parcollet, P. P. B. de Gusmão, N. D. Lane
  2022
  (PDF)

• Type Systems for Functional Reactive Programming
  K. H. Li
  Bachelor thesis, 2022
  (PDF)

Talks

• Separation Logics for Probability, Concurrency, and Security
  Doctoral Symposium 2025
  (Slides)

• Coneris: Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs
  Logsem Seminar 2025 + Iris Workshop 2025
  (Slides)

• The Asynchronous Computability Theorem - A Marriage Between Distributed Systems and Algebraic Topology
  Churchill CompSci Talks 2022
  (Slides, Recording)

• Understanding the Source Coding Theorem - A Talk on Shannon’s Entropy
  Churchill CompSci Talks 2021
  (Slides)
  Audience Favourite Talk Prize

Misc

CV (Last updated: September 2025)

Photo (2023 May Bumps)

Other stuff