Find Academic Supervisors

• Hydrogeology
• Groundwater
• Stochastic Modelling
• +16 more

Dr. Alraune Zech is an Assistant Professor for Computational Environmental Hydrogeology at Utrecht University, Faculty of Geosciences, Department of Earth Sciences, Hydrogeology group. Her research focuses on groundwater flow and transport processes in heterogeneous environments, with emphasis on practical applications in contaminated aquifers, PFAS remediation, and construction-related groundwater issues. She is affiliated with the Helmholtz-Centre for Environmental Research and serves as convener for EGU sessions on contaminant transport. Dr. Zech's educational background includes: PhD in Computational Hydrosystems from Friedrich-Schiller-University Jena and Helmholtz-Centre for Environmental Research (2010-2013) Prediploma Degree in Business Mathematics from University Leipzig (2011) Diploma in Mathematics with minor in Chemistry from University Leipzig (2003-2009) Her research interests span hydrogeology, groundwater modeling, and environmental remediation. She specializes in stochastic and computational modeling of subsurface processes, with focus on contaminated aquifers, PFAS removal strategies, biodegradation, bioremediation, and heat transport in the subsurface. Her work bridges theoretical approaches with practical applications in construction engineering and environmental protection. Analysis of Dr. Zech's recent publications (2021-2025) reveals strong focus on advancing hydrogeological modeling techniques, particularly in aquifer heterogeneity characterization, machine learning applications in hydrogeology, and practical remediation strategies. Her work spans fundamental research on pore-scale processes to field-scale applications, with increasing integration of artificial intelligence methods for solving complex groundwater problems. Dr. Zech leads several significant research projects: Living Lab PFAS Remediation (2024-2028): Developing strategies for PFAS contamination SilPit (2024-2028): Studying erosion of silicate grouting in construction pits MIBIREM (2022-2027): Creating innovative technological toolbox for bioremediation She actively supervises multiple PhD students including Alexandra Hockin, Kim Bartsch, Mahammad Valibeknejad, Sona Aseyednezad, Hannah Gebhardt, and Martijn van Leer. Her research is supported by funding from the Ministry of Infrastructure and Water Management, NWO, and EU Horizon programs.

• Parallel Programming
• Dependently Typed Languages
• Concurrent Systems
• +3 more

Dr Adam Barwell is a Lecturer and Researcher at the School of Computer Science, University of St Andrews. His research focuses on parallel programming, dependently typed languages, and formal methods in concurrent systems. He advises PhD student Leonid Nosovitskiy and has contributed to projects involving session types, distributed systems, and type-safe refactoring techniques. His educational background includes a PhD (not explicitly detailed here), and he actively engages in academic activities such as organizing events like Doors Open @ Computer Science 2025. Key research themes include concurrency control, functional programming paradigms, and improving code security through dependent types. Recent publications emphasize advancements in parallel language design, fault-tolerant protocols, and type-driven development. Collaborations span international conferences and institutions, reflecting his contributions to both theoretical and applied computer science domains.

Brigitte PientkaView profile

Professor

• Type theory
• Programming languages
• Logical frameworks
• +7 more

Brigitte Pientka is a Full Professor in the School of Computer Science at McGill University, where she leads the Computation and Logic group. She received her PhD from Carnegie Mellon University in 2003, and previously studied at the University of Edinburgh and Technical University of Darmstadt. Her educational background includes: PhD from Carnegie Mellon University (2003) Studies at the University of Edinburgh Studies at Technical University of Darmstadt Dr. Pientka's research focuses on developing theoretical and practical foundations for building and reasoning about reliable, safe software systems. She combines theoretical research on logical foundations of computer science in programming languages and verification with system building. Her work spans logics (classical and non-classical), type theory, theorem proving, logic and functional programming, and logical frameworks. She has made significant contributions to the field of contextual types and mechanized metatheory. Her recent publications demonstrate a strong trend toward modal type theory, contextual types, and session types, with applications to functional programming, verification, and meta-programming. She has made significant contributions to the Beluga system, which explores how to combine functional programming with dependently-typed, higher-order data specified in the logical framework LF. Her work often bridges theoretical foundations with practical implementations for mechanized reasoning. Dr. Pientka has received several notable awards: Humboldt Fellowship Test of Time Award @ PPDP'18 for 'Programming with proofs and explicit contexts' Best student paper award at ICLP'03 She is actively involved in mentoring and academic service, having served as PC Chair for ICFP'24, CPP'23 and CPP'24, and as General Chair for POPL'20. She is an Executive Editor of Logical Methods in Computer Science and serves on the editorial boards of the Journal of Functional Programming and ACM Transactions of Computational Logic. She leads the Computation and Logic group at McGill University, which focuses on developing theoretical and practical foundations for reliable software systems through research in logical frameworks, type theory, and programming language design.

