Find Academic Supervisors

Jeremy GibbonsView profile

Professor

• Functional Programming
• Programming Languages
• Software Engineering
• +3 more

Jeremy Gibbons is a Professor of Computing at the University of Oxford, affiliated with the Department of Computer Science within the Faculty of Computer Science. He serves as Director of the Professional Programmes, overseeing part-time postgraduate degrees in Software Engineering. His roles include Chair of the Faculty of Computer Science (2012–2016), Director of the Software Engineering Programme, and Fellow of Kellogg College. Gibbons' research focuses on programming methodologies, particularly functional and object-oriented languages, with an emphasis on program calculation, design patterns, and bidirectional transformations. He leads the Algebra of Programming research group and is Editor-in-Chief of the Journal of Functional Programming and The Art, Science, and Engineering of Programming . Education includes a D.Phil. from Oxford University. His work spans formal methods, domain-specific modeling for clinical trials (e.g., CancerGrid project), and semantic frameworks for software systems. He has advised numerous students and contributed to open-access initiatives in publishing. Key collaborations include roles in ACM SIGPLAN and IFIP Working Groups 2.1 and 2.11. Research interests emphasize foundational aspects like profunctor optics, categorical programming, and algorithm design. Notable projects include datatype-generic programming and metadata-driven engineering for clinical trials. His work bridges theoretical computer science with practical applications in software architecture and system design.

Mathias PayerView profile

Associate Professor

• Software Security
• System Security
• Binary Exploitation
• +3 more

Mathias Payer is an Associate Professor at EPFL's School of Computer and Communication Sciences (IC), leading the HexHive Laboratory . His work focuses on software security, particularly addressing memory corruption and type violations through binary analysis and compiler-based techniques. He contributes to research in secure system design, fault isolation, and fuzzing methodologies. Current PhD students : Di Bartolomeo Luca, Feng Zhiyao, Hofhammer Florian, Lyu Tao, Mao Philipp Yuxiang, Zhang Chibin, Zheng Han Past EPFL PhD students: Badoux Nicolas Daniel, Bhattacharyya Atri, Hazimeh Ahmad His research explores software security in areas like: Protecting applications from vulnerabilities Binary exploitation and mitigation Compiler-driven security hardening Strong sanitization and privilege separation Memory corruption detection The HexHive group develops tools and frameworks for: Automated fuzz driver generation Gradual compartmentalization State inference for feedback optimization Secure cell architectures Recent publications highlight advancements in: Fuzzing hybrid approaches (e.g., DUMPLING, MendelFuzz) Memory safety validation (QMSan, Pacmem) Compiler-assisted defenses (Gradient, Type++)

Peter DindaView profile

Professor

• Parallel and Distributed Systems
• Virtualization
• Operating Systems
• +8 more

Peter Dinda is a Professor in the Department of Computer Science at Northwestern University , with a secondary appointment in the Department of Electrical and Computer Engineering . He has authored over 130 scientific papers, holds five patents, and is a Fellow of the IEEE . As the former head of the Computer Engineering and Systems division, he has contributed extensively to experimental computer systems. Education: B.S. in Electrical and Computer Engineering from the University of Wisconsin Ph.D. in Computer Science from Carnegie Mellon University Research Focus: Experimental computer systems, particularly parallel and distributed systems , virtualization , operating systems , and empathic systems that integrate user satisfaction with systems-level decision-making. His work also spans compiler design, memory management, and hardware-software co-design for performance optimization. Recent Trends: His publications emphasize virtualization efficiency, memory protection frameworks, parallel programming language design, and power management in heterogeneous computing environments. Key areas include exascale systems, IoT privacy, and physiological sensor-based user modeling. Scientific Awards: Fellow, IEEE Leadership: Served as Director of Graduate Studies and previously led the Computer Engineering and Systems division.

Todd MillsteinView profile

Professor

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

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

Tom SchrijversView profile

Professor

• Programming Languages
• Functional Programming
• Type Systems
• +6 more

