Ori Lahav

Ori Lahav is a faculty member in the School of Computer Science at Tel Aviv University. He holds a PhD from Tel Aviv University (supervised by Arnon Avron), completed postdoctoral research at Tel Aviv University (hosted by Mooly Sagiv) and MPI-SWS in Germany (hosted by Viktor Vafeiadis and Derek Dreyer). His research is supported by an ERC Starting Grant and ISF Grant.

His research focuses on programming languages, verification, concurrency, and relaxed memory models, with additional interests in proof theory, semantics of non-classical logics, and automated reasoning. His work bridges theoretical foundations with practical applications in compiler design, hardware verification, and distributed systems.

Lahav's publications consistently explore concurrency paradigms, weak memory models, and verification techniques. Recent works emphasize formal methods for RDMA, persistent memory, compositional semantics, and automated tooling for memory consistency.

Awards:

• Best Paper & Best Student Paper Awards (DISC 2024)
• Distinguished Paper Award (OOPSLA 2021)
• Best Paper Award (TABLEAUX 2017)
• Distinguished Paper Award (PLDI 2017)
• Best Paper Award (ECOOP 2017)
• Kleene Award for Best Student Paper (LICS 2013)

He advises PhD and MSc students including Yoav Ben Shimon, Yotam Dvir, and Roy Margalit. His group investigates shared-memory concurrency, denotational semantics, and verification tools.

Lahav co-organizes conferences (VMCAI 2024) and Dagstuhl seminars (2023, 2026). He teaches courses on Programming Language Foundations, Discrete Mathematics, and Weak Memory Concurrency.