Find Academic Supervisors

William SlofstraView profile

Associate Professor

• Quantum Information
• Quantum Computation
• Non-local Games
• +13 more

William Slofstra is an Associate Professor in the Department of Pure Mathematics at the University of Waterloo and a member of the Institute for Quantum Computing. His primary academic home is within the Faculty of Mathematics at Waterloo, where he contributes to both pure mathematical research and quantum information science. Slofstra's research spans two major areas: the mathematics of quantum information and computation, and classical areas of Lie theory and algebraic combinatorics. Within quantum information, his main interests include non-local games, quantum correlation sets, self-testing and device-independence, entanglement theory, and multi-prover interactive proofs. He also investigates new mathematical tools such as decision problems in operator algebras and approximate representation theory that could advance these areas. In Lie theory and algebraic combinatorics, his research focuses on Kac-Moody groups and algebras, Schubert varieties, Coxeter groups, and hyperplane arrangements. His publication record shows a strong trajectory from more classical mathematical research toward quantum information theory, with recent work demonstrating deep connections between group theory and quantum non-locality. His most significant contributions include proving that the set of quantum correlations is not closed, establishing undecidability results for quantum correlation membership problems, and developing connections between hyperlinear profiles of groups and entanglement requirements in non-local games. Slofstra maintains an active research program with numerous collaborations, particularly with Ed Richmond in the area of Schubert varieties and with various researchers in quantum information. His work has appeared in top journals including the Journal of the American Mathematical Society, Forum of Mathematics Pi, and the Computational Complexity Conference. He is engaged in educational activities, having worked on turning his notes for PMATH 343 into a book titled 'Linear algebra and quantum probability.' He also maintains a podcast and YouTube channel, though he notes he has minimal social media presence.

• Automated Reasoning
• Theorem Proving
• Logic Languages
• +3 more

Geoff Sutcliffe is a Professor in the Department of Computer Science within the College of Arts and Sciences at the University of Miami. His research focuses on automated reasoning systems, theorem proving, and logic languages, with significant contributions to the Thousands of Problems for Theorem Provers (TPTP) infrastructure. He serves as an active researcher in formal methods and artificial intelligence, with recent work integrating cloud computing infrastructure for theorem proving systems. Sutcliffe's research interests center on automated reasoning, where he has developed foundational infrastructure for theorem proving competitions and benchmarking. His work spans classical first-order logic through higher-order logic and non-classical logics, with particular emphasis on translation methods between logical systems. He investigates how automated theorem provers can solve complex logical problems, including quantified modal logic and higher-order logical inference. His research also explores the integration of machine learning techniques, particularly reinforcement learning, to enhance theorem proving systems' performance and efficiency. Sutcliffe has received notable recognition including the 2023 Amazon Research Award for his work on Automated Theorem Proving Community Infrastructure in the AWS Cloud . This award highlights his contributions to building scalable infrastructure for the automated reasoning community using cloud technologies. His publication record shows consistent contributions to the field of automated theorem proving, with recent work focusing on system competitions (CASC), logic language frameworks, and the empirical assessment of progress in automated reasoning. Sutcliffe has been instrumental in organizing and evaluating automated theorem proving systems through annual competitions that serve as the de facto world championship for ATP systems.

William ManskyView profile

Assistant Professor

• Program Semantics
• Concurrency Verification
• Compiler Verification
• +6 more

William Mansky is an Assistant Professor in the Department of Computer Science at the University of Illinois at Chicago. His research focuses on the semantics, analysis, and correctness of programs, particularly concurrent programs, using interactive theorem provers like Coq and Isabelle. He works on compiler verification, formalizing memory models, and developing tools for proving the correctness of concurrent C programs through the Verified Software Toolchain. Ph.D., Computer Science, University of Illinois, Urbana-Champaign Mansky's research bridges the gap between programming and program verification, emphasizing practical approaches to ensure software correctness. His projects include proving the correctness of concurrent systems such as web servers and databases, formalizing memory models, and creating frameworks for symbolic analysis of concurrent programs. His recent work trends highlight applications of formal verification in concurrent programming, compiler optimizations, and generalized transition semantics for formal languages like CSP. He actively collaborates with researchers in the DeepSpec team and Lennart Beringer on verifying realistic systems code. Mansky is affiliated with the Formal Systems Laboratory and contributes to open-source projects like the Verified Software Toolchain. He is currently recruiting PhD students interested in formal logic, programming language behavior, and software correctness.

Moa JohanssonView profile

Associate Professor

• Artificial Intelligence
• Automated Reasoning
• Neuro-Symbolic Methods
• +4 more

