Find Academic Supervisors

Kenneth P. Birman is the N. Rama Rao Professor of Computer Science at Cornell University, where he has had a long and impactful career in distributed systems, cloud computing, and AI/ML infrastructure. He is known for foundational contributions to reliable and scalable distributed systems, and for leading high-impact projects such as Cascade, Vortex, and Derecho. He is also the author of a widely used textbook on reliable distributed systems and has founded multiple companies based on his research. Education: Ph.D. in Computer Science, University of California, Berkeley M.S. in Computer Science, University of California, Berkeley B.A. in Computer Science, Columbia University Research Interests: Professor Birman's research focuses on building reliable, secure, and scalable distributed systems . His current emphasis is on AI and ML infrastructure , particularly in reducing latency and improving performance through hardware acceleration, RDMA-based communication, and edge computing. He explores how to eliminate data movement bottlenecks in AI pipelines and how to support real-time, mission-critical applications in domains like healthcare, smart grids, and industrial IoT. His work spans systems programming, cloud computing, fault tolerance, and formal verification . He has designed systems that have been deployed in high-stakes environments such as the New York Stock Exchange, the Swiss Exchange, and the French Air Traffic Control system. Scientific Awards: ACM Fellow (1999) IEEE Fellow (2014) IEEE Tsutomu Kanai Award for innovations in distributed computing Teaching and Mentorship: Professor Birman teaches two courses in the fall semester: CS4414: Systems Programming and CS5416: Cloud and ML Systems Programming . He has advised numerous Ph.D. and M.S. students, including Alicia Yang, Tiancheng Yuan, Yifan Wang, Weijia Song, Edward Tremel, Sagar Jha, Jonathan Behrens, and Mae Milano. He has announced that Fall 2025 will be his last semester teaching, and he is no longer recruiting new students, though he will continue supervising current ones. Labs and Projects: He leads the Derecho Project and the Cascade/Vortex Project , both focused on high-performance distributed systems. These projects are collaborative efforts with students and industry partners, and the software is released under open-source licenses. He also maintains strong ties with Cornell's systems group and collaborates with faculty across CS, ECE, IS, and the Cornell Tech NYC campus.

• Distributed Systems
• Cloud Computing
• Machine Learning Systems
• +5 more

Kamalika Chaudhuri is a Professor in the Department of Computer Science and Engineering at the University of California, San Diego (UCSD), and also serves as a Director and Research Scientist with the FAIR team at Meta AI. Her research focuses on the foundations of trustworthy machine learning, including robust machine learning, learning with privacy, and out-of-distribution generalization. Dr. Chaudhuri has earned her PhD from UC Berkeley in 2007 with a dissertation on "Learning Mixtures of Distributions." Her academic journey has led her to become a leading researcher in machine learning theory with a particular emphasis on privacy and robustness. Her research interests span machine learning foundations with a strong focus on trustworthy AI . She investigates problems at the intersection of differential privacy , adversarial robustness , and out-of-distribution generalization . Her work addresses critical challenges in developing machine learning systems that maintain privacy while preserving utility, resist adversarial attacks, and generalize effectively beyond training data distributions. She has pioneered approaches in privacy-preserving machine learning, robust learning theory, and methods for detecting and mitigating data memorization in models. An analysis of her recent publications (2024-2025) reveals a strong focus on the intersection of privacy, security, and machine learning. Her work spans differential privacy mechanisms, membership inference attacks, memorization detection, and fairness certification. She has been particularly active in developing methods for privacy-preserving foundation models, with several papers on differentially private computer vision and language models. Her research demonstrates a consistent thread of addressing fundamental challenges in trustworthy AI while developing practical solutions that balance privacy, accuracy, and utility. Best Award at the ICLR 2024 Workshop on Privacy Regulation and Protection in Machine Learning Distinguished Paper Award at IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), 2024 Dr. Chaudhuri has advised numerous PhD students who have gone on to prominent positions at Google, DeepMind, Microsoft Research, and other leading AI institutions. Her group maintains an active research blog with guest posts from UCSD researchers. She has served in significant leadership roles including General Chair for ICML 2022 and Program Co-Chair for both ICML 2019 and AISTATS 2019, where she pioneered initiatives to improve reproducibility in machine learning research. Her research group at UCSD focuses on trustworthy machine learning, with current projects spanning privacy-preserving AI, robustness against adversarial attacks, and methods for ensuring reliable out-of-distribution generalization. The group collaborates closely with the FAIR team at Meta AI, where Dr. Chaudhuri serves as a Research Scientist.

