Find Academic Supervisors

Amal AhmedView profile

Professor

• correct and secure compilation
• safe language interoperability
• foreign-function interfaces
• +9 more

Amal Ahmed is a Professor and Associate Dean for Graduate Programs at Khoury College of Computer Sciences, Northeastern University, where she leads research in programming languages and secure compilation. She received her PhD in Computer Science from Princeton University and has established herself as a leading researcher in compiler correctness, language interoperability, and type systems. Her research focuses on correct and secure compilation across the software-hardware stack and safe language interoperability, including design of sound foreign-function interfaces (FFIs) and richly typed compiler intermediate languages. She makes extensive use of semantics and type systems for reasoning about imperative and probabilistic programming languages, multi-language systems, security, concurrency, and provenance. Her work has significantly advanced the understanding of gradual typing, compiler verification, and compositional language interoperability. Dr. Ahmed's publications reveal a research trajectory focused on building solid semantic foundations for language interoperability and secure compilation. Her recent work spans topics from probabilistic separation logic to WebAssembly interoperability, with consistent emphasis on formal verification and semantic techniques. She has developed frameworks for reasoning about multi-language systems that preserve security properties across language boundaries. NSF CAREER Award recipient Editorial Board: Journal of Functional Programming (2017–present) Editorial Board: Mathematical Structures in Computer Science (2016–present) Member: IFIP Working Group 2.8 (Functional Programming, 2014–present) As an educator and mentor, Dr. Ahmed has advised numerous PhD students, postdocs, and undergraduates, many of whom have gone on to successful academic and industry careers. She has organized the Programming Languages Mentoring Workshop and regularly teaches advanced courses in programming languages. She serves on the steering committees of major conferences including POPL, SPLASH, and PLMW, and has chaired program committees for ESOP and POPL.

Gilbert BernsteinView profile

Assistant Professor

• Computer Graphics
• Programming Languages
• High-Performance DSLs
• +7 more

Gilbert Bernstein is an Assistant Professor in the Computer Science & Engineering department within the College of Engineering at the University of Washington. His research bridges computer graphics and programming languages, with a focus on high-performance domain-specific languages. Previously, he was a post-doctoral scholar at UC Berkeley and MIT working with Jonathan Ragan-Kelley, and received his PhD from Stanford University under Pat Hanrahan. His research interests span Computer Graphics, Programming Languages, High-Performance DSLs, Physical Simulation, Geometry & Topology, Differentiable Programming, Hardware DSLs, Tools for Artists, Fabrication, and Human-Computer Interaction. Bernstein develops languages and compilers that enable efficient computation for creative applications, physical simulations, and graphics rendering systems. His recent publications reveal strong trends in differentiable programming for graphics applications, domain-specific languages for hardware acceleration, and computational approaches to traditional crafts like quilting and knitting. His work consistently combines formal language theory with practical applications in graphics and fabrication. Bernstein actively mentors students across multiple institutions including current advisees Felix Hahnlein (UW Postdoc), Ryan Zambrotta (UW PhD), Haoran Peng (UW PhD), and previous students including Alex Reinking (UC Berkeley PhD 2022, now at Qualcomm) and MacKenzie Leake (Stanford PhD 2021, now at Adobe Research). His lab works on diverse projects including debugging CAD programs, compilers for finite element methods, semantics for knitting machines, algebraic scheduling of tensor programs, and exocompilers for hardware accelerators. Bernstein also collaborates on DSLs for networking, Counterstrike bots, gradient-based optimization, memory management, hardware design, and garment design tools.

Adam ChlipalaView profile

Professor

• Programming Languages
• Formal Methods
• Computer Systems
• +5 more

