Find Academic Supervisors

Nadia PolikarpovaView profile

Associate Professor

• Program Synthesis
• Program Verification
• Type Systems
• +5 more

Nadia Polikarpova is an Associate Professor in the Department of Computer Science and Engineering at the University of California, San Diego . She earned her PhD from ETH Zurich in 2014 under Bertrand Meyer , followed by postdoctoral research at MIT CSAIL with Armando Solar-Lezama . Her academic contributions have been recognized with prestigious awards including the 2020 Sloan Fellowship , 2020 Intel Rising Stars Award , and 2020 NSF CAREER Award . Polikarpova's research focuses on program synthesis , program verification , and type systems . She leads the Programming Systems group at UCSD and contributes to the IFIP Working Group 2.8 on Functional Programming since 2022. Her work spans foundational research and practical tools, including projects like Synquid , SuSLik , and Laurel that combine formal methods with machine learning for code generation. Her recent publications in venues like OOPSLA , NeurIPS , and ICFP reveal trends in AI-assisted programming , live programming environments , and formal verification . She has advised numerous PhD and Master’s students including Shraddha Barke , Zheng Guo , and Tristan Knoth , many of whom have moved to prominent academic and industry positions. Notable artifacts from her lab include tools like ColDeco for spreadsheet inspection and Superfusion for eliminating intermediate data structures. 2020 : Sloan Fellow 2020 : Intel Rising Stars Award 2020 : NSF CAREER Award 2021 : Distinguished Paper at POPL 2023 : Distinguished Artifact at PLDI 2023 : Distinguished Paper at OOPSLA Polikarpova actively contributes to academic service, serving on program committees for PLDI , POPL , and OOPSLA , and co-chairing the OOPSLA Review Committee in 2023. She has delivered keynotes at APLAS'20 and PLDI'24 , emphasizing the integration of large language models with formal methods.

Yin Tat LeeView profile

Associate Professor

• Convex Optimization
• Convex Geometry
• Graph Algorithms
• +2 more

Yin Tat Lee is an Associate Professor at the Paul G. Allen School of Computer Science & Engineering , University of Washington, and a Senior Principal Researcher in Microsoft AI. His research spans convex optimization , convex geometry , graph algorithms , online algorithms , and differential privacy , with applications in machine learning and theoretical computer science.

Assia MahboubiView profile

Researcher

• Type Theory
• Formal Verification
• Computer-Aided Mathematics
• +3 more

Assia Mahboubi is a tenured researcher ( directrice de recherche ) at INRIA in the Gallinette team, Nantes, France, and an endowed professor in the Algebra and Number Theory section of the Vrije Universiteit Amsterdam, Netherlands. Her work bridges theoretical computer science and formal mathematics, with significant contributions to proof assistants and formal verification. Her research focuses on the foundations and formalization of mathematics in type theory, particularly on the automated verification of mathematical proofs. She explores the interplay between computer algebra and formal proofs, and is a key contributor to the Rocq prover (formerly Coq) and the Mathematical Components libraries. Her work often examines how familiar mathematical objects can be optimally represented for computer-aided proof checking. Recent publications show a strong trend toward categorical reasoning, diagram chasing, and continuity properties in constructive type theory, with increasing focus on practical applications of formal methods in computational mathematics. Her work demonstrates the maturation of formal verification techniques from theoretical foundations to practical tools for mathematical research. ERC Consolidator grant for the FRESCO (Fast and Reliable Symbolic Computation) project Mahboubi actively supervises doctoral students including Vojtěch Štěpančík, Tomás Vallejos Parada, and Alain Chavarri Villarello. She has received significant research funding through her ERC Consolidator grant for the FRESCO project, which aims to develop fast and reliable symbolic computation techniques. She is deeply involved in the international research community, serving on program committees for major conferences including POPL, CPP, and ICFP. She leads research in the Gallinette team at INRIA, which focuses on the intersection of proof assistants, programming languages, and formal mathematics. Her work has helped establish formal verification as a practical tool for mathematical research, moving beyond theoretical foundations to real applications in computational mathematics.

• Secure Decentralized Systems
• Blockchain Technology
• Systems Security
• +3 more

