Find Academic Supervisors

Sam StatonView profile

Professor

• Programming Language Theory
• Probabilistic Programming
• Quantum Computing
• +3 more

Sam Staton is a Professor of Computer Science at the University of Oxford and Senior Research Fellow at Jesus College. He holds a Royal Society University Research Fellowship and leads the ERC-funded BLaSt project on probabilistic programming. His research focuses on programming language theory, particularly probabilistic and quantum programming, and category theory. Staton earned his PhD from the University of Cambridge in 2007, with prior roles as a lecturer and researcher at Cambridge, Paris, and Nijmegen. Research Interests: His work explores foundational aspects of programming languages, including semantics, algebraic effects, and applications to quantum computing and statistical modeling. Recent grants include the ARIA Safeguarded AI initiative and an AFOSR award. Education: PhD in Computer Science (2007), BA from Cambridge (2002). Students & Collaborators: Supervises multiple PhD students and postdocs, including those funded through his grants. Notable advisees include Swaraj Dash (now at Heriot-Watt) and Mathieu Huot (postdoc at MIT). Awards & Grants: Royal Society Fellowship, ERC Consolidator Grant (BLaSt), EATCS Best Paper Award, and Facebook Research Award. Labs & Teams: Leads the BLaSt project and collaborates on quantum programming via algebraic effects. Engaged in editorial roles for ACM Transactions on Quantum Computing and program committees for major conferences like POPL and LICS.

Peter SelingerView profile

Professor

• Quantum Computing
• Category Theory
• Mathematical Logic
• +4 more

Peter Selinger is a Professor in the Department of Mathematics and Statistics at Dalhousie University , with a cross-appointment in Computer Science. He specializes in mathematical methods in computer science, particularly quantum computing and combinatorial game theory . His work on quantum programming languages like Quipper and foundational research in category theory has garnered international recognition. Education : Ph.D. in Mathematics (University of Pennsylvania, 1997), undergraduate studies in Mathematics (Technische Universität Darmstadt). Research Interests span quantum computing, category theory, and combinatorial game theory. He has pioneered formalisms for quantum programming languages, developed categorical models for quantum mechanics, and analyzed game-theoretic structures in games like Hex. His recent work includes linear dependent type theory , quantum circuit synthesis , and combinatorial game classification . Publications demonstrate expertise in quantum programming languages, categorical semantics, and game theory. Key trends include Hamiltonian simulation , Clifford+T circuits , and monotone game realization . Scientific Honors include the Killam Professorship (2017–2022), Faculty of Science Award for Excellence in Teaching (2023), and fellowships from the Alfred P. Sloan Foundation and German National Scholarship Foundation . Students he has supervised include PhD graduates Xiaoning Bian , Francisco Rios , and Neil J. Ross , along with MSc students like Fahimeh Bayeh and Seth Greylyn . He has advised 16 postdoctoral researchers.

Paul LarsonView profile

Professor

• Set Theory
• Topology
• Model Theory
• +3 more

Paul Larson is a Professor of Mathematics at Miami University. His research focuses on set theory, topology, and model theory, with particular expertise in forcing axioms, descriptive set theory, and infinitary logic. He holds a Ph.D. in Mathematics from the University of California, Berkeley. His work bridges foundational mathematical logic with applications in topology and combinatorics. Key contributions include studies on canonical models under fragments of the Axiom of Choice, polar forcings, and cardinal characteristics. Larson has collaborated extensively with leading researchers such as Saharon Shelah and Jindřich Zapletal. His publications span prestigious journals like the Annals of Pure and Applied Logic and Transactions of the American Mathematical Society. Beyond research, he contributes to the academic community through editorial work and expository writings on historical developments in determinacy theory. Education: Ph.D., Mathematics, University of California, Berkeley Research interests emphasize foundational questions in set theory with applications to topology and model theory. His recent work explores advanced forcing techniques, square principles in Pmax extensions, and combinatorial properties of cardinal invariants. Publications reflect interdisciplinary engagement, including crystal structure prediction in high-pressure chemistry and operator theory in functional analysis. Despite an extensive publication record, no specific scientific awards are documented here. His advising and grant activities remain unspecified in the provided texts. Collaborations span international institutions, reflecting his role as a central figure in contemporary set theory research.

Sanjit A. SeshiaView profile

Professor

• Formal Methods
• Cyber-Physical Systems
• Computer Security
• +10 more