Tom Schrijvers is a Professor at the Department of Computer Science in the Faculty of Engineering Science at KU Leuven, Belgium. He leads the Programming Languages Group within the Declarative Languages and Artificial Intelligence (DTAI) research group. His research focuses on programming languages, particularly functional and logic programming, with special emphasis on Haskell, type systems, and algebraic effects. His research interests include: Functional Programming, especially Haskell Type Systems and Type Theory Algebraic Effects and Handlers Logic Programming, particularly Prolog Constraint Programming Domain-Specific Languages Programming Language Theory Prof. Schrijvers' recent research has focused on effect systems, staged programming, and language composition. His work on algebraic effect handlers has been particularly influential, providing new insights into how effects can be modularly composed and handled in functional languages. He has also made significant contributions to the understanding of type classes and their implementation in Haskell. His publications demonstrate a consistent focus on practical applications of programming language theory, with work spanning from foundational type theory to applied domain-specific languages for areas like fluorescence microscopy. His research often bridges the gap between theoretical programming language concepts and practical implementation concerns. Prof. Schrijvers has supervised numerous PhD students to completion, including Pieter Wuille, Benoit Desouter, George Karachalias, Steven Keuchel, Amr Saleh, Alexander Vandenbroucke, and Ruben Pieters. He currently supervises PhD students Klara Mardirosian, César Santos, Gert-Jan Bottu, Koen Pauwels, Birthe van den Berg, and Roger Bosman. His research group has received funding from various sources including EU projects like GRACeFUL. The Programming Languages Group at KU Leuven, which he leads, focuses on functional (Haskell) and logic (Prolog, Datalog, CLP) programming languages, as well as general programming language theory. The group has been active in numerous research projects and collaborations across Europe.

Conrad WattView profile

Assistant Professor

• WebAssembly
• Formal Verification
• Programming Languages
• +4 more

Conrad Watt is an Assistant Professor at Nanyang Technological University (NTU), Singapore , specializing in WebAssembly, formal verification, and concurrency. He previously served as a Research Fellow at Peterhouse, University of Cambridge, and earned his PhD under Peter Sewell. Co-chair of the W3C WebAssembly Community Group Active in WebAssembly standards development, including concurrency specifications Developed mechanizations in theorem provers like Isabelle/HOL Collaborator with industry (wasmtime engine) and academic teams on verification tools Research Focus: Formal verification of low-level languages, concurrency models, and security mechanisms for WebAssembly. His work bridges theoretical rigor with practical applications, including WasmRef-Isabelle and threads projects. Recent Trends: 2025 publications explore separation logic automation and concurrency experiments, while 2024-2023 work emphasizes specification toolchains (SpecTec), verified interpreters, and memory-safe execution techniques. Scientific Awards ACM Doctoral Dissertation Award Honorable Mention EAPLS Best Dissertation Award Advising: Supervises PhD students Qiyuan Xu and Antanas Kalkauskas. Collaborates with researchers like Philippa Gardner and Jean Pichon-Pharabod.

Mahesh TripunitaraView profile

Professor

• Information Security
• Authorization and Access Control
• Cryptographic Key Transport
• +7 more

Dr. Mahesh Tripunitara is a Professor in the Department of Electrical and Computer Engineering at the University of Waterloo, serving as Associate Chair for Undergraduate Studies. He holds a PhD (2005) and Master's (1995) in Computer Science from Purdue University, along with a BSc (1993) in Computer Science from Dalhousie University. His research focuses on information security, authorization mechanisms, cryptographic key management, and hardware security, with industry experience at Motorola's R&D labs and Silicon Valley. His work spans theoretical advancements like access control policy analysis and practical applications such as secure payments systems and IoT device reliability. Notable awards include the Best Student Paper at Usenix Security 2013 and Best Paper at ACM SACMAT 2013. He actively serves on program committees for major security conferences including CCS, CODASPY, and SACMAT. Recent publications highlight innovations in cellular security (SUCI-Catchers defense), role-mining optimization, and blockchain smart contract auditing. Teaching includes advanced algorithm design courses (ECE 406/606) and digital computation (BME 121). His research emphasizes balancing security rigor with usability in authorization systems and hardware protection mechanisms.