Adam Chlipala is a Professor at the Massachusetts Institute of Technology working at the intersection of programming languages, formal methods, and computer systems. His research focuses on building practical verified systems with end-to-end machine-checked proofs, particularly using the Coq proof assistant. His educational background includes a Computer Science undergraduate degree from Carnegie Mellon University (2003) and a PhD in Computer Science from the University of California, Berkeley (2007). Following a postdoctoral position at Harvard University through 2011, he joined MIT as faculty. Chlipala's research spans multiple domains with strong emphasis on dependent types , verified compilation , and hardware-software co-verification . His work consistently bridges theoretical foundations with practical implementation, as evidenced by his development of the Ur/Web programming language and his focus on creating clean-slate hardware-software stacks with formal guarantees. Key research thrusts include cryptographic constant-time verification, side-channel security, and verified tensor compilation. His recent publications (2020-2025) reveal a clear trajectory toward increasingly complex verified systems, with growing emphasis on hardware-software integration, cryptographic implementations, and performance-critical applications. The work consistently leverages Coq for machine-checked proofs while addressing real-world constraints like timing channels and hardware interfaces. Chlipala is the author of the influential textbook Certified Programming with Dependent Types , which serves as a primary educational resource for Coq at numerous institutions worldwide. His professional activities include significant service to the PL community through program committees for major conferences including PLDI, POPL, ICFP, and CPP. He leads research initiatives connecting hardware and software verification, most notably through the DeepSpec project which aims to build fully verified computing stacks. His current work focuses on practical applications of dependent types for business applications through Ur/Web and verified cryptographic implementations.

Stephen ChongView profile

Professor

• Programming languages
• Information security
• Language-based security
• +3 more

Stephen Chong is a Gordon McKay Professor of Computer Science in the Harvard John A. Paulson School of Engineering and Applied Sciences, where he serves as Co-Director of Undergraduate Studies for Computer Science. His academic career spans over a decade of teaching and research at Harvard, where he has made significant contributions to programming languages and information security. Chong received his PhD from Cornell University under the guidance of Andrew Myers, and a bachelor's degree from Victoria University of Wellington, New Zealand. Prior to graduate school, he worked as a consultant and contractor in the software industry, bringing practical experience to his academic research. Professor Chong's research focuses on language-based information security, using programming language techniques to provide information security assurance. His work bridges the gap between theoretical foundations and practical applications, developing tools and frameworks that help programmers write trustworthy programs. His research has evolved to address increasingly complex security challenges in modern computing environments, from web applications to cyber-physical systems. His recent publications reveal a strong trend toward integrating advanced programming language techniques with security analysis, particularly through the use of Datalog, SMT solvers, and program synthesis. His work on Formulog has been particularly influential, extending Datalog with mechanisms to construct and reason about SMT formulas for static analysis. His research has expanded to address security challenges in cyber-physical systems, where sensor attacks pose unique threats to safety-critical infrastructure. Chong has received numerous prestigious awards including an NSF CAREER award, an AFOSR Young Investigator award, and a Sloan Research Fellowship. He has also served in leadership roles for major conferences including CSF 2012-2013, PLMW @ PLDI 2021, and as SIGPLAN-M Chair for 2025-2026. As an educator, Chong has mentored numerous students through Harvard's undergraduate research programs and has served as a thesis advisor. His teaching portfolio includes foundational courses like CS51, systems courses like CS61, and advanced topics in programming languages (CS152) and compilers (CS1530). He has been instrumental in shaping Harvard's computer science curriculum, particularly in security and programming languages. Chong leads a research group focused on language-based security, with projects including Formulog (for SMT-based static analysis), PRINCESS (for autonomous adaptation of software), and work on secure shell scripting (Shill). His group collaborates with researchers across Harvard and other institutions to tackle challenging problems at the intersection of programming languages and security.

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