Prof. Bryan Ford leads the Decentralized/Distributed Systems (DEDIS) lab at EPFL. He focuses on secure decentralized systems, including blockchain technology, privacy, and systems security. He earned his Ph.D. from MIT and held faculty positions at Yale University and EPFL. His work spans distributed consensus protocols, peer-to-peer networking, and privacy-preserving systems. Key projects include QuePaxa (timeout-free consensus), UIA (global connectivity for mobile devices), and MedCo (secure healthcare data sharing). He advises numerous PhD students and contributes to open-source projects like Bitcoin collective signing and privacy networks like Riffle. Education: Ph.D., MIT; Postdoctoral work at Yale Research interests include blockchain scalability, consensus algorithms, and cryptographic privacy. His lab develops systems like TRIP for coercion-resistant voting and F3B to mitigate blockchain front-running. His work on NAT traversal and peer-to-peer protocols (e.g., STUN/ICE) remains foundational in network architecture. He emphasizes practical, auditable security solutions such as CertiKOS and atomic cross-chain transactions (Atom). Notable contributions: CoSi (collective signing), OmniLedger (sharded blockchain), and privacy-preserving protocols like PURBs (Protected Unsealable Recursive Boxes). His lab collaborates with Swiss Post to audit e-voting systems and designs democratic cryptocurrencies like PoPCoin.

• Computer Vision
• Artificial Intelligence
• Multimodal Learning
• +7 more

Dr. Hilde Kuehne is a Professor at the University of Tuebingen and a key researcher at the Tuebingen AI Center. She holds affiliations with MIT-IBM Watson AI Lab and Goethe University Frankfurt, with a focus on computer vision, multimodal learning, and explainable AI. Her work bridges vision-language models, audio-visual alignment, and self-supervised methods. Co-organizer of the New Frontiers in Associative Memories workshop @ ICLR 2025 Member of the Scientific Advisory Board of the Carl-Zeiss-Foundation Contributor to CVPR 2025's UTD dataset for unbiased video benchmarks Her research addresses critical challenges in: Explainability for Vision Transformers (LeGrad) Fine-grained audio-visual alignment (CAV-MAE Sync) Zero-shot visual recognition automation (Meta-Prompting) Spatio-temporal grounding without annotations Recent collaborative work spans 15+ publications across CVPR, NeurIPS, ICCV, and ICLR, with emphasis on multimodal foundation models, dataset bias mitigation, and differentiable logic networks. She actively contributes to workshop organization and peer review as evidenced by her involvement in CVPR 2025 and ICLR 2025 program committees.

Muhammad Ali GulzarView profile

Assistant Professor

• Fault Localization
• Big Data systems
• Data Intensive scalable computing
• +5 more

Muhammad Ali Gulzar is an Assistant Professor in the Computer Science Department at Virginia Tech and an Amazon Scholar at Amazon Web Services. His research focuses on improving developer productivity through automated debugging and testing for applications in emerging domains, including data-intensive software such as dataflow programs, ML/AI applications, and computational notebooks. Education Ph.D. in Computer Science from University of California, Los Angeles (Google Ph.D. Fellow 2017-2020) Research Interests Gulzar's research spans three primary areas: (1) automated tracking-code localization techniques in web applications, (2) re-engineering testing and debugging for data-intensive applications, and (3) advancing current testing and debugging practices in Federated Learning Applications. His work addresses the challenges of debugging in complex systems where traditional approaches fail due to the scale and distributed nature of modern applications. His research has significant implications for improving software quality, developer productivity, and accessibility in web applications. Research Trends Recent publications demonstrate a strong focus on debugging and testing challenges in emerging application domains. His work bridges traditional software engineering with machine learning, data-intensive systems, and web technologies. Notably, he has made significant contributions to Federated Learning debugging (FedDebug), accessibility challenges in ad-driven web applications, and semantic caching for Large Language Models. His approach often combines novel algorithmic insights with practical implementations that address real-world challenges in software development and maintenance. Scientific Awards Google Ph.D. Fellow (2017-2020) $1.1 million NSF award for Federated Learning research ACM CCS 2024 Distinguished Artifact Award Advising and Grants Gulzar leads a productive research group with multiple students contributing to publications in top-tier venues. His NSF-funded research on Federated Learning demonstrates his ability to secure competitive funding for innovative projects. His advising style appears to emphasize practical impact alongside theoretical contributions, with students often taking lead roles in publications. Current research directions include debugging techniques for Large Language Models, accessibility challenges in modern web applications, and novel testing approaches for distributed data processing systems.