• Machine Learning
• Trustworthy Machine Learning
• Differential Privacy
• +4 more

Jenna Wise DiVincenzo is an Assistant Professor at the Elmore Family School of Electrical and Computer Engineering at Purdue University. She specializes in research areas such as software verification, formal methods, and programming languages, with a focus on gradual verification techniques that combine static and dynamic analysis. Her work emphasizes usability and scalability in verification tools, and she has contributed to projects like Gradual C0 and gradual null-pointer analysis. Dr. DiVincenzo earned her PhD in Software Engineering from Carnegie Mellon University (2023) and a BS in Mathematics and Computer Science from Youngstown State University (2017). She has interned at IBM Research, MIT Lincoln Laboratory, and the Software Engineering Research and Empirical Studies Lab at YSU. Her awards include the Google PhD Fellowship, NSF GRFP Fellowship, and 2022 Rising Star in EECS. Her research projects span theoretical advancements in gradual verification, empirical studies on usability, and practical tool development. She advises PhD students (e.g., Craig Liu, Conrad Zimmerman) and collaborates on initiatives like gradual verification for Rust and educational tools to teach verification concepts. Her work also explores leveraging large language models for specification generation and enhancing verification tool soundness through formal proofs.

• Software Verification
• Formal Methods
• Programming Languages
• +5 more

Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.

• Programming Languages
• Networking
• Databases
• +5 more

Charalampos Papamanthou is an Associate Professor of Computer Science at Yale University, where he also serves as Co-director of the Yale Applied Cryptography Laboratory and a member of the Yale Institute for Foundations of Data Science. He holds affiliations with the Yale Center for Algorithms, Data, and Market Design. Additionally, he is Chief Scientist at Lagrange Labs. His research focuses on computer security and applied cryptography, particularly verifiable and privacy-preserving computations, leakage-abuse attacks on searchable encryption, and scalable blockchains/cryptocurrencies. He has advised numerous students and postdocs, and his work is supported by NSF, Protocol Labs, and JP Morgan. Research Interests: His primary areas include cryptographic protocols, privacy-preserving systems, blockchain infrastructure, secure cloud computing, and distributed consensus mechanisms. He has pioneered advancements in zero-knowledge proofs, private information retrieval, and dynamic searchable encryption. Awards: He has received prestigious awards such as the CCS Test-of-Time Award (2022), JP Morgan Faculty Research Award (2022), and NSF CAREER Award (2017). His contributions span over 140 publications in top venues like CRYPTO, CCS, and SODA. Teaching: He has taught advanced courses in cryptography, algorithms, and computer systems security at Yale and previously at the University of Maryland and Brown University. Recently, he chairs Yale’s PhD admissions in Computer Science. Labs & Teams: Leads the Yale Applied Cryptography Lab, focusing on real-world applications of cryptographic research. Collaborates with industry partners like Lagrange Labs to develop privacy-preserving technologies.

• Computer Security
• Applied Cryptography
• Verifiable Computations
• +5 more

Alexandra Boldyreva is a Professor at the Georgia Institute of Technology, holding joint appointments in the School of Cybersecurity and Privacy and the School of Computer Science. She serves as Associate Chair for Graduate Studies in the School of Cybersecurity and Privacy and coordinates the Information Security Master’s program in the College of Computing. Her affiliations include the Institute for Information Security & Privacy (IISP), the Algorithms, Combinatorics and Optimization (ACO) program, and the Algorithms and Randomness Center (ARC). She earned her Ph.D. in Computer Science from the University of California, San Diego, and holds bachelor’s and master’s degrees in applied mathematics from St. Petersburg State Technical University, Russia. Her research focuses on cryptography and information security, with notable contributions to encryption methods, authentication protocols, and privacy-preserving systems. Boldyreva’s work emphasizes provable security analysis of protocols like FIDO2 and TLS 1.3, as well as searchable encryption and data privacy techniques. Her recent studies include secure communication channel establishment, leakage quantification in encryption systems, and applications of fuzzy search in encrypted databases. She has received Test of Time Awards for foundational contributions to cryptography. Boldyreva leads initiatives in cybersecurity education and has secured grants for research in secure communication protocols and human-computing approaches to key exchange. Her interdisciplinary collaborations span computer science, mathematics, and privacy engineering.

