Sanjit A. Seshia is the Cadence Founders Chair Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley . He is affiliated with the Group in Logic and the Methodology of Science and participates in centers like the Industrial Cyber-Physical Systems Center , Berkeley AI Research , and the Simons Institute for the Theory of Computing . Research interests include formal methods for automated verification and synthesis of dependable systems, with applications to cyber-physical systems , AI-based autonomy , and computer security . His work spans SMT solving, model counting, syntax-guided synthesis, and algorithmic improvisation, with tools like UCLID5 , VerifAI , and Scenic for verifying autonomous systems and educational platforms like CPSGrader . Students and collaborators include notable researchers such as Dorsa Sadigh (Stanford), Daniel Fremont (UC Santa Cruz), and Hazem Torfah (Chalmers). He has co-founded startups like Decyphir and 20ⁿ Labs based on his research.
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.
Prof. Dr. Barbara Kraus is the Chair of Quantum Algorithms and Applications at the Technical University of Munich (TUM), affiliated with the TUM School of Natural Sciences. She previously held academic positions at the University of Innsbruck, where she founded her research group in 2010. Education : Physics and Mathematics at the University of Innsbruck; Post-doctoral work at MPI for Quantum Optics and University of Geneva. Her research focuses on foundational problems in quantum information theory, particularly entanglement in multipartite systems, quantum simulation, and verification of quantum processors. She develops theoretical tools for quantum many-body systems and explores applications in quantum computing, emphasizing error characterization and experimental validation. Recent publications highlight advancements in Hamiltonian learning, symmetry-resolved entanglement detection, and multipartite state transformations. Her work bridges theoretical quantum physics with practical implementations, including Rydberg platforms and quantum metrology. Key Awards : START Prize (2010), Ignaz L. Lieben Award (2013), Boltzmann Prize (2011), Südtiroler Sparkasse Research Prize (2019). She supervises doctoral students and postdocs in quantum information theory, with a focus on stabilizer states, quantum networks, and entanglement measures. Her courses at TUM include Quantum Information , Quantum Algorithms , and workshops on entanglement manipulation.
Supratik Chakraborty serves as the Bajaj Group Chair Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Bombay. He maintains dual affiliations with the Centre for Formal Design and Verification of Software and the Centre for Liberal Education at IIT Bombay, demonstrating his cross-disciplinary engagement. Professor Chakraborty's research spans formal methods with focus on formal verification, rigorous analysis of system models, and automated synthesis of systems from specifications. His work bridges theoretical foundations with practical applications, particularly in developing mathematically provable guarantees for increasingly complex hardware, software, and intelligent systems. Current research interests include constrained counting and sampling, scalable formal verification of software and hardware systems, automated synthesis of programs and circuits, and applications of automata, logic and finite model theory to practical verification challenges. His publication trajectory shows a significant evolution from traditional hardware and software verification toward addressing verification challenges in machine learning and AI systems. Recent work increasingly focuses on interpretability of black-box models, verification of neural networks, and synthesis techniques applicable to intelligent systems. The research demonstrates strong interdisciplinary connections between formal methods, programming languages, and artificial intelligence. IIT Bombay Excellence in Thesis (CSE) Award 2011 (for Bhargav Gulavani's thesis) IIT Bombay Excellence in Thesis (CSE) Award 2017 (for Abhisekh Sankaran's thesis) Best Paper in Algorithms and Architecture track at IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1998 Professor Chakraborty has successfully supervised 11 doctoral students, with research spanning formal verification techniques, Boolean functional synthesis, constrained counting, and applications to hardware and software systems. His students have gone on to positions at major institutions including Microsoft Research, TCS Research, Georgia Tech, and BARC, reflecting the strong industry and academic impact of his mentorship. Current research directions show increasing emphasis on verification challenges posed by machine learning systems and AI. His research group at IIT Bombay, while not explicitly named in the materials, appears to focus on formal methods with strong connections to the Centre for Formal Design and Verification of Software. The group maintains active collaborations with international researchers including Moshe Y. Vardi at Rice University, and has made significant contributions to verification tools like VeriAbs that bridge theoretical advances with practical applications.
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.
Sean Welleck is an Assistant Professor at Carnegie Mellon University's School of Computer Science, Language Technologies Institute, leading the L3 Lab. His research focuses on bridging informal and formal reasoning with AI, spanning machine learning for mathematics and code, inference algorithms, and AI agents. PhD in Computer Science from New York University (advised by Kyunghyun Cho) Postdoctoral work at University of Washington (advised by Yejin Choi) His work explores AI-driven formal methods for mathematics and code generation, test-time compute scaling, and algorithms enabling AI improvement over time. Recent publications analyze reasoning evaluation, premise selection, and automated proof optimization in systems like Lean. Key article trends include neural theorem proving, code generation, and inference-time compute optimization. Awards: NVIDIA AI Labs Pioneering Research Awards (2017, 2018), NAACL 2025 Best Paper. Current advisees include PhD students Pranjal Aggarwal, Weihua Du (co-advised with Yiming Yang), Andre He (co-advised with Daniel Fried), and Seungone Kim (co-advised with Graham Neubig). He co-organizes workshops like Autoformalization for the Working Mathematician (ICERM 2025) and VerifAI: AI Verification in the Wild (ICLR 2025), and teaches Advanced NLP at CMU.
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.
Ardalan Amiri Sani is an Associate Professor in the Computer Science Department at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information & Computer Sciences. He leads the Trustworthy Systems Lab (TrussLab), focusing on secure and reliable mobile systems, operating systems, and virtualization. His research bridges mobile computing, security, and OS design, addressing challenges in I/O devices, kernel hardening, and verifiable provenance. Education: Ph.D. and M.Sc. from Rice University (ECE), B.Sc. from Sharif University of Technology. Awards include the NSF CAREER Award, Google ASPIRE Award, and UCI Dean's Mid-Career Research Award. He has advised numerous graduate and undergraduate students, many of whom now work in academia and industry. Research highlights include Tabellion (secure legal contracts on mobile devices), ProvCam (verifiable video provenance), and work on minimizing smartphone TCBs via hardware isolation. His grants include NSF funding for OS kernel security and NSA support for provenance systems. Education: Ph.D., Electrical and Computer Engineering, Rice University, 2014 B.Sc., Electrical Engineering, Sharif University of Technology Grants: $500K NSF Award (with UCR) for OS kernel security (2020) NSF SaTC Award for GPU security in browsers Google ASPIRE Award for Android system call filtering Labs/Teams: Trustworthy Systems Lab (TrussLab), collaborating with industry partners like Intel and Broadcom.
Juan Zhai is an Assistant Professor in the Manning College of Information and Computer Sciences (CICS) at the University of Massachusetts Amherst. She co-directs the Laboratory for Advanced Software Engineering Research (LASER) and is a member of the UMass NLP group. Her research advances software engineering through automated techniques for building high-quality systems with emphasis on behavioral specifications, AI safety, and trustworthy AI. Her work addresses the fundamental challenge of aligning software behavior with intended specifications through two main directions: automated specification synthesis (translating natural language comments to formal specifications via tools like C2S and LLMCup) and defect detection/repair (developing frameworks for AI system testing, bias mitigation, and training diagnostics). Her vision integrates these into end-to-end assurance systems that continuously validate, repair, and audit evolving software in dynamic environments. Recent publications (2024-2025) reveal dominant trends at the software engineering/AI intersection: formal specification synthesis for IoT and code generation, comment maintenance using LLMs, deep learning framework testing (DevMuT, Citadel), bias detection in LLMs, and automated training repair (AutoTrainer, DREAM). These contributions appear in top venues including ICSE, FSE, ASE, ISSTA, and ACL. Professor Zhai currently advises PhD student Gehao Zhang (focusing on Software Engineering and AI Safety) and actively recruits new PhD/Master's students. Her LASER lab develops practical tools for specification inference, LLM-driven synthesis, and trustworthy AI, while collaborating with the UMass NLP group on language-centric software analysis. The LASER lab, co-directed by Zhai, pioneers techniques for behavioral specification enforcement across traditional and AI-powered systems. Key projects include CPC for bidirectional code-comment analysis, ModelMeta for deep learning framework testing, and frameworks for bias mitigation across the ML lifecycle. The lab emphasizes practical, scalable tools that enhance correctness, robustness, and fairness in critical AI applications.
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.
Daniel Balasubramanian is an Adjunct Associate Professor of Computer Science and Research Scientist at Vanderbilt University's School of Engineering. His research focuses on cybersecurity, software verification, and cyber-physical systems, with expertise in symbolic execution, code analysis, and formal methods. He contributes to advancing secure systems through frameworks like RAMPART for adversarial defense and Syntheto for formal verification. His work intersects edge computing, hardware security, and autonomous systems resilience. Research Interests: Cybersecurity (including ethical hacking, network defense), formal methods (verification, theorem proving), edge computing (tinyML, cloud integration), and cyber-physical systems (emulation, testbeds). His recent work emphasizes assurance provenance in software documentation and adversarially robust autonomous systems. Publications since 2019 highlight contributions to cybersecurity testbeds, reinforcement learning for penetration resistance, and hardware security against rowhammer attacks. He has explored domain-specific languages (Syntheto), incremental modeling techniques (differential-formula), and cloud-edge service resilience against adversarial perturbations. Labs/Teams: Affiliated with the Institute for Software-Integrated Systems (ISIS), focusing on integrating software with physical systems through model-driven approaches and cybersecurity innovations.
Stefania Dumbrava is an Associate Professor of Computer Science at ENSIIE (École Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise) and a permanent member of the ACMES team in the SAMOVAR laboratory at Télécom SudParis, Institut Polytechnique de Paris. She is also actively involved in the Property Graph Schema Working Group and the European Research Network on Formal Proofs (EuroProofNet). Education PhD in Computer Science, Université Paris-Sud (2016) MSc in Computer Science, Jacobs University Bremen (2012) BSc in Mathematics, Jacobs University Bremen (2010) Research Interests Dumbrava's research lies at the intersection of formal methods and data management . She designs and verifies algorithms and systems for graph databases , with emphasis on property graphs , schema discovery , query optimization , and distributed graph processing . Recently, her work focuses on certifying large-scale distributed graph systems under the ANR JCJC VERDI project (2025–2029). Awards & Honors SIGMOD Best Paper Award 2023 – “PG-Schema: Schemas for Property Graphs” SIGMOD Research Highlight Award 2023 – “Threshold Queries” VLDB 2022 Best Regular Research Paper Runner-Up – “Threshold Queries in Theory and in the Wild” SIGMOD 2025 Distinguished Reviewer Award ICDE 2025 Best Program Committee Member Award EASST Best Software Science Paper Award, ICGT 2025 Students & Grants Dumbrava has supervised numerous research interns and is actively recruiting PhD students for her ANR VERDI project on verified foundations of large-scale distributed graph systems. She has also served on six PhD thesis committees as examiner since 2021. Labs & Teams She leads the ACMES research group within the SAMOVAR laboratory (Télécom SudParis, Institut Polytechnique de Paris), where her team develops formally verified graph-database engines and tools such as GRASP, VerDILog, and DatalogCert.
Wolfgang Kunz is a Full Professor (C4, W3) and Chair of Electronic Design Automation at the Technische Universität Kaiserslautern since 2001. His academic career spans multiple prestigious institutions, including Goethe-University Frankfurt/Main and the University of Massachusetts, Amherst. He has held leadership roles such as Dean (2005-2007) and Vice-Dean (2007-2009) at TU Kaiserslautern. Habilitation (Dr. rer. nat. habil.), Computer Science, University of Potsdam (1996) Doctoral degree (Dr.-Ing.), Electrical Engineering, University of Hannover (1992) Dipl.-Ing. degree, Karlsruhe Institute of Technology (1989) His research focuses on hardware verification, security, and optimization, particularly in embedded systems and processors. His work on formal verification methods has been commercialized by companies like Synopsys, Mentor Graphics, and Siemens EDA. His 2016-2021 publications address critical security issues such as Spectre/Meltdown and introduce innovative verification frameworks adopted by industry leaders like Infineon and OneSpin Solutions. Scientific awards include the IEEE Fellow (2006), German IT Society Award (2005), and TU Kaiserslautern Distinguished Teaching Award (2016). He has served on editorial boards of major journals and coordinated the Erasmus Mundus European Master Program in Embedded Computing Systems since 2010. Key students: Jörg Bormann, Raik Brinkmann, Tobias Ludwig Collaborations: Siemens EDA, Infineon, AbsInt, Intel SCAP Spin-offs: LUBIS EDA, OneSpin Solutions
Christina L. Garman is an Assistant Professor in the Department of Computer Science at Purdue University, where she joined in Spring 2018. Her research focuses on practical cryptography and cryptographic automation to make secure system development accessible to non-experts through error-resistant design methodologies. Her educational background includes: Bachelor of Science in Computer Science and Engineering from Bucknell University (2011) Bachelor of Arts in Mathematics from Bucknell University (2011) Master of Science in Engineering in Computer Science from Johns Hopkins University (2013) Doctor of Philosophy in Computer Science from Johns Hopkins University (2017) Professor Garman's work centers on real-world cryptographic system security, spanning protocol analysis (e.g., RC4 in TLS, Apple iMessage flaws), decentralized anonymous systems (Zerocash/ZCash), and cryptographic automation. She pioneered techniques for removing human error in cryptographic deployments through automated tools and frameworks. Her research bridges theoretical cryptography with practical implementation challenges in privacy-preserving technologies and secure infrastructure. Analysis of her 2021-2025 publications reveals expanding research horizons: hardware security vulnerabilities (Rowhammer, SGX), privacy network enhancements (Tor onion services), software supply chain security (SBOM tools), and advanced cryptographic protocols (zkSNARKs, MPC). This evolution demonstrates consistent focus on real-world security impact while diversifying into hardware-software cross-layer threats and formal verification methods for cryptographic implementations. Her major scientific recognitions include: NSF CAREER Award (2021) for cryptographic automation research ACM CCS Best Paper Award (2016) for iMessage security analysis IEEE Test of Time Award (2024) for foundational Zerocash work Professor Garman co-founded ZCash, a privacy-focused cryptocurrency based on her Zerocash protocol, and her NSF CAREER grant supports cryptographic automation development. Her research has received significant media coverage in The Washington Post, Wired, and The New York Times, highlighting real-world relevance. While specific student advising details aren't public, her active publication record indicates ongoing mentorship of graduate researchers in security and cryptography. Her work maintains strong industry connections through ZCash development and Tor network contributions, with recent projects like keyless CDNs demonstrating practical applications of cryptographic automation. She remains a leading voice in cryptographic research communities through conference participation and collaborative projects addressing evolving security challenges.
Vijay Kumar is the Nemirovsky Family Dean of Penn Engineering at the University of Pennsylvania, with faculty appointments in the Departments of Mechanical Engineering, Computer and Information Science, and Electrical and Systems Engineering. He is a leading figure in robotics and computer architecture research. Research Interests include robotics, particularly multi-robot systems and micro aerial vehicles (MAVs), as well as computer architecture innovations for machine learning, GPU acceleration, and datacenter efficiency. His work spans theoretical foundations and practical applications in autonomous systems and hardware optimization. Scientific Awards include: 1991 NSF Presidential Young Investigator Award 1996 Lindback Award for Distinguished Teaching 2012 ASME Mechanisms and Robotics Award 2014 Engelberger Robotics Award 2017 IEEE George Saridis Leadership Award Multiple best paper awards at DARS, ICRA, and RSS conferences Editorial Leadership includes serving as Editor of the ASME Journal of Mechanisms and Robotics and Advisory Board Member of AAAS Science Robotics Journal . His GRASP Lab team developed foundational frameworks for micro UAV testbeds and swarm robotics.