Zachary KincaidView profile

Associate Professor

• Program Analysis
• Formal Methods
• Programming Languages
• +4 more

Zachary Kincaid is an Associate Professor in the Department of Computer Science at Princeton University's School of Engineering and Applied Science. His research focuses on program analysis, logic, and programming languages, with an emphasis on making program analysis compositional and robust. He received his PhD from the University of Toronto under the supervision of Azadeh Farzan. His work has been implemented in the Duet program analyzer, and he has an Erdős number of 3. Dr. Kincaid's research interests include: Compositional program analysis techniques Algebraic approaches to program analysis Termination analysis and ranking function synthesis Verification of concurrent and parallel programs Automated reasoning and decision procedures Analysis of numerical programs and loops His recent publications show a strong focus on developing novel techniques for program analysis that bridge theoretical computer science with practical verification tools, particularly in nonlinear analysis, quantified reasoning, and compositional verification. Dr. Kincaid has received research support from ONR grant N00014-19-1-2318 for his work on robust program analysis. He has advised graduate students including: Current: Jake Silverman, Nicolas Koh, Nikhil Pimpalkhare Graduated: Shaowei Zhu (PhD 2024, Researcher at Amazon), Charlie Murphy (PhD 2023, Postdoc at University of Wisconsin–Madison) Dr. Kincaid teaches courses including: COS 320 – Compiling Techniques (Spring 2024, 2022, 2020, 2019) COS 516 / ELE 516 – Automated Reasoning about Software (Fall 2025, 2022, 2018) COS 217 – Introduction to Programming Systems (Fall 2024) COS IW – Practical Solutions to Intractable Problems (Fall 2023, Spring 2023, 2018, 2017) COS IW – Little Languages (Spring 2018) COS 597D – Reasoning about concurrent systems (Fall 2016)

Bo XiongView profile

Researcher

• Machine Learning
• Knowledge Graphs
• Graph Neural Networks
• +4 more

Bo Xiong is a researcher at the University of Stuttgart in the Analytic Computing group. His research focuses on machine learning and knowledge graphs , with a particular emphasis on geometric embeddings and hyperbolic neural networks. His research interests include: Knowledge graph embeddings Hyperbolic and pseudo-Riemannian geometry in AI Temporal knowledge graph reasoning Structured multi-label prediction Recent publications highlight his work on geometric relational embeddings, complex query answering, and temporal fact reasoning using advanced manifold-based techniques.

• Quantum Computing
• Quantum Foundations
• ZX-calculus
• +7 more

John van de Wetering is an Assistant Professor at the Theoretical Computer Science group of the Informatics Institute, University of Amsterdam, working with the QuSoft research center. He co-authored the open-access book Picturing Quantum Software and developed the PyZX quantum compiler. His research spans quantum computation and quantum foundations, focusing on diagrammatic methods like the ZX-calculus and ZH-calculus. Quantum circuit optimization and verification Quantum foundations via algebraic/compositional methods Co-creator of PyZX His recent publications explore multi-qutrit systems, completeness of graphical calculi, and quantum state representations. Supervises students in quantum computing, including Lia Yeh and Sarah Li. Directs the new Master's program in Quantum Computer Science at UvA. Actively contributes to open-source projects and international conferences. Notable collaborations include Aleks Kissinger, Neil J. Ross, and QuSoft researchers. Uses GitHub for DiZX development (qudit extension of PyZX). No explicit scientific awards mentioned.

Michael D. ErnstView profile

Professor

• software engineering
• programming languages
• type theory
• +6 more

