Find Academic Supervisors

Andrei Popescu is a Senior Lecturer in Computing Foundations at the School of Computer Science, University of Sheffield, where he also serves as School Programmes Lead (PGT). He is a member of both the Security of Advanced Systems research group and the Foundations of Computation research group. Prior to joining Sheffield in May 2020, he was a Lecturer at Middlesex University and a postdoctoral researcher at TU Munich. Dr. Popescu holds dual PhDs: one in computer science from the University of Illinois at Urbana-Champaign (advised by Elsa L. Gunter and Grigore Roșu) and another in mathematics from the University of Bucharest (advised by George Georgescu). His primary research interests include proof assistants, information flow security, inductive and coinductive datatypes, automated deduction, and syntax with bindings. His work often focuses on the formal verification of security properties in practical systems, as evidenced by projects like CoCon (a conference management system with verified confidentiality) and CoSMeDis (a social media platform with formally verified security guarantees). Analysis of his recent publications reveals a strong focus on foundational aspects of proof assistants, particularly Isabelle/HOL, with significant contributions to syntax with bindings, recursion principles, and the formalization of Gödel's incompleteness theorems. His work bridges theoretical computer science with practical applications in security verification. Scientific Awards: Distinguished paper award at POPL 2025 for 'Barendregt Convenes with Knaster and Tarski: Strong Rule Induction for Syntax with Bindings' Distinguished paper award at POPL 2024 for 'Nominal Recursors as Epi-Recursors' Distinguished paper award at POPL 2023 for 'Admissible Types-to-PERs Relativization in Higher-Order Logic' Dr. Popescu has successfully supervised PhD students, including Lorenzo Gheri whose thesis focused on syntax with bindings. He has secured significant research funding, including the COVERT project (EPSRC, £422,585), Security of Digital Twins in Manufacturing (EPSRC, £774,954), and Cyclic Reasoning Mechanisms for Interactive Theorem Proving (Royal Society, £12,000). He is actively involved in the research community, serving on program committees for major conferences including POPL, ITP, CSF, and IJCAR, and co-organizing the Midlands Graduate School. His work with the Security of Advanced Systems group continues to advance the field of formal verification for security-critical systems.

• Proof assistants
• Information flow security
• Inductive and coinductive datatypes
• +5 more

Andrei Popescu is a Senior Lecturer (Associate Professor level) in the Department of Computer Science at the University of Sheffield, where he conducts research in formal methods, proof assistants, and information flow security. He previously held academic positions at Middlesex University and TU Munich. University: University of Sheffield Department: Department of Computer Science Previous Affiliations: Middlesex University, TU Munich His research focuses on the logical foundations and practical applications of proof assistants, particularly Isabelle/HOL. He has made foundational contributions to inductive and coinductive datatypes, syntax with bindings, higher-order logic, and the formal verification of secure systems. His work bridges theoretical logic with real-world systems such as conference management (CoCon) and social media platforms (CoSMeDis). The recent publications highlight a strong trend in formalizing deep logical results (e.g., Gödel’s incompleteness theorems), advancing datatype theory, verifying complex security properties, and applying formal methods to practical systems. His work consistently appears in top-tier venues such as POPL, CAV, ITP, and CSF. Distinguished Paper Award at POPL 2025 Distinguished Paper Award at POPL 2024 Distinguished Paper Award at POPL 2023 RS 3 Best Paper Award for 2012–2013 He has advised PhD students including Lorenzo Gheri and has been actively involved in organizing major academic events such as the Midlands Graduate School, CPP, ITP, and TABLEAUX conferences. He has served on numerous program committees including POPL, ITP, CSF, and CAV, and has led research projects funded by VeTSS and industrial partners. He is a key contributor to the Isabelle proof assistant ecosystem, particularly in the development of the (co)datatype package and foundational consistency results. His work combines deep theoretical insight with practical implementation, making significant impacts in both academia and applied security.

• Proof Assistants
• Formal Verification
• Inductive and Coinductive Datatypes
• +12 more

Dr. Paige North is an Assistant Professor at Utrecht University, holding a dual appointment in the Department of Mathematics and the Department of Information and Computing Sciences . She combines topology and category theory to address challenges in computer science, particularly focusing on the interplay between functional programming/type theory and homotopy theory/higher category theory . Her research includes formalizing double categories, model category theory, and dependent type theories within univalent foundations. She has taught courses like Homotopy Type Theory and Advanced Functional Programming, and actively participates in organizing academic events such as the UniMath School and DutchCATS Workshop . Funding: AFOSR grant (2021–2024) Awards: Honorary Research Fellow, University of Birmingham Key Collaborations: Nima Rasekh, Benedikt Ahrens, Michael Shulman