Ross HorneView profile

Senior Lecturer

• Security protocols
• Privacy-preserving technologies
• Concurrency theory
• +7 more

Ross Horne is a Senior Lecturer in the Department of Computer & Information Sciences at the University of Strathclyde, Glasgow, United Kingdom. He is a member of the StrathCyber and Mathematically Structured Programming research groups. Education: PhD (University of Southampton, 2012), BA (Oxford University, 2005) Prior Appointments: Research Fellow at University of Luxembourg (2018-2023), Senior Research Fellow at Nanyang Technological University (2015-2018), Associate Professor at Kazakh-British Technical University (2012-2015) Research Interests: Dr. Horne's work focuses on security and privacy protocols for digital systems, particularly addressing threats in payment technologies, ePassports, and decentralized identity management (e.g., Solid protocol). His theoretical contributions bridge concurrency theory, proof theory, and logic through applications to security verification and process calculi. Developed formal models for unlinkability in EMV payment protocols Created intuitionistic logical frameworks for process equivalence Explored graphical proof systems beyond formulaic representations Investigated legal-compliant AI for space systems (CubeSat anomaly detection) Scientific Contributions: He has published extensively in top venues including ACM CCS, IEEE CSF, LICS, and CONCUR. His 2017 CONCUR best paper introduced intuitionistic characterizations of bisimilarity. Principal Investigator for EU COST Action on Distributed Knowledge Graphs Co-developed privacy models adopted in Luxembourg parliamentary responses Advising: Currently accepting PhD students with strong mathematical and computer science skills for research in security/privacy of emerging systems. Former student Semen Yurkov completed a thesis on privacy-preserving smart card payments. Interdisciplinary Work: Collaborates with space lawyers through the Interdisciplinary Master Program in Space Resources. Projects include AI for CubeSat reliability and legal-compliant software certification frameworks.

Brigitte PientkaView profile

Professor

• Programming Languages
• Verification
• Type Theory
• +6 more

Brigitte Pientka is a Professor at McGill University's School of Computer Science , where she leads the Computation and Logic group . She earned her PhD from Carnegie Mellon University in 2003 and previously studied at the University of Edinburgh and Technical University of Darmstadt. Education PhD in Computer Science, Carnegie Mellon University (2003) University of Edinburgh Technical University of Darmstadt Research Interests Her work focuses on the theoretical and practical foundations for building reliable software systems, combining logic, type theory, and verification with system-building. Key areas include: Type Theory and Dependent Types Logical Frameworks and Mechanized Metatheory Session-Typed Concurrency and Linear Logic Metaprogramming and Contextual Type Systems Theorem Proving and Formal Verification Functional Programming and Language-Based Security Professional Roles She has served as: PC Chair for ICFP'24 and CPP'24 General Chair for POPL'20 Executive Editor of Logical Methods in Computer Science Steering Committee Member for LICS, POPL, and ESOP Scientific Awards Dr. Pientka has received: Test of Time Award at PPDP'18 Humboldt Fellowship for research at MPI-SWS, Germany Labs & Teams She actively develops the Beluga programming language , a tool for mechanizing meta-theory proofs and type-driven program manipulation.

Sam LindleyView profile

Associate Professor

• Programming Languages
• Formal Methods
• Type Systems
• +3 more

Sam Lindley is a Reader in Programming Language Design and Implementation at the School of Informatics, University of Edinburgh. He holds a UKRI Future Leaders Fellowship in Effect Handler Oriented Programming. His research focuses on foundational aspects of programming languages, including effect systems, session types, type theory, and functional programming. Key research interests span algebraic effects, concurrency models, type systems for resource management, and language implementation techniques. Lindley's work bridges theory and practice, addressing challenges in systems programming, web technologies (e.g., WebAssembly), and compiler design. Recent publications (2023–2025) emphasize effect handlers for low-level languages (e.g., C, WebAssembly), modal type systems for memory management, and formal semantics for concurrent systems. His work often explores how advanced type systems can improve expressivity and efficiency in programming models. Scientific Awards: UKRI Future Leaders Fellowship Labs/Teams: Laboratory for Foundations of Computer Science (LFCS) Grants: Active funding via UKRI Fellowship

