Aleksandar Nanevski

Aleksandar Nanevski is a Research Professor at the IMDEA Software Institute since 2009. He holds a Ph.D. in Computer Science from Carnegie Mellon University (2004), with postdoctoral positions at Harvard University and Microsoft Research, Cambridge. His research focuses on programming languages for formal verification, integrating programming with theorem proving via type theory. Key interests include verifying imperative programs with modern language features, concurrency, and pointer arithmetic. He leads projects like FCSL (Functional Concurrent Separation Logic) and RHTT (Relational Hoare Type Theory).

Education:

• Ph.D., Computer Science, Carnegie Mellon University, 2004
• M.S., Computer Science, Carnegie Mellon University
• B.S., Computer Science, University of Skopje, Macedonia, 1995

Research Interests: Design and implementation of programming languages for formal verification, dependent type systems, concurrency, and security. His work bridges programming methodology with interactive and automated theorem proving, emphasizing scalable verification of imperative programs.

Professional Activities: Program chair for HOPE (2016-2017), PC member for OOPSLA, POPL, and ESOP. Invited keynotes at MFPS, ICTI, and VS-THEORY. Active in foundational research on separation logic and concurrent systems.

Labs/Projects: FCFS (Functional Concurrent Separation Logic) and RHTT (Relational Hoare Type Theory), focusing on security-aware and concurrent program verification.