Ilya SERGEY

Associate Professor
Yale-NUS College, Singapore
Ph.D. (Computer Science, Katholieke Universiteit Leuven, Belgium, 2012)
M.Sc. (Mathematics and Computer Science, Saint Petersburg State University, Russia, 2008)
RC3-01-03E
651 61903

https://ilyasergey.net

Research Areas

  • Programming Languages & Software Engineering
  • Systems & Networking
  • Algorithms & Theory

Research Interests

  • Applied Logic for Software Verification
  • Design and Implementation of Programming Languages
  • Static Program Analysis

Profile

Since November 2018, I am a tenure-track Associate Professor at Yale-NUS College (Singapore), holding a joint appointment with NUS School of Computing. From November 2015 till October 2018, I was a faculty at the Department of Computer Science of University College London. Prior to joining UCL, from I was a postdoc at IMDEA Software Institute. I defended my PhD thesis at CS Department of KU Leuven in 2012. I got my MSc degree in Mathematics and CS in 2008 from Dept. of Mathematics and Mechanics of Saint Petersburg State University. Before joining academia I worked as a software developer at JetBrains.

Current Projects

  • Distributed System Optimizations as Network Semantics Transformations (funded by Google Faculty Research Award)

Selected Publications

  • Structuring the Synthesis of Heap-Manipulating Programs 
    Nadia Polikarpova and Ilya Sergey
    46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL’19)

  • A True Positives Theorem for a Static Race Detector
    Nikos Gorogiannis, Peter O’Hearn, and Ilya Sergey
    46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL’19)

  • Programming and Proving with Distributed Protocols
    Ilya Sergey, James R. Wilcox, and Zachary Tatlock
    45th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL'18)

  • RacerD: Compositional Static Race Detection
    Sam Blackshear, Nikos Gorogiannis, Peter O’Hearn, and Ilya Sergey
    33rd ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications (OOPSLA’18)

  • Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms
    Ilya Sergey
    21st ACM SIGPLAN International Conference on Functional Programming (ICFP’16)

  • Hoare-style Specifications as Correctness Conditions for Non-linearizable Concurrent Objects
    Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee and German Andres Delbianco
    31st ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications (OOPSLA’16)

  • Mechanized Verification of Fine-grained Concurrent Programs
    Ilya Sergey, Aleksandar Nanevski, and Anindya Banerjee
    36th ACM SIGPLAN International Conference on Programming Language Design and Implementation (PLDI’15)

  • Modular, Higher-Order Cardinality Analysis in Theory and Practice
    Ilya Sergey, Dimitrios Vytiniotis and Simon Peyton Jones
    41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’14)

Awards & Honours

  • POPL 2019 Distinguished Paper Award for the work "Structuring the Synthesis of Heap-Manipulating Programs"
  • Google Faculty Research Award recipient (2017). Google Inc
  • Vladimir Potanin Fund Scholarship recipient (2004, 2005, 2007). The Vladimir Potanin Foundation

Teaching (2018/2019)

  • YSC2229: Introductory Data Structures and Algorithms (Yale-NUS College)