• Cryptography
• Information Security
• Searchable Encryption
• +3 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.

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

Andrew Miller is an Associate Professor in the Electrical and Computer Engineering department at the University of Illinois, specializing in Programming Languages, Formal Methods, Software Engineering, Security and Privacy, and Systems and Networking. His research focuses on blockchain technologies, cryptography, and secure systems. Professor Miller's research spans multiple critical areas in modern computer security. His work primarily focuses on blockchain technologies , where he has made significant contributions to understanding and improving the security, privacy, and performance of systems like Bitcoin and Ethereum. He has conducted empirical analyses of privacy in the Lightning Network and developed protocols for confidential smart contracts. His work in cryptography includes research on multiparty computation, zero-knowledge proofs, and formal methods for cryptographic protocol design. Miller also investigates security vulnerabilities in proof-of-stake systems and resource exhaustion attacks, contributing to the robustness of decentralized systems. His applied security research extends to privacy-preserving health applications, as evidenced by his work on the Safer Illinois platform for COVID-19 contact tracing. Miller's publication record demonstrates consistent contributions to top security and systems venues including IEEE Security & Privacy, ACM CCS, Financial Cryptography, and USENIX Security. His research shows a clear trajectory from foundational work in blockchain security to more applied systems addressing real-world privacy and security challenges. Recent work focuses on making multiparty computation services publicly auditable and developing decentralized identity solutions that maintain compatibility with existing systems. Distinguished Reviewer Award, IEEE Security & Privacy 2018 Professor Miller has advised students including Vivek Nair, who joined the prestigious Hertz Fellows program in 2022. He has taught various courses including Introduction to Algorithms & Models of Computation, Advanced Computer Security, Cryptography, Applied Cryptography, and Ideal Functionality in Cryptography. His research has received support through grants including the SaTC: CORE: Medium project on "Automated Support for Writing High-Assurance Smart Contracts" in 2018. Miller is actively involved in research groups focusing on blockchain security, cryptographic protocols, and privacy-preserving systems. His lab appears to collaborate extensively with researchers across multiple institutions, as evidenced by the diverse author lists on his publications. Current work seems to be focused on making decentralized systems more secure, privacy-preserving, and accessible for real-world applications.

• Security and Privacy
• Cryptography
• Blockchain
• +4 more

Josef Urban is a leading researcher at the Czech Institute of Informatics, Robotics and Cybernetics (CIIRC) , Czech Technical University in Prague, heading the ERC Consolidator project AI4REASON . Previously, he held positions as a postdoc at Radboud University Nijmegen and assistant professor at Charles University in Prague, where he co-founded the Prague Automated Reasoning Group. Education Ph.D. in Computer Science (2004), Charles University, Prague M.S. in Mathematics (1998), Charles University, Prague B.S. in Economics (1995), Charles University, Prague Research Interests Urban specializes in automated reasoning over large formalized knowledge bases, combining deductive theorem proving and inductive machine learning . His work aims to realize "strong AI" through formalized mathematics, particularly using systems like Mizar and the AI/TP Challenges . He advocates for computer-verifiable mathematics as a foundation for AI progress. Article Trends Urban's publications focus on integrating machine learning with automated theorem proving in systems like ENIGMA and BliStr . Key trends include semantic guidance for ATPs, premise selection in formal libraries, and automated proof compression via concept invention. Scientific Contributions Head of ERC Consolidator project AI4REASON Marie-Curie Fellow at University of Miami Co-founder of Prague Automated Reasoning Group Editor for Formalized Mathematics Advising and Grants Urban has advised numerous PhD and MSc students including Daniel Kuehlwein, Krystof Hoder, and Yutaka Nagashima. He has secured grants like the ERC Consolidator Grant and Marie-Curie Fellowship . Labs and Collaborations Urban leads the AI4REASON team at CIIRC and collaborates with the Foundations Group at Radboud University. He contributes to projects like Mizar TWiki and XML-based API for Mizar , aiming to create a semantic AI ecosystem for formal knowledge.