Moa Johansson is an Associate Professor (Docent) at the Department of Computer Science and Engineering, Chalmers University, Sweden. She serves as Co-Director of Chalmers' Area of Advance in Information and Communication Technology, driving interdisciplinary AI research. PhD in Automated Theorem Proving (University of Edinburgh, 2009) Postdoc at University of Verona (2009-2011) Her research spans neuro-symbolic AI methods , combining neural networks with symbolic reasoning for applications in mathematics, sports science, and political science. Current projects include: NeSSy (2023-): Neuro-symbolic synthesis via reinforcement learning Neurodynamic Programming (2023-): Agent communication learning Countering Bias in AI (2023-): NLP applications in social sciences Bias in Political Analysis (2020-2025): WASP-HS funded Recent publications focus on theory exploration , neuro-symbolic methods , and AI applications across disciplines. Scientific achievements include a VINNMER Marie Curie Fellowship and Best Paper Award at CICM 2014. Led TRACKS project course on sports digitalization Developed HipSpec automated inductive prover

• Static Analysis
• Abstract Interpretation
• Fixpoint Algorithms
• +1 more

Sarah Tilscher, M.Sc., is a researcher at the Chair for Languages and Structures in Computer Science at the Technical University of Munich (TUM). She contributes to teaching tutorials for courses including Advanced Concepts of Programming Languages and Compiler Construction , and has supervised seminars on static analysis and programming paradigms. Her research focuses on: Incremental and interactive static analysis using abstract interpretation Verification of fixpoint algorithms in Isabelle theorem prover Development of the Goblint static analyzer for concurrent C programs Formal methods for program correctness and verification Her publications (11 recent works) predominantly explore static analysis techniques, abstract interpretation frameworks, and verification tools. Key themes include top-down solvers, weak relational domains, parser generators, correctness witnesses, and concurrency modeling, primarily applied to programming languages and compiler design. She actively supervises student theses on topics including incremental static analysis, visualization of analysis results, and verification of fixpoint algorithms. Current opportunities include master's projects on verified top-down solvers and bachelor's projects on solver code generation. As a core member of the Goblint project team, she develops static analysis tools for memory safety and termination verification, collaborating with TUM researchers and external partners.

Georg StruthView profile

Professor

• Logical and Algebraic Methods in Computer Science
• Formalised Mathematics
• Program Verification and Correctness
• +7 more

Professor Georg Struth is a faculty member at the School of Computer Science , University of Sheffield. He serves as Head of the Foundations of Computation research group. Research Interests include logical and algebraic methods in computer science, formalised mathematics with interactive theorem provers, program verification, and hybrid systems. His work bridges foundational algebra (Kleene algebras, quantales, catoids) with practical verification tools in Isabelle/HOL. Recent Publications focus on higher-dimensional automata, modal algebras, and convolution-based concurrency models. Grants include EPSRC funding for hybrid system verification and concurrent algorithms. Teaching covers Hardware and Software Verification and formalised mathematics.

Matthew DaggittView profile

Lecturer

• Formal Verification
• Neural Networks
• Automated Reasoning
• +4 more

Matthew Daggitt is a Lecturer in the Department of Computer Science and Software Engineering at the University of Western Australia (UWA), within the School of Physics, Maths and Computing. He holds a PhD in Computer Science from the University of Cambridge (2019), focusing on algebraic routing theory. Previously, he worked at Curtin University and Heriot-Watt University. His research emphasizes formal verification of software correctness, particularly in neural-symbolic systems and distributed algorithms. He leads the development of Vehicle , a tool for end-to-end verification of hybrid neural-symbolic programs. He also maintains the Agda theorem prover’s standard library and explores computational geology, such as zircon analysis for geological dating. Education: PhD in Computer Science (University of Cambridge, 2019). Research Interests: Formal verification, neural networks, automated reasoning, neuro-symbolic systems, distributed algorithms, and routing protocols. His work bridges theoretical foundations with practical tools like Vehicle, enabling rigorous verification of machine learning and classical software integration. Research Trends: Recent publications focus on neural network verification challenges, geological applications of zircon analysis, and advances in formal methods for AI safety. Collaborations span computer science and geology, reflecting his interdisciplinary approach. Advising & Projects: Accepts PhD students in formal verification and neural-symbolic systems. Active in open-source projects and tool development.

Magnus MyreenView profile

Researcher

• Formal Verification
• Programming Languages
• Compiler Design
• +4 more