• Algebraic Combinatorics
• Geometric Combinatorics
• Hyperplane Arrangements
• +4 more

Galen Dorpalen-Barry is an Assistant Professor at Texas A&M University. Her research focuses on geometric and algebraic combinatorics, particularly hyperplane arrangements, oriented matroids, polytopes, posets, and related fields. Education: PhD in Mathematics (University of Minnesota, 2021) Masters in Mathematics (University of Minnesota, 2018) Bachelor of Arts in Mathematics (Bard College, 2015) Her recent research explores the topology of hyperplane arrangement complements, cohomology of graphical configuration spaces, and combinatorial interpretations of the ab-index. She collaborates with researchers including Nick Proudfoot, Christian Stump, and Vic Reiner. Galen has organized multiple seminars and conferences, including the Algebra and Combinatorics Seminar at Texas A&M and special sessions at SIAM and AMS meetings. She has presented at numerous international workshops and seminars on topics like positive geometries, Shi arrangements, and the Varchenko-Gel'fand ring. Contact: dorpalen-barry@tamu.edu | Website | GitHub

Yao LiView profile

Assistant Professor

• Programming Languages
• Formal Verification
• Dependent Types

Yao Li is an Assistant Professor of Computer Science at Portland State University, specializing in Programming Languages, Formal Verification, and Dependent Types. They earned a Ph.D. in Computer and Information Science from the University of Pennsylvania (2022), supervised by Stephanie Weirich, and hold a Master’s and Bachelor’s in Software Engineering from Shanghai Jiao Tong University (2016, 2013) under Zhengwei Qi. Ph.D., Computer and Information Science, University of Pennsylvania (2022) M.S., Software Engineering, Shanghai Jiao Tong University (2016) B.S., Software Engineering, Shanghai Jiao Tong University (2013) Their research focuses on formal verification of functional programming languages, particularly Haskell, and mechanized proofs using tools like Coq. They work on specifying and verifying networked servers, lazy program cost analysis, and embedded systems through program adverbs and Tlön embeddings. Recent publications (2018-2025) demonstrate expertise in Haskell verification, formal methods, and interaction trees. Key trends include bridging the gap between mechanized formalization and real-world code, advancing lazy evaluation semantics, and enhancing software verification through dependent types. Yao Li actively participates in academic service as a committee member and session chair in conferences like POPL, ICFP, and PLDI, contributing to artifact evaluation, program organization, and student research competitions.

Ben HermannView profile

Professor

• Programming Languages
• Security
• Static Analysis
• +6 more

Ben Hermann is a Professor for Secure Software Engineering at Technische Universität Dortmund, Germany, with research focusing on the intersection of programming languages and security. His work primarily centers on vulnerability detection using static analysis, risk assessment of software libraries, security guarantees in type systems, and language-based security. His academic journey includes a doctoral degree from Technische Universität Darmstadt in 2016, followed by postdoctoral work in Eric Bodden's Secure Software Engineering Group at the Heinz Nixdorf Institute. Since 2020, he has held a tenure-track professorship at TU Dortmund, after serving as an interim Professor for IT Security at Paderborn University from October 2019 to September 2020. Hermann's research portfolio demonstrates consistent output in static program analysis frameworks, particularly with contributions to Soot and PhASAR. His work spans vulnerability detection, analysis reusability, and research quality in computer science, with emphasis on artifact evaluation. His recent publications show progression from framework development toward security applications and research methodology. Hermann has been actively involved in numerous conferences including ASE, ICSE, ECOOP, and SPLASH, often serving in program committees and as session chair. His research group at TU Dortmund includes students like Maximilian Krebs who presented work on energy consumption prediction of programs. He maintains an active presence in the academic community, advocating for research quality and reproducibility, and serves in various organizational roles including Doctoral Symposium Chair and Diversity & Inclusion Chair for conferences.

Amin TimanyView profile

Associate Professor

• Programming Languages
• Type Theory
• Logical Relations
• +9 more