• Automated Reasoning
• Machine Learning
• Theorem Proving
• +5 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.

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

Christina L. Garman is an Assistant Professor in the Department of Computer Science at Purdue University, where she joined in Spring 2018. Her research focuses on practical cryptography and cryptographic automation to make secure system development accessible to non-experts through error-resistant design methodologies. Her educational background includes: Bachelor of Science in Computer Science and Engineering from Bucknell University (2011) Bachelor of Arts in Mathematics from Bucknell University (2011) Master of Science in Engineering in Computer Science from Johns Hopkins University (2013) Doctor of Philosophy in Computer Science from Johns Hopkins University (2017) Professor Garman's work centers on real-world cryptographic system security, spanning protocol analysis (e.g., RC4 in TLS, Apple iMessage flaws), decentralized anonymous systems (Zerocash/ZCash), and cryptographic automation. She pioneered techniques for removing human error in cryptographic deployments through automated tools and frameworks. Her research bridges theoretical cryptography with practical implementation challenges in privacy-preserving technologies and secure infrastructure. Analysis of her 2021-2025 publications reveals expanding research horizons: hardware security vulnerabilities (Rowhammer, SGX), privacy network enhancements (Tor onion services), software supply chain security (SBOM tools), and advanced cryptographic protocols (zkSNARKs, MPC). This evolution demonstrates consistent focus on real-world security impact while diversifying into hardware-software cross-layer threats and formal verification methods for cryptographic implementations. Her major scientific recognitions include: NSF CAREER Award (2021) for cryptographic automation research ACM CCS Best Paper Award (2016) for iMessage security analysis IEEE Test of Time Award (2024) for foundational Zerocash work Professor Garman co-founded ZCash, a privacy-focused cryptocurrency based on her Zerocash protocol, and her NSF CAREER grant supports cryptographic automation development. Her research has received significant media coverage in The Washington Post, Wired, and The New York Times, highlighting real-world relevance. While specific student advising details aren't public, her active publication record indicates ongoing mentorship of graduate researchers in security and cryptography. Her work maintains strong industry connections through ZCash development and Tor network contributions, with recent projects like keyless CDNs demonstrating practical applications of cryptographic automation. She remains a leading voice in cryptographic research communities through conference participation and collaborative projects addressing evolving security challenges.

• Cryptography
• Information Security
• Cryptographic Automation
• +3 more

Dr. Chunyan Mu serves as a Senior Lecturer in the School of Natural and Computing Sciences at the University of Aberdeen, actively contributing to both academic instruction and cutting-edge research in computing science while currently accepting new PhD students. Her research program centers on Trustworthy AI and Safe Autonomy, with specialized expertise in formal verification of responsibility, accountability, and privacy mechanisms within multi-agent systems. She investigates resilience frameworks for autonomous intelligent systems and develops advanced methodologies for information flow security analysis, bridging theoretical computer science with practical security implementations. Analysis of her publication trajectory (2014-2025) reveals consistent innovation in applying formal methods to security-critical systems. Key thematic developments include probabilistic strategy logic for observability analysis, quantitative verification of opacity properties, and game-theoretic approaches to security verification, demonstrating increasing sophistication in handling multi-agent accountability and system resilience challenges. Dr. Mu currently supervises PhD candidates and offers a fully funded doctoral position focused on formal verification of safety properties in autonomous systems, providing comprehensive financial support including tuition coverage, £20,780 annual stipend, and dedicated research funding for candidates with strong backgrounds in formal methods and artificial intelligence.

• Artificial Intelligence
• Computer Security
• Multi-Agent Systems
• +3 more