Clément Pit-Claudel is an assistant professor at École Polytechnique Fédérale de Lausanne (EPFL) in the School of Computer and Communication Sciences, Department of Computer Science. He leads the SYSTEMF lab which he founded in January 2023. Prior to joining EPFL, he was a PhD candidate at MIT with Adam Chlipala and subsequently worked as a senior applied scientist at Amazon AWS. His academic journey began at École Polytechnique in France, followed by doctoral studies at MIT. Dr. Pit-Claudel's research focuses on programming languages, compilers, and formal verification, with broader interests spanning systems engineering, hardware design languages, security, performance engineering, databases, and type theory. His work centers around three main axes: extensible compilation (teaching compilers domain-specific optimization tricks), hardware design languages and verification, and tooling for proof assistants. He has developed several influential systems including Elk (a linear-time engine for JavaScript regexes), Warblre (a Coq translation of JS regex specification), Fiat (a library for correct-by-construction refinement), Narcissus (for verified binary encoders/decoders), F2F (a program extraction framework), Rupicola (a compiler-construction toolkit), Kôika (a rule-based hardware design language), Cuttlesim (a fast hardware simulator), and Alectryon (a literate programming system for Coq). His publications span top venues including PLDI, POPL, ICFP, ASPLOS, and SLE, with recent work focusing on verified JavaScript regular expressions, foundational integration verification of cryptographic servers, and relational compilation techniques. His research aims to build small, fast, and completely verified components for critical systems through a combination of machine-checked proofs, hardware-software co-design, low-level compiler engineering, and new tools for interactive theorem proving. His notable awards include the Distinguished Artifact award at SLE 2020 for 'Untangling Mechanized Proofs,' the William A. Martin Memorial Thesis Award from MIT in 2016, and the Frederick C. Hennie III Teaching Award from MIT in 2016. He has served on program committees for numerous conferences including PLDI, POPL, ICFP, and SPLASH, and has organized workshops such as the Coq Workshop and Proof Systems. As an educator, he teaches 'Software Construction' (undergraduate level, ~400 students) and 'Interactive Theorem Proving' (graduate level) at EPFL. His teaching philosophy emphasizes hands-on learning, continuous assessment through oral examinations, and designing assignments that lead students to build concrete artifacts they can be proud of. His approach is informed by hundreds of hours of in-class instruction in Europe and the US, resulting in stellar student reviews and multiple teaching awards.

Koushik SenView profile

Professor

• Software Engineering
• Programming Languages
• Formal Methods
• +3 more

Koushik Sen is a Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley. His academic career spans major contributions to software engineering and programming languages research through active participation in premier conferences including PLDI, ICSE, and ISSTA. His research focuses on Software Engineering , Programming Languages , and Formal Methods , with particular emphasis on developing software tools that enhance programmer productivity and software quality. Key research thrusts include automated test generation , symbolic execution , fuzzing techniques , and program synthesis . His work bridges theoretical foundations with practical tool development for real-world software verification challenges. Analysis of his publication record reveals consistent contributions to automated testing methodologies, with recent work integrating machine learning (particularly large language models) into traditional program analysis techniques. His research shows strong continuity in improving software reliability through innovative input generation and vulnerability detection approaches. As an active academic leader, he has served as General Chair for MAPL (2020), Program Chair for ISSTA (2017), and committee member for numerous top-tier conferences including PLDI, ICSE, and SPLASH across multiple years. His academic advising manifests through collaborative publications with students on topics like test corpus expansion (Bonsai Fuzzing), visualization synthesis (VizSmith), and smart contract auditing (ItyFuzz), though specific student names aren't listed in the source material. His research has been supported through conference participations and likely associated grants given his extensive publication record.

Ilya SergeyView profile

Associate Professor

• Programming Languages
• Concurrency
• Type Theory
• +7 more