Amin Timany is an Associate Professor in the Department of Computer Science at Aarhus University, Denmark, where he conducts research in programming languages, type theory, and formal verification. He is a member of the Logic and Semantics Group and actively contributes to the development of logical relations, separation logic, and proof assistants such as Coq and Iris. He holds a PhD in Computer Science from KU Leuven (2018) and was previously a postdoctoral fellow with FWO at KU Leuven. His research focuses on mechanized semantics, program equivalence, concurrency, and distributed systems verification. He is particularly known for solving the long-standing problem of proving encapsulation in the ST monad using logical relations. His recent publications span top-tier venues including POPL, ICFP, PLDI, and CPP, with key contributions in guarded interaction trees, higher-order separation logic (e.g., Trillium), and modular verification of CRDTs and virtual machines. His work emphasizes formalization and mechanization in Coq, often within the Iris framework. He has served on numerous program committees and has chaired conferences such as CPP and sessions at CoqPL. Notably, his paper 'Modular Denotational Semantics for Effects with Guarded Interaction Trees' received a Distinguished Paper Award at POPL 2024. PhD, KU Leuven, 2018 MSc, TU Dresden, 2013 He teaches courses such as Compilation, Program Logics, and Advanced Topics in Programming Language Theory. He collaborates extensively with researchers like Lars Birkedal, Robbert Krebbers, and Derek Dreyer, and mentors students in formal methods and PL theory.

Farzaneh DerakhshanView profile

Assistant Professor

• Concurrency
• Formal Methods
• Programming Languages
• +4 more

Farzaneh Derakhshan is an Assistant Professor in the Computer Science Department at Illinois Institute of Technology. She received her Ph.D. in Pure and Applied Logic from Carnegie Mellon University in 2021 under Prof. Frank Pfenning and completed a postdoctoral fellowship at CMU with Profs. Limin Jia and Stephanie Balzer. Her research focuses on formal methods for concurrent and secure systems. Education: Ph.D. in Pure and Applied Logic, Carnegie Mellon University (2021) Dr. Derakhshan's research explores logical foundations for concurrent program design, emphasizing correctness guarantees (safety, reactivity) and security properties (fault tolerance, side-channel protection). Current projects include modal logics for under/over-approximation, relational logic for GPU security, type systems for intermittent computing, and behavioral types for security enforcement. Her work bridges theoretical logic with practical systems challenges. Recent publications (2021-2025) reveal strong thematic continuity in concurrency, security, and formal verification. Key trends include session-typed process models for secure communication, modal type systems for intermittent computing, and logical frameworks for program assurance. These contributions demonstrate consistent innovation at the intersection of programming languages, logic, and cybersecurity. Scientific Awards: No scientific awards are mentioned in the provided text. Advising and Research Funding: Current Students: PhD: Godha Pallavi Bhogadi, Myra Dotzel, Lang Liu; Master's: Akash Madhu Former Students: Narasimha Karthik G. (MS), Griffin Colomer (BSc) Grants: NSF SaTC CORE #2350217: "Mixed Assurance Reasoning via Modal Logic" (2024) Dr. Derakhshan leads an active research group focused on programming language security, collaborating with Carnegie Mellon University researchers. She co-organizes community initiatives including the 2026 Dagstuhl Seminar on Behavioural Types for Resilience and serves on multiple program committees for top programming languages conferences.

Wade RussuView profile

Associate Professor

• Drug Discovery
• Medicinal Chemistry
• Organic Chemistry
• +3 more

Wade Russu is an Associate Professor at University of the Pacific, specializing in chemistry education within pharmacy contexts and drug discovery for cancer. He has been at the university since 2005, blending teaching and research in pharmaceutical chemistry. Education: BS in Biochemistry, California Polytechnic State University, San Luis Obispo (1992) PhD in Chemistry, University of California, Santa Barbara (2000) Postdoctoral training at University of California, Irvine (2001-2004) Dr. Russu's research focuses on designing quinazoline-based kinase inhibitors for cancer therapy, including PDGFR family inhibitors and NF-kB pathway inhibitors. His work extends to using chemical probes to identify novel targets like CDK8 in triple-negative breast cancer and AhR in autophagy pathways. His teaching philosophy emphasizes "learn by doing" through problem-solving, lab sessions, and critical thinking exercises in courses like Drug Design (PCSP 211) and Pharmaceutical Analysis (PCSP 208). Scientific Honors: Phi Lambda Upsilon National Honorary Chemical Society Rho Chi Pharmaceutical Honor Society Alpha Chi Sigma National Chemistry Fraternity American Association of Colleges of Pharmacy American Association for Cancer Research American Association for the Advancement of Science American Chemical Society (Organic & Medicinal Chemistry Divisions) Dr. Russu's publications highlight his expertise in kinase inhibition, anti-cancer drug development, and chemical probe applications. He also maintains professional affiliations relevant to pharmaceutical and chemical sciences.

