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 .
Jenna Wise DiVincenzo is an Assistant Professor at the Elmore Family School of Electrical and Computer Engineering at Purdue University. She specializes in research areas such as software verification, formal methods, and programming languages, with a focus on gradual verification techniques that combine static and dynamic analysis. Her work emphasizes usability and scalability in verification tools, and she has contributed to projects like Gradual C0 and gradual null-pointer analysis. Dr. DiVincenzo earned her PhD in Software Engineering from Carnegie Mellon University (2023) and a BS in Mathematics and Computer Science from Youngstown State University (2017). She has interned at IBM Research, MIT Lincoln Laboratory, and the Software Engineering Research and Empirical Studies Lab at YSU. Her awards include the Google PhD Fellowship, NSF GRFP Fellowship, and 2022 Rising Star in EECS. Her research projects span theoretical advancements in gradual verification, empirical studies on usability, and practical tool development. She advises PhD students (e.g., Craig Liu, Conrad Zimmerman) and collaborates on initiatives like gradual verification for Rust and educational tools to teach verification concepts. Her work also explores leveraging large language models for specification generation and enhancing verification tool soundness through formal proofs.
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.
Prof. Dr. Timothy Roscoe is a Full Professor in the Department of Computer Science at ETH Zurich. His research focuses on operating systems, networking, and distributed systems. He was inducted as an ACM Fellow in 2014 for contributions to these fields. Previously, he worked at Intel Research Berkeley, UC Berkeley (Adjunct Professor), and Sprint Labs. His work includes foundational contributions to systems like PlanetLab, P2 Declarative Networking, and the Nemesis OS. Roscoe holds a PhD from the University of Cambridge and has led projects in cloud computing, wide-area network measurement, and secure systems design. His current research emphasizes hardware-software co-design, formal verification of systems, and scalable memory architectures. Education: PhD in Computer Science, University of Cambridge (1995) Key Roles: Principal Researcher at Intel Berkeley Lab, Visiting Researcher at National ICT Australia Research Highlights: Contributions to distributed systems (PlanetLab), declarative networking (P2), and secure microkernels (seL4 integration). Current projects address challenges in disaggregated memory systems, coherent interconnects, and trustworthy embedded systems. Awards: ACM Fellow (2014), numerous grants and industry collaborations. Labs/Teams: Systems Group at ETH Zurich, focusing on OS design, hardware architectures, and formal methods.
Professor Christian Bizer is a leading figure in web-based systems and data integration at the University of Mannheim , where he chairs Information Systems V: Web-based Systems . His research focuses on integrating data from multiple sources using large language models and LLM-based agents, with applications in product data extraction and DBpedia knowledge graph construction. He co-founded the DBpedia project and initiated the WebDataCommons initiative. Current research areas: Entity matching, schema matching, table annotation, information extraction, data discovery Key projects: WebMall benchmark, WInte.r integration framework, Schema.org analysis His work applies to e-commerce data integration and knowledge graph construction, with empirical studies on schema.org adoption. He supervises PhD students including Alexander Brinkmann and Ralph Peeters. Scientific Awards: Best Paper at iiWAS 2024 SWSA Ten-Year Award at ISWC 2019 Yahoo FREP Award 2015 Semantic Web Challenge winners Teaching includes courses on web data integration, web mining, large language models, and data mining for master's programs. He leads the DWS PhD colloquium and team projects on LLM agents for data integration.
Yao Qin is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of California, Santa Barbara (UCSB), with dual affiliation in the Department of Computer Science. She concurrently serves as Co-Director of the REAL AI Initiative at UCSB and holds a Senior Research Scientist position at Google DeepMind, where she contributes to the Gemini Multimodal project. Her academic credentials include a PhD in Computer Science and Engineering from the University of California, San Diego (advised by Prof. Garrison W. Cottrell) and a BS in Electrical Engineering from Dalian University of Technology. During her doctoral studies, she completed internships with pioneering researchers Geoffrey Hinton and Ian Goodfellow. Dr. Qin's research program centers on machine learning robustness, with emphasis on adversarial robustness, out-of-distribution generalization, and fairness. She develops reliable AI systems specifically for healthcare applications, with diabetes management as a primary focus. Her lab explores critical themes including AI safety in multimodal models and diabetes-specific AI solutions, particularly exercise metabolism modeling and glycemic effect prediction. Recent publications reveal a strong trajectory in robust machine learning with cross-domain applications. Her work consistently bridges theoretical robustness concepts with practical healthcare implementations, particularly in diabetes care. Key publication venues include CVPR, ICML, NeurIPS, and ICLR, with notable contributions to out-of-distribution detection, adversarial transfer learning, and multimodal AI safety. Her distinguished recognition includes: EECS Rising Star at MIT (2021) UCSB Regents' Junior Faculty Fellowship Award Helmsley Charitable Trust award for Type 1 diabetes research UCSB Faculty Research Grant American Diabetes Association Abstract Award (ADA-2025) Dr. Qin actively mentors four PhD students—Mehak Dhaliwal, Andong Hua, Kenan Tang, and Youngseok Yoon—on projects spanning LLMs for diabetes, multimodal robustness, and generative time-series modeling. Her research is funded by the Helmsley Charitable Trust and UCSB, with recent grants supporting exercise-specific AID algorithms for diabetes management. As Co-Director of the REAL AI Initiative, she leads a research ecosystem focused on developing reliable artificial intelligence. Current lab activities include organizing workshops at NeurIPS-2024 (AdvML-Frontiers and AIM-FM) and developing next-generation diabetes management tools through collaborations with medical institutions.
Fabian Suchanek is a full professor at Institut Polytechnique de Paris, specifically affiliated with Télécom Paris. He leads research in the Data, Intelligence, and Graphs (DIG) team within the Computer Science department. His academic career focuses on bridging artificial intelligence with structured knowledge representations. Suchanek's research interests span artificial intelligence, knowledge bases, and natural language processing, with particular emphasis on knowledge graph construction , rule mining , knowledge-based language models , and explainable AI . His work demonstrates how structured knowledge can enhance machine learning systems, particularly large language models, by providing factual grounding and interpretability. The research group he leads develops practical systems that address real-world knowledge management challenges. His recent publications showcase a strong trajectory in knowledge-intensive AI, with notable contributions to knowledge graph completion, rule mining techniques, and neural approaches to knowledge base validation. The research demonstrates increasing integration between symbolic and neural approaches to AI. Best Student Paper Award at KR 2024 for work on contextual reasoning Best Demo Award of IJCAI 2024 for rule mining in knowledge graphs French Open Research Award for the YAGO project Best Paper Award of ESWC 2021 for Neural Knowledge Base Repairs Suchanek has secured significant research funding, evidenced by his active recruitment of PhD students for knowledge-based language model research. He has held visiting positions, including at Nanyang Technological University (June-September 2023), and is recognized internationally through keynote invitations such as the Singapore ACM SIGKDD Symposium 2023. He has deliberately stepped back from administrative duties at Institut Polytechnique de Paris to focus on research. His laboratory maintains strong industry connections through open-source software projects including the YAGO knowledge base, AMIE for rule mining, STACI for explainable AI, and several other tools that have become standard in knowledge representation research.
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.
Nadia Polikarpova is an Associate Professor in the Department of Computer Science and Engineering at the University of California, San Diego . She earned her PhD from ETH Zurich in 2014 under Bertrand Meyer , followed by postdoctoral research at MIT CSAIL with Armando Solar-Lezama . Her academic contributions have been recognized with prestigious awards including the 2020 Sloan Fellowship , 2020 Intel Rising Stars Award , and 2020 NSF CAREER Award . Polikarpova's research focuses on program synthesis , program verification , and type systems . She leads the Programming Systems group at UCSD and contributes to the IFIP Working Group 2.8 on Functional Programming since 2022. Her work spans foundational research and practical tools, including projects like Synquid , SuSLik , and Laurel that combine formal methods with machine learning for code generation. Her recent publications in venues like OOPSLA , NeurIPS , and ICFP reveal trends in AI-assisted programming , live programming environments , and formal verification . She has advised numerous PhD and Master’s students including Shraddha Barke , Zheng Guo , and Tristan Knoth , many of whom have moved to prominent academic and industry positions. Notable artifacts from her lab include tools like ColDeco for spreadsheet inspection and Superfusion for eliminating intermediate data structures. 2020 : Sloan Fellow 2020 : Intel Rising Stars Award 2020 : NSF CAREER Award 2021 : Distinguished Paper at POPL 2023 : Distinguished Artifact at PLDI 2023 : Distinguished Paper at OOPSLA Polikarpova actively contributes to academic service, serving on program committees for PLDI , POPL , and OOPSLA , and co-chairing the OOPSLA Review Committee in 2023. She has delivered keynotes at APLAS'20 and PLDI'24 , emphasizing the integration of large language models with formal methods.
William Yang Wang serves as the Mellichamp Professor of Artificial Intelligence at the University of California, Santa Barbara (2019-present). He directs the UCSB Center for Responsible Machine Learning, the Mind and Machine Intelligence Initiative, and the UCSB NLP Group. His research focuses on theoretical foundations and practical algorithms for AI, particularly in NLP, LLMs, and neuro-symbolic reasoning. PhD in Computer Science from Carnegie Mellon University Active in AI theory and applications (2016-present) Research interests span multiple AI domains, with special emphasis on NLP and responsible machine learning. He has pioneered datasets like HybridQA, TabFact, and VaTeX, enabling advancements in multi-hop QA, fact verification, and video-language tasks. His work combines statistical relational learning with modern deep learning paradigms. Recent publications center around multimodal reasoning, knowledge graph integration, and responsible AI development. He has received numerous accolades including the IEEE SPS Pierre-Simon Laplace Award (2024) and NSF CAREER Award (2021). Karen Sparck Jones Award (2022) DARPA Young Faculty Award (2018) IBM Faculty Award Mentoring 15+ PhD and postdoc researchers who now hold positions at Microsoft Research, Amazon, Meta GenAI, and academic institutions like Arizona and Rutgers. His lab maintains active collaborations with industry partners through initiatives like ChipAgents.ai, which he founded as CEO.
Madelon Hulsebos is a Researcher at CWI in Amsterdam, where she leads the Table Representation Learning (TRL) Lab and contributes to the Database Architectures group. She is also a faculty member of the European Laboratory for Learning and Intelligent Systems (ELLIS) Amsterdam unit. Her career bridges academia and industry, including a postdoctoral fellowship at UC Berkeley and prior industry experience in automating data analysis pipelines with ML. Education : PhD in Computer Science (University of Amsterdam, 2023), with research at Sigma Computing and MIT; Postdoctoral Fellow (UC Berkeley, 2024). Her research focuses on establishing tabular data as a key AI modality through Table Representation Learning , generative models for relational data, and robust systems for data analysis. Key interests include: Relational Table Embeddings LLMs for QA/text2SQL and data wrangling Retrieval over Data Lakes and Databases Agentic Systems for Data Science Democratizing insights from structured data Recent work highlights trends in benchmarking table retrieval (TARGET), semantic column detection (AdaTyper, Sherlock), and large-scale tabular data curation (GitTables, SchemaPile). These projects address challenges in metadata utilization, data lake search, and end-to-end systems for structured data. She has secured significant funding, including the NWO AiNed Fellowship Grant ($1M) for her 5-year DataLibra project. Madelon organizes workshops at NeurIPS , SIGMOD , and ACL , and reviews for top venues like VLDB and NeurIPS. Scientific Awards : NWO AiNed Fellowship Grant ($1M) She actively mentors students and collaborates on European AI initiatives, including monthly TRL seminars and workshops. Her lab's tools (GitTables, TARGET) are widely adopted for training foundation models on tabular data.
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.
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.
Caroline Lemieux is an Assistant Professor at the Department of Computer Science, University of British Columbia (UBC), with research focused on advancing software correctness, security, and performance through innovative testing and synthesis techniques. Her work bridges Programming Languages and Software Engineering , particularly in fuzz testing, specification mining, and program synthesis. PhD from University of California, Berkeley (2021), advised by Koushik Sen Postdoctoral researcher at Microsoft Research, NYC (2021-2022) Key contributions: FuzzFactory , CodaMOSA , Arvada , and Gauss Her research integrates machine learning with traditional testing methods, exemplified by projects like RLCheck (reinforcement learning for test generation) and AutoPandas (neural synthesis for dataframes). Recent publications analyze generator-based fuzzing challenges and propose hybrid strategies combining coverage feedback with AI-driven insights. Scientific Awards : ACM/SIGSOFT Best Paper Award (ESEC/FSE 2019) ACM/SIGSOFT Tool Demonstration Award (ISSTA 2019) ACM/SIGSOFT Distinguished Artifact Award (ISSTA 2019) NSERC Postgraduate Scholarship-Doctoral (PGS D) UBC Governor General's Silver Medal (2016) Teaching roles include: 2025W2: CPSC 539L - Topics in Programming Languages 2024W2: CPSC 410 - Advanced Software Engineering 2023W2: CPSC 410 (with Alex Summers) She supervises graduate and undergraduate researchers working on projects like ExploTest (automated unit test generation) and GRIMOIRE (grammar extraction from pseudo-rules). Her research team collaborates with institutions including Microsoft Research, Google, and academic partners in systems security and AI-driven testing.
Daniel Varro is a Professor affiliated with McGill University (Faculty of Engineering, School of Computer Science), with strong ties to Budapest University of Technology and Economics and Linköping University. He is a leading researcher in model-driven engineering, cyber-physical systems, and software engineering, actively contributing to top-tier conferences such as MODELS, ICSE, and ASE. His research focuses on model-based systems engineering (MBSE) , automated model generation , model transformations , and constraint-based consistency checking . Recently, his work has expanded into integrating large language models (LLMs) and machine learning into modeling workflows, including model querying, domain modeling, and bug detection. The recent publications reveal a strong trend toward AI-augmented modeling, logic-based solvers (e.g., Refinery), and safety assurance of autonomous systems (e.g., COLREGs compliance). His work bridges formal methods with practical software engineering challenges in industrial and safety-critical domains. Scientific Awards: No specific awards mentioned in the text. Advising and Grants: While no explicit list of students or grants is provided, his mentorship in the Doctoral Symposium and repeated leadership roles suggest active supervision and likely grant funding. He has led projects on automated model generation, model quality, and AI integration in modeling. Labs and Teams: Daniel Varro is associated with research groups focused on model-driven engineering and software evolution, likely leading or co-leading teams working on the VIATRA and Refinery frameworks for model transformation and solving.
