Professor Andrei Popescu

简介

Andrei became a Senior Lecturer in the Security of Advanced Systems group in May 2020, and was promoted to Professor of Computing Foundations in January 2026. Previously, he worked as a Lecturer at Middlesex University and as a postdoctoral researcher at TU Munich. He has a Ph.D. in computer science from the University of Illinois at Urbana-Champaign and a Ph.D. in mathematics from the University of Bucharest.

代表成果

• Derrick J, Dongol B, Edmonds C, Griffin M, Popescu A & Wright J (2025) Relative Security: (Dis)Proving Resilience Against Semantic Optimization Vulnerabilities in Isabelle/HOL. Journal of Automated Reasoning, 69(4).
• Cohen L, Jabarin A, Popescu A & Rowe RNS (2024) The complex(ity) landscape of checking infinite descent. Proceedings of the ACM on Programming Languages, 8(POPL), 1352-1384. View this article in WRRO
• Popescu A (2024) Nominal recursors as epi-recursors. Proceedings of the ACM on Programming Languages, 8(POPL). View this article in WRRO
• Popescu A (2023) Rensets and renaming-based recursion for syntax with bindings extended version. Journal of Automated Reasoning, 67(3). View this article in WRRO
• Popescu A & Traytel D (2023) Admissible types-to-PERs relativization in higher-order logic. Proceedings of the ACM on Programming Languages, 7(POPL), 1214-1245. View this article in WRRO
• Popescu A & Traytel D (2021) Distilling the requirements of Gödel’s incompleteness theorems with a proof assistant. Journal of Automated Reasoning, 65(7), 1027-1070.
• Popescu A, Lammich P & Hou P (2021) CoCon: a conference management system with formally verified document confidentiality. Journal of Automated Reasoning, 65(2), 321-356. View this article in WRRO
• (2020) Preface. IOP Conference Series: Materials Science and Engineering, 997(1), 011001-011001.
• Gheri L & Popescu A (2020) A formalized general theory of syntax with bindings: extended version. Journal of Automated Reasoning, 64(4), 641-675.
• Blanchette JC, Gheri L, Popescu A & Traytel D (2019) Bindings as bounded natural functors. Proceedings of the ACM on Programming Languages, 3(POPL), ---.