Jan Dreier is a Research Fellow at the Institute of Logic and Computation at Vienna University of Technology. His research centers on structural graph theory and algorithmic meta-theorems, particularly exploring the boundaries of tractability for model checking problems. Dreier's work bridges theoretical computer science and discrete mathematics, focusing on graph decompositions, parameterized complexity, and logical expressiveness. Key research themes include monadic stability in graph classes, applications of model theory to computer science, and efficient algorithms for logical queries on structured graphs. His publication record shows consistent focus on graph sparsity concepts and algorithmic applications of logic, with recent work expanding into approximation methods for counting queries. Research demonstrates sophisticated applications of combinatorial methods to fundamental problems in computational complexity.
Neelakantan R. Krishnaswami is a Professor of Computer Science at the University of Cambridge's Computer Laboratory , and a Fellow of Trinity College . His research focuses on the intersection of program verification, programming language design, and foundational topics like type theory and semantics. His work spans areas such as refinement types, parser design, separation logic for systems software, and the semantics of reactive programming. Notable contributions include the Datafun language for higher-order Datalog and the λert type theory for explicit refinement types. He has also developed foundational frameworks for verifying imperative programs using advanced type systems and logical relations. Key publications include 'Explicit Refinement Types' (ICFP 2023), 'flap: A Deterministic Parser with Fused Lexing' (PLDI 2023), and 'CN: Verifying Systems C Code' (POPL 2023). His work frequently addresses challenges in efficiency, correctness, and modularity for both functional and imperative systems. His awards include Distinguished Paper Awards at PLDI 2019 and POPL 2020. His research integrates theoretical rigor with practical tooling, exemplified by contributions to languages like Coq, Lean, and Haskell.
Ryan Giordano is an Assistant Professor in the Department of Statistics at the University of California, Berkeley. He holds a PhD in Statistics from UC Berkeley (2019), advised by Michael Jordan, Tamara Broderick, and Jon McAuliffe, an MSc in Econometrics and Mathematical Economics from the London School of Economics (2009), and undergraduate degrees in Mathematics and Theoretical/Applied Mechanics from the University of Illinois at Urbana-Champaign. Prior to academia, he worked as an engineer at Google and HP and served as a Peace Corps volunteer in Kazakhstan. His research focuses on variational methods , Bayesian robustness , sensitivity analysis , and statistical computing , with applications in machine learning, environmental science, and astronomy. He is particularly known for developing scalable Bayesian inference techniques and quantifying the robustness of statistical models to data perturbations. Giordano’s recent work includes studies on Laplace approximation accuracy, MCMC sensitivity to data removal, and robustness metrics for differential expression analysis. He has contributed to open-source statistical software and collaborates with Tamara Broderick’s group at MIT on postdoctoral work (pre-2019 position). His academic trajectory combines theoretical innovation with practical applications, emphasizing reproducibility and computational efficiency in statistical methodology.
Andreas Abel is a Senior Lecturer in the Division of Computing Science at the Department of Computer Science and Engineering, Chalmers University of Technology and the University of Gothenburg. He has previously served as an Assistant Professor at Ludwig-Maximilians-Universität (LMU) Munich and has been a visiting researcher at INRIA in Paris. His primary affiliations are with Chalmers and the University of Gothenburg, where he conducts research and teaches in programming languages and type theory. Chalmers University of Technology, Department of Computer Science and Engineering, Senior Lecturer University of Gothenburg, Division of Computing Science LMU Munich, Assistant Professor (former) INRIA Paris, Visiting Researcher Abel’s research lies at the intersection of type theory, functional programming, and formal verification. He is particularly known for his work on dependent types, normalization by evaluation, and the development of the Agda proof assistant. His interests include constructive logic, logical frameworks, modal and linear typing, program verification, and compiler construction. He leads the Modal Dependent Type Theory project funded by the Swedish Research Council (Vetenskapsrådet) and has contributed to several other major research initiatives in programming language theory. His recent publications reflect a strong focus on foundational aspects of type systems, including cubical type theory, decidability of conversion, and formalization of algebraic completeness. These works appear in top-tier venues such as ICFP, LICS, POPL, and TYPES, showcasing both theoretical depth and practical implementation in Agda. Distinguished Paper Award, ICFP 2019 Editor, Theoretical Pearls column, Journal of Functional Programming Member, IFIP WG 1.3 on Foundations of System Specification Abel actively supervises students and contributes to the research community through program committee memberships for major conferences including LICS, ICFP, and CPP. He is a senior developer of Agda and the maintainer of the BNFC (Backus-Naur Form Compiler) tool. His work bridges theoretical computer science with practical software development for formal methods. He is involved in several research groups and projects, including the Programming Logic Group at Chalmers and the international EUTYPES network. His role as principal investigator and core contributor in multiple funded projects highlights his leadership in the field of programming language foundations.
Andrzej Murawski is a Professor of Computer Science at the University of Oxford and a Tutorial Fellow at Worcester College . His research focuses on the semantics of programming languages and software verification, with applications in automata theory, probabilistic computation, and concurrency. Current affiliations: University of Oxford, SIGLOG Vice-Chair, FoSSaCS Steering Committee Research interests: Game semantics, higher-order recursion, probabilistic systems, differential privacy Recent publications address probabilistic verification, equivalence checking, and game semantics for concurrent systems. He has chaired program committees for conferences such as ESOP and PERR, and his work has earned recognition like the POPL 2025 Distinguished Paper Award . Current students : Benedict Bunting, Haoxuan Yin Past students : Conrad Cotton-Barratt, David Hopkins, Guanyan Li, Dominik Wagner, Fabian Zaiser
Associate Professor Seojeong Lee is a faculty member at the University of New South Wales (UNSW) Business School, School of Economics, specializing in advanced econometric theory. She joined UNSW in 2012 after completing her PhD at the University of Wisconsin-Madison and has established herself as a leading researcher in robust inference methods under complex data conditions. Her educational background includes: Ph.D. in Economics, University of Wisconsin-Madison (2008-2012) M.A. in Economics, Seoul National University (2006-2008) B.A. in Economics and Political Science (dual major), Seoul National University, summa cum laude (2000-2006, with military service 2002-2004) Professor Lee's research centers on developing theoretically rigorous methods for econometric inference, with primary focus on generalized method of moments (GMM), instrumental variables (IV), and two-stage least squares (2SLS) under model misspecification. Her work addresses critical challenges including invalid/many/weak instruments, heterogeneous treatment effects, and clustered sampling, contributing foundational advances to statistical inference in economics. Analysis of her recent publications reveals a strong trajectory in refining methods for many-instrument settings and misspecified models, with increasing emphasis on computational implementations (e.g., Stata packages) and applications to causal inference. Her work bridges theoretical econometrics with practical policy-relevant analysis. Her scientific achievements include: Australian Research Council DECRA Fellowship (2017-2019) UNSW Dean's Research Fellowship (2020-2022) Zellner Thesis Award Honorable Mention from American Statistical Association (2014) Multiple competitive UNSW research awards Professor Lee actively supervises PhD candidates Wei Tian and Fangzhou Yu, and has secured over AUD 700,000 in research funding including ARC Discovery Projects. She teaches undergraduate and postgraduate econometrics courses, integrating her research into pedagogy. Her ongoing work continues to push boundaries in robust econometric methodology for modern data challenges.
Jaco van de Pol is a Full Professor of Computer Science at Aarhus University, holding dual roles in the Digital Society Institute and Formal Methods and Tools. He earned his PhD from Utrecht University in 1996, specializing in Termination of Higher-order Rewrite Systems, and a Master's in Computer Science (Term Rewriting) in 1992. His research focuses on model checking, formal methods, algorithms, and automated verification, contributing to UN Sustainable Development Goals related to innovation and education. Education: PhD, Termination of Higher-order Rewrite Systems, Utrecht University (1996) Master's in Computer Science (Term Rewriting), Utrecht University (1992) Research Interests: His work spans model checking, formal verification, parallel algorithms, and their applications in software engineering and bioengineering. He emphasizes practical formal methods, such as SCC algorithms and timed automata analysis, to solve complex computational challenges. Awards: Best Paper Award SPIN 2017 (2017) Best Student Paper Award (2018) Advising & Grants: Supervised 12 students and contributed to collaborative projects in formal methods and computational biology. His research has been applied to areas like cartilage phenotype modeling and parallel algorithm design. Labs/Teams: Engages with interdisciplinary teams, including computational biology and distributed systems groups, to advance formal methods in practical contexts.
Dr. Dominic Williamson is a theoretical quantum physicist and DECRA Research Fellow at the School of Physics, University of Sydney. He specializes in quantum phases of matter and their applications to quantum error correction and computing. His work bridges condensed matter theory and quantum information science, focusing on fracton topological phases and fault-tolerant quantum architectures. Education: PhD in Physics from the University of Vienna (2017); Postdoctoral research at Yale University, Stanford University, and IBM Quantum. Current roles include faculty membership at the University of Sydney’s Quantum Science Group and prior industry experience at IBM and PsiQuantum. Research interests: Topological phases of matter, quantum error correction codes (e.g., fracton codes, QLDPC systems), fault-tolerant quantum computing architectures, and non-Abelian anyon systems. Recent breakthroughs include low-overhead quantum architectures and novel approaches to parallelized logical measurements. Grants: 2022 ARC Discovery Early Career Researcher Award for topological phases in quantum computation. Collaborations include projects on gauging logical operators and quantum code surgery. Professional activities: Editor for Quantum , frequent speaker at international conferences, and mentor for students at all levels (undergraduate to postdoctoral). Active in open-source research and public engagement through platforms like arXiv and Google Scholar.
Dr. Aurelien Baillon is a Professor of Economics of Uncertainty at the Erasmus School of Economics , Erasmus University Rotterdam, specializing in the Department of Applied Economics . His research focuses on individual decision-making under risk and ambiguity, combining empirical and theoretical approaches to understand probability elicitation and expert opinion aggregation. Key research areas: Behavioral Economics, Risk Attitudes, Bayesian Modeling Major projects: Bayesian Markets , Personal Model of Trumpery , Malakoff Humanis Chair His recent publications explore ambiguity theories , cybersecurity decision-making , and linguistic deception detection . Notable grants include the ERC Starting Grant (2016) and NWO Vidi Grant (2014). Collaborations span institutions like BRiO , HITS Institute , and GATE . The Datavisualization project with Alice Havrileck demonstrates his interdisciplinary approach to uncertainty analysis.
Bart Bogaerts is an Associate Professor in the Department of Computer Science at KU Leuven's Faculty of Engineering Science. He is affiliated with the Declarative Languages and Artificial Intelligence (DTAI) research unit and is a member of Leuven.AI - KU Leuven Institute for Artificial Intelligence. Bogaerts serves on the Council of the Faculty of Engineering Science as senior academic staff and participates in the Programme Committee for Artificial Intelligence curriculum development. His research focuses on foundational aspects of logic programming and knowledge representation, with particular expertise in approximation fixpoint theory, higher-order logic programming, and non-monotonic reasoning. Bogaerts investigates the theoretical underpinnings of stable model semantics, justification frameworks, and executable query languages. His work bridges theoretical computer science with practical applications in artificial intelligence and knowledge-based systems. Bogaerts' publication record demonstrates consistent contributions to top venues in logic programming and artificial intelligence. His recent work shows increasing focus on category-theoretic approaches to approximation theory, distributed web traversal specifications, and certified model expansion techniques. The publications reveal a strong emphasis on formal methods with applications spanning from theoretical mathematics to practical AI systems. As a promotor for multiple significant research projects, Bogaerts leads investigations into certified answer set programming (CertifASP), first-order model expansion (CertiFOX), proof generation for combinatorial optimization, distributed configuration problems, and knowledge integration paradigms. These projects, funded through 2028-2029, demonstrate his leadership in advancing the theoretical foundations of AI and logic programming. Bogaerts is actively involved in teaching courses on knowledge representation and reasoning, contributing to the development of next-generation AI researchers. His work within the DTAI research unit positions him at the forefront of declarative AI approaches in Belgium's leading research university.
Ichiro Hasuo is a Professor at the National Institute of Informatics (NII) in Tokyo, Japan, where he serves as Director of the Research Center for Mathematical Trust in Software and Systems. He holds a joint appointment at The Graduate University for Advanced Studies (SOKENDAI). Since 2016, he has been the Research Director of the JST ERATO Metamathematics for Systems Design Project, and founded Imiron Co., Ltd. in 2024. Education: PhD in Computer Science (cum laude) from Radboud University Nijmegen (2008) MSc in Mathematical and Computing Sciences from Tokyo Institute of Technology (2004) BSc in Mathematics from University of Tokyo (2002) His research focuses on foundational aspects of software science, particularly formal verification techniques using mathematical structures from category theory and coalgebra. He develops methods for ensuring reliability in cyber-physical systems and systems incorporating machine learning components. Current work emphasizes logical frameworks for autonomous vehicle safety and mathematical trust in complex systems. Hasuo's publications demonstrate consistent focus on theoretical foundations with practical applications. His recent work spans coalgebraic verification methods, temporal logic for hybrid systems, quantum programming semantics, and applications to autonomous driving systems. Key themes include compositional reasoning, probabilistic modeling, and the integration of discrete and continuous system verification. Awards and Honors: Best Paper Award at ICTAC 2024 Minister of Education, Culture, Sports, Science and Technology Commendation (2024) Distinguished Paper Award at CAV 2023 Outstanding Reviewer Award at EMSOFT 2022 Best Paper Award at ICECCS 2018 Best Paper Award at CONCUR 2014 Hiroshi Fujiwara Encouragement Prize (2012) PhD cum laude (2008) He leads multiple major research grants including: JST ASPIRE (2024-2029) for international collaboration on software trust JST START (2022-2025) for autonomous driving verification JST ERATO Metamathematics for Systems Design (2016-2025) Several JSPS KAKENHI grants As head of the MMM laboratory (Hasuo-Lab) at NII, he supervises PhD students and postdoctoral researchers in formal methods and mathematical systems design.
Anders Møller is a Professor and Vice Head of Department at the Department of Computer Science, Aarhus University, Denmark. He is a leading researcher in programming languages and software engineering, with a primary focus on static and dynamic program analysis. He serves as Chairman of the PhD Committee and holds leadership roles in the international research community, including Vice-Chair of ACM SIGPLAN and Associate Editor for ACM TOPLAS and ACM TOSEM. His research interests include programming languages, software engineering, static and dynamic analysis, program verification, and security. His work bridges theoretical foundations and practical applications, particularly in improving software reliability and security through advanced analysis techniques. The trends in his recent publications reflect a strong emphasis on static analysis for security, scalability, and real-world impact—especially in web applications, smart contracts, and open-source software supply chains. His research has evolved toward practical deployment, demonstrated by the founding and acquisition of Coana by Socket in 2025 for enhanced vulnerability detection. Recipient of the Danish Elite Research Prize 2020 ACM Distinguished Member He actively mentors students and contributes to the academic community through conference leadership (e.g., OOPSLA, PLDI, ICSE). He also co-authored the widely used textbook Static Program Analysis with Michael I. Schwartzbach. His work is deeply integrated into both academic and industrial advancements in software analysis and security.
Frank Pfenning is a Professor in the Department of Computer Science at Carnegie Mellon University's School of Computer Science. With decades of active research and service in programming languages and logic communities, he maintains a significant presence across major conferences including POPL, ICFP, and ESOP. His research spans foundational work in Programming Languages , Logic and Type Theory , Logical Frameworks , Automated Deduction , and Trustworthy Computing . Recent publications reveal a strong focus on session types, substructural logics, and their applications to concurrency and distributed systems. His work bridges theoretical foundations with practical implementations for reliable communication protocols. Analysis of his publication trends shows a consistent evolution from foundational type theory toward practical applications in concurrent and distributed systems. The integration of logical frameworks with session types represents a signature research trajectory, increasingly addressing real-world challenges in protocol verification and deadlock freedom. As an active community member, Pfenning has served on numerous program committees including POPL (2016-2025), ICFP (2015-2022), and ESOP. His mentoring activities include PLMW@POPL presentations, demonstrating commitment to training next-generation researchers. His technical contributions are primarily disseminated through premier venues in programming languages research. The absence of explicit grant information in available sources suggests focus on theoretical contributions rather than large-scale funded projects, though his sustained conference participation indicates stable institutional support.
Diogo Poças serves as Assistant Professor in the Department of Mathematics at Instituto Superior Técnico (University of Lisbon) and Researcher at Instituto de Telecomunicações since 2024. Previously, he held faculty positions at the University of Lisbon's Faculty of Sciences (2020-2024) and conducted postdoctoral research at TU München (2018-2020), demonstrating continuous academic engagement within Portugal's leading technical institution. His academic foundation includes: PhD in Mathematics from McMaster University (2014-2017) supervised by Prof. Jeffery Zucker MSc in Mathematics and Applications from Instituto Superior Técnico (2011-2013) supervised by Prof. José Félix Costa BSc in Applied Mathematics and Computation from Instituto Superior Técnico (2008-2011) Dr. Poças' research program integrates theoretical computer science with practical applications across three interconnected domains: Session Types (developing algorithms for type equivalence and communication safety in concurrent systems), Algorithmic Game Theory (analyzing equilibrium computation complexity in congestion games and auctions), and Analog Computation (modeling continuous-data computation through frameworks like the General Purpose Analog Computer). His work consistently bridges formal methods with real-world computational challenges. His publication record reveals a cohesive research trajectory where session type theory advances directly inform game-theoretic mechanism design. Recent papers demonstrate growing sophistication in handling higher-order polymorphic types while simultaneously addressing fundamental questions in auction revenue maximization and congestion game equilibria, indicating a unique interdisciplinary approach to computational theory. No scientific awards or fellowships are documented in available sources. Dr. Poças has mentored students through teaching assistant roles (2013-2015) and supervised his own MSc thesis on stochastic oracle complexity. Current research funding derives from his affiliations with LASIGE (2020-2024) and Instituto de Telecomunicações, though specific grant mechanisms remain unspecified. He contributes to Portugal's computational research ecosystem through Instituto de Telecomuncações, building on prior work with LASIGE where he developed theoretical frameworks now reflected in his recent publications on session types and game equilibria.
Gordon Kindlmann is an Associate Professor of Computer Science at the University of Chicago, affiliated with the Systems Group research community. His work bridges computational imaging science and visualization theory, focusing on biomedical applications and machine learning integration. He leads projects in diffusion MRI analysis, surgical planning tools like SlicerDMRI, and theoretical advancements in visualization design. Research Interests: Biomedical Image Analysis Scientific Visualization Theory High Performance Computing Medical Imaging Algorithms Machine Learning Applications Recent Articles Trends: His work emphasizes cardiovascular modeling (e.g., aortic dissection prediction) and visualization validation techniques. Recent collaborations include optimizing visualization tools for scalability and accuracy in threaded data exploration. Awards: None explicitly listed in provided text. Grants/Advising: Involved in CDAC Discovery Grants (2019) and actively supports student research, though specific advisees are not listed here. His lab develops open-source tools like Diderot for tensor field visualization. Labs & Teams: Member of the Systems Group, a collaborative environment advancing systems research, programming languages, and software engineering.