Zhendong SuView profile

Professor

• Programming Languages
• Compilers
• Software Engineering
• +3 more

Zhendong Su is a full professor in the Department of Computer Science at ETH Zurich since August 2018. Previously, he held a full professorship at UC Davis from 2003 until June 2019. He earned his Ph.D. in Computer Science from UC Berkeley and dual Bachelor’s degrees in Computer Science and Mathematics from UT Austin in 1995. Affiliations: ETH Zurich: Full Professor (since 2018) UC Davis: Full Professor and Chancellor’s Fellow (2003–2019) IEEE Fellow, ACM Fellow, and Member of Academia Europaea His research focuses on programming languages, compilers, software engineering, computer security, and education technologies . Key contributions include compiler validation (e.g., Project Yin-Yang for SMT solvers and DBMS testing), testing tools like SQLancer, and educational innovations such as the Algot visual programming language. Recent work emphasizes secure AI (e.g., CipherSteal for TEE-shielded models) and compiler reliability (e.g., Artemis/Apollo for JIT validation). He has pioneered techniques like metamorphic testing and equivalence modulo inputs (EMI) for compiler validation, uncovering thousands of bugs in GCC/LLVM and SMT solvers. Awards: ICSE MIP Award (2022), ACM SIGSOFT Impact Paper (2018), NSF CAREER Award, and multiple industrial awards. His students have won IEEE TCSE Rising Star and SIGSOFT Impact Paper awards, securing roles at top universities and companies like Google and NVIDIA. Service: Steering committee member of ISSTA and ESEC/FSE, ACM Distinguished Speaker, and Associate Editor for ACM TOSEM. Program chaired ISSTA 2012 and co-chaired FSE 2016. Labs/Teams: Leads research groups on compiler validation, secure AI, and education technologies. Projects include Yin-Yang (SMT testing), SQLancer (DBMS fuzzing), and Algot (visual programming for education).

Carlisle-MartinView profile

Professor

• Computer Security
• Programming Languages
• Computer Science Education
• +3 more

Carlisle-Martin is an Associate Department Head and Professor of Practice in the Department of Computer Science & Engineering at Texas A&M University. They also serve as Director of the United States Air Force Academy Center for Cyberspace Research. Their research focuses on computer security, programming languages, and innovative computer science education techniques. Education: Ph.D., Computer Science, Princeton University (1996) B.S., Mathematics and Computer Science, University of Delaware (1991) Research Interests: Malware analysis and detection Cybersecurity frameworks for DNS and network protocols Visual programming tools like RAPTOR for education Ada language modernization and integration Cybersecurity education through CTF competitions Awards: 2016: Meritorious Civilian Service Award (USAF) 2014: SANS Institute Security Award 2009: ACM Distinguished Educator 2008: Colorado Professor of the Year 2007: Arthur S. Flemming Award Advising & Grants: Known for mentoring through cybersecurity initiatives and leading the USAF Academy's cyberspace research programs. No specific grant details listed, but their work aligns with defense and education funding priorities. Labs/Teams: Directs the USAF Academy's Center for Cyberspace Research, focusing on applied cybersecurity solutions and educational outreach.

Caroline TrippelView profile

Assistant Professor

• Computer Architecture
• Hardware Security
• Formal Methods
• +5 more

Caroline Trippel is an Assistant Professor in the Departments of Computer Science and Electrical Engineering at Stanford University. Her research focuses on ensuring correctness and security in computer systems through formal methods, with particular emphasis on hardware verification, memory consistency models, and mitigating vulnerabilities like Spectre/Meltdown. She previously worked at Facebook’s FAIR SysML group before joining Stanford. Education: PhD in Computer Science, Princeton University BS in Computer Engineering, Purdue University Her work has influenced the RISC-V ISA memory consistency model and produced tools like CheckMate, which automatically synthesizes hardware exploits for security verification. She explores privacy-preserving ML, ML-driven hardware optimizations (e.g., neural recommendation), and datacenter reliability. Her research has earned awards including the 2020 ACM SIGARCH Dissertation Award and NVIDIA Fellowship. Key contributions include: Formal analysis of RISC-V memory models Exploitation synthesis frameworks (CheckMate) Hardware-software contracts for security Defenses against microarchitectural side-channel attacks Current projects include: VeriCoder: LLM-enhanced RTL code verification Multi-μPATH synthesis for security validation Near-data processing (RecSSD) for recommendation systems

