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.

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.

• Formalized Mathematics
• Proof Assistants
• Homotopy Type Theory
• +3 more

Floris van Doorn is a Professor at the Mathematical Institute of the University of Bonn where he leads the Formalized Mathematics group. His research focuses on making it viable to formalize research mathematics in proof assistants that can check the correctness of such proofs. He primarily works with the Lean Theorem Prover and is a maintainer of its mathematical library (mathlib). University of Bonn: Professor (2023-present) University of Paris-Saclay: Postdoc with Patrick Massot (2021-2023) University of Pittsburgh: Postdoc with Tom Hales (2018-2021) Carnegie Mellon University: PhD under Jeremy Avigad and Steve Awodey (2013-2018) Van Doorn's research interests center on formalized mathematics, tools and automation for formalization, and homotopy type theory. He has made significant contributions to several major formalization projects including the Carleson project (proving Carleson's theorem), the sphere eversion project (formalizing Gromov's h-principle), the Flypitch project (formalizing the independence of the continuum hypothesis), and the Spectral sequences project. His work demonstrates that proof assistants can handle complex areas of mathematics beyond algebra, including differential topology and analysis. His recent publications show a consistent focus on advancing formalized mathematics, with his most recent work formalizing the Gagliardo-Nirenberg-Sobolev inequality and continuing the Carleson project. His publications span theoretical foundations of type theory, practical applications of formalization, and educational resources for learning proof assistants. Skolem award (2025) for the paper 'The Lean Theorem Prover (System Description)' Van Doorn actively mentors students and collaborators, with Maria, Michael, and Arend recently joining his formalization group in Bonn. He has taught various courses on formalized mathematics and proof assistants at the University of Bonn, University of Pittsburgh, and Carnegie Mellon University. His educational efforts include developing learning resources such as the Natural Number Game and the online book 'Mathematics in Lean.' He also maintains an active presence in the Lean community through the Formalized Mathematics group and collaborative projects like the Carleson project, which invites participation from those familiar with Lean.

Todd MillsteinView profile

Professor

• Software Reliability
• Network Verification
• Programming Languages
• +5 more

Todd Millstein is a Professor in the Computer Science Department at the University of California, Los Angeles (UCLA), and served as Department Chair from 2022–2025. He is also an Amazon Scholar and a co-founder and former Chief Scientist of Intentionet (now at AWS). His research focuses on making software systems more reliable, particularly through network verification and programming language techniques. He pioneered the Batfish network configuration analyzer, which is used by AWS, Oracle Cloud, and dozens of companies, and received the ACM SIGCOMM Networking Systems Award (2025) for this work. His recent publications span probabilistic programming, network reliability, and interactive program verification, including papers at PLDI 2024 (on bit blasting probabilistic programs), NSDI 2024 (on behavioral testing of BGP), and HotNets 2024 (on network layering). Todd has received prestigious awards such as an NSF CAREER Award , a Microsoft Research Outstanding Collaborator Award , and multiple best paper awards at PLDI, OOPSLA, and SIGCOMM. He has advised Ph.D. students like Ana Brendel and Poorva Garg , and teaches courses such as CS30 (Principles of Computing), CS231 (Types and Programming Languages), and CS239 (Current Topics in PL and Systems). His professional roles include Program Chair for OOPSLA 2014 and ECOOP 2018, and committee member for numerous conferences including PLDI , SPLASH , and LAFI .

Gheorghe CraciunView profile

Professor

• Mathematical Biology
• Dynamical Systems
• Chemical Reaction Networks
• +3 more

Gheorghe Craciun is a Professor in the Department of Mathematics and the Department of Biomolecular Chemistry at the University of Wisconsin-Madison. His research focuses on mathematical and computational models in biology and medicine, particularly dynamical systems models of biological interaction networks. He has been a visiting researcher at the Max Planck Institute for Mathematics in the Sciences during the 2019-2020 academic year and has organized the Madison Workshops on Mathematics of Reaction Networks. Craciun's primary research interests include Mathematical Biology, Dynamical Systems, Chemical Reaction Networks, Computational Biology, Systems Biology, and Algebraic Geometry. He investigates systems of differential equations with polynomial right-hand sides, which are common in biochemical reaction networks, ecological interactions, and epidemiological models. His work often involves proving global stability, analyzing multistability, and characterizing steady states using tools from algebraic geometry and combinatorics. Recent publications demonstrate his focus on toric differential inclusions, endotactic networks, and the global attractor conjecture, extending to applications in biochemical networks and discrete Boltzmann equations. His extensive publication record reveals a strong trend toward algebraic and geometric methods for analyzing complex biological networks, with significant contributions to reaction network theory, stability analysis, and parameter characterization. Craciun's work bridges abstract mathematical concepts with practical applications in biochemistry, ecology, and medicine, including modeling vitellogenin production in trout and peptide mass distributions. He has collaborated extensively with international researchers including Alicia Dickenstein, Anne Shiu, Bernd Sturmfels, Casian Pantea, and Miruna-Stefana Sorea. In education, Craciun teaches graduate courses such as Math 703 and mentors students through the Madison Math Circle and Putnam Club, while organizing specialized workshops that foster collaboration in reaction network theory.

Jürgen Richter-GebertView profile

Professor

• Geometry
• Visualization
• Computer Science
• +7 more

Professor Jürgen Richter-Gebert is a full professor of Geometry and Visualization at the Technical University of Munich (TUM), working within the TUM School of Computation, Information and Technology. Born in 1963, he has been at TUM since 2001, following positions at ETH Zurich (1997-2001) and TU Berlin (1994-1997). His educational background includes studies at TU Darmstadt (1983-1988) and dual PhDs from TU Darmstadt and KTH Stockholm (1991-1992). Richter-Gebert's research spans combinatorial and computer-oriented geometry, with particular expertise in polytope theory and mathematical visualization software. He develops processes for the automatic generation of geometric problem solutions and is actively involved in raising the public profile of mathematics. Richter-Gebert's publications and research focus on the intersection of mathematics and computer science, with particular emphasis on projective geometry, dynamic geometry, polytope theory, and combinatorial geometry. His work demonstrates how mathematical structures can be made accessible through computerized interactive visualizations. His most notable publications include "Perspectives on Projective Geometry" (2011) and "Geometriekalküle" (2009), along with numerous papers on dynamic geometry systems. Ars Legendi Prize for excellent university teaching (2011) Karl Max von Bauernfeind Medal of the TUM (2010) MedidaPrix - media didactic university prize (2008) EASA - European Academic Software Award (2000) Communicator Preis for science communication (2021) As founder and director of the ix-quadrat mathematics exhibition at the Garching Campus, Richter-Gebert has made significant contributions to mathematics education and outreach. He has developed influential mathematical visualization tools including Cinderella, CindyJS, and iOrnament, which have received multiple awards for educational software excellence. His research group focuses on mathematical foundations, authoring systems, and mathematical visualizations with applications in education and public scenarios.

Matthieu SozeauView profile

Researcher

• Type Theory
• Proof Assistants
• Functional Programming
• +4 more

Matthieu Sozeau is a prominent researcher at Inria in the Gallinette team in Nantes, France, and a key contributor and coordinator of the Coq/Rocq proof assistant project. His work bridges theoretical computer science and practical software development, focusing on creating reliable formal verification tools. His research interests span Type Theory, Proof Assistants, Functional Programming, and Unification. He has made significant contributions to the development of Coq (recently renamed to Rocq Prover), particularly through the MetaCoq project which aims to verify Coq's kernel within Coq itself, the Equations plugin for dependent pattern matching, and CertiCoq, a verified compiler from Coq to assembly. His work enables stronger guarantees about formalized mathematics and verified software. Sozeau's publications reveal a consistent focus on foundational aspects of proof assistants. His recent work includes verified type checking ('Coq Coq Correct!'), verified extraction from Coq to OCaml, and sort polymorphism for proof assistants. These contributions advance both theoretical understanding and practical implementation of dependently-typed programming languages. Distinguished paper award for Verified Compilation from Coq to OCaml at PLDI'24 As an academic mentor, Sozeau has supervised PhD students including Théo Winterhalter and Antoine Allioux. He regularly teaches courses on proof assistants, notably at MPRI (Master Parisien de Recherche en Informatique), and actively participates in the academic community through program committees, invited talks, and workshops. His work has significantly influenced both the theoretical foundations and practical applications of interactive theorem proving.

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.

Shuvendu K. LahiriView profile

Researcher

• Formal Verification
• Smart Contracts
• Program Synthesis
• +5 more

Shuvendu K. Lahiri is a researcher at Microsoft Research, focusing on formal verification, program synthesis, and software testing. His work bridges artificial intelligence with formal methods, particularly in blockchain security and automated code generation. 2025 : Published LLM-Vectorizer (verified loop vectorizer) and neural synthesis for SMT-assisted proof-oriented programming 2024 : Explored LLM-based test-driven code generation and natural precondition inference 2023 : Developed resource management specifications and contributed to test generation with pre-trained models 2022 : Advanced Solidity type systems and merge conflict resolution using language models His research combines large language models with formal verification tools to improve software correctness. He actively contributes to conferences like ICSE, PLDI, and ISSTA as author and committee member.

Farzaneh DerakhshanView profile

Assistant Professor

• Type Theory
• Proof Theory
• Programming Languages
• +7 more

Dr. Farzaneh Derakhshan is an Assistant Professor in the Computer Science Department at Illinois Institute of Technology (Illinois Tech), where she explores logical foundations of concurrency and develops formal methods for program verification. She earned her Ph.D. in Pure and Applied Logic from Carnegie Mellon University in 2021 under Frank Pfenning, followed by a postdoctoral fellowship at CMU with Limin Jia and Stephanie Balzer. Current affiliation: Illinois Tech (since ~2021) Previous affiliation: Carnegie Mellon University (Ph.D. and postdoc) Research focus: Type theory, logical verification, and security for concurrent systems Teaching: Courses on programming languages, type systems, and security Her research addresses fundamental challenges in concurrent programming, including: Developing modal logic frameworks for system verification Designing type systems for intermittent computing Creating behavioral type systems for security guarantees Applying relational logic to GPU security and secure compilation Investigating logical foundations of session-typed processes Formal verification of cyclic process networks Current research trends include: Hybrid dynamic verification for parallel systems Logical approaches to side-channel security Formal methods for cyber-physical systems Crash-resilient computing models Security verification in decentralized applications Noninterference proofs in session-typed concurrency Scientific recognition: NSF SaTC CORE Collaborative Award #2350217 Organizing committee member at Dagstuhl Seminar 26071 Professional leadership: Program committee co-chair for PLACES 2025 Committee roles at LICS 2026, ESOP 2026, ICFP 2025, and ECOOP 2025 Regular reviewer for ACM Transactions journals Laboratory involvement: Co-director of behavioral types research at Illinois Tech Collaboration with Carnegie Mellon's formal verification group Key participant in the FACCT workshop

Steve ZdancewicView profile

Professor

• Programming Languages
• Type Theory
• Logic
• +7 more

Steve Zdancewic is the Schlein Family President's Distinguished Professor and Associate Chair in the Department of Computer and Information Science at the University of Pennsylvania's School of Engineering and Applied Science. He is a leading researcher in programming languages, formal methods, and computer security with over two decades of impactful contributions to the field. His research interests span programming languages, type theory, logic, computer security, quantum programming, and formal verification. Zdancewic has made significant contributions to information-flow security, memory safety, program synthesis, and the verification of low-level systems. His work often bridges theoretical foundations with practical applications, particularly through the development of verified systems using Coq and other proof assistants. Analysis of his recent publications reveals a strong focus on formal verification techniques, particularly using Interaction Trees and the Coq proof assistant. His research trajectory shows consistent evolution from foundational work on information-flow security toward increasingly sophisticated verification of complex systems including LLVM, quantum computing, and distributed systems. His work demonstrates a commitment to building practically useful verification tools while maintaining rigorous theoretical foundations. Distinguished Paper Award for Semantics for Noninterference with Interaction Trees (ECOOP 2023) Schlein Family President's Distinguished Professor (2021) Distinguished Paper Award for Interaction Trees (POPL 2020) Christian R. and Mary F. Lindback Foundation Award for Distinguished Teaching (2018) IEEE MICRO top picks (2013) Alfred P. Sloan Fellow (2009-2010) NSF CAREER award (2004) Zdancewic has advised numerous PhD students who have gone on to successful careers in academia and industry. His research has been supported by significant grants from NSF, including the NSF Expedition on the Science of Deep Specification. He is actively involved in multiple major research projects including Vellvm (verified LLVM), DeepSpec, and quantum programming verification. Zdancewic also co-organizes Penn's PL Club programming languages research group with Benjamin Pierce and Stephanie Weirich.

Christoph BenzmüllerView profile

Professor

• Automated Theorem Proving
• Computational Metaphysics
• Artificial Intelligence
• +5 more

Prof. Christoph Benzmüller is a Full Professor at the University of Bamberg (Chair for AI Systems Engineering) and an adjunct professor at Freie Universität Berlin's Department of Mathematics and Computer Science. He is a leading researcher in automated reasoning, computational metaphysics, and formal logic systems. His work focuses on integrating higher-order logic into AI to achieve transparent and ethically grounded systems. Research Interests: His research spans automated theorem proving, formal ontologies, and normative reasoning in AI. Notably, he has formalized Gödel's ontological argument using computational methods and developed the Leo theorem provers for higher-order logic. He emphasizes the use of symbolic reasoning for ethical and legal AI frameworks. Grants & Projects: He leads projects like PetraKIP (AI portfolios for teacher education) and NFDIxCS (National Research Data Infrastructure). His work is funded by DFG, EPSRC, and the Volkswagen Foundation. He also collaborates with institutions globally, including Stanford and Cambridge. Awards: Recipient of the Central Teaching Award (FU Berlin) for his Computational Metaphysics course and a DFG Heisenberg Fellowship. His research on Gödel's argument gained international media attention. Education: Studied at Saarland University, where he earned his PhD (1999) and habilitation (2006).曾是专业长跑运动员，后转向学术研究。

Tobias NipkowView profile

Professor

• Formal Methods
• Interactive Theorem Proving
• Program Verification
• +9 more

Professor Tobias Nipkow is a leading researcher in formal methods and interactive theorem proving at the Technical University of Munich (TUM), affiliated with the School of Computation, Information and Technology and the Department of Computer Science. He is a core developer of the Isabelle proof assistant and leads the Theorem Proving Group. His work has profoundly influenced program verification, semantics, and formalized mathematics. University: Technical University of Munich School: School of Computation, Information and Technology Department: Department of Computer Science Research Group: Theorem Proving Group Key Projects: Isabelle, Archive of Formal Proofs, Concrete Semantics His research focuses on formal verification, higher-order logic, semantics of programming languages, and verified algorithms. He has pioneered the formalization of textbook algorithms, data structures like B+-trees and quadtrees, and logical systems. His work bridges theoretical foundations with practical tools for software correctness. The most recent publications show a strong trend in verifying classical algorithms (e.g., Gale-Shapley, Earley parser), data structures (B+-trees, deques), and decision procedures, primarily using Isabelle/HOL. His contributions span foundational logic, program analysis, and educational approaches to formal methods. Best Paper Award at CADE 28 (2021) Tobias Nipkow has made extensive contributions to advising and collaborative research, co-authoring with numerous researchers and students. He has secured support for large-scale formalization efforts and contributed to major projects like the Flyspeck proof of the Kepler conjecture. His work is supported by ongoing development of the Isabelle framework and the Archive of Formal Proofs. He leads the Theorem Proving Group at TUM, which is central to the development and application of Isabelle. The group fosters international collaboration, contributes to the Archive of Formal Proofs, and advances research in automated reasoning, semantics, and verified systems.

• Theorem Proving
• Automated Reasoning
• Formal Methods
• +14 more

Jasmin Blanchette is a Professor of Theoretical Computer Science and Theorem Proving at the Institute for Informatics, Ludwig-Maximilians-Universität München (LMU), where he also serves as Dean of Studies for Computer Science since January 2024. He is additionally affiliated as a guest researcher with the VeriDis group at Loria in Nancy, France. His research lies at the intersection of automated and interactive theorem proving, with a focus on higher-order logic and proof automation. Key projects include the development of tools like Sledgehammer, Nitpick, and Zipperposition, and foundational work on (co)datatypes and higher-order superposition. His recent publications reflect a strong trend in formalizing and verifying automated reasoning techniques, especially in higher-order logic, with applications in proof automation, SMT solving, and logical verification. Articles frequently appear in top venues such as CADE, ITP, and the Journal of Automated Reasoning. CADE 2023 Best Paper Award for 'Verified given clause procedures' FroCoS 2023 Best Paper Award (with Visa Nummelin and Sander Dahmen) IPA Dissertation Award (awarded to his student Petar Vukmirović) Dutch 'cum laude' distinction (awarded to his student Anne Baanen) Dutch Prize for ICT Research 2022 Blanchette has advised numerous PhD and postdoctoral researchers, many of whom are now active contributors to the formal methods community. He has received significant research grants through projects like Matryoshka and Nekoka. He is also the editor-in-chief of the Journal of Automated Reasoning and plays a central role in organizing key conferences such as ITP, CADE, and CPP. He leads an active research group at LMU, consisting of postdocs and PhD students working on topics such as higher-order superposition, formalization of voting systems, categorical logic, and proof search heuristics. The team collaborates closely with international groups, including those at Inria and TU Wien.

Sarah FakhouryView profile

Researcher

• Formal Methods
• Software Engineering
• AI-Assisted Programming
• +5 more

Sarah Fakhoury is a Senior Researcher in the Research in Software Engineering (RiSE) group at Microsoft Research, Redmond. Her work bridges formal methods, empirical software engineering, machine learning, and human-computer interaction to optimize developer cognitive effort in AI-assisted programming tools. Her research focuses on trustworthy AI for code generation , leveraging formal verification to ensure correctness in LLM-generated outputs. Key areas include program comprehension, source code readability, and empirical evaluation of developer-AI interaction. She develops tools like 3DGen for provably correct binary parsers and NL2Fix for natural language-based code repair. Her publications reveal strong trends in formal methods integration with AI (60% of recent work), empirical developer studies (30%), and readability/metrics innovation (10%). Keywords cluster around program verification, LLM evaluation, and cognitive load measurement. ACM/SIGSOFT Distinguished Paper Award (ICPC 2018) Fakhoury actively contributes to the academic community as PC member for ASE, ICSE, and ESEC/FSE. She co-organizes workshops like Muslims in ML at NeurIPS and mentors through SMeW. Her RiSE group collaboration with Shuvendu Lahiri and Madanlal Musuvathi drives Microsoft's trustworthy AI4Code initiatives, focusing on verifiable developer tools.