Dr. Daniel Rakita is an Assistant Professor of Computer Science at Yale University, specializing in robotics and human-robot interaction. His research focuses on developing real-time motion planning algorithms and intuitive shared-control interfaces to enable robots to safely assist humans in critical tasks such as healthcare, disaster relief, and manufacturing. He holds a Ph.D. and M.S. in Computer Science from the University of Wisconsin-Madison. His work integrates robotics, machine learning, and human factors to create end-to-end solutions for robot manipulation. Key contributions include RelaxedIK (real-time collision-free motion synthesis) and CollisionIK (per-instant pose optimization). His research also explores teleoperation systems and adaptive viewpoints for remote control in complex environments. Education: Ph.D./M.S., University of Wisconsin-Madison (Computer Science) Affiliations: School of Engineering & Applied Science, Yale University Labs/Teams: Robotics and Human-Computer Interaction research groups at Yale His publications span top venues like Robotics: Science and Systems (RSS), ICRA, and HRI. Notable awards include the Microsoft PhD Fellowship (2019-2021) and Best Paper Awards at HRI 2018. Current projects emphasize diffusion policies for manipulation learning and optimization-based motion generation frameworks.
Lars Birkedal is a Professor in the Department of Computer Science at Aarhus University, Denmark. He is a leading researcher in programming languages and formal methods with extensive contributions to the field over the past decade. His work appears consistently in top-tier programming languages conferences including POPL, ICFP, and PLDI, where he has served in leadership roles such as Program Chair and committee member. Birkedal's research primarily focuses on the theoretical foundations of program verification, with significant contributions to separation logic, type theory, and formal methods for concurrent and probabilistic systems. His work bridges theoretical computer science with practical verification challenges, particularly through the development and application of the Iris framework for higher-order concurrent separation logic. He has pioneered approaches for reasoning about probabilistic programs, capability-based security, and memory models for modern architectures. Analysis of Birkedal's recent publications (2023-2025) reveals a continued focus on advancing separation logic for increasingly complex systems. His work shows a clear trajectory from foundational theoretical work toward practical verification of real-world systems like WebAssembly while maintaining rigorous formal guarantees. There's a notable emphasis on probabilistic programming, error bounds analysis, and distributed systems verification in his most recent contributions. As a faculty member at Aarhus University, Birkedal has built a strong research group focused on programming language theory and formal verification. His leadership in the programming languages community is evident through his repeated service on program committees for major conferences and his mentorship of numerous graduate students and junior researchers, though specific student names aren't listed in the available information. His research has likely been supported by significant grants from Danish and European funding agencies, given the sustained output and international collaborations evident in his publication record.
Alexandra Silva is a Professor of Computer Science at Cornell University, with a research group partially based at University College London (UCL) where she previously held a Royal Society Wolfson Fellowship. She is deeply involved in academic leadership, serving on program committees for conferences like ECOOP and POPL, and organizing workshops at venues such as VMCAI and PLDI. Her research spans formal methods, probabilistic programming, and coalgebraic modeling, with applications in network verification and concurrent systems. Key Research Themes: Kleene Algebra with Tests (KAT), coalgebraic semantics, probabilistic program verification, network control plane analysis, and categorical approaches to formal methods. Collaborations: Active collaborations with institutions including Cornell, UCL, University of Leicester, and INRIA Rhone-Alpes. Scientific Awards: Distinguished Paper Award at POPL 2020 Advising: Currently advising eight PhD students, including Tiago Ferreira and Noam Zilberstein, with a broader team of postdocs, alumni, and collaborators.
Elsa L Gunter is a Research Professor and Senior Lecturer at the University of Illinois at Urbana-Champaign's Department of Computer Science. Her academic background includes a Ph.D. in Mathematics from the University of Wisconsin, Madison. She leads research in formal methods, programming languages, and human-computer systems. Research Interests: Her work spans formal verification, programming language semantics, automated theorem proving, and security. She develops tools for compiler optimization verification, human-automation system safety, and concurrent program analysis. Key projects include the VeriF-OPT framework for parallel program transformations and Tutela for human-computer system protection analysis. Publications Focus: Her recent research emphasizes compiler verification, concurrency models, and human-system interaction. Work includes symbolic analysis for CSP, dependently-typed session systems, and robustness verification for safety-critical interfaces. Awards: Most Influential 10 Year Paper award at Requirements Engineering (RE 2010) EASST Best Software Science Paper at ETAPS 2001 Best Paper award at Fourth International Conference on Requirements Engineering (2000) Funding and Labs: Secured NSF grants for projects on parallel program verification ($450K) and human task analysis ($500K). Leads the Formal Methods and Verification Lab, collaborating with NASA on NextGen aviation systems. Student Advising: Mentored 7 PhD graduates and 12+ Master's students. Current PhD candidates work on secure distributed programming (Dennis Griffith) and formal methods for concurrent systems (Liyi Li, Susannah Johnson).
Étienne André is a Full Professor at Université Sorbonne Paris Nord , affiliated with the Institut Galilée and the Laboratoire d’Informatique de Paris Nord (LIPN) . He leads the SAFER research team and has previously held professorial positions at Université de Lorraine . His work bridges formal verification and real-world applications in cyber-physical and distributed systems. PhD from ENS Cachan (2010) Postdoc at National University of Singapore (2010–2011) Associate Professor at Université Sorbonne Paris Nord (2011–2019) Full Professor at Université de Lorraine (2019–2022) Full Professor at Université Sorbonne Paris Nord (2022–present) His research centers on formal verification of concurrent and real-time systems, with a focus on parametric timed model-checking . He investigates how systems behave under timing uncertainty and develops methods to synthesize safe timing parameters. His work extends to monitoring cyber-physical systems and detecting side-channel attacks using quantitative formal methods. He is a strong advocate for sustainable research , minimizing carbon footprint through reduced air travel. The recent publications reflect a consistent trajectory in parametric verification , real-time systems , and model checking , with increasing emphasis on distributed and probabilistic approaches. His tools like IMITATOR and InSPEQTor enable practical application in industrial and academic settings. PhD Award, Académie Lorraine des Sciences (2024) Étienne André has supervised several PhD students and postdoctoral researchers. He leads major research projects such as ProMiS , MoCcA , and PACS , funded by ANR, PHC, and other international agencies. His collaborative work spans France, Singapore, Poland, and Japan. He is deeply involved in the formal methods community, serving on steering committees for SynCoP and Petri Nets , and organizing conferences such as ETAPS and ICFEM . He has participated in over 30 program committees, including FORTE , TACAS , and HSCC .
Jan Friso Groote is a Full Professor and Chair of the Formal System Analysis group in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e). He also holds professorial roles in the EAISI Foundational and EAISI High Tech Systems institutes. Since 2016, he has been working part-time at ASML, contributing his expertise in formal verification to industrial applications. Education: Born in 1965, studied Computer Science at Twente University of Technology (now University of Twente), 1983–1988. PhD in 1991 from the University of Amsterdam with thesis 'Process algebra and structured operational semantics', based on research at CWI (Centrum Wiskunde en Informatica). Jan Friso Groote is a leading researcher in formal methods and software verification. His work focuses on enabling the development of flawless software through rigorous formal analysis. Key research areas include structural operational semantics, model checking, branching bisimulation, protocol verification, and the development of the mCRL2 toolset. His current goal is to integrate formal techniques into complete software system design, improving both development speed and quality. His research has demonstrated that formal methods can reduce development time by a factor of three and increase quality tenfold, with potential for zero-defect software. His recent publications demonstrate sustained contributions in formal verification, including work on mutual exclusion algorithms, industrial control system modeling, probabilistic systems, and efficient bisimulation algorithms. The articles span topics such as tunnel control systems, simulation lower bounds, and formal methods for critical systems, reflecting both theoretical depth and practical application. Scientific Awards: Best Paper Award FACS 2018 FMICS-AVoCS Best Paper Award (2017) Jan Friso Groote has held significant leadership roles in education, including Director of Education for Computer Science (2000–2010) and for multiple bachelor’s and master’s programs. He has advised numerous researchers and supervised a large body of research output (over 320 publications). He leads the Formal System Analysis group and has been involved in projects such as 'Composable Embedded Systems for Healthcare'. His work bridges academia and industry, particularly through collaborations with ASML and Rijkswaterstaat, and he has been a visiting researcher at institutions across Europe and China. He is a key contributor to the mCRL2 toolset, which supports modeling and verification of software behavior with data, time, and probabilities. His research fingerprints highlight strong expertise in model checking, transition systems, software design, and process algebra. He teaches courses such as System Validation, Embedded Software, and Capita Selecta in Formal System Analysis.
Wan J. Fokkink is a Full Professor ("Professor") at Eindhoven University of Technology (TU/e) in the Faculty of Mechanical Engineering , specifically the Control Systems Technology Group. He also holds a concurrent position as Professor of Theoretical Computer Science at Vrije Universiteit Amsterdam since 2004. His research bridges mechanical engineering and computer science, focusing on formal methods for software development in civil infrastructure and logistics. Education : MSc in Mathematics (1990, University of Amsterdam); PhD in Computer Science (1994, University of Amsterdam) Professional Affiliations : Embedded Systems Group (CWI, 2000-2004); Part-time Professor on Stochastic Design (TU/e, 2012-2016); Co-founder and former vice-chair, IFIP Working Group 1.8 His research interests include: Automated synthesis of safety-critical control software using formal methods Verification of communication protocols and distributed algorithms Application of process algebra and modal logic to real-world systems Model-based development of PLC code for civil engineering structures (bridges, dams, tunnels) Collaboration with semi-industry partners like Rijkswaterstaat and Vanderlande Industries Recent research trends show interdisciplinary focus on: Supervisory control theory applied to logistics and civil infrastructure Abstraction techniques in cyber-physical systems Optimization and fault-tolerance in automated control He actively contributes to UN Sustainable Development Goals through applications in smart infrastructure.
Pascale Le Gall is an active researcher specializing in formal methods and computer science, with primary research conducted through the Mathematics and Computer Science for Complexity and Systems laboratory. Their work spans theoretical computer science, software engineering, and interdisciplinary applications in biological systems modeling. Le Gall's research focuses on formal verification techniques, particularly in conformance testing, symbolic execution, and graph transformations. Their work bridges theoretical computer science with practical applications in distributed systems verification, geometric modeling, and biological network analysis. Key research themes include developing frameworks for stochastic process discovery, feature interaction resolution, and topological operations in geometric modeling, demonstrating both theoretical depth and practical implementation value across multiple domains. Analysis of their recent publications reveals a strong trend toward interdisciplinary applications of formal methods, particularly in biological systems. Their work increasingly integrates statistical approaches with traditional formal verification techniques, as seen in Bayesian inference for process discovery and statistical model checking of biological pathways. The research shows consistent development of symbolic execution techniques applied to increasingly complex systems, from abstract data types to distributed biological networks. Pascale Le Gall maintains active collaborations with researchers including Christophe Gaston, Marc Aiguier, and Paolo Ballarini across multiple projects. Their publication record shows consistent output with significant contributions to model-based testing frameworks, geometric modeling using graph transformations, and formal analysis of biological systems. The researcher has contributed to both theoretical foundations and practical implementations of verification techniques, with numerous conference papers and journal articles spanning over 15 years of active research.
Emanuela Merelli is a Full Professor of Computer Science at the University of Camerino. She leads the BioShape & Data Science Lab, established during her coordination of the EU-FET Project TOPDRIM, which focuses on topology-driven methods for complex systems. Her research integrates formal methods, algebraic topology, and data science to study biological systems like RNA folding and immune responses. She has held a Fulbright Fellowship at the University of Oregon (2005) and remains active in European academic initiatives. Research Interests: Interactive computation, topological field theory of data (TFTD), foundations of learning processes, cell cycle analysis in somatic/cancer cells, and complex systems modeling. Her work bridges theoretical computer science with systems biology, emphasizing topological approaches to data analysis. Awards: Fulbright Fellow (2005), Fellow Member of COST Action CA19122 EUGAIn (promoting gender balance in informatics). She contributes to the European Association for Theoretical Computer Science (EATCS) through leadership roles and educational initiatives. Professional Activities: Promotes open-access publications, organizes international conferences (e.g., ICALP 2022), and develops educational programs like the EATCS Young Researchers School on Complexity and Concurrency. Her work also extends to smart housing technologies for elderly care (Progetto SIAMADA) and seismic engineering applications. Labs & Projects: Leads BioShape Lab exploring topological methods in biology and data science. Coordinates EU-funded projects on RNA structure analysis and complex systems.
Monika Seisenberger is an Associate Professor at the Department of Computer Science , Swansea University, within the Faculty of Science and Engineering . Her academic role is centered on Formal Methods , Interactive Theorem Proving , and Specification & Verification , with significant contributions to logic, proof theory, and well-quasiorders. Research Interests : Her work bridges Computer Science and Mathematics , focusing on Program extraction from proofs Formal verification of safety-critical systems Applications of AI in medical and railway domains Computational content of choice principles Development of concurrent algorithms and toolchains Article Trends : Her publications over the past decade highlight a consistent focus on formal methods applied to railway logistics , AI explainability in healthcare, and constructive mathematics . Notable themes include Counterfactual explanation generation Multi-agent optimization in transportation Temporal model analysis via gradients Railway system safety verification Verification of geographic data Computational logic foundations Supervision & Collaboration : She actively supervises postgraduate research in areas like formal software verification , AI-driven railway technologies , and SHAP refinement , often collaborating with experts in Markus Roggenbach , Anton Setzer , and Fabio Caraffini . Labs & Teams : Based at the Computational Foundry (Bay Campus), she contributes to Swansea University's Formal Methods research group, advancing tools for proof theory and program synthesis .
Grigore Rosu is a Professor in the Department of Computer Science at the University of Illinois at Urbana-Champaign , where he leads the Formal Systems Laboratory (FSL) . He is also the founder and President of Runtime Verification, Inc. (2010) and Pi Squared, Inc. (2023). Rosu's research bridges theoretical foundations and practical system development in formal methods , software engineering , and programming languages . His academic journey includes a Ph.D. in Computer Science (2000, University of California at San Diego), an M.S. in Fundamentals of Computing (1996, University of Bucharest), and a B.A. in Mathematics (1995, University of Bucharest). Prior to UIUC, he worked as a Research Scientist at NASA Ames Research Center (2000-2002) and took a sabbatical at Microsoft Research (2008). Rosu's research has shaped the field of runtime verification (coined with Klaus Havelund in 2001), introduced the K framework (2003) for executable semantics, and pioneered matching logic as a unifying foundation for formal reasoning. His work spans automated coinduction, monitoring-oriented programming, and formal semantics for C, Java, JavaScript, Python, and the Ethereum Virtual Machine. He has received numerous awards, including the NSF CAREER , Dean's Award for Excellence in Research , and IEEE/ACM Most Influential Paper Award . Scientific Honors : AAAS Fellow (2022) IEEE Fellow (2021) Test of Time Awards (RV 2001, 2018; RV 2003, 2023) Distinguished Paper Awards (ASE 2008, ASE 2016, OOPSLA 2016, ETAPS 2002) NSF CAREER Award (2005) Dean's Award for Excellence in Research (2014) Rosu teaches advanced courses in programming language design , formal semantics , and blockchain technology . His innovations have been commercialized through Runtime Verification, Inc., serving clients like NASA, Boeing, Toyota, and blockchain entities such as Ethereum Foundation.
Lutz Schröder is a Professor and head of the Chair of Computer Science 8 (Theoretical Computer Science) at the Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU). He is actively involved in research and leadership within formal methods and logic in computer science. His research interests include Formal Methods , Logic in Computer Science , Knowledge Representation , and Coalgebraic Logic . His work emphasizes theoretical foundations of programming semantics, modal and fixpoint logics, and automated reasoning, often employing category-theoretic and coalgebraic frameworks. His recent publications span top conferences such as LICS, POPL, CSL, and CONCUR, focusing on graded semantics, behavioral metrics, nominal automata, and generic model checking. These works exhibit a strong trend toward unifying logical systems and developing modular, coalgebraic tools for verification. EATCS Best Paper Award at ETAPS 2006 Best Theory Paper at FM 2019 He advises several researchers, including Paul Wild, Jonas Forster, and Daniel Hausmann, many of whom are frequent co-authors. He leads DFG projects such as CoMoC (Coalgebraic Model Checking), SpeQT (Spectra of Behavioural Distances), and is a principal investigator in the DFG Research Training Group 2475 on Cybercrime and Forensic Computing. He has been a PC member or co-chair for major conferences including LICS, IJCAI, FoSSaCS, and STACS, and co-chaired IFIP WG 1.3 from 2016–2022. He is also involved in the development of reasoning tools like COOL and COOL-MC.
Paweł Sobociński is a Professor of Trustworthy Software Technologies at the Department of Software Science, School of Information Technologies, Tallinn University of Technology (TalTech), where he also leads the Laboratory for Compositional Systems and Methods. He is a principal investigator in several major research projects including the Estonian Research Council’s PRG1210 (ALICE), the EU-funded CHESS cybersecurity hub, and the EXAI Centre of Excellence in AI. His academic background includes faculty positions at the University of Southampton and research roles at the University of Cambridge and institutions in France and Italy. His research lies at the intersection of computer science and mathematics, with a focus on applied category theory. He investigates compositional modeling of systems, where the behavior of complex systems emerges from the structured interaction of their components. His work employs string diagrams, process algebras, Petri nets, and categorical semantics to develop formal methods for verifying and reasoning about concurrent and cyber-physical systems. He is particularly known for his contributions to graphical linear algebra and diagrammatic reasoning. The recent publications highlight a strong trend in diagrammatic methods, especially string diagrams, for expressing logic, algebra, and system behavior. These works span from foundational categorical structures to applications in electrical circuits, concurrency, and formal verification, demonstrating a unifying thread of compositional reasoning. His leadership in organizing conferences like LICS 2024 and ICALP 2024 underscores his central role in the theoretical computer science community. His scientific recognition includes numerous invited talks and tutorials at major international venues such as CONCUR, QPL, MFPS, and ETAPS, as well as leadership roles in academic organizations. He is an Associate Editor for journals including Compositionality , Mathematical Structures in Computer Science , and Logical Methods in Computer Science , and has served on the steering committee of ETAPS. Sobociński has supervised multiple PhD students and postdoctoral researchers, including Owen Stephens, Fabio Zanasi, Mario Román, and Elena di Lavore. He is also the director of the PhD programme in ICT at TalTech and has received research grants from the Estonian Research Council, the European Commission, and the Estonian Ministry of Education and Research, supporting his work in trustworthy software, AI, and cybersecurity. He leads the Laboratory for Compositional Systems and Methods at TalTech, a research group focused on developing and applying compositional techniques in software science, with applications in AI, security, and formal verification. The lab fosters international collaboration and is active in organizing workshops and summer schools.
Christel Baier is a full Professor and head of the Chair for Algebraic and Logic Foundations of Computer Science at the Faculty of Computer Science, Technische Universität Dresden, a position she has held since 2006. She previously served as an associate professor for Theoretical Computer Science at the University of Bonn from 1999 to 2006. She is currently the dean of the Faculty of Computer Science at TU Dresden (2025–2027), having been vice-dean from 2019 to 2024. She holds a Diploma in Mathematics (1990), a Ph.D. in Computer Science (1994), and a Habilitation (1999), all from the University of Mannheim. In 2022, she was awarded an honorary doctorate from RWTH Aachen. Her research centers on formal methods in computer science, with a strong emphasis on modeling, specification, and verification of reactive and stochastic systems. She is a leading expert in probabilistic model checking, temporal and modal logics, automata over infinite structures, game theory, and the verification of infinite-state systems. Her work bridges theoretical foundations with practical applications in system reliability and correctness. The recent publications and edited volumes reflect a consistent focus on formal verification, logic in computer science, and tools for system analysis. Her editorial leadership in major venues such as LICS, TACAS, and FoSSaCS underscores her influence in shaping the research agenda in theoretical computer science and formal methods. Jean-Claude Laprie Award in Dependable Computing (2023) Honorary doctorate from RWTH Aachen (2022) Member of Academia Europaea (since 2011) Editor-in-Chief of Acta Informatica (2015–2022) Steering Committee Member of LICS, FoSSaCS, FORTE, and FSEN Extensive service on program committees of top-tier conferences including CAV, CONCUR, and ICALP Christel Baier has advised numerous PhD and master’s students (though not explicitly listed), and has led major research projects funded by DFG, EU, and DAAD. She has organized pivotal events such as CONCUR'06, TACAS'15, and LICS'22. She is actively involved in academic governance, serving on the senate of TU Dresden (2015–2020), as ombudsperson for the Department of Computer Science, and on the Scientific Advisory Board of Schloss Dagstuhl. Her leadership in the German Excellence Initiative and DFG Research Training Groups highlights her role in shaping national research agendas.
James Worrell is a Professor of Computer Science at the University of Oxford , with a focus on logic in computer science , linear dynamical systems , and automated verification . He is also a Fellow of Green Templeton College. His research spans theoretical computer science and formal methods , including work on metric temporal logic , probabilistic semantics , and category theory . His publications address decision problems , verification of linear dynamical systems , and automata theory . James has received the EPSRC Established-Career Fellowship for his work in linear dynamical systems verification . His recent papers include polynomial invariants , polyhedral escape problems , and skolem problem solutions . He has advised students such as Mehran Hosseini , Pascale Gourdeau , and Ventsislav Chonev , and teaches courses like Computational Learning Theory and Logic and Proof . His work appears in venues like ICALP , LICS , and SODA .