Dr. Magnus Myreen is an affiliate researcher at the Department of Computer Science and Technology, University of Cambridge. His work focuses on formal verification, compiler correctness, and verified systems programming, with a particular emphasis on the CakeML project. He contributes to developing verified compilers, ensuring their reliability through rigorous mathematical proofs. His research integrates formal methods with practical systems programming challenges, addressing topics like SAT solver validation, hardware-software co-verification, and certified approximation algorithms. Myreen’s research interests span formal methods, programming languages, and compiler design. He explores techniques for verifying complex software systems, including device drivers, operating systems, and cryptographic functions. His projects emphasize end-to-end verification, ensuring that every component—from high-level specifications to machine code—is formally validated. Recent work includes advancements in verified propagation redundancy checking and the development of tools like Pancake for systems programming. He collaborates on initiatives such as the SAT Competition, contributing verified tools like VeriPB. His publications highlight trends in verified compilation, formalized mathematics, and the integration of interactive theorem provers with practical applications. Myreen’s efforts aim to bridge the gap between theoretical formal methods and real-world software engineering challenges.

Adam ChlipalaView profile

Professor

• Programming Languages
• Formal Verification
• Compiler Verification
• +2 more

Adam Chlipala is the Arthur J. Conner Professor of Computer Science at MIT, with appointments in the Computer Science and Artificial Intelligence Laboratory (CSAIL) and the Department of Electrical Engineering and Computer Science. His research integrates programming languages and formal methods to develop verified computer systems. Education: PhD in Computer Science, University of California, Berkeley MS in Computer Science, University of California, Berkeley BS in Computer Science, Carnegie Mellon University Research Focus: Dr. Chlipala's work spans: Verified compilers and programming tools Cryptographic protocol implementation Hardware description languages Proof automation in theorem provers High-performance parallel computing His current projects focus on rethinking abstractions for parallel systems with end-to-end formal verification. Teaching: He has created and teaches courses on verified software engineering (6.S057), programming fundamentals (6.1010), and formal reasoning about programs (6.5120). His educational materials include textbooks on Certified Programming with Dependent Types and Formal Reasoning About Programs. Awards and Honors: His research has been recognized with the German IT Security Award, Humies Gold Award for evolutionary computation, and multiple teaching prizes including the Jamieson Prize. He is an ACM Distinguished Member and NSF CAREER awardee. Research Teams: Dr. Chlipala leads the Programming Languages & Verification Group at MIT CSAIL. His startup Nectry develops no-code enterprise software based on the Ur/Web language and UPO proof system.

• Embedded Systems
• Formal Verification
• Synchronous Languages
• +1 more

Timothy Bourke holds dual appointments as a Researcher at Inria (PARKAS team) and Adjunct Professor at École polytechnique's Informatics Department. His research develops rigorous methods for modeling, programming, and verifying embedded control systems, with applications ranging from medical devices to wireless protocols. Dr. Bourke employs synchronous languages and interactive theorem provers to create practical verification approaches. His team has worked on projects involving robotic wheelchairs, microkernel operating systems, and wireless routing protocols. Current research focuses on bridging theoretical frameworks with real-world embedded system challenges. As an active member of the programming languages community, he serves on program committees for leading conferences including EMSOFT, ECRTS, and iFM. His pedagogical contributions include courses on programming language theory at École normale supérieure and École polytechnique.

Mark-Matthias ZymlaView profile

Research Fellow

• Computational Semantics
• Syntax/Semantics Interface
• Formal Pragmatics
• +5 more

Mark-Matthias Zymla is a post-doctoral researcher at the University of Konstanz's Department of Linguistics specializing in computational linguistics. His work bridges theoretical linguistic frameworks with practical computational implementations, focusing on semantic representation and processing. His primary research interests include computational semantics, the syntax/semantics interface, formal and computational pragmatics, with particular expertise in tense and aspect systems, argumentation theory, discourse particles, and rhetorical questions. He develops computational tools like LiGER (Linguistic Graph Expansion and Rewriting) that integrate syntactic analyses from LFG and Universal Dependencies with semantic annotations using Glue Semantics. Zymla has taught numerous courses at the University of Konstanz including Computational Semantics, Lexical Functional Grammar, Large Language Models, and Grammar Development across multiple semesters since 2015. His research is supported by projects like CUEPAQ (Visual Analytics for Argument Quality), VALIDA, and tense/aspect research funded by the Nuance Foundation. He actively participates in the ParGram community, co-organizing meetings in Rochester (2023) and Groningen (2022), and co-founded the 'SuP' reading group on semantics and pragmatics at Konstanz. His publications demonstrate strong interdisciplinary work connecting computational linguistics with visual analytics, argumentation studies, and cross-linguistic semantic annotation.

• Number Theory
• Algebraic Geometry
• Formalization of Mathematics
• +3 more