Michael D. Ernst is a Professor in the Computer Science & Engineering department at the University of Washington's College of Engineering. His research aims to make software more reliable, more secure, and easier (and more fun!) to produce. Previously, he was a tenured professor at MIT and a researcher at Microsoft Research. Ernst's primary technical interests are in software engineering, programming languages, type theory, security, program analysis, bug prediction, testing, and verification. His research combines strong theoretical foundations with realistic experimentation, with an eye to changing the way that software developers work. He focuses particularly on programmer productivity and developing practical tools that can be integrated into developers' workflows. Analysis of his recent publications (2018-2025) reveals a continued focus on verification techniques, program analysis, and testing methodologies. His work spans from theoretical foundations of type systems to practical applications of NLP for test generation and LLMs for test oracle creation. A consistent theme is developing lightweight, modular approaches that can be practically applied in real-world development environments. Scientific Awards: ACM Fellow (2014) John Backus Award (2009) NSF CAREER Award (2002) ACM SIGSOFT Impact Paper Award (2013) 8 ACM Distinguished Paper Awards across multiple conferences ECOOP 2011 Best Paper Award Microsoft Academic Search ranked #2 in software engineering research (2013) Ernst has received significant research funding including the NSF CAREER Award, supporting his work on program analysis and verification techniques. His research combines theoretical rigor with practical impact, often resulting in tools that are adopted by the software engineering community. He actively collaborates with researchers across institutions and has served in leadership roles for major conferences in programming languages and software engineering. His research group develops practical tools that address real challenges in software development, with a focus on making verification and analysis techniques more accessible to working developers. Current projects include applying machine learning techniques to software engineering problems while maintaining strong theoretical foundations.

Dominique DevrieseView profile

Professor

• Functional Programming
• Object Capabilities
• Secure Compilation
• +5 more

Dominique Devriese is a professor at the Department of Computer Science, KU Leuven, and a member of the DistriNet research group. His work bridges computer security, programming languages, and formal verification. Research interests: Functional Programming, Object Capabilities, Secure Compilation, Dependently-typed Programming, Modal Type Theory Teaching: Formal Systems, Object-Oriented Programming, CyberSecurity, Secure Software His research focuses on rigorous software systems security through capability machines and secure compilation techniques. He actively contributes to formal verification using Agda and Haskell, with recent work on multimode type theory and effect parametricity. Key publication trends include: multimode/presheaf type theory, capability-based security models, formal verification of hardware/software abstractions, and parametricity applications in programming languages. Contact: Email: dominique.devriese@kuleuven.be ORCID: 0000-0002-3862-6856

• Machine Learning
• Educational Data Mining
• Time Series Forecasting
• +5 more

Irena Koprinska is a prominent researcher at the University of Sydney with over 150 publications from 1996 to 2025. Her work spans multiple interdisciplinary domains with significant contributions to machine learning applications in educational technology, time series forecasting, and health informatics. She maintains strong research collaborations, particularly with Kalina Yacef (38 joint publications), Mashud Rana (26 papers), and Bryn Jeffries (22 papers), indicating leadership in her research group. Her research interests focus on practical applications of machine learning across diverse domains. In educational data mining, she has pioneered methods for predicting student performance in programming courses, analyzing syntax errors, and developing automated hint generation systems. Her work in time series forecasting has made significant contributions to solar power prediction using advanced neural network architectures. Additionally, she has applied machine learning techniques to medical domains, particularly in sleep disorder detection and analysis. The analysis of her 15 most recent publications (2022-2025) reveals a continued focus on educational technology and time series analysis, with increasing attention to interpretable methods and health applications. Her work demonstrates a consistent trajectory of applying sophisticated machine learning techniques to solve real-world problems across multiple domains, with particular emphasis on creating practical tools for education and renewable energy management. Notable Research Contributions: Development of the HINTS framework for automated programming hint generation Innovative approaches to multistep-ahead time series forecasting Applications of deep learning to sleep disorder detection Methods for predicting student performance in programming education Her publication record in top venues including Machine Learning journal, AIED, EDM, and IJCNN demonstrates significant impact in both machine learning and educational technology communities. The consistent output of high-quality research over nearly three decades indicates sustained scholarly productivity and leadership in her fields of expertise.

Dmitriy TraytelView profile

Associate Professor

• Logic
• Automata Theory
• Runtime Verification
• +7 more