• Topology
• Category Theory
• Computer Science
• +4 more

Dmitriy Traytel is an Associate Professor at the Department of Computer Science (DIKU), Faculty of Science, University of Copenhagen, where he leads the Software, Data, People & Society (SDPS) section. He earned his PhD from TU München under the supervision of Tobias Nipkow in 2015 and previously held a senior researcher position at ETH Zürich's Information Security Group. His primary research interests include interactive theorem proving, runtime verification, logic, automata, decision procedures, and coinduction. He works extensively with the Isabelle/HOL proof assistant, developing foundational theories and verified tools. His work bridges theoretical logic and practical system verification, focusing on correctness, expressiveness, and scalability. The recent publications highlight a strong focus on verified runtime monitoring, formalization of logical systems, and efficient query evaluation. Key themes include the development of formally verified monitoring tools (e.g., TimelyMon, WhyMon, VeriMon), foundational work on corecursion and datatypes in Isabelle, and translations of logical formalisms into executable and verifiable code. Several publications have received distinguished paper awards, indicating high impact in the programming languages and verification communities. Distinguished Paper Award, POPL 2025: 'Barendregt Convenes with Knaster and Tarski: Strong Rule Induction for Syntax with Bindings' Distinguished Paper Award, POPL 2023: 'Admissible Types-to-PERs Relativization in Higher-Order Logic' Distinguished Paper Award, ATVA 2018: 'Optimal Proofs for Linear Temporal Logic on Lasso Words' Best Student Paper Award, FSCD 2016: 'Formal Languages, Formally and Coinductively' Traytel has (co)supervised numerous PhD, MSc, and BSc students, many of whose projects contribute directly to his research agenda in verified systems and formal methods. He is actively involved in the academic community, serving on program committees for POPL, ITP, RV, and CPP, and has chaired conferences such as CPP 2023 and 2024. His tools, including TimelyMon, VeriMon, and WhyMon, are practical outcomes of his research, enabling scalable, explainable, and trustworthy runtime verification. He leads a research group focused on trustworthy stream processing, distributed streaming computations, and explainable monitoring. His work often involves collaboration with researchers at ETH Zürich and other institutions, particularly in the areas of security and monitoring.

• Interactive Theorem Proving
• Runtime Verification
• Logic
• +11 more

Graham Hutton is a Professor of Computer Science at the University of Nottingham , where he leads the Functional Programming Lab and serves as Director of the Midlands Graduate School . He co-founded the Quotient Haskell project and maintains key roles in Journal of Functional Programming editorial work and Haskell Foundation governance. Co-leader, Functional Programming Lab (2008–date) Director, Midlands Graduate School (2023–date) ACM Distinguished Scientist Principal investigator for £912k EPSRC project (2024–2027) His research focuses on mathematical approaches to program construction , particularly through functional languages like Haskell and Agda . He develops techniques for compiler correctness , type system design , and program optimization , with recent work on quotient polymorphism and denotational cost models . Key article themes include: Compiler derivation from formal semantics Effect handling in functional languages Graph-based code generation over traditional tree structures Quotient type systems with SMT solver integration Concurrency semantics using choice trees Operational improvement with parametric polymorphism Scientific awards include: ACM Distinguished Scientist (2013) Best Paper & Best Student Paper (2018) EPSRC funding for compiler correctness projects He advises current PhD students in compiler calculation and memory safety , while maintaining extensive educational contributions through his widely-used textbook Programming in Haskell and open course materials.

• Mathematics of program construction
• Functional programming
• Programming language semantics
• +6 more

Andrei Popescu is a Senior Lecturer in the Department of Computer Science at the University of Sheffield, specializing in formal verification and proof assistants. Previously, he held faculty positions at Middlesex University and TU Munich. University of Sheffield (2020–present) Middlesex University (2014–2020) TU Munich (2010–2020) His research focuses on proof assistants (Isabelle/HOL), inductive/coinductive reasoning, syntax with bindings, and information flow security. Key projects include CoCon (verified conference system) and CoSMeDis (confidentiality-verified social media). Recent publications address Gödel's incompleteness theorems, modular (co)datatypes, and security verification. Awards include POPL Distinguished Paper Awards (2023–2025) and the RS 3 Best Paper Award (2012–2013). He teaches courses on software/hardware verification and previously taught decision support systems, web development, and verification techniques. Andrei is actively involved in conference organization and program committees, including POPL, ITP, and CSF.

• Proof Assistants
• Formal Verification
• Inductive and Coinductive Reasoning
• +6 more