Sander Dahmen is an Associate Professor in the Department of Mathematics at Vrije Universiteit Amsterdam. He is affiliated with the Faculty of Science and actively involved in academic research and teaching. His primary research interests include Number Theory, Algebraic Geometry, and the formalization of mathematical proofs. Dahmen has contributed to foundational work in areas such as Dedekind domains, class groups of global fields, elliptic curves, and Diophantine equations. He has led research projects including the 'Formalizing Diophantine algorithms' (2022–2026) and 'New Diophantine Directions' (2017–2022), focusing on algorithmic and computational aspects. He currently teaches courses such as 'Number Theory' and 'Project Computer Assisted Proofs'. His research has been supported by grants, including the NWO tenure-track grant (2014–2019). His publications span topics like formalizing mathematical structures, elliptic curve computations, and solving complex Diophantine equations. Dahmen also serves as an external member of the exam committee for Boswell-Bèta in Utrecht since 2021. His work bridges foundational mathematics with computational methods, emphasizing rigor through formal proof systems like Coq.

Claudio Sacerdoti CoenView profile

Associate Professor

• Mathematical Knowledge Management
• Interactive Theorem Proving
• Logical Frameworks
• +14 more

Claudio Sacerdoti Coen is an Associate Professor in Computer Science at the Department of Computer Science and Engineering , University of Bologna. His research focuses on Mathematical Knowledge Management , Interactive Theorem Proving , and their applications to functional programming languages and markup languages like XML and MathML. He has led the DAMA project for didactic applications of theorem provers. Employment: Associate Professor (2017–present), previously Lecturer (2007–2017) Education: Ph.D. in Computer Science (University of Bologna, 2004), Master’s in Computer Science (2000) Research Interests include: Integration of XML-based Mathematical Knowledge Management with Interactive Theorem Provers (e.g., Coq, Matita) Reduction strategies in the Calculus of (Co)Inductive Constructions Formal verification of algorithms and compilers Constructive analysis and formal topology User interface design for proof assistants Publications over the last decade highlight advancements in: Efficient substitution mechanisms for lambda calculi Formalization of mathematical theorems (e.g., Lebesgue’s Dominated Convergence Theorem) Development of proof assistant frameworks (Matita kernel, ELPI interpreter) Mathematical document structuring and search engine design

Enrico TassiView profile

Researcher

• Interactive Theorem Proving
• Formal Verification
• Type Theory
• +5 more

Enrico Tassi is a researcher at Inria, France, affiliated with the STAMP team. His work focuses on the technology of formal proofs, particularly type theory, interactive theorem proving, and its application to formalizing mathematics. He is a key contributor to the development of tools like Coq-Elpi , Hierarchy-Builder , and the small scale reflection Coq extension. His research spans proof assistant architecture, software design, and formal verification, with a strong emphasis on free software principles. Enrico completed his Ph.D. at the University of Bologna in 2008, where he designed the Matita interactive theorem prover. He contributed to the formalization of the Odd Order Theorem and the Paral-ITP project, aiming to scale Coq for large mathematical libraries. His software projects include Elpi , a meta-language for proof assistants, and past contributions to Debian as a developer (2006–2016), focusing on integrating the Lua language into Debian systems. His publications highlight innovations in unification algorithms, tactical design, and proof structuring techniques. Articles address challenges in bi-directional type inference, pattern-based proof command focusing, and nonuniform coercion implementations. His work on small-scale reflection and Hierarchy-Builder demonstrates expertise in algebraic hierarchies and formal library management. Current efforts target enhancing OCaml-based systems through Elpi's high-level programming capabilities. Key Collaborations : Mathematical Components team (INRIA), D.A.M.A. Project Major Tools : Coq-Elpi, Hierarchy-Builder, Matita Formalization Efforts : Ordered Uniformities, Odd Order Theorem, Finite Group Theory

Sean HoldenView profile

Professor

• Automated Theorem Proving
• Machine Learning
• Artificial Intelligence
• +5 more

Sean Holden is a Professor in the Department of Computer Science and Technology at the University of Cambridge, affiliated with The Computer Laboratory. He holds positions at both the University and Trinity College. His research focuses on automated theorem proving, machine learning, and their intersections with formal methods and AI. He leads the development of the Connect++ theorem prover, which won the Best Newcomer award at CASC 2024. His work spans areas including connection calculus, graph neural networks, and reinforcement learning in games like Mahjong. Holden's academic contributions include over 50 publications in top venues such as IJCNN, ICPRAM, and Journal of Automated Reasoning. Notable works include foundational research on Bayesian methods in theorem proving and machine learning applications in bioinformatics and medical imaging. He serves as an Associate Editor for IEEE Transactions on Artificial Intelligence since 2023. His research group explores topics like protein graph embeddings, medical AI (e.g., breast cancer classification via MUGI-MRI), and the integration of machine learning with automated reasoning systems. Collaborations span institutions including Trinity College and international partners in computational biology and AI.