Find Academic Supervisors

Shraddha BarkeView profile

Researcher

• Programming Languages
• Formal Methods
• Artificial Intelligence
• +2 more

Shraddha Barke is a Senior Researcher at Microsoft Research (RiSE group) in Redmond, United States. She previously held an affiliation with the University of California at San Diego. Her research spans Programming Languages , Formal Methods , and Artificial Intelligence , with a focus on program synthesis and AI-assisted code generation. Notable Contributions : POPL Student Volunteer Co-Chair (2024), Committee Member for SPLASH 2025, ESEC/FSE 2025, and HATRA 2024/2025. GitHub Projects : Key contributions to SyPhon (constraint-based phonological rule inference) and Phonosynthesis (phonological transformation learning). Her work on program synthesis and constraint-based learning has produced papers in top venues like OOPSLA and ICFP. She explores intersections between code generation , machine learning , and natural language processing , with tools like Z3 theorem prover for constraint satisfaction. She has also participated in educational initiatives like SIGPLAN-M Introduction at ICFP 2023 and PLMW @ POPL.

• Programming Languages
• Formal Verification
• Compilers
• +6 more

Clément Pit-Claudel is an Assistant Professor at École Polytechnique Fédérale de Lausanne (EPFL), where he heads the SYSTEMF lab. Previously, he was a PhD candidate at MIT under Adam Chlipala and a Senior Applied Scientist at Amazon AWS. His research focuses on programming languages, compilers, and formal verification, with broader interests in systems engineering, hardware design languages, security, performance engineering, and type theory. Key research areas include extensible compilation, hardware design languages verification, and tooling for proof assistants. Recent publications span topics like JavaScript regular expression verification ( ICFP 2024 ), relational compilation ( PLDI 2024 ), and foundational integration verification for cryptographic servers ( PLDI 2024 ). Scientific Awards: Distinguished Artifact, ACM SIGPLAN International Conference on Software Language Engineering (2020) William A. Martin Memorial Thesis Award for Outstanding Thesis in Computer Science, MIT (2016) Frederick C. Hennie III Teaching Award, MIT (2016) As an educator, he teaches Software Construction (undergraduate) and Interactive Theorem Proving (graduate) at EPFL. His teaching philosophy emphasizes hands-on learning, oral examinations, and project-based assignments that lead to tangible artifacts. The SYSTEMF lab focuses on building small, fast, and completely verified systems components through machine-checked proofs, hardware-software co-design, low-level compiler engineering, and theorem prover tooling.

Magnus O. MyreenView profile

Professor

• Formal verification
• Interactive theorem provers
• Compilers
• +6 more

Magnus O. Myreen is a Professor at Chalmers University of Technology in the Department of Computer Science and Engineering. His research focuses on formal verification , interactive theorem provers, compilers, machine code, and functional programming. He leads the CakeML project, aiming to create verified compilers and runtime systems. Education: B.A. in Computer Science from University of Oxford, Ph.D. in Program Verification from University of Cambridge. Current Roles: Professor at Chalmers, part-time researcher at Arm Ltd., and steering committee chair for ITP conference. His research integrates decompilation into logic , proof-producing synthesis , and verified stacks that connect software and hardware verification. Recent work includes verified compilers for Scheme and Dafny via CakeML, and end-to-end verification of subgraph-solving algorithms. Key publications highlight verified compiler ecosystems , including bootstrapping CakeML, cross-architecture compilation, and hardware verification. Trends in his work emphasize automated reasoning , compiler optimization , and verified computation for AI/ML . Scientific Awards: BCS Distinguished Dissertation Competition 2010 ACM SIGPLAN Most Influential POPL Paper Award 2024 Amazon Research Award for Compiling Dafny to CakeML (2023) Myreen has supervised PhD students Alejandro Gomez , Oskar Abrahamsson , and Andreas Loow . Funding includes grants from the Swedish Research Council and a Royal Society University Research Fellowship . He also contributes to projects like Milawa and HOL Light verification.

Clare DixonView profile

Professor

• Verification
• Automated Reasoning
• Temporal Logic
• +5 more