Justine Sherry is the A. Nico Habermann Associate Professor of Computer Science at Carnegie Mellon University, affiliated with the College of Engineering. She holds a PhD (2016) and MS (2012) from UC Berkeley and a BS/BA (2010) from the University of Washington. Her research focuses on networked systems, including middleboxes, cloud computing, congestion control, and hardware acceleration (e.g., SmartNICs/FPGAs). Notable projects include Pigasus (open-source 100Gbps IDS), APLOMB (cloud-based middlebox scaling), and BlindBox (encrypted traffic scanning). Her academic roles include serving on the SIGCOMM CARES Committee, DARPA ISAT Study Group, and ACM CoNEXT Steering Committee. Awards include the Alfred P. Sloan Fellowship, VMware Systems Award, and IETF Applied Networking Prize. She advises over 15 students and collaborates with industry partners like Intel and VMware. Research highlights include radical shifts in datacenter architectures (SmartNIC compute control), fairness in congestion algorithms (BBR analysis), and database-proxy innovations (Tigger with eBPF). Her teaching emphasizes systems as science labs, integrating experimental design and hypothesis testing into projects. Education: PhD UC Berkeley (2016), MS UC Berkeley (2012), BS/BA University of Washington (2010) Labs/Teams: CyLab, SNAP Research Group, CMU Portugal Collaboration Grants: NSF, Intel, Google Faculty Awards

• Computer Networking
• Networked Systems
• Middleboxes
• +5 more

Marina Blanton is an Associate Professor in the Department of Computer Science and Engineering at the University at Buffalo, and Faculty Director of Women in Science and Engineering within the School of Engineering and Applied Sciences. She holds a PhD in Computer Science from Purdue University (2007), along with multiple advanced degrees in Computer Science and Electrical Engineering from prestigious institutions in the US and Russia. Her research focuses on applied cryptography, information security, and privacy-preserving computation and outsourcing. She has pioneered work on secure multi-party computation protocols, privacy-preserving biometric authentication, and secure data analytics across distributed systems. Her contributions include foundational frameworks like PICCO, a compiler for private distributed computation, and advancements in protocols for genomic data analysis and floating-point secure computation. Blanton has been recognized with numerous awards, including IEEE and ACM Senior Membership (2016/2015), the ACM CCS Test of Time Award (2015), and the AFOSR Young Investigator Award (2013). Her research has been supported by grants such as NSF SaTC awards and AFOSR funding. Her work emphasizes practical implementations of secure computation, with applications in healthcare, biometrics, and distributed data systems. She has advised numerous students and contributed to educational initiatives promoting women in STEM through her leadership roles.

• Applied Cryptography
• Information Security
• Privacy-Preserving Computation
• +3 more

Cezary Kaliszyk is a Professor in Theoretical Computer Science at the University of Melbourne, previously affiliated with the University of Innsbruck. He is actively involved in research and leadership in formal methods, automated reasoning, and machine learning for theorem proving. Research Interests: Automated Reasoning and Interactive Theorem Proving Formalized Mathematics and Proof Automation Machine Learning for Logic and Theorem Proving Integration of AI with Proof Assistants (Coq, Isabelle) Dependent Type Theory and Higher-Order Logic His recent publications (2023–2025) span topics in dependently-typed logic, learning for proof guidance, formalization of surreal numbers, and blockchain-based formal methods. The works consistently bridge formal logic with machine learning, emphasizing automation, explainability, and cross-system integration. Scientific Leadership and Projects: Principal Investigator, ERC project FormalWeb3 Lead Developer, CoqHammer , Tactician , ProofWeb WG5 Leader, COST Action EuroProofNet (until 2024) Contributor to HOL(y)Hammer , Isabelle Enigma He supervises multiple PhD students and has mentored several graduates in formal methods and AI. He teaches courses in theoretical computer science, logic, and machine learning. There are no listed awards in the provided data, but his extensive publication record and project leadership indicate significant recognition in the field. Labs and Research Groups: He leads a research group focused on formal methods and learning-based reasoning, collaborating internationally on projects involving proof automation, formal libraries, and semantic technologies.

• Automated Reasoning
• Formal Methods
• Formalized Mathematics
• +7 more