Tom ConteView profile

Professor

• Computer Architecture
• Compiler Optimization
• Manycore Architectures
• +4 more

Tom Conte is an academic leader with a joint appointment in the School of Electrical & Computer Engineering and School of Computer Science at Georgia Institute of Technology. As the founding director of the Center for Research into Novel Computing Hierarchies (CRNCH), he specializes in computer architecture and compiler optimization. His work focuses on manycore architectures, energy-efficient microprocessor design, and embedded system architectures. Prior to Georgia Tech, he directed the Center for Embedded Systems Research at North Carolina State University. He holds IEEE Fellow status and served as 2015 President of the IEEE Computer Society, co-leading the IEEE Rebooting Computing Initiative since 2011. Dr. Conte earned his bachelor’s degree in Electrical Engineering from the University of Delaware (1986), followed by M.S. and Ph.D. degrees in Electrical Engineering from the University of Illinois at Urbana-Champaign (1988 and 1992). His research has been recognized with prestigious awards including the IEEE Computer Society’s Golden Core Member award and the National Science Foundation’s CAREER Award (1996). His research interests span quantum computing, 3D chip architectures, energy-efficient processing, and post-Moore computing innovations. He has pioneered initiatives like the Superstrider architecture and CREEPY energy-efficient processing frameworks. Recent work includes advancements in quantum programming languages (e.g., Qwerty) and hybrid quantum-classical systems. Awards: IEEE Fellow, Young Alumni Achievement Award, CAREER Award Leadership: IEEE Computer Society President (2015), CRNCH Director Key Projects: Rebooting Computing Initiative, Superstrider Architecture His lab’s contributions include novel compiler optimizations for manycore systems, smart NIC offloading techniques, and thermodynamically inspired computing models. Conte’s work bridges academic research with industry needs through interdisciplinary collaborations and standardization efforts.

• Cybersecurity
• Cryptography
• Programming Languages
• +4 more

Elaine Shi is a Professor with a joint appointment in the Computer Science Department (CSD) and Electrical and Computer Engineering (ECE) at Carnegie Mellon University. She is also an Adjunct Professor of Computer Science at the University of Maryland. Her research focuses on cryptography, security, mechanism design, algorithms, blockchains, and programming languages. She co-founded Oblivious Labs, Inc., and her work on Oblivious RAM and differential privacy has been adopted by Signal, Meta, and Google. Education: Not explicitly listed, but her academic roles imply advanced degrees in computer science. Research Interests: Shi's work spans foundational areas such as secure computation, privacy-preserving algorithms, and blockchain protocols. She emphasizes practical implementations, such as Oblivious RAM and cryptographic compilers like Viaduct. Her research also explores game-theoretic mechanisms for decentralized systems and explores the intersection of theory and practice in secure distributed systems. Publications: Over 150+ articles in top venues like Eurocrypt, S&P, and CCS, covering topics like oblivious algorithms, blockchain security, and differential privacy. Recent work includes optimizing obfuscation, secure aggregation, and transaction fee mechanisms. Packard Fellow, Sloan Fellow, ACM Fellow, IACR Fellow Co-founder of CMU's Crypto Group and Crypto Seminar Series Advising & Grants: Supervises a large group of students and postdocs, with notable alumni holding academic and industry roles. Active in securing grants for research in secure computation and blockchain technologies. Labs & Teams: Leads research in Oblivious Labs and collaborates on projects like the Viaduct compiler and secure enclaves for privacy-preserving computation.

Zachary KincaidView profile

Associate Professor

• Program Analysis
• Formal Methods
• Programming Languages
• +4 more