Clare Dixon is a Professor of Computer Science in the Department of Computer Science at the University of Manchester, where she leads the Autonomy and Verification research group. Previously, she held a Professorship at the University of Liverpool (2001–2020) and was a Senior Research Fellow at Manchester Metropolitan University (1995–2000). She also holds an honorary professorship at the University of Liverpool (2020–2023). Her research focuses on verification for robotics and autonomous systems, formal methods, temporal and modal logics, and theorem proving. Key applications include ensuring systems meet safety and reliability requirements through tools like model checkers and theorem provers. She collaborates with robotics engineers to apply formal verification techniques in dynamic environments and swarm systems. Research Interests: Verification of autonomous systems, formal specification, temporal logics, automated reasoning, and reliable robotics. Her work aligns with UN Sustainable Development Goals, particularly in advancing reliable technology and improving quality of life. Awards: Best Paper Award (2018) Invitation to Sister Conference Best Paper Track (2017) Springer Best Paper Award (2014) Projects: She is a Co-Investigator in major initiatives such as the Centre for Robotics and Artificial Intelligence , FAIR-SPACE Hub , and S4: Science of Sensor System Software , focusing on autonomous systems, space robotics, and secure sensor networks. Labs/Teams: Leads the Autonomy and Verification group at Manchester and contributes to interdisciplinary teams in robotics, formal methods, and AI ethics.

• Formalized Mathematics
• Programming Languages
• Type Theory
• +3 more

Maximilian Doré is a Departmental Lecturer in the Department of Computer Science at the University of Oxford, and a College Lecturer at Corpus Christi College and Merton College. His research focuses on formalized mathematics, type theory, and automated theorem proving, with applications in computational mathematics and programming language foundations. He teaches courses on programming paradigms, functional programming, and algorithms. Education: DPhil in Computer Science from the University of Oxford (supervised by Samson Abramsky and Sam Staton), MSc in Logic and Philosophy of Science from LMU Munich (thesis on constructivity in type theory), and a joint Bachelor’s in Computer Science and Mathematics from RWTH Aachen. Research Interests: Formalized mathematics using dependent type theory, particularly Cubical Type Theory; topological data analysis formalized in Cubical Agda; and educational tools like the Elfe prover for undergraduate mathematics. Current projects include proof search automation in Cubical Agda and machine learning approaches to theorem proving via Hindsight Experience Replay. His work bridges foundational mathematics and computational logic, aiming to create tools that enhance mathematical rigor through computer-verified proofs.

Douglas HoweView profile

Professor

• Automated Reasoning
• Formal Methods in Software Engineering
• Programming Languages
• +4 more

Affiliations & Roles: Professor at Carleton University's School of Computer Science. Served as Associate Director and Director of the School. Holds a Ph.D. from Cornell University (1988), along with M.S. and B.A. from Carleton University. Education: Ph.D. in Computer Science, Cornell University, 1988 M.S. and B.A., Carleton University Research Interests: Automated Reasoning Formal Methods in Software Engineering Programming Languages & Type Theory Interactive Theorem Proving Systems Software Verification (including real-time systems) Integration of theorem provers with verification tools Professional Background: 1987–1992: Faculty Member & Research Associate, Cornell University 1992–1999: Member of Technical Staff at Bell Labs (AT&T/Lucent) 2000–Present: Professor at Carleton University Advising & Grants: No specific advising/grant information provided in texts. Labs/Teams: Leadership roles in School of Computer Science's academic/research activities.

Jing ChenView profile

Assistant Professor

• Computational Game Theory
• Mechanism Design
• Auctions
• +6 more

Jing Chen is an Assistant Professor in the Department of Computer Science at Stony Brook University and Chief Scientist and Head of Theory Research at Algorand Inc. She is affiliated with the Economics Department and the Center for Game Theory. Her research focuses on computational game theory, mechanism design, auctions, markets, healthcare, and distributed ledgers. She holds a PhD from MIT (2012) and degrees from Tsinghua University. Her work bridges computer science and economics, emphasizing incentive mechanisms in strategic environments. Notable contributions include the Algorand blockchain protocol and mechanisms for healthcare policy design. Research interests include algorithmic game theory, mechanism design for real-world applications, and the theoretical foundations of rationality. She has received the NSF CAREER Award (2016) and the Cisco Fellowship. Teaching includes courses such as Analysis of Algorithms and Theory of Computation. Professional service roles include associate editor of ACM Transactions on Economics and Computation and organizing workshops on game theory and blockchain at major conferences. Her advising includes PhD students at institutions like Hong Kong Polytechnic University and Williams College. Collaborations span academia and industry, with a focus on distributed systems and cryptographic protocols.

• Constructive Mathematics
• Automated Reasoning
• Geometry
• +4 more

Michael J Beeson is a Professor of Computer Science at San José State University. He holds a Ph.D. from Stanford University (1972). His research focuses on automated reasoning, constructive mathematics, and formal geometry. Key areas include proof-checking Euclidean geometry, minimal surfaces, and set theory. He has received NSF grant CCR-0204362 for research in automated reasoning. Beeson has authored numerous articles on topics like Tarskian geometry, non-Euclidean systems, and geometric tiling. His work bridges logic, computation, and traditional mathematical proof methods. Education: Doctor of Philosophy, Stanford University, 1972 Research Interests: Constructive approaches to geometry and set theory Automated theorem proving and proof verification Applications of lambda calculus and type theory Historical and foundational aspects of mathematics Grants & Support: National Science Foundation grant CCR-0204362 (2005–3000) Labs/Teams: Collaborates with projects like GeoCoq for formalized geometry and OTTER/Ivy theorem provers.