Sanjit A. Seshia is the Cadence Founders Chair Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley . He is affiliated with the Group in Logic and the Methodology of Science and participates in centers like the Industrial Cyber-Physical Systems Center , Berkeley AI Research , and the Simons Institute for the Theory of Computing . Research interests include formal methods for automated verification and synthesis of dependable systems, with applications to cyber-physical systems , AI-based autonomy , and computer security . His work spans SMT solving, model counting, syntax-guided synthesis, and algorithmic improvisation, with tools like UCLID5 , VerifAI , and Scenic for verifying autonomous systems and educational platforms like CPSGrader . Students and collaborators include notable researchers such as Dorsa Sadigh (Stanford), Daniel Fremont (UC Santa Cruz), and Hazem Torfah (Chalmers). He has co-founded startups like Decyphir and 20ⁿ Labs based on his research.

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.

Supratik ChakrabortyView profile

Professor

• Formal Methods
• Formal Verification
• Automated Synthesis
• +7 more

Supratik Chakraborty serves as the Bajaj Group Chair Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Bombay. He maintains dual affiliations with the Centre for Formal Design and Verification of Software and the Centre for Liberal Education at IIT Bombay, demonstrating his cross-disciplinary engagement. Professor Chakraborty's research spans formal methods with focus on formal verification, rigorous analysis of system models, and automated synthesis of systems from specifications. His work bridges theoretical foundations with practical applications, particularly in developing mathematically provable guarantees for increasingly complex hardware, software, and intelligent systems. Current research interests include constrained counting and sampling, scalable formal verification of software and hardware systems, automated synthesis of programs and circuits, and applications of automata, logic and finite model theory to practical verification challenges. His publication trajectory shows a significant evolution from traditional hardware and software verification toward addressing verification challenges in machine learning and AI systems. Recent work increasingly focuses on interpretability of black-box models, verification of neural networks, and synthesis techniques applicable to intelligent systems. The research demonstrates strong interdisciplinary connections between formal methods, programming languages, and artificial intelligence. IIT Bombay Excellence in Thesis (CSE) Award 2011 (for Bhargav Gulavani's thesis) IIT Bombay Excellence in Thesis (CSE) Award 2017 (for Abhisekh Sankaran's thesis) Best Paper in Algorithms and Architecture track at IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1998 Professor Chakraborty has successfully supervised 11 doctoral students, with research spanning formal verification techniques, Boolean functional synthesis, constrained counting, and applications to hardware and software systems. His students have gone on to positions at major institutions including Microsoft Research, TCS Research, Georgia Tech, and BARC, reflecting the strong industry and academic impact of his mentorship. Current research directions show increasing emphasis on verification challenges posed by machine learning systems and AI. His research group at IIT Bombay, while not explicitly named in the materials, appears to focus on formal methods with strong connections to the Centre for Formal Design and Verification of Software. The group maintains active collaborations with international researchers including Moshe Y. Vardi at Rice University, and has made significant contributions to verification tools like VeriAbs that bridge theoretical advances with practical applications.

• Programming Language Theory
• Semantics of Programming Languages
• Domain Theory
• +7 more

Gordon Plotkin is a Professor at the School of Informatics, University of Edinburgh, where he is affiliated with the Laboratory for Foundations of Computer Science (LFCS). His research lies at the intersection of theoretical computer science and programming language semantics, with a profound influence on the formal understanding of computation. His research interests include Programming Language Theory, Semantics of Programming Languages, Domain Theory, Operational Semantics, Lambda Calculus, Type Theory, Concurrency Theory, and Algebraic Effects. His seminal work on structural operational semantics and domain theory has laid the foundation for modern semantics of programming languages. His publications span over five decades, showing a sustained and evolving research trajectory from foundational work in lambda calculus and domain theory to recent contributions in algebraic effects, probabilistic computation, and biochemical systems modeling. The articles demonstrate a consistent focus on formal methods, mathematical rigor, and the algebraic structure of computational effects. He has collaborated with leading researchers including Martín Abadi, John Power, Glynn Winskel, and John Reynolds. His work continues to influence both theoretical and practical developments in programming languages and systems. Gordon Plotkin has made foundational contributions to computer science, particularly through his development of structural operational semantics and domain-theoretic models of computation. He has advised numerous researchers and supervised many influential PhD theses, though specific student names are not listed in the provided text. His work has been supported by long-standing affiliations with the Laboratory for Foundations of Computer Science and the University of Edinburgh, and he has contributed to major collaborative projects in programming language design and verification. He is associated with several research groups and labs, most notably the Laboratory for Foundations of Computer Science (LFCS), which serves as a hub for theoretical research in programming languages, semantics, and logic at the University of Edinburgh.

Wolfgang KunzView profile

Professor

• Hardware Safety and Security
• Formal Hardware Verification
• Embedded Computing Systems
• +5 more

Wolfgang Kunz is a Full Professor (C4, W3) and Chair of Electronic Design Automation at the Technische Universität Kaiserslautern since 2001. His academic career spans multiple prestigious institutions, including Goethe-University Frankfurt/Main and the University of Massachusetts, Amherst. He has held leadership roles such as Dean (2005-2007) and Vice-Dean (2007-2009) at TU Kaiserslautern. Habilitation (Dr. rer. nat. habil.), Computer Science, University of Potsdam (1996) Doctoral degree (Dr.-Ing.), Electrical Engineering, University of Hannover (1992) Dipl.-Ing. degree, Karlsruhe Institute of Technology (1989) His research focuses on hardware verification, security, and optimization, particularly in embedded systems and processors. His work on formal verification methods has been commercialized by companies like Synopsys, Mentor Graphics, and Siemens EDA. His 2016-2021 publications address critical security issues such as Spectre/Meltdown and introduce innovative verification frameworks adopted by industry leaders like Infineon and OneSpin Solutions. Scientific awards include the IEEE Fellow (2006), German IT Society Award (2005), and TU Kaiserslautern Distinguished Teaching Award (2016). He has served on editorial boards of major journals and coordinated the Erasmus Mundus European Master Program in Embedded Computing Systems since 2010. Key students: Jörg Bormann, Raik Brinkmann, Tobias Ludwig Collaborations: Siemens EDA, Infineon, AbsInt, Intel SCAP Spin-offs: LUBIS EDA, OneSpin Solutions

Cezary KaliszykView profile

Professor

• Automated Reasoning
• Formal Methods
• Formalized Mathematics
• +7 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.

Sanjay JainView profile

Professor

• Inductive Inference
• Recursion Theory
• Complexity Theory
• +3 more

Sanjay Jain is a Provost's Chair Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). His research focuses on theoretical computer science with particular emphasis on inductive inference, recursion theory, complexity theory, and computational learning theory. Education: B.Tech. in Computer Science from Indian Institute of Technology Kharagpur, India (1986) M.S. in Computer Science from University of Rochester, USA (1988) Ph.D. in Computer Science from University of Rochester, USA (1990) Professor Jain's research spans multiple areas of theoretical computer science. His primary contributions are in computational learning theory, where he has made significant advances in understanding the intrinsic complexity of language identification and the limits of inductive inference. His work on recursion theory explores fundamental questions about computability and complexity, while his research in complexity theory addresses structural aspects of computational problems. A notable achievement was his work on "Deciding Parity Games in Quasipolynomial Time," which won the prestigious STOC 2017 best paper award and later the EATCS-IPEC Nerode Prize. Professor Jain's publication record shows a consistent focus on theoretical foundations of computer science, particularly in learning theory and computational complexity. His recent work has expanded into automatic structures, semiautomatic models, and connections between computational learning and algebraic structures. There is a clear progression from foundational work on language identification to more complex models involving automatic functions, transducers, and connections to mathematical logic. Scientific Awards: STOC 2017 Best Paper Award for "Deciding Parity Games in Quasipolynomial Time" EATCS-IPEC Nerode Prize (2021) Professor Jain has served on the editorial board of Information and Computation and has been actively involved in the academic community through program committee memberships for major conferences including COLT, ALT, LATA, TAMC, and PRICAI. He has held leadership roles as program co-chair for ALT 2000 and ALT 2013, and conference chair for ALT 2005. His work has been supported by various research grants, though specific details are not provided in the available materials. Professor Jain leads research in theoretical computer science at NUS, where he has built a strong research group focused on computational learning theory and related areas. His work often involves collaborations with researchers from around the world, particularly with Frank Stephan, with whom he has co-authored numerous papers. His research group has made significant contributions to understanding the fundamental limits and possibilities of computational learning models.

Franziska JahnkeView profile

Professor

• Model Theory
• Set Theory
• Algebra
• +3 more

Prof. Dr. Franziska Jahnke is a Professor in the Faculty of Mathematics and Computer Science at the University of Münster, affiliated with the Institute for Mathematical Logic and Foundational Research. She specializes in model theory and its applications to algebra, particularly valued fields, set theory, and arithmetic definability. Her research bridges foundational mathematics and algebraic structures, with a focus on henselian valuations, NIP fields, and combinatorial aspects of valued fields. Education: Diplom in Mathematics from Albert-Ludwigs-Universität Freiburg (2009), DPhil in Mathematics from the University of Oxford (2013). Academic roles include Junior Professor at Münster (2017–2024), and a visiting position at the University of Amsterdam (2023–2024). Research Interests: Model theory of fields, arithmetic definability of valuations, perfectoid fields, and connections to infinite combinatorics. Key contributions include work on Ax-Kochen-Ershov principles, NIP fields, and classification conjectures in strongly dependent fields. Recent Activities: Organized workshops on non-archimedean geometry and model theory of valued fields. Recipient of the Teaching Prize 2022 and a fellow of the Daimler und Benz Stiftung. Deputy Equal Opportunity Representative in her department. Supervision: Advised multiple PhD students (e.g., Blaise Boissonneau, Simone Ramello) and postdocs. Taught courses on algebra, logic, and model theory, including lectures on valued fields and stability theory.

Leslie ValiantView profile

Professor

• Complexity Theory
• Machine Learning
• Parallel Computation
• +4 more

Leslie Valiant is the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics in Harvard University's School of Engineering and Applied Sciences, where he has held a faculty position since 1982. A foundational figure in theoretical computer science, his work bridges artificial and natural computational phenomena across multiple disciplines. His academic background includes education at: King's College, Cambridge Imperial College, London Ph.D. in Computer Science from Warwick University (1974) Valiant's research spans computational complexity , machine learning theory , parallel systems , and computational neuroscience . He pioneered the PAC (Probably Approximately Correct) learning framework that established computational learning theory as a rigorous field. His holographic algorithms work revealed deep connections between computational complexity and statistical physics, while his neuroidal model and evolvability theory provide computational explanations for cognitive processes and biological evolution. Current investigations focus on cortical computation primitives and knowledge infusion architectures. His publication trends show increasing integration of neuroscience with computational theory since 2010, with dominant themes in holographic computation (2006-2018), cortical modeling (2012-2018), and evolvability (2009-2017). The work consistently applies computational complexity analysis to biological and cognitive systems. Major recognitions include: Nevanlinna Prize (1986) for mathematical aspects of computer science Knuth Award (1997) for foundational algorithms contributions EATCS Award (2008) for theoretical computer science impact Turing Award (2010) for computational learning theory and complexity Fellowship in the Royal Society and National Academy of Sciences Valiant's research has been supported by NSF and international grants enabling cross-disciplinary work in computational neuroscience and evolutionary algorithms. While specific advisees aren't documented in source materials, his theoretical frameworks have shaped generations of researchers in machine learning and complexity theory. His current research group explores neuroidal architectures for cognitive computation, investigating how cortical circuits achieve robust information processing through in-circuit testing methodologies. Ongoing projects aim to identify fundamental computational primitives in neural systems and develop biologically inspired AI frameworks.

Mingsheng YingView profile

Professor

• Quantum Computation
• Quantum Programming
• Model-checking Quantum Systems
• +5 more

Mingsheng Ying is a Distinguished Professor and Research Director of the Centre for Quantum Computation and Intelligent Systems (QCIS) at the Faculty of Engineering and Information Technology, University of Technology Sydney, Australia. He also holds the position of Cheung Kong Professor at the State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing, China. Professor Ying graduated from the Department of Mathematics, Fuzhou Teachers College, Jiangxi, China, in 1981. His primary research interests span quantum computation (particularly quantum programming and model-checking quantum systems), programming theory and formal methods, and the foundations of artificial intelligence (focusing on logic and uncertainty). As an author of the books "Foundations of Quantum Programming" (Elsevier - Morgan Kaufmann 2016) and "Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs" (Springer-Verlag, 2001), he has published over 100 papers in top international journals and conferences. His recent research publications demonstrate a strong focus on quantum programming languages, verification techniques for quantum systems, and the theoretical foundations of quantum computation. The trend in his work shows increasing emphasis on formal verification methods for quantum systems, particularly model-checking techniques for quantum Markov chains and quantum processes. His research bridges theoretical computer science with quantum information theory, creating frameworks for reliable quantum software development. Editorial Board, Artificial Intelligence, Elsevier, Amsterdam Editorial Board, Fuzzy Sets and Systems, Elsevier, Amsterdam Vice President, International Fuzzy Systems Association (elected in 2005) Program Chair, IFSA 2005, World Congress of International Fuzzy Systems Association Chairman, Chinese Association of Fuzzy Systems and Mathematics Professor Ying has secured significant research funding including multiple Australian Research Council Discovery Projects such as "Model-checking quantum Markov chains: towards verification techniques for quantum cryptographic systems" (2013-2015) and "Process algebra approach to distributed quantum computation and secure quantum communication" (2011-2013). His work has also received funding from the National Natural Science Foundation of China and Tsinghua University. At QCIS, he leads research in quantum software theory and methodology, with applications in quantum cryptography and secure communication.

Richard GarnerView profile

Lecturer

• Category Theory
• Algebraic Structures
• Homotopy Type Theory
• +3 more

Richard Garner is a lecturer at Macquarie University's School of Mathematical and Physical Sciences, Faculty of Science and Engineering. He specializes in teaching mathematics to engineering and computing students in units like MATH2055 and MATH1007, focusing on problem-solving and real-world applications. His teaching philosophy emphasizes authentic mathematical experiences, blending abstract concepts with practical examples, such as connecting multivariable calculus to AI technologies. School: School of Mathematical and Physical Sciences University: Macquarie University Teaching Areas: Mathematics for engineering and computing, convolution, multivariable calculus Richard won a Student Nominated Award in the 2023 Vice Chancellor’s Learning and Teaching Awards, reflecting his commitment to student-centered education. He prioritizes clarity in course design, using visual tools and accessible materials to enhance learning, and fosters a supportive environment where students feel comfortable asking questions. Key Teaching Strategies Organized iLearn layouts following Macquarie University's standards Multiple formats for lecture materials (diagrams, color-coded slides) Weekly task clarity and real-world problem framing Live worked examples and transparent success criteria His research spans category theory, computational effects, and homotopy theory, with publications on topics like comodels, monoidal bicategories, and enriched categories. Richard's work bridges abstract mathematics with applications in computer science and logic. Scientific Awards 2023 Vice Chancellor’s Learning and Teaching Award (Student Nominated) Students praise his ability to make complex concepts intuitive, his enthusiasm for mathematics, and his dedication to explaining the 'why' behind the subject. His teaching design, including time-sensitive banners and structured weekly content, has been highlighted as exemplary.

Manfred DrosteView profile

Professor

• Theoretical Computer Science
• Automata Theory
• Logic
• +6 more

Manfred Droste is a Professor at the Institute of Computer Science of the University of Leipzig, where he leads the Research Group on Automata and Formal Languages. He serves as Director of the Graduate Centre Mathematics, Computer Science and Natural Sciences and is Vice-speaker of the DFG-Research Training Group Quantitative Logics and Automata. His academic career spans decades of research and leadership in theoretical computer science and algebra. Prof. Droste's research focuses on theoretical computer science, particularly automata theory, logic, algebraic models for concurrent systems, and domain theory. In algebra, his interests include model theory, automorphism groups, and ordered algebraic structures. His work bridges theoretical foundations with practical applications in formal language theory and quantitative systems. His extensive publication record demonstrates a consistent focus on weighted automata, formal languages, and their logical characterizations. Over the years, his research has evolved to address increasingly complex quantitative models, with recent work focusing on weighted complexity classes, weighted linear dynamic logic, and decidability boundaries for weighted automata. Prof. Droste has received significant recognition including election to Academia Europaea, an honorary doctorate from Immanuel Kant Baltic Federal University, and fellowship in the Asia-Pacific Artificial Intelligence Association. These honors reflect his substantial contributions to theoretical computer science. He has supervised numerous PhD students including Dietrich Kuske, Paolo Boldi, and Karin Quaas, many of whom have become prominent researchers. His extensive grant portfolio includes multiple DFG projects on weighted automata and international collaborations through DAAD funding. Prof. Droste leads a vibrant research team including Andrea Hesse, Karin Quaas, Erik Paul, and others. He has organized the international workshop series "Weighted Automata: Theory and Applications" since 2002, fostering global collaboration in this specialized field.