Sug Woo Shin is a Professor of Mathematics at the University of California, Berkeley ( Math Genealogy , MathSciNet Profile ). His research focuses on Number Theory and Automorphic Forms, with significant contributions to the Langlands Program, Shimura varieties, and cohomology of arithmetic spaces. Editorial roles: Astérisque , Manuscripta Mathematica , Journal of the Korean Mathematical Society Recent research explores cohomological properties of locally symmetric spaces, tempered A-packets for classical groups, and modularity of symplectic Galois representations Collaborators include Ana Caraiani, Mark Kisin, Arno Kret, and Peter Scholze He has supervised PhD theses on topics like affine Deligne-Lusztig varieties, specialization maps in Scholze's category of diamonds, and statistical properties of automorphic representations. Teaching includes graduate courses on Number Theory (254A/254B), undergraduate Linear Algebra (110), and Calculus (1A), as well as seminars on global Langlands reciprocity and p-adic cohomology theories. Co-organized conferences include the BIRS workshop on Langlands programs (2025), PRIMA algebraic number theory sessions (2022), and KAST Symposium on automorphic forms (2021). His work appears in journals like Annals of Mathematics, Duke Mathematical Journal, and Compositio Mathematica.
Hannah Hoganson is an NSF Postdoctoral Fellow in the Department of Mathematics at the University of Maryland, mentored by Christian Rosendal after previously holding a Brin Postdoctoral Fellowship under Lei Chen. Her research bridges geometric group theory, low-dimensional topology, and descriptive set theory, with a focus on mapping class groups of infinite-type surfaces and topological groups. Her educational background includes a PhD from the University of Utah (2022) advised by Ken Bromberg, and prior graduate studies at Miami University where she investigated Thompson's groups. She has taught multiple calculus courses at UMD and the University of Utah, receiving exceptional student evaluations for her clarity and supportive teaching style. Hoganson's research explores the coarse geometry of mapping class groups, connections between topological groups and descriptive set theory, and geometric structures on infinite-type surfaces. Her work often combines algebraic, geometric, and topological methods to address fundamental questions about group actions and classification problems in low-dimensional topology. Her recent publications demonstrate a strong trend toward interdisciplinary approaches, integrating geometric group theory with descriptive set theory to analyze infinite-type mapping class groups and Polish groups. Key themes include geometric finiteness, coarse boundedness, and the interplay between algebraic structures and topological dynamics in infinite settings. NSF Postdoctoral Fellowship (DMS-2303365) Brin Postdoctoral Fellowship Hoganson has advised an undergraduate reading course in geometric group theory (Spring 2024) and served as a mentor for REU students at SUMSRI. Her current research is supported by NSF grant DMS-2303365, which funds her postdoctoral work on geometric and topological aspects of infinite-type surfaces and groups. She actively collaborates with researchers including George Domat, Sanghoon Kwak, and Robbie Lyman across multiple projects. She co-organizes the University of Maryland Geometry and Topology Seminar and has co-led specialized workshops including the Big Mapping Class Groups log cabin workshop in Young, AZ (2024) and the AWM special session on Women in Groups, Geometry and Dynamics (2023), fostering collaborative research environments in geometric topology.
Giorgis Petridis is an Associate Professor at the University of Georgia, specializing in arithmetic combinatorics, a field rooted in combinatorial number theory with modern extensions into discrete analysis and finite field geometry. Born in Athens, Greece, he earned his PhD from the University of Cambridge under Tim Gowers and held a Visiting Assistant Professor position at the University of Rochester. He serves as an editor for Combinatorial Theory and is affiliated with the Number Theory and Arithmetic Geometry group, particularly its additive combinatorics and discrete analysis subgroup. Doctor of Philosophy (2011), University of Cambridge Certificate of Advanced Studies in Mathematics (2002), St John’s College, Cambridge BA (Hons) in Mathematics (2001), St John’s College, Cambridge His research focuses on additive combinatorics, exploring sumset estimates, polynomial configurations in prime lattices, and geometric incidence problems over finite fields. He investigates combinatorial geometry, including pinned distance problems and bisector arrangements, while also contributing to exponential sum bounds and expander graph theory. His work bridges theoretical mathematics with applications in pseudorandomness and discrete geometry. Recent publications highlight trends in finite field analysis, with 6 of 15 articles addressing arithmetic structures in prime-order fields. Key keywords include Combinatorics , Number Theory , and Finite Fields , with sub-fields spanning polynomial configurations, energy bounds, and geometric combinatorics. Scientific awards include the Creative Research Medal (2024) from the University of Georgia for mid-career research impact. Grants from the Simons Foundation (MPS-TSM-00007816) and multiple NSF DMS Awards (2054214, 1723016, 1500984, 1804049) support his work on discrete analysis and conferences. He co-advises five PhD students and has supervised multiple Master’s theses on topics like point-plane incidences and additive energy. Outreach includes leading high school math teams, organizing discrete analysis sessions, and contributing to public science communication guides.
Limin Jia is a Research Professor in the Electrical and Computer Engineering (ECE) department at Carnegie Mellon University, with a courtesy appointment in the Computer Science Department (CSD). Affiliated with CyLab, their work focuses on applying formal techniques to enhance software security through programming language design, formal verification, and information flow analysis. Research interests span Security Programming Languages Formal Verification Information Flow Control Intermittent Computing Rust Programming . Recent publications integrate formal methods with practical security challenges, including Node.js vulnerability detection Rust API testing Secure multi-execution Intermittent computing type systems IFTTT security analysis Browser security frameworks . Limin serves on program committees for conferences like POPL, PLDI, VMCAI, and is actively involved in teaching courses such as Browser Security (18-636) Introduction to Information Security (18-631) .
Danfeng Zhang is a faculty member at Duke University whose research sits at the intersection of programming languages and security. Active across the premier PL conferences since 2015, Zhang has served on more than two-dozen program committees and currently co-chairs the POPL Student Research Competition. Education & Affiliation: Home page: users.cs.duke.edu/~dz132 Affiliation: Duke University, United States Research Interests: Zhang’s work spans programming-language design, static and dynamic analysis, formal verification, and security. A recurring theme is developing language-based techniques that guarantee strong security and privacy properties—ranging from side-channel resistance and constant-time execution to differential-privacy proofs—while preserving performance and usability. His recent projects combine type systems, program logics, and automated reasoning to build practical verification tools for concurrent, speculative, and approximate software. Publication Trends: Across nine representative papers (2015-2024) Zhang has advanced static detection of cache side channels, automated proofs of differential privacy, and relaxed concurrency models. The trajectory shows deepening integration of security concerns into language infrastructure, with tool-building (CtChecker, SpecSafe, LightDP) that bridge formal guarantees and real-world systems. Service & Leadership: 2024 POPL Student Research Competition Co-Chair 2025 POPL Program Committee member Repeated reviewer/PC member: PLDI, SPLASH/OOPSLA, ISSTA, ECOOP, APLAS, PriSC, PASS Zhang regularly mentors student researchers through SRC sessions and workshop panels, fostering diversity and early-career participation in the programming-languages community.
Yingfei Xiong is an active Associate Professor at Peking University, China, specializing in software engineering and programming languages. With a consistent research trajectory from 2013 through 2026, Xiong has established themselves as a prominent figure in the software engineering research community, regularly contributing to top-tier conferences including SPLASH, ICSE, ASE, and PLDI. Dr. Xiong's research primarily focuses on program synthesis, automated program repair, and software analysis techniques. Their work bridges theoretical programming language concepts with practical software engineering applications, particularly in developing novel approaches for code generation, bug fixing, and program optimization. The research demonstrates strong interdisciplinary connections between traditional software engineering, programming languages theory, and emerging AI techniques. Analysis of Xiong's publication trends reveals a clear evolution in research focus, beginning with foundational work in API transformations and program adaptation around 2013-2016, shifting toward program repair techniques from 2017-2020, and most recently incorporating machine learning and neural approaches into program synthesis and repair (2021-2026). The work consistently addresses practical challenges in software development while maintaining theoretical rigor, with increasing integration of AI techniques in recent years. Dr. Xiong has served in various leadership roles across the software engineering conference ecosystem, including program committee membership and session chair positions at major conferences. Their extensive service demonstrates recognition by peers as a subject matter expert in software engineering and programming languages research. While specific grant information isn't detailed in the provided text, the sustained publication record suggests successful research funding.
Dr. Farzaneh Derakhshan is an Assistant Professor in the Computer Science Department at Illinois Institute of Technology (Illinois Tech), where she explores logical foundations of concurrency and develops formal methods for program verification. She earned her Ph.D. in Pure and Applied Logic from Carnegie Mellon University in 2021 under Frank Pfenning, followed by a postdoctoral fellowship at CMU with Limin Jia and Stephanie Balzer. Current affiliation: Illinois Tech (since ~2021) Previous affiliation: Carnegie Mellon University (Ph.D. and postdoc) Research focus: Type theory, logical verification, and security for concurrent systems Teaching: Courses on programming languages, type systems, and security Her research addresses fundamental challenges in concurrent programming, including: Developing modal logic frameworks for system verification Designing type systems for intermittent computing Creating behavioral type systems for security guarantees Applying relational logic to GPU security and secure compilation Investigating logical foundations of session-typed processes Formal verification of cyclic process networks Current research trends include: Hybrid dynamic verification for parallel systems Logical approaches to side-channel security Formal methods for cyber-physical systems Crash-resilient computing models Security verification in decentralized applications Noninterference proofs in session-typed concurrency Scientific recognition: NSF SaTC CORE Collaborative Award #2350217 Organizing committee member at Dagstuhl Seminar 26071 Professional leadership: Program committee co-chair for PLACES 2025 Committee roles at LICS 2026, ESOP 2026, ICFP 2025, and ECOOP 2025 Regular reviewer for ACM Transactions journals Laboratory involvement: Co-director of behavioral types research at Illinois Tech Collaboration with Carnegie Mellon's formal verification group Key participant in the FACCT workshop
Philip Wadler is Professor of Theoretical Computer Science at the University of Edinburgh and Senior Research Fellow at IOHK. He is an ACM Fellow, Fellow of the Royal Society, and Fellow of the Royal Society of Edinburgh. His work spans programming language design, type systems, and formal verification, with significant contributions to Haskell, Java, and XQuery. He has held leadership roles in ACM SIGPLAN and served on editorial boards for major journals. Research Interests: Wadler's research focuses on the foundations of programming languages , including Gradual and session typing Language-integrated query Functional and logic programming XML data models Parametricity and free theorems Verification of smart contracts Publication Trends: Recent articles emphasize type safety, formal verification, and blockchain applications. Key themes include gradual typing (blame calculus), session types for concurrency, and logical foundations of programming. His 2015–2025 papers show sustained focus on type theory and language design . Awards & Recognition: POPL Most Influential Paper (2003 for 1993 work) SIGPLAN Distinguished Service Award Best Paper SBMF 2018 Royal Society-Wolfson Fellowship (2004–2009) ACM Fellow (2007) Fellow of Royal Society of Edinburgh (2005) Advising & Grants: He has supervised numerous PhD students in programs like the Centre for Doctoral Training in Pervasive Parallelism. His EPSRC Programme Grant "From Data Types to Session Types" (2013–2020) funded major advances in concurrency theory. Current work with IOHK explores blockchain verification using Haskell-based Plutus.
Michał Paweł Skrzypczak is an Associate Professor at the Institute of Informatics, Faculty of Mathematics, Informatics, and Mechanics, University of Warsaw. He is actively involved in teaching and academic service, with a focus on theoretical computer science and formal methods. His research interests lie primarily in theoretical computer science , particularly program semantics , program verification , logic in computer science , and automata theory . These interests are reflected in his long-standing teaching of advanced courses such as Program Semantics and Verification , Logics for Computer Scientists , and Automata on Infinite Trees . While no publications are listed in the provided text, the consistent engagement with formal methods and mathematical logic across multiple courses over more than a decade suggests a sustained research trajectory in foundational aspects of computing. Scientific Awards: No awards listed. He has contributed to the academic development of students through teaching and exercise sessions, particularly in core theoretical subjects. Though no formal advisees are listed, his role as an instructor in graduate-level courses indicates mentorship responsibilities. He is affiliated with the Institute of Informatics at the University of Warsaw, which serves as his primary academic unit. There is no mention of specific research labs or teams, but his collaborations with researchers like Prof. Andrzej Tarlecki and Prof. Paweł Urzyczyn suggest integration into a strong logic and semantics research group.
Ross J. Kang is a Canadian mathematician currently serving as an Associate Professor at the Korteweg–de Vries Institute for Mathematics within the Faculty of Science at the University of Amsterdam since 2022. He is an active member of the Discrete Mathematics and Quantum Information group and the NETWORKS consortium. Previously, he held positions as Assistant/Associate Professor at Radboud University Nijmegen (2014-2022), Assistant Professor at Utrecht University (2013), and Researcher at Centrum Wiskunde & Informatica (2012-2013). His academic journey includes postdoctoral positions at Durham University (2010-2012) and McGill University (2008-2010), where he was advised by Bruce Reed and Louigi Addario-Berry. DPhil in Mathematics, University of Oxford (2008) - Thesis: 'Improper colourings of graphs', advised by Colin McDiarmid BSc (Hons) in Mathematics and Computer Science, University of Victoria (2003) - Governor General's Silver Academic Medal recipient Ross J. Kang's research focuses on probabilistic and extremal combinatorics, random discrete structures, graph coloring, geometric graphs, and algorithms. His work bridges theoretical mathematics with practical applications, exploring fundamental questions in discrete mathematics. He has made significant contributions to understanding graph coloring problems, particularly in the contexts of list coloring, distance coloring, and strong coloring. His research often employs probabilistic methods to establish bounds and structural properties in graph theory. Kang's work on the hard-core model, local occupancy method, and triangle-free graphs has advanced our understanding of the interplay between local constraints and global structure in discrete systems. Analysis of his recent publications reveals a strong emphasis on graph coloring problems, particularly list coloring variants and their extensions. His work frequently explores the relationship between graph structure (such as degree constraints, girth, or forbidden subgraphs) and coloring properties. A notable trend is his development and application of the local occupancy method to establish improved bounds for chromatic numbers in various graph classes. His research also demonstrates a consistent interest in extremal problems, seeking optimal configurations under specific constraints, particularly in the context of triangle-free graphs and geometric representations. NWO Open Competition M-1 grant entitled 'Asymptotic triangle-free structure (3Free)', 2022-2026 NWO Vidi grant entitled 'On the edge: theory and techniques at the frontiers of edge-colouring', 2017-2023 NWO Veni grant entitled 'Generalised colouring for random graph models', 2012-2015 Van Gogh travel grants (2020-2021 with Marthe Bonamy; 2016-2017 with Louis Esperet) Governor General's Silver Academic Medal (2003) Ross J. Kang has successfully supervised multiple PhD students including Eoin Hurley (defending May 2025), Stijn Cambie (defended April 2022), and François Pirot (winner of 2020 prix Charles Delorme). His research is supported by significant grants from the Netherlands Organisation for Scientific Research (NWO), including the prestigious Open Competition M-1 grant. Kang is actively involved in the academic community through his editorial role at Combinatorial Theory, co-organization of conferences like the Dutch Days of Combinatorics, and leadership in initiatives such as Innovations in Graph Theory, a diamond open access journal he helped launch in August 2023. As a member of the Discrete Mathematics and Quantum Information group at the University of Amsterdam and the NETWORKS consortium, Kang collaborates with researchers across various institutions. He has established strong international connections through his Van Gogh travel grants and participation in collaborative projects like the Sparse (Graphs) Coalition sessions. His research group focuses on theoretical aspects of discrete mathematics with connections to quantum information science, and he maintains active collaborations with researchers across Europe and North America.
Dr. Uwe Grünefeld is a Visiting Professor at the Faculty of Computer Science , Institute for Computer Science and Business Information Systems (ICB) of the University of Duisburg-Essen. He has been actively contributing to Human-Computer Interaction research through multiple publications in 2025-2022 focusing on Virtual Reality , Augmented Reality , and Robotics . Research Interests span across immersive technology applications for health behavior change (situated artifacts, weight visualization mirrors), haptic feedback systems (EMS for weight perception, vibrotactile directional cues), and behavioral biometrics (hand tracking identification, gaze-based user recognition). His work addresses cross-reality system design , collaborative robotics , and human-in-the-loop simulation methodologies . Key Publications demonstrate significant contributions to VR/AR user engagement, with particular focus on Physical activity promotion through situated artifacts Advanced haptic feedback techniques for immersive environments Behavioral biometric identification systems Robot motion intent communication Cross-reality transition visualization His research often employs mixed-method approaches combining technical implementations with user studies involving quantitative and qualitative data collection.
Jens Palsberg is a Professor and former Department Chair of Computer Science at the University of California, Los Angeles (UCLA), where he currently serves as Director of the UCLA-Amazon Science Hub for Humanity and Artificial Intelligence and co-director of UCLA's quantum research center. He chairs ACM SIGPLAN and is a member of the ACM Council. His research spans programming languages, software engineering, quantum computing, compilers, embedded systems, and information security. Palsberg has authored over 80 technical papers, co-authored the book Object-Oriented Type Systems , and revised Appel's textbook on Modern Compiler Implementation in Java . His recent work shows a significant shift toward quantum computing, including compiler techniques and program analysis for quantum systems. Analysis of his recent publications reveals a clear transition from traditional programming language research to quantum computing, with nearly half of his 2022-2024 publications focusing on quantum topics while maintaining strong work in software engineering and programming languages. His quantum research particularly emphasizes compiler optimization, abstract interpretation, and circuit analysis. ACM SIGPLAN Distinguished Service Award (2012) UCLA teaching award for quantum computing courses (2023) National Science Foundation CAREER and ITR awards Purdue University Faculty Scholar award IBM Faculty Award Okawa Foundation research award Palsberg has served in numerous leadership roles including general chair of POPL, conference chair of LICS, and vice chair of ACM SIGBED. His research has been supported by DARPA, Intel, British Telecom, and the National Science Foundation. He was instrumental in establishing UCLA's Masters degree in quantum science and has mentored numerous students through his legendary proof sessions. He leads a research group of over 30 professors in UCLA's quantum research center and maintains active collaborations across academia and industry, particularly with Amazon through the UCLA-Amazon Science Hub.
Daniel Frumin is an Assistant Professor in the Department of Fundamental Computing Science at the University of Groningen, affiliated with the Bernoulli Institute. His research focuses on Logic, Type Theory, and Program Verification, with a particular emphasis on formal methods for concurrency, type systems, and homotopy type theory. He has contributed to foundational work in denotational semantics, modular programming language design, and mechanized verification of concurrent systems. His expertise includes the application of logical frameworks to concurrency models, such as ReLoC (Relational Logic for Concurrent Programming) and the integration of type theories with operational semantics. Recent work explores guarded interaction trees, interval domains in homotopy type theory, and compositional security properties for fine-grained systems. Frumin has published extensively in top-tier venues like ESOP, CONCUR, and ACM POPL, with peer-reviewed contributions on topics ranging from bunched implications in session-based concurrency to formal verification of data structures like concurrent queues. His research often bridges theoretical computer science and practical formal verification, leveraging tools like Coq for mechanized proofs. Collaborations include projects with institutions such as Aarhus University (Denmark) and the University of Bologna, focusing on univalent foundations, categorical semantics, and security verification. His work is supported by grants from the Dutch Research Council (NWO) and industry partnerships like Meta's Folly Library verification efforts. Labs/Teams: Active contributor to the Bernoulli Institute's Formal Methods Group and the Univalent Foundations initiative. His research group specializes in applying type-theoretic and categorical methods to concurrency and verification challenges.
Deepak Garg is a researcher at the Max Planck Institute for Software Systems (MPI-SWS) in Germany. His work primarily focuses on secure compilation , type theory , and formal verification of software systems. Conference Roles: He has served as an author and committee member in premier programming language conferences such as POPL , PLDI , ICFP , and ESOP since 2015. Research Interests include: Secure compilation techniques for hyperproperty preservation. Modal and refined type theories for cost analysis and concurrency. Formal verification of C code and probabilistic programs. Compiler correctness and decentralized multi-language verification. Contributions span foundational research in programming languages, with a focus on security, complexity, and concurrency. His work has been published in tracks like PriSC , OOPSLA , and ESOP , addressing topics such as data-flow back-translation and robust property preservation.
Adrian Francalanza is a Professor in the Department of Computer Science at the Faculty of Information and Communication Technology, University of Malta. His research is centered on formal methods, runtime verification, and concurrency, with a focus on monitorability and distributed systems. His research interests include: Runtime Verification and Monitor Synthesis Session Types and Protocol Safety Concurrency and Actor-Based Systems Branching and Linear-Time Temporal Logics Probabilistic and Decentralized Monitoring Formal Tools for Cyber-Physical and Distributed Systems The recent publications highlight a strong trend in theoretical and practical advances in monitorability, especially for branching-time and probabilistic systems. His work bridges theory with implementation, often resulting in tools like STMonitor and DetectEr. There is a clear emphasis on session types, runtime enforcement, and the verification of communication protocols in real-world systems such as REST APIs and SMTP. Scientific awards include: Distinguished Paper Award at ECOOP 2025 Best Paper Award at DisCoTec 2022 He has been actively involved in advising and organizing major academic events. He served as Program Chair for GandALF 2024 and 2025, FORTE 2024, and VORTEX workshops. He led a three-year project funded by Rannis on Theoretical Foundations for Monitorability in collaboration with Reykjavik University. He has received grants and recognition for developing practical tools such as DetectEr and STMonitor, which support runtime monitoring of Erlang and session-typed systems. He is associated with several research teams and labs, including: Runtime Verification and Monitorability Research Group at University of Malta Collaborators on the DetectEr project Developers of STMonitor and polyLarva tools International collaborators at Reykjavik University and beyond