Dmitriy Traytel is an Associate Professor at the University of Copenhagen's Department of Computer Science since August 2020, where he currently heads the Software, Data, People & Society (SDPS) section. Prior to this position, he worked as a senior researcher (Oberassistent) in the Information Security Group led by David Basin at ETH Zürich. He completed his PhD at TU München under Tobias Nipkow's supervision in 2015. His research focuses on formal methods, particularly logic, automata theory, runtime verification and monitoring, decision procedures, (co)induction and (co)recursion, and interactive theorem proving. Traytel develops formally verified tools for runtime monitoring including VeriMon, TimelyMon, and WhyMon, emphasizing correctness and efficiency in monitoring complex temporal properties. His recent publications (2021-2025) demonstrate a strong focus on first-order temporal logic monitoring, with particular attention to explainable verdicts, scalable parallel implementations, and formal verification of monitoring algorithms. The work spans theoretical foundations in logic and category theory while maintaining practical applications in runtime verification systems. Distinguished Paper Award at POPL 2025 for 'Barendregt Convenes with Knaster and Tarski' Best Student Paper Award at FSCD 2016 Distinguished Paper Award at ATVA 2018 Traytel has supervised numerous PhD, Master's, and Bachelor's students in areas spanning formal verification, runtime monitoring, and theorem proving. His research has been supported through collaborations with major institutions including ETH Zürich and TU München. He actively contributes to the academic community by serving on program committees for major conferences including ITP 2025 and RV 2025. He leads the Software, Data, People & Society section at the University of Copenhagen, focusing on developing formally verified tools for runtime verification that bridge theoretical computer science with practical applications in security and system monitoring.

Riccardo TommasiniView profile

Associate Professor

• Stream Processing
• Knowledge Graphs
• Query Languages
• +3 more

Riccardo Tommasini is an Associate Professor at INSA Lyon , a leading engineering institution in France. He leads the Stream Processing and Knowledge Graphs research within the DB Team at LIRIS laboratory under Professor Angela Bonifati. His academic journey began with a PhD in Computer Science from Politecnico di Milano under Emanuele Della Valle, with a dissertation titled Velocity on the Web to be published as a Springer book. Research Interests : Advancing stream processing for real-time data systems Extending knowledge graphs with dynamic data Designing graph databases for big data applications Creating query languages for heterogeneous data environments Building data engineering pipelines with Apache Airflow Enabling big graph processing in distributed settings Key Contributions : Developed Zodiac framework for Datalog reasoning under rule amendments (ICDE 2025) Co-authored foundational Streaming Linked Data book with Springer (2023) Created RSP4J API for RDF stream processing (ESWC 2021) Designed challenge-based learning curriculum for Data Engineering courses Scientific Recognition : Received ANR JCJC grant for POLYFLOW project (2024) Awarded Best Resource at ESWC 2021 Managed industrial collaborations with Neo4j, InfluxData, and Confluent Advising & Teaching : Supervises Mohamed Ragab (PhD candidate at University of Tartu) Course Leadership : Foundational Data Engineering course at INSA Lyon and University of Tartu Structured around Apache Airflow , Docker, and graph databases

Martín Hötzel EscardóView profile

Professor

• Homotopy Type Theory
• Univalent Mathematics
• Martin-Löf Type Theory
• +12 more

Martín Hötzel Escardó is a Professor of Theoretical Computer Science in the School of Computer Science at the University of Birmingham, UK. He has been a faculty member since 2000, following previous academic positions at Imperial College London, the University of Edinburgh, and the University of St Andrews. His research bridges theoretical computer science and pure mathematics, with a strong emphasis on foundational aspects of computation. His educational background includes a BSc and MSc from Universidade Federal do Rio Grande Sul (Brazil) and a PhD from Imperial College London (1997) under Michael B. Smyth. Escardó's research interests center on topology in computation , constructive mathematics , dependent and univalent type theory (including Homotopy Type Theory and Cubical Type Theory), domain theory , locale theory , and exact real-number computation . His work explores deep connections between logic, topology, and programming, often using functional languages like Haskell and Agda to formalize and experiment with theoretical ideas. He is particularly known for his discoveries on exhaustively searchable infinite sets and the topological nature of computability. The trend in his recent publications reflects a sustained focus on univalent foundations, constructive domain and order theory, game semantics with dependent types, and the logical structure of type universes. His work consistently advances the formalization and understanding of higher-type computation and constructive mathematics within modern type theories. He has no listed scientific awards in the provided text, but his influence is evident through his extensive publication record and software developments like TypeTopology. Escardó has advised several students and collaborators, though specific names are not listed. He has been involved in significant research projects, particularly in the formalization of mathematics in type theory and the semantics of programming languages. His work often involves developing Agda libraries to formalize new mathematical results constructively. He leads and contributes to a vibrant research group in theoretical computer science at Birmingham, with a focus on logic, semantics, and type theory. His public research blog, lecture notes, and open-source Agda code (e.g., TypeTopology, HoTT-UF-in-Agda) serve as important resources for the community.