Max S. NewView profile

Assistant Professor

• Programming Languages
• Secure Compilation
• Gradual Typing
• +6 more

Max S. New is an Assistant Professor in Computer Science & Engineering at the University of Michigan, affiliated with the MPLSE research community . He works on the mathematical foundations of programming languages, focusing on Gradual Typing , Category Theory , Secure Compilation , and Effect Handlers . His research bridges formal methods with practical language design. Educational background : PhD in Computer Science, Northeastern University (2020) Postdoctoral Research, Wesleyan University (with Dan Licata) Max's recent work explores the intersection of Dependent Lambek Calculus and parsing verification, Synthetic Guarded Domain Theory for gradual typing semantics, and Relative Monads in computational models. His publications span top venues like PLDI , POPL , and ICFP , emphasizing formal verification and category-theoretic abstractions. He has served as Committee Member in OOPSLA and POPL, Session Chair for type systems tracks, and Program Co-Chair for HOPE workshops. His PhD students include Eric Giovannini, Steven Schaefer, and Jesse Slater (co-advised with Xinyu Wang).

J. Garrett MorrisView profile

Researcher

• Programming Languages
• Type Systems
• Functional Programming
• +4 more

J. Garrett Morris is a researcher and teacher at the University of Iowa's Department of Computer Science, with previous affiliation to the University of Kansas. His work focuses on programming languages, type systems, and formal verification. Active contributor to conferences like POPL, ICFP, and Haskell Recognized for research in session types, linear logic, and functional programming His publications span topics including Exceptional Asynchronous Session Types , Partial Type Constructors , and Constrained Type Families . While no specific awards or students are mentioned in the scraped data, his academic activities include committee roles and keynote sessions.

Giulia SaccàView profile

Associate Professor

• Algebraic Geometry
• Hyper-Kähler Manifolds
• Calabi-Yau Manifolds
• +4 more

Giulia Saccà is an Associate Professor in the Department of Mathematics at Columbia University. In Fall 2025 she will be on medical (maternity) leave. Previously, she spent 2019–2020 at the Collège de France, was an Assistant Professor at MIT (2017–2018), a J. H. Simons Instructor at Stony Brook University, and a Member of the School of Mathematics at the Institute for Advanced Study (IAS) in 2014–2015. Education: PhD, Princeton University, 2013 Research Interests lie in algebraic geometry, with a specific focus on hyper-Kähler and Calabi-Yau manifolds, K3 surfaces, moduli spaces of sheaves, families of abelian varieties and their degenerations, and symplectic resolutions. Her work intersects Hodge theory, derived categories, and enumerative aspects of these geometries. Her recent publications demonstrate a concentrated effort on understanding moduli spaces arising from Kuznetsov components, compactifications of Lagrangian fibrations, and the intricate geometry of O’Grady-type hyper-Kähler manifolds. A recurring theme is the interplay between derived categories and classical geometric constructions, often leveraging Bridgeland stability conditions and perverse sheaf techniques. Awards & Funding: NSF CAREER Award DMS-2144483 NSF FRG Grant DMS-2052750 “Derived Categories, Moduli Spaces, and Classical Algebraic Geometry” Member of the Simons Collaboration on Moduli of Varieties Previous NSF Grants DMS-1949812 and DMS-1801818 Graduate Advising & Service: Current PhD students: Anna Abasheva, Nicolás Vilches Reyes Organizer: Columbia Algebraic Geometry Seminar, FRG workshop “Hyperkähler Varieties, Derived Categories, and Moduli Spaces”, 2024 & 2025 GROW conferences, AMS Summer Research Institute 2025 session “Hyper-Kähler manifolds and derived categories” Former organizer: ZAG online seminar She maintains an active presence in the algebraic-geometry community through seminar organization, conference leadership, and collaborative grants that support graduate training and international workshops.