Zachary Kincaid is an Associate Professor in the Department of Computer Science at Princeton University's School of Engineering and Applied Science. His research focuses on program analysis, logic, and programming languages, with an emphasis on making program analysis compositional and robust. He received his PhD from the University of Toronto under the supervision of Azadeh Farzan. His work has been implemented in the Duet program analyzer, and he has an Erdős number of 3. Dr. Kincaid's research interests include: Compositional program analysis techniques Algebraic approaches to program analysis Termination analysis and ranking function synthesis Verification of concurrent and parallel programs Automated reasoning and decision procedures Analysis of numerical programs and loops His recent publications show a strong focus on developing novel techniques for program analysis that bridge theoretical computer science with practical verification tools, particularly in nonlinear analysis, quantified reasoning, and compositional verification. Dr. Kincaid has received research support from ONR grant N00014-19-1-2318 for his work on robust program analysis. He has advised graduate students including: Current: Jake Silverman, Nicolas Koh, Nikhil Pimpalkhare Graduated: Shaowei Zhu (PhD 2024, Researcher at Amazon), Charlie Murphy (PhD 2023, Postdoc at University of Wisconsin–Madison) Dr. Kincaid teaches courses including: COS 320 – Compiling Techniques (Spring 2024, 2022, 2020, 2019) COS 516 / ELE 516 – Automated Reasoning about Software (Fall 2025, 2022, 2018) COS 217 – Introduction to Programming Systems (Fall 2024) COS IW – Practical Solutions to Intractable Problems (Fall 2023, Spring 2023, 2018, 2017) COS IW – Little Languages (Spring 2018) COS 597D – Reasoning about concurrent systems (Fall 2016)

Timothy M. JonesView profile

Professor

• Compilers
• Computer Architecture
• Binary Modification
• +3 more

Timothy M. Jones is a Professor of Computer Architecture and Compilation at the University of Cambridge Computer Laboratory, where he leads research in systems-level computing. He is also a Fellow at Gonville and Caius College, contributing to academic leadership and student mentorship within the collegiate system. His primary affiliation with the Computer Laboratory positions him at the forefront of systems research within the university. Dr. Jones's research focuses on extracting various forms of parallelism (thread-level, data-level, memory-level) to enhance computational performance while addressing energy efficiency and reliability challenges. His work spans compiler design, binary translation, and microarchitecture optimization, with specific interest areas including: Compiler technologies for functional and parallel programming Hardware reliability and fault tolerance mechanisms Binary analysis and instrumentation frameworks Memory system optimization and virtual memory management Security enhancements through binary modification Runtime systems for heterogeneous architectures Analysis of his recent publications reveals strong emphasis on systems-level innovation, particularly in fault tolerance techniques, binary analysis tools, memory optimization, and parallel execution frameworks. His work consistently bridges theoretical computer science with practical hardware implementation challenges. Dr. Jones maintains active participation in the academic community through conference leadership roles, including serving as Program Co-Chair for CGO 2026 and committee positions at premier venues including ISMM, CGO, and ECOOP. He contributes to open-source academic resources through GitHub and maintains professional engagement via Twitter.

• Programming Language Design
• Program Verification
• Type Theory
• +3 more

Neelakantan R. Krishnaswami is a Professor of Computer Science at the University of Cambridge's Computer Laboratory , and a Fellow of Trinity College . His research focuses on the intersection of program verification, programming language design, and foundational topics like type theory and semantics. His work spans areas such as refinement types, parser design, separation logic for systems software, and the semantics of reactive programming. Notable contributions include the Datafun language for higher-order Datalog and the λert type theory for explicit refinement types. He has also developed foundational frameworks for verifying imperative programs using advanced type systems and logical relations. Key publications include 'Explicit Refinement Types' (ICFP 2023), 'flap: A Deterministic Parser with Fused Lexing' (PLDI 2023), and 'CN: Verifying Systems C Code' (POPL 2023). His work frequently addresses challenges in efficiency, correctness, and modularity for both functional and imperative systems. His awards include Distinguished Paper Awards at PLDI 2019 and POPL 2020. His research integrates theoretical rigor with practical tooling, exemplified by contributions to languages like Coq, Lean, and Haskell.