Ilya Sergey is an Associate Professor at the National University of Singapore (NUS) School of Computing, with previous faculty appointments at University College London (2015-2018). His academic career spans multiple prestigious institutions including IMDEA Software Institute (postdoctoral position) and KU Leuven (PhD). His educational background includes a PhD in Computer Science from KU Leuven (2012), an MSc in Mathematics and Computer Science from Saint Petersburg State University (2008), and professional experience as a software engineer at JetBrains prior to academia. Sergey's research focuses on the intersection of programming language theory and practical software verification, with particular emphasis on concurrent systems , smart contracts , and program synthesis . His work bridges theoretical foundations in type theory and separation logic with practical applications in blockchain technology and Rust programming. He has developed novel techniques for verifying heap-manipulating programs, analyzing commutativity in distributed transactions, and synthesizing correct-by-construction code. Analysis of his recent publications reveals a clear trajectory toward practical verification of blockchain systems and concurrent data structures, with increasing focus on Rust programming language applications. His work demonstrates consistent innovation in mechanized reasoning techniques while maintaining relevance to real-world software challenges, particularly in the domains of smart contracts and distributed systems. Sergey maintains an active research group at NUS, as evidenced by his social media references to lab traditions and student collaborations. He frequently participates in major programming languages conferences as both author and committee member, serving in leadership roles including General Chair for ICFP 2025. His research lab follows distinctive traditions, including location-based Mattermost status updates when traveling. Sergey is deeply engaged with the programming languages community through conference organization, mentoring activities, and outreach initiatives such as nature walks for conference attendees.

Denis KuperbergView profile

Researcher

• automata theory
• synthesis
• verification
• +6 more

Denis Kuperberg is a CNRS researcher at LIP (Laboratoire de l'Informatique du Parallélisme), ENS Lyon, where he is part of the Plume research team. His work bridges theoretical computer science with interdisciplinary applications, particularly in systems biology. His primary research interests include automata theory, synthesis, verification, games, logics, decidability procedures, complexity, and proof theory. Kuperberg's work often explores the connections between formal methods and practical applications, as evidenced by his recent interdisciplinary publications on thermodynamic consistency of autocatalytic cycles. His research demonstrates a strong focus on both theoretical foundations and practical implementations, with several software tools developed for research purposes. Kuperberg's publication record shows a clear evolution from purely theoretical work in automata and logic toward more interdisciplinary research. His recent papers (2022-2025) demonstrate increasing engagement with biological applications while maintaining strong theoretical foundations. Key themes across his publications include history-determinism in automata, cyclic proof systems, positive fragments of logic, and applications to verification problems. Best Paper Award at ICALP 2025 (with Thomas Colcombet and Amina Doumane) Kuperberg actively supervises multiple students at various levels, including PhD candidates (Iris Magniez–Papillon, Émile Hazard, Laureline Pinault), postdoctorates (Thomas Kosc, Marc Bagnol), and numerous interns. His teaching portfolio includes advanced courses on Graphs, Machines and Logics at ENS Lyon Master 2 program, Theory of Regular Languages at EPITA Lyon, and specialized topics like Mathematical Aspects of Automata Theory. He leads the development of research software including EmergeNS (for simulating chemical reaction networks and tracking autocatalytic dynamics), Stamina and Acme (for solving decision problems from automata theory), and Electrum (a specification language analyzer). These tools demonstrate his commitment to bridging theoretical computer science with practical implementations.

Christoph CsallnerView profile

Professor

• Program Analysis
• Automated Bug Finding
• Software Security
• +4 more

Christoph Csallner is a Professor in the Computer Science and Engineering Department at the University of Texas at Arlington (UTA). He previously worked at Google and Microsoft Research and holds a Diplom-Informatiker degree from Universität Stuttgart, Germany, and M.S. and Ph.D. degrees in Computer Science from Georgia Tech. His research has received numerous best paper awards at top software engineering conferences including ASE, ISSTA, and ISSRE. Dr. Csallner's research interests focus on software engineering, with particular expertise in program analysis, automated bug finding, software security, and mobile software development. His work bridges theoretical foundations with practical applications, developing tools that have real-world impact in improving software quality and security. Recent research has concentrated on analyzing Simulink models for cyber-physical systems, mobile app screen search and generation, and applying deep learning techniques to software testing problems. His publications show a consistent trajectory of innovation in software testing and analysis, with recent work exploring the intersection of machine learning and software engineering. The research spans from foundational program analysis techniques to practical tools addressing challenges in mobile development and cyber-physical systems. His work on Simulink model analysis has created valuable resources for the research community, including large open-source corpora of Simulink models. Scientific awards include: Best Paper Award at IEEE ISSRE 2010 ACM SIGSOFT Distinguished Paper Awards at ISSTA 2006 and 2012 Best Paper Award at PPREW 2014 ACM SIGSOFT Distinguished Paper Awards at ASE 2007 and 2015 Distinguished Referee Award at ASE 2019 Dr. Csallner has successfully advised numerous Ph.D. and Master's students who have gone on to prominent positions at companies like Meta, Google DeepMind, and Bloomberg. His research has been funded by the National Science Foundation, MathWorks, the Alzheimer's Association, and other organizations. He leads the Software Engineering Research Center (SERC) lab at UTA, where his team develops innovative tools for software analysis, testing, and development.

Yuriy BrunView profile

Professor

• software engineering
• self-adaptive systems
• software fairness and bias
• +4 more

Yuriy Brun is a Professor at the Manning College of Information & Computer Sciences at the University of Massachusetts Amherst. He leads research in software engineering with a focus on improving the construction of intelligent, self-adapting systems while ensuring fairness and correctness. His research spans several key areas: software fairness, self-adaptive systems, automated program repair, and formal verification. Brun's work has pioneered the field of software fairness, establishing it as a fundamental software engineering concern. His lab, LASER, conducts high-risk, high-impact research aimed at fundamentally improving how engineers build systems. Brun's publications demonstrate a strong focus on automating formal verification and ensuring fairness in machine learning systems. His recent work leverages large language models for proof synthesis and develops techniques for guaranteeing fairness constraints in software systems. His research has shown significant evolution from distributed systems and collaborative development toward formal verification and AI safety. NSF CAREER Award recipient IEEE Fellow Multiple ACM SIGSOFT Distinguished Paper Awards Google Inclusion Research Award recipient Amazon Research Award recipient Microsoft Research Software Engineering Innovation Foundation Award Brun actively mentors students, with current PhD advisees including Zhanna Kaufman, Hadeel Eladawy, and Abhishek Varghese. His former students have gone on to positions at institutions including Oregon State University, University of California San Diego, and Microsoft. He teaches courses including Introduction to Software Engineering and Software Engineering Project Management.

Yun LinView profile

Associate Professor

• Automatic programming
• Software debugging
• Software testing
• +8 more

Yun Lin is an Associate Professor and Deputy Head of the Department of Computer Science and Technology at Shanghai Jiao Tong University's School of Computer Science. Prior to joining SJTU, Lin served as a Research Assistant Professor at the National University of Singapore working with Prof. Dong Jin Song. Lin leads the CoPhi ("Code Philia") research group, which focuses on the intersection of Software Engineering, AI, and Security. Lin's research spans three major areas: Automatic Programming (including code editing, software testing, and debugging), Explainable AI (focusing on representation interpretation and training data attribution), and Web Misinformation (particularly phishing and scam detection). The research has resulted in numerous tools including CoEdPilot for code editing recommendation, DeepDebugger for interactive debugging of deep classifiers, and Phishpedia for phishing webpage detection. Lin's recent publications demonstrate a strong trend toward integrating AI techniques, particularly large language models and vision language models, with traditional software engineering and security tasks. The work shows increasing sophistication in understanding project context, handling interactive nature of programming tasks, and addressing security challenges in the age of generative AI. Key themes include consistency-based approaches for anomaly detection, agent-based frameworks for complex tasks, and hybrid models that combine symbolic reasoning with neural approaches. ACM Distinguished Paper Award in ICSE'18 for "Towards Optimal Concolic Testing" Distinguished Reviewer Award in FSE'25 2nd prize Research Prototype Award in ChinaSoft'24 Lin advises a large team of PhD, Master's, and undergraduate students, with several publications co-authored with students appearing in top venues. Current research is supported by collaborations with National University of Singapore, particularly with Prof. Dong Jin Song, and includes projects on code editing, GUI testing, and phishing detection. The CoPhi group maintains active development of multiple research tools and datasets. The CoPhi research group under Lin's leadership focuses on building practical tools that bridge the gap between theoretical advances and real-world programming and security challenges. The group's work spans from fundamental program analysis techniques to applied security solutions, with an increasing emphasis on leveraging AI capabilities while maintaining explainability and reliability.

• Software Engineering
• Requirements Engineering
• Agile Methodologies
• +4 more

Professor Jerzy Nawrocki is a distinguished academic at the Poznań University of Technology, where he serves in the Faculty of Computer Science and Telecommunications within the Institute of Computer Science. With a career spanning several decades since completing his doctoral dissertation in 1984 on 'Cost analysis of dynamic memory allocation in real-time systems,' he has established himself as a prominent researcher in software engineering. Professor Nawrocki's research primarily focuses on: Software Engineering methodologies and practices Requirements Engineering, particularly Non-functional Requirements Agile Software Development processes Use Case Analysis and specification Code Quality assessment and metrics Software Documentation quality models His recent work has examined task-specific code metrics, the application of Definition of Done in agile projects, and the maintenance of non-functional requirement templates. Professor Nawrocki has published extensively, with numerous articles in reputable journals such as IEEE Access, Journal of Systems and Software, and Information and Software Technology. Professor Nawrocki has supervised eight doctoral dissertations, mentoring researchers who have gone on to make their own contributions to the field of software engineering. His students include Sylwia Kopczyńska, Bartosz Alchimowicz, Jakub Jurkiewicz, and Mirosław Ochodek. His work demonstrates a consistent focus on empirical approaches to software engineering challenges, with many of his publications presenting empirical studies that validate or challenge existing practices in the field.

• Computer Software
• Computation Theory
• Pure Mathematics
• +3 more

Martin Berger is an Associate Professor in Foundations of Computation at the University of Sussex's School of Engineering and Informatics. His research bridges theoretical computer science and practical systems engineering, with focus areas including: Formal methods and program verification Programming language design and semantics Hardware security vulnerabilities and mitigations GPU-accelerated computation and program synthesis Automated reasoning and logic-based systems With 51 publications, his recent work demonstrates strong emphasis on: Developing high-performance simulation tools (Pydrofoil) GPU-based acceleration of formal methods Security analysis of programming language ecosystems Automated inference systems for regular expressions He maintains active research collaborations across Europe and welcomes inquiries via his institutional email.

Bas SpittersView profile

Associate Professor

• Homotopy Type Theory
• Formal Verification
• Blockchain
• +6 more

Bas Spitters is an Associate Professor at the Department of Computer Science, Aarhus University, Denmark. He leads the Concordium Blockchain Research Center and the Blockchain workpackage in Digit , and contributes to Aarhus University's Quantum Campus initiative. His research spans Homotopy Type Theory , Formal Verification , and High-assurance cryptographic software . He develops proof assistants like Coq for applications in probabilistic programming , blockchain security , and quantum computing . Recent article trends focus on verified compilation (CertiCoq-Wasm), smart contract certification (ConCert), and applications of HoTT to probabilistic and blockchain systems. Key keywords include Formal Methods , Blockchain , Quantum Computing , and Cubical Type Theory . Scientific awards and grants: AFOSR grant (2018-2021) for Homotopy Type Theory in probabilistic computation Villum Foundation grant (2015-2019) for Guarded Homotopy Type Theory NWO VENI grant (2010-2013) for Reasoning and Computing DIAMANT researcher grant Advising and collaboration: Advised PhD students: Benjamin Salling Hvass, Jakob Botsch Nielsen, Andreas Aagaard Lynge, Soren Eller Thomsen, Martin Bidlingmaier Collaborated on computer-verified exact analysis, smart contracts, and quantum logic Organized workshops: TYPES workshop , HACS , and DMV Mini-Symposium

Denis MerigouxView profile

Researcher

• Programming Languages
• Verification
• Compiler Construction
• +3 more

Denis Merigoux is a researcher at Inria specializing in the intersection of programming languages , formal verification , and computational law . As the lead of the Catala project, he focuses on translating legal texts into verifiable code to modernize tax and social welfare systems. His academic background includes a PhD in Computer Science from Université Paris Sciences et Lettres (2021) and a Master's thesis at École polytechnique.