Michael Carbin is the Jamieson Career Development Assistant Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT) and leads the MIT Programming Systems Group. His research focuses on programming systems that address system uncertainty to enhance performance, energy efficiency, and resilience, particularly in environments involving neural networks , approximate computing , and unreliable hardware . His work spans probabilistic programming , quantum computing , and machine learning systems . Articles highlight contributions in pruning neural networks , quantum data structures , and compiler optimization , reflecting trends in deep learning , formal verification , and language-driven systems . Scientific Awards : MIT Frank E. Perkins Award (2020) Sloan Research Fellowship (2020) Facebook Research Award (2019) NSF CAREER Award (2018) Best Paper Awards at OOPSLA (2013, 2014) He has advised numerous graduate students and postdocs including Eric Atkinson, Cambridge Yang, and Charles Yuan, and served on program committees for conferences like POPL, OOPSLA, and ICLR. His group collaborates with institutions such as MIT CSAIL and explores applications in quantum algorithms and probabilistic inference .
Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.
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.
Joseph Eremondi is an Assistant Professor in the Department of Computer Science at the University of Regina, Faculty of Science, Canada. He began his tenure in 2024 after serving as a Royal Society Newton International Fellow at the University of Edinburgh, where he conducted postdoctoral research with Ohad Kammar in the Laboratory for Foundations of Computer Science. He earned his PhD from the University of British Columbia (UBC) under the supervision of Ron Garcia at the UBC Software Practices Laboratory. His research is centered on programming languages theory, with a strong focus on type systems that enhance software reliability and usability. He is particularly known for his work in dependent types, gradual typing, and the integration of both paradigms. His research interests include: Dependent pattern matching and its semantic foundations Gradual dependent types and approximate normalization Error message generation and usability in dependently typed languages Static analysis using set constraints and SMT solvers Theoretical properties of reversal-bounded counter automata and shuffle operations His recent publications, appearing in premier venues like POPL, ICFP, and CPP, reflect a consistent trajectory toward making advanced type systems more accessible and practical. Key themes include coverage semantics for dependent pattern matching, formal models of gradual dependent typing, and improving the developer experience through better tooling and error diagnostics. Notable scientific recognitions include the NSERC Discovery Grant (awarded in 2025) and the prestigious Royal Society Newton International Fellowship. These awards underscore the impact and promise of his research program on the usability of dependently typed programming languages. Joseph is actively mentoring and recruiting graduate students, particularly in areas such as dependently typed programming (Lean, Agda, Idris, Coq), gradual typing, live programming environments, and static analysis. He emphasizes close collaboration within a small, focused research group. He has also served on program committees, including for TyDe and POPL Artifact Evaluation, demonstrating active engagement in the programming languages community. His work bridges theoretical rigor with practical implementation, evident in his artifact releases on GitHub and integration with tools like Ott and DrRacket. He maintains a personal website and open-source repositories that support reproducibility and community involvement.
Björn Pasternak is a Research Professor leading the Pharmacoepidemiology group at the Department of Medicine, Solna, Karolinska Institutet. His team specializes in large-scale registry studies focused on adverse drug effects, with research programs in pediatric pharmacoepidemiology, safety of diabetes medications, and rapid assessment of drug safety concerns. The group leverages high-quality epidemiological methods to inform evidence-based clinical decisions. Pasternak's research interests span pharmacoepidemiology, drug safety, diabetes outcomes, cardiovascular risk, and perinatal health. His work utilizes nationwide registries to evaluate real-world drug effects, socioeconomic disparities in treatment, and long-term outcomes of chronic therapies. Key focuses include GLP-1 receptor agonists, SGLT2 inhibitors, antibiotic use in pregnancy, and opioid safety. Recent publications demonstrate strong emphasis on Scandinavian cohort studies of diabetes medications (GLP-1 agonists, SGLT2 inhibitors) and their associations with thyroid cancer, liver events, intestinal obstruction, and cardiovascular/renal outcomes. Other trends include perinatal pharmacovigilance (antibiotics, acid-suppressive drugs) and neurodegenerative risks in athletes.
Manuel R. Amieva is a Professor at Stanford University School of Medicine , holding joint appointments in Pediatrics - Infectious Diseases and Microbiology & Immunology . He is also a member of the Maternal & Child Health Research Institute (MCHRI) . His clinical practice at Stanford Medicine Children's Health focuses on pediatric infectious diseases. Education: Medical Education: Stanford University School of Medicine (1997) Fellowship: Stanford University Pediatric Infectious Disease Fellowship (2004) Internship & Residency: Stanford Health Care at Lucile Packard Children's Hospital (1998-1999) Dr. Amieva's research investigates host-pathogen interactions at epithelial barriers, with specific expertise in Helicobacter pylori , Listeria monocytogenes , Salmonella enterica , and Staphylococcus aureus . His lab develops innovative organoid culture systems with controlled polarity to study microbial colonization and oncogenic mechanisms. Key discoveries include: H. pylori's manipulation of epithelial junctions via the CagA protein Listeria's exploitation of cell extrusion sites for invasion Staphylococcus toxin interactions with adherens junctions Gastric stem cell activation by pathogens Recent publication trends show continued leadership in infectious disease mechanisms (2020-2025), with a focus on: Pathogen-specific epithelial breach strategies Organoid modeling of viral/bacterial interactions Redox-dependent host factor regulation Single-cell spatial transcriptomic analyses Multi-institutional educational frameworks His scientific collaborations span disciplines including: Gastric cancer genomics initiatives COVID-19 lung infection models Stem cell-microbe interactions Medical education reform projects Dr. Amieva maintains active clinical research while mentoring students in both the Microbiology & Immunology and Pediatrics programs. His lab at Stanford employs advanced 3D confocal microscopy and organ-on-a-chip technologies to visualize epithelial colonization dynamics.
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.
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.
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.
Naoki Yoshinaga is a tenured Associate Professor at the Institute of Industrial Science, The University of Tokyo, with extensive experience in natural language processing and computational linguistics. He has held academic positions since 2008 and currently leads research on pragmatic NLP models and multilingual systems. PhD in Computer Science, The University of Tokyo (2005-2008) MSc in Information Science (2000-2002) BSc in Information Science (1996-2000) His research focuses on mechanistic interpretability in NLP models, multilingual/multimodal NLP , and efficient model design using trie structures and conjunctive features. He also investigates knowledge acquisition from social data and evaluation metrics for language generation . Recent publications include work on neuron empirical gradient analysis (ACL-25), multilingual knowledge representation (EACL-24), and compact embedding methods (CoNLL-24). His research has been funded by multiple grants, including the University of Tokyo Excellent Young Researcher program and JSPS fellowships. Committee Special Award, Association for NLP (2023) JSAI SIG Research Award (2022) Best Interactive Award, DEIM Forum (2019, 2016) He developed widely-adopted NLP tools like pecco (fast classification library), RenTAL (LTAG-to-HPSG grammar converter), and J.DepP (Japanese dependency parser). His lab emphasizes strong equivalence in formalism comparisons and pragmatic model design .
Dr. Benjamin Scott Flavel is a Research Group Leader at the Institute of Nanotechnology, Karlsruhe Institute of Technology (KIT), Germany. His research focuses on carbon nanotubes and their applications in photovoltaics and sensing technologies. He leads a dynamic research team conducting cutting-edge work on the separation, purification, and application of single- and double-walled carbon nanotubes. Education: Doctor of Philosophy (Chemistry), Flinders University, Australia, 2010 Bachelor of Science in Nanotechnology (Honors), Flinders University, Australia, 2005 Habilitation in Materials Science, Technische Universität Darmstadt, 2018 His research interests lie at the intersection of nanotechnology and energy materials, particularly in carbon nanotube-based solar cells , chirality-specific separation techniques , and nano-sensing devices . His group has pioneered methods such as ATPE for enantiomer sorting and developed innovative solar cell architectures with industrial relevance. The research spans fundamental charge transport mechanisms to applied device engineering. The publication record shows a strong trend in advancing carbon nanotube photovoltaics, with key contributions in interface engineering, scalable fabrication, and high-efficiency CNT:Si solar cells. Work also extends to spectroscopic characterization, alignment techniques, and software tools for data analysis. Scientific Awards: Heisenberg Program, DFG (2018) Emmy Noether Program, DFG (2013) Alexander von Humboldt Research Fellowship (2011) Australian Government Endeavor Research Fellowship (2009) Bloom-Gutmann Prize, Royal Australian Chemical Institute (2008) Hope Meeting, Japanese Society for the Promotion of Science (2008) Research Fellowship, Flinders University (2007) Dr. Flavel has successfully advised multiple PhD students, including Dr. Moritz Pfohl, Dr. Katherine Moore, and Dr. Daniel Tune. His research has been supported by significant grants from the German Research Foundation (DFG), including funding for a double-walled carbon nanotube project and an organic evaporation system (~320,000 EUR). Collaborations span institutions such as NIST, Freie Universität Berlin, University of Antwerp, McMaster University, and University of Sydney. The research group operates within the Institute of Nanotechnology at KIT, utilizing advanced infrastructure for nanomaterials synthesis, characterization, and device fabrication. The team is recognized internationally, with work featured in Open Access Government , Research Features , and Europhotonics , and covered by Nanotechweb.
David I. August is a Professor of Computer Science at Princeton University, affiliated with the Department of Electrical Engineering. He earned his Ph.D. from the University of Illinois at Urbana-Champaign in 2000. His research focuses on compilers and computer architecture, emphasizing synergistic design between compilers and microarchitecture. He leads the Liberty Research Group, which explores topics such as automatic parallelization, memory profiling, and speculative execution. August joined Princeton in 1999 as a lecturer, advancing to full professor in 2012. He has served as program chair for MICRO 2009 and on committees for ISCA, PLDI, and ASPLOS. His notable accolades include the IEEE Fellow designation, Best Paper Awards at PLDI and CGO, and teaching awards from Princeton's School of Engineering. His work spans compiler optimizations, hardware-software co-design, and security architectures like TrustGuard. Recent research includes GPU scheduling (GhOST), memory profiling frameworks (PROMPT), and instruction prefetching (PDIP). He advises over 20 graduate students, many now leading roles at tech companies and academia. August teaches courses such as COS-126 (Intro to CS), COS-375 (Computer Architecture), and graduate seminars. His projects often bridge theory and practice, with tools like NOELLE and Liberty Research Group initiatives advancing compiler infrastructure and parallelism extraction.
Alexander Summers is an Associate Professor at the Department of Computer Science , University of British Columbia . He joined UBC in March 2020 after serving as a Senior Researcher (Oberassistent) at ETH Zurich from 2014-2020. His research bridges Programming Languages , Formal Methods , and Software Engineering , with a focus on automated verification tools for heap-based and concurrent programs. MSc Joint Mathematics and Computer Science, Imperial College London (2004) PhD Computer Science, Imperial College London (2009) Postdoc, ETH Zurich (2009-2014) Summers leads the Prusti Project , developing deductive verification tools for Rust, and contributes to the Viper Project for intermediate verification languages. His work addresses challenges in: Memory safety and concurrency verification Ownership models and aliasing control Automated reasoning with SMT solvers Resource-oriented programming specifications Debugging verification condition quantifiers Formal validation of verification infrastructure His research has been recognized with a Amazon Research Award and ACM SIGPLAN Distinguished Paper Awards . He teaches courses like Advanced Software Engineering and Program Verifiers and Program Verification , and supervises graduate students in formal verification and Rust-related research.
Dr. Tim Halim is a Sir Henry Dale Fellow and Junior Group Leader at the Cancer Research UK Cambridge Institute (CRUK Cambridge Institute), University of Cambridge. His primary research program focuses on pancreatic cancer, with thoracic cancer as a secondary research focus within the CRUK Cambridge Centre's structured research programs. Dr. Halim's research expertise lies at the intersection of cancer biology and immunology, with particular emphasis on innate lymphoid cells (especially ILC2) and regulatory T cells within the tumor microenvironment. His work investigates how these immune cell populations interact with cancer cells and influence tumor progression, metastasis, and response to therapy. His research has significant implications for developing novel immunotherapeutic approaches for pancreatic and thoracic cancers. His publication record demonstrates a consistent focus on the role of innate lymphoid cells in cancer, with recent work examining IL-33 and ILC2 in pancreatic cancer, cross-talk between ILC2 and regulatory T cells, and the influence of innate lymphoid cells on pancreatic stromal composition. His research employs advanced techniques including in vivo labeling, single-cell analysis, and fate-mapping approaches to understand immune cell behavior in cancer contexts. Dr. Halim has been awarded the prestigious Sir Henry Dale Fellowship, a joint fellowship from the Royal Society and Wellcome Trust that supports early-career researchers of outstanding promise working at the interface of basic and clinical science.
Limin Jia is a Research Professor in the Electrical and Computer Engineering (ECE) department at Carnegie Mellon University, with a courtesy appointment in the Computer Science Department (CSD). Affiliated with CyLab, their work focuses on applying formal techniques to enhance software security through programming language design, formal verification, and information flow analysis. Research interests span Security Programming Languages Formal Verification Information Flow Control Intermittent Computing Rust Programming . Recent publications integrate formal methods with practical security challenges, including Node.js vulnerability detection Rust API testing Secure multi-execution Intermittent computing type systems IFTTT security analysis Browser security frameworks . Limin serves on program committees for conferences like POPL, PLDI, VMCAI, and is actively involved in teaching courses such as Browser Security (18-636) Introduction to Information Security (18-631) .
_rdax_230x341s.jpg)