Ilya SergeyView profile

Associate Professor

• Programming Languages
• Software Verification
• Distributed Systems
• +5 more

Associate Professor Ilya Sergey leads the Verified Systems Engineering (VERSE) lab at the School of Computing, National University of Singapore (NUS). He holds a PhD in Computer Science from KU Leuven and an MSc in Mathematics from Saint Petersburg State University. His research focuses on programming languages, software verification, distributed systems, and program synthesis. He is a recipient of the AITO Dahl-Nygaard Junior Prize (2019) and multiple ACM SIGPLAN Distinguished Paper Awards. His work includes developing the Scilla smart contract language and the Veil verification framework, emphasizing formal methods for ensuring software correctness. **Education**: PhD in Computer Science, KU Leuven, Belgium (2012) MSc in Mathematics and Computer Science, Saint Petersburg State University, Russia (2008) **Research Interests**: Design and Implementation of Programming Languages Formal Verification using Separation Logic Distributed Systems and Concurrency Program Synthesis and Automated Proof Repair **Recent Articles Trends**: His recent work emphasizes automated verification tools (e.g., Veil), exploit generation via synthesis, and compositional verification of Byzantine protocols. These contributions bridge foundational theory with practical applications in distributed systems and smart contracts. **Awards**: AITO Dahl-Nygaard Junior Prize (2019) ACM SIGPLAN Distinguished Paper Awards (PLDI'23, PLDI'21, POPL'19) Google, Facebook, and Amazon Research Awards **Advising & Grants**: He actively mentors PhD students in formal methods and verification. His grants include support from Google and industry partnerships. He organizes the ICFP Programming Contest and co-chairs ICFP'25. **Labs & Teams**: Leads the VERSE lab, part of the PLSE@NUS group, focusing on verified software systems and program synthesis.

Thomas VidickView profile

Professor

• Quantum Information
• Complexity Theory
• Cryptography
• +3 more

Thomas Vidick is a Professor of Computing and Mathematical Sciences at the California Institute of Technology (Caltech). As of 2022–2023, he held a visiting position at the Weizmann Institute in Israel. He earned his Ph.D. from the University of California, Berkeley in 2011. His research focuses on quantum information, complexity theory, and cryptography, with a particular emphasis on applying complexity-theoretic tools to quantum computing challenges. Notably, his work resolved Tsirelson's problem and demonstrated that MIP* = RE, a landmark result in computational complexity and operator algebras. Research Interests: Quantum information and its intersections with complexity theory Entanglement in multi-prover interactive proofs and device-independent cryptography Quantum verification, cryptography, and protocols Applications of semidefinite programming and approximation algorithms in quantum contexts Awards and Honors: Simons Investigator (2021) NSF CAREER Award (2015) AFOSR Young Investigator Award (2015) Presidential Early Career Award for Scientists and Engineers (2016) Okawa Research Grant (2014) Teaching and Academic Contributions: Regularly teaches courses such as Analysis and Design of Algorithms (CMS/CS/IDS 139) and Introduction to Cryptography (CS 152) at Caltech. Co-organizes the TCS+ online seminar series and contributed to QIP 2022 as a host. Research activities include collaborations on quantum-proof extractors, certifiable randomness, and cryptographic protocols.

James DavenportView profile

Professor

• Computer Algebra
• Symbolic Computation
• Cryptography
• +5 more

James Davenport is the Hebron and Medlock Professor of Information Technology at the University of Bath's Department of Computer Science. He holds affiliations with institutions such as the International Centre for Higher Education Management (ICHEM), the Institute of Coding, and the UKRI CDT in Accountable, Responsible, and Transparent AI. His research focuses on computer algebra, cryptography, symbolic computation, and computational geometry, with notable contributions to cylindrical algebraic decomposition and quantifier elimination. He has led or collaborated on projects funded by EPSRC, EU Horizon 2020, and other bodies, addressing challenges in algorithmic complexity, cybersecurity education, and digital skills development. His research interests span computer science education, cybersecurity, and formal methods, with a strong emphasis on advancing symbolic computation techniques. Recent work includes improving cylindrical algebraic decomposition through machine learning and exploring frameworks for authentic assessment in computing education. He actively contributes to initiatives like the Institute of Coding to address the UK’s digital skills gap. Professor Davenport has been involved in 12 research projects, including the DEWCAD project targeting computational geometry challenges. His publications emphasize algorithmic innovation, educational frameworks, and interdisciplinary applications. While no specific awards are listed, his extensive contributions to the field underscore his academic impact. He supervises doctoral students and collaborates with global researchers, contributing to both theoretical advancements and practical applications in education and technology. His work bridges academic research and industry needs, particularly in cybersecurity and computational efficiency.

Helen TreharneView profile

Professor

• Cyber Security
• Formal Methods
• Intelligent Transport Systems
• +5 more

Professor Helen Treharne is the Head of the School of Computer Science and Electronic Engineering at the University of Surrey and holds the title of Professor in Computer Science (SFHEA, FBCS). She also serves as Director of the Academic Centre of Excellence in Cyber Security Education (ACE-CSE), recognized by the National Cyber Security Centre (NCSC), and is a member of the Faculty Executive Board in the Faculty of Engineering and Physical Sciences. Her leadership spans roles such as overseeing accreditation processes, Athena SWAN submissions, and the Research Excellence Framework (REF), alongside strategic growth initiatives and staff mentorship. Her research focuses on formal analysis of secure systems, particularly in intelligent transport systems (e.g., rail applications) and usable security for diverse populations, including ageing societies. Recent projects include a collaboration with ARM Ltd, Thales, NTU, and SRI International on secure swarm attestation protocols using the TAMARIN prover. She emphasizes interdisciplinary approaches to bridge technical and societal challenges in security. As a teacher, she contributes to the BSc Computer Science programme, specializing in risk management and threat modeling. Her teaching philosophy integrates industry regulations and best practices, featuring guest speakers from governance, compliance, and digital forensics sectors to prepare students for real-world challenges. She is also a co-investigator on an EPSRC grant exploring verifiably correct swarm attestation frameworks. Scientific Awards: SFHEA (Society for Teaching and Learning in HE), FBCS (Fellow of the British Computer Society) Grants/Advising: Co-I on EPSRC Verifiably Correct Swarm Attestation project Labs/Teams: ACE-CSE at Surrey, collaboration with ARM Ltd and Thales in security research

• Type Theory
• Interactive Theorem Proving
• Dependently Typed Programming
• +6 more

Dr Anton Setzer is a Reader in the Department of Computer Science at Swansea University, part of the School of Mathematics and Computer Science. His research focuses on foundational aspects of type theory, interactive theorem proving, and formal verification, with particular emphasis on dependently typed programming and blockchain technologies. He is affiliated with the Computational Foundry at Bay Campus and supervises PhD students in critical domains like smart contracts and cybersecurity. Research Interests: Setzer’s work spans type theory (especially Martin-Löf variants), coinduction, proof theory, and their applications in dependently typed systems. His recent projects include formal verification of smart contracts (Solidity, Bitcoin Script) using Agda and exploring blockchain-enabled coordination protocols for UAVs. He also investigates foundational topics like predicative Mahlo universes in type theory. Academic Contributions: Setzer has pioneered techniques for integrating automated and interactive theorem proving, developed formal semantics for CSP processes in Agda, and contributed to coalgebraic type theory. His work on inductive-inductive definitions and copatterns has advanced functional programming methodologies. Supervision & Collaboration: Current PhD topics include SMT solving for railway systems, secure UAV coordination, and pharmaceutical supply chain technologies. He collaborates with Prof Arnold Beckmann on blockchain verification and Monika Seisenberger on railway safety systems. His teaching includes critical systems design (CSCM13) and blockchain technology (CSCM29).

Mina CyrusView profile

Lecturer

• Constructive Logic
• Domain Theory
• Interactive Theorem Proving
• +1 more

Dr. Mina Cyrus is a Teaching Fellow at Swansea University's Department of Computer Science. She researches formal problem-solving using constructive logic (BHK interpretation) and interactive theorem provers (Lean 4/Coq) to verify solution correctness. Research Focus Her expertise includes domain theory, theorem proving, and cryptography. Teaching She teaches Foundations of Computing, Discrete Mathematics, and Lean 4 theorem proving.

Mukesh TiwariView profile

Lecturer

• Cryptography
• Electronic Voting
• Interactive Theorem Proving
• +3 more

Dr. Mukesh Tiwari is a Lecturer at Swansea University’s Department of Computer Science. His research ensures the correctness and security of software used in high-stakes public domains like electronic voting and sensitive data processing using formal methods and the Coq theorem prover. He is affiliated with the Faculty of Science and Engineering. Research Interests His work spans cryptography, electronic voting systems, software security, and social choice theory, with a focus on mathematically rigorous verification of critical systems. Teaching He actively teaches courses in cryptography and formal verification.