Find Academic Supervisors

Kazuhiro OgataView profile

Professor

• Programming Languages
• Software Engineering
• Formal Methods
• +5 more

Kazuhiro Ogata is a Professor in the School of Information Science at Japan Advanced Institute of Science and Technology (JAIST). He actively teaches courses such as i116 Basic of Programming, i217 Functional Programming, and i219 Software Design Methodology, indicating a strong commitment to computer science education and curriculum development. Institution: Japan Advanced Institute of Science and Technology (JAIST) School: School of Information Science Position: Professor Email: ogata@jaist.ac.jp Research Laboratory: http://www.jaist.ac.jp/~ogata/lab/ His research interests center on programming languages, software design methodology, formal methods, and compiler construction. He emphasizes formal verification using theorem proving and rewriting logic, particularly with tools like Maude. His work bridges theoretical computer science with practical software engineering and education, focusing on correctness, design patterns, and language semantics. The analysis of his recent publications reveals a consistent focus on formal specification, verification of software systems, and educational tools for programming. His work spans functional programming, concurrent systems, and distributed algorithms, often using rewriting logic as a unifying framework. He integrates formal methods into both research and teaching, promoting rigorous software development practices. No scientific awards are explicitly mentioned in the provided texts. Kazuhiro Ogata advises students through his laboratory at JAIST and has developed structured course materials that suggest active mentorship. While specific grant information is not available, his sustained research output and tool development imply ongoing project funding. He contributes to academic outreach through summer schools and educational frameworks. He leads a research laboratory focused on formal methods and programming language design, fostering a collaborative environment for students and researchers. The lab develops tools for teaching and verifying software systems, emphasizing correctness and educational impact.

• Proof Assistants
• Formal Verification
• Inductive and Coinductive Datatypes
• +12 more

Andrei Popescu is a Senior Lecturer (Associate Professor level) in the Department of Computer Science at the University of Sheffield, where he conducts research in formal methods, proof assistants, and information flow security. He previously held academic positions at Middlesex University and TU Munich. University: University of Sheffield Department: Department of Computer Science Previous Affiliations: Middlesex University, TU Munich His research focuses on the logical foundations and practical applications of proof assistants, particularly Isabelle/HOL. He has made foundational contributions to inductive and coinductive datatypes, syntax with bindings, higher-order logic, and the formal verification of secure systems. His work bridges theoretical logic with real-world systems such as conference management (CoCon) and social media platforms (CoSMeDis). The recent publications highlight a strong trend in formalizing deep logical results (e.g., Gödel’s incompleteness theorems), advancing datatype theory, verifying complex security properties, and applying formal methods to practical systems. His work consistently appears in top-tier venues such as POPL, CAV, ITP, and CSF. Distinguished Paper Award at POPL 2025 Distinguished Paper Award at POPL 2024 Distinguished Paper Award at POPL 2023 RS 3 Best Paper Award for 2012–2013 He has advised PhD students including Lorenzo Gheri and has been actively involved in organizing major academic events such as the Midlands Graduate School, CPP, ITP, and TABLEAUX conferences. He has served on numerous program committees including POPL, ITP, CSF, and CAV, and has led research projects funded by VeTSS and industrial partners. He is a key contributor to the Isabelle proof assistant ecosystem, particularly in the development of the (co)datatype package and foundational consistency results. His work combines deep theoretical insight with practical implementation, making significant impacts in both academia and applied security.

Matthew HagueView profile

Professor

• Infinite-State Verification
• Higher-Order Recursion
• Counter Systems
• +9 more

Matthew Hague is a Professor at the Department of Computer Science, Royal Holloway University of London. His research focuses on theoretical and practical aspects of infinite-state verification, with a particular emphasis on higher-order recursion and counter systems. Education: MEng in Computing, Imperial College London DPhil (PhD) in Computer Science, University of Oxford Research Interests: Matthew's work spans infinite-state systems verification , higher-order program analysis , string constraint solving , and pushdown automata . He develops practical tools like Ostrich (for string constraints), C-SHORe (for HORS analysis), TreePed (for CSS optimization), and PDSolver (for pushdown parity games). Scientific Contributions: His recent work includes symbolic Parikh's theorem applications (2024), regex-dependent string constraint solving (2022), collapsible pushdown parity games (2021), and path feasibility analysis with integer data types (2020). These span formal methods, automata theory, and programming language design. Awards & Grants: EPSRC Early Career Fellowship (2013-2018) EPSRC Grant for String Constraint Solving (PI, 2019-2022) Academic Leadership: Matthew has supervised numerous PhD students including Emma Lieu and Jonathan Hoyland, and organized key conferences like BCTCS 2018 and ICALP 2026. He maintains active involvement in program committees for POPL, LICS, and MFCS. Laboratory Tools: He leads development of Ostrich (string constraint solver), PDSolver (pushdown system analysis), and C-SHORe (higher-order verification) tools.

Peng FuView profile

Assistant Professor

• Type theories
• Quantum programming languages
• Categorical semantics
• +3 more

Peng Fu is an Assistant Professor in the Department of Computer Science and Engineering at the Molinaroli College of Engineering and Computing, University of South Carolina. His academic career focuses on the theoretical foundations of programming languages with particular emphasis on quantum computing applications. Dr. Fu received his educational training from prestigious institutions: Ph.D. in Computer Science from University of Iowa (2014) B.Eng. in Computer Science from Huazhong University of Science and Technology (2009) Dr. Fu's research program centers around type theories, quantum programming languages, and their categorical semantics . His work bridges the gap between theoretical computer science and practical quantum computing applications. He develops formal systems that enable reliable quantum circuit programming through strong type systems and categorical models. His research has significant implications for the future of quantum software development, where correctness and reliability are paramount due to the fragile nature of quantum states. An analysis of Dr. Fu's publication record reveals a consistent trajectory toward increasingly sophisticated quantum programming frameworks. Starting with foundational work on lambda encodings and type theory, he has progressively focused on quantum-specific challenges. His recent papers on Proto-Quipper variants demonstrate innovative approaches to quantum circuit programming with features like dynamic lifting, reversing, and control structures. The research shows strong integration of category theory with practical programming language design, creating bridges between abstract mathematical structures and executable quantum code. Dr. Fu actively mentors the next generation of computer scientists, currently seeking Ph.D. students to join his research group. His teaching portfolio includes advanced courses such as CSCE 790: Quantum Programming Languages (Spring 2025) and CSCE 544: Functional Programming (Fall 2024), where he introduces students to cutting-edge concepts in programming language theory and quantum computing. His commitment to education extends to developing comprehensive course materials and providing guidance to graduate students pursuing research in quantum programming languages. Dr. Fu maintains an active presence in the quantum computing research community, regularly presenting at major conferences including the International Conference on Quantum Physics and Logic (QPL), ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), and specialized quantum computing workshops. His work contributes to the growing ecosystem of quantum programming tools and methodologies that will be essential for practical quantum computing applications.

Karl CraryView profile

Associate Professor

• Programming Languages
• Security and Privacy
• Type Theory
• +4 more

Karl Crary is an Associate Professor at the Computer Science Department of Carnegie Mellon University , where he also serves as Director of Doctoral Programs . His research focuses on Programming Languages , Security and Privacy , and Mechanized Metatheory , with emphasis on applying Type Theory to software verification and compiler design. Research Type Safety Proofs Certified Code Compiler Implementation His recent publications explore Substructural Parametricity , Hashgraph Consensus Verification , and Focused Logic applications. He has advised students including Derek Dreyer , Chris Martens , and Tom Murphy , with software projects like Istari proof assistant and CM-Lex/CM-Yacc for hygienic code generation. Current teaching includes Constructive Logic (15-317/657) and HOT Compilation (15-417).

Charles GrelloisView profile

Lecturer

• Program Verification
• Formal Semantics
• Probabilistic Programming
• +2 more

Charles Grellois is a Lecturer in Verification at the University of Sheffield's Department of Computer Science. His research focuses on formal verification methods for functional and probabilistic programs using semantic and type-theoretic approaches. Research interests include program verification, linear logic, higher-order model checking, and termination analysis of probabilistic programs. Collaborates with medical researchers on mathematical modeling for cancer treatment prediction. Publications appear in computer science logic conferences including CSL and MFPS. Current work develops proof systems for bringing-it-about logics and intuitionistic deontic logic.

Carsten FuhsView profile

Senior Lecturer

• Program Analysis
• Termination
• Complexity Bounds
• +5 more

Carsten Fuhs is a Senior Lecturer at the School of Computing and Mathematical Sciences at Birkbeck, University of London . His research focuses on Program Analysis , Termination , Complexity Bounds , and Term Rewriting , with applications in Verification and SAT Encodings . Research Group Lead of the Logical Methods research group (2023–present) Member of the Board of Trustees for CADE (2023–present) Chair of the Bill McCune PhD Award Expert Committee (2024, 2025) Active in conference organization and program committees (FSCD, IJCAR, LOPSTR, etc.) Research Interests : Carsten Fuhs specializes in automated termination and complexity analysis for term rewriting and programming languages. His work leverages SAT solving and constraint-based methods to develop tools like AProVE for program verification. Key areas include parallel term rewriting , higher-order dependency pairs , and memory safety proofs . Selected Publications Trends : Recent articles emphasize higher-order rewriting (2025), parallel complexity analysis (2024), and modular termination proofs (2022–2024). Earlier work (2014–2017) explores pointer arithmetic verification , separation logic , and integer program complexity . Scientific Awards : Best Paper Award, LOPSTR 2022 Teaching and Mentoring : Carsten Fuhs has lectured on Java programming , compilers , and term rewriting at Birkbeck and international summer schools. He contributes to SAT competitions as a benchmark submitter and organizes regional programming language seminars like S-REPLS 10 (2018).

Taro SekiyamaView profile

Associate Professor

• programming languages
• type theory
• gradual typing
• +6 more

Taro Sekiyama is an Associate Professor at the National Institute of Informatics in Japan. His research focuses on programming language theory and applications, particularly in type systems, gradual typing, and program verification with effects. Academic Rank: Associate Professor University: National Institute of Informatics His research interests span type theory , polymorphic algebraic effects , gradual typing , and temporal verification . His work combines theoretical foundations with practical applications, including Rust programming language verification and effect handling. The analysis of Taro Sekiyama's publications reveals a consistent focus on: Algebraic effect systems Refinement type theory Gradual typing semantics Temporal verification techniques Neural-guided program analysis Effect handler design

• Blockchain
• Cybersecurity
• Distributed Systems
• +5 more

Roberto Zunino is an Associate Professor in the Department of Mathematics at the University of Trento, specializing in blockchain technologies, formal methods, and distributed systems. His research bridges theoretical computer science with practical cryptographic applications, particularly in Bitcoin and smart contract ecosystems. His research interests focus on blockchain security , smart contract formalization , and probabilistic verification . Key areas include MEV (Maximal Extractable Value) theory, UTXO-based smart contracts, and computationally sound tokenization. His work combines rigorous mathematical modeling with real-world protocol analysis, emphasizing security guarantees through formal methods. Recent publications demonstrate a strong trend toward theoretical foundations of blockchain economics and security. His 15 most recent papers (2020-2025) analyze MEV formalization, Bitcoin contract liquidity, UTXO scalability, and smart contract language design, revealing deep integration of type theory, game theory, and cryptographic primitives. Zunino actively teaches courses including Informatics , Interactive Theorem Proving (using Lean 4), and Computer Tools for Mathematics . His educational focus emphasizes formal verification, imperative programming foundations, and mathematical logic applications in computer science.

Morten RhigerView profile

Associate Professor

• Computer Science
• Programming Languages
• Semantics of Programming Languages
• +10 more

Morten Rhiger is an Associate Professor in the Department of People and Technology at Roskilde University, Denmark, specializing in programming language theory and implementation with expertise in semantics, type systems, and compiler design. His research portfolio centers on: Programming Languages : Core design principles and theoretical foundations Semantics : Formal denotational and operational frameworks Type Systems : Safety mechanisms and correctness verification Compilers : Optimization techniques and runtime systems Program Generation : Staged computation and automatic code synthesis Multi-stage Languages : Runtime code generation and partial evaluation Publication trends reveal sustained contributions from foundational work (2009-2012) on pattern combinators and staged computation to recent innovations in type-based uncurrying (2024), with significant interdisciplinary work on energy-transparent systems (2016). His research consistently bridges theoretical rigor with practical implementation challenges. Rhiger actively contributes to major research initiatives including ENTRA (2012-2015) for energy transparency, NUSA (2011-2013) for model checking, and recent energy-certification projects (2020-2022), demonstrating sustained focus on program analysis and energy-aware computing. He maintains strong community engagement through organizing the Copenhagen Programming Languages Workshop and participating in key conferences including the Symposium on Implementation and Application of Functional Languages.

• Theoretical Computer Science
• Rewriting Systems
• Lambda Calculus
• +3 more

Femke van Raamsdonk is an Assistant Professor in Theoretical Computer Science at Vrije Universiteit Amsterdam’s Faculty of Science and affiliated with the Network Institute. She specializes in rewriting systems, lambda calculus, and formal methods. Her research spans higher-order rewriting, termination analysis, and computational logic, with a focus on theoretical foundations and applications in programming languages. Van Raamsdonk has edited numerous conference proceedings, including RTA 2013 and FSCD 2023, and has authored over 24 research outputs. She teaches advanced courses like Advanced Logic and Equational Programming, emphasizing practical tools like the ProofWeb system. Her work contributes to UN Sustainable Development Goals through advancements in computational theory and education. No scientific awards are explicitly mentioned, but her extensive editorial roles and conference contributions highlight her academic leadership. She has supervised two PhD theses, though student names are not listed. Her activities include memberships in professional organizations like CL and RTA, and lectures on topics such as constructor subtyping and termination in lambda calculus.

Uli FahrenbergView profile

Professor

• Real-Time Systems
• Quantitative Verification
• Directed Algebraic Topology
• +2 more

Uli Fahrenberg is a Professor at Université Paris-Saclay and the Formal Methods Laboratory (LMF). He previously served as Head of the Automata and Applications research group at the EPITA Research Lab (LRE) until August 2025. He holds a PhD in Mathematics from Aalborg University and has worked at institutions including Aalborg University, IRISA Rennes, LIX (École Polytechnique), and EPITA Rennes. His research spans: Real-time systems : Modeling and verification of time-sensitive computational systems. Quantitative verification : Formal methods for analyzing probabilistic/timed systems. Directed algebraic topology : Applications in concurrency and spatial logic. Concurrency theory : Semantics and analysis of parallel processes. Categorical foundations : Abstract structures for theoretical computer science. His publications focus on advancing higher-dimensional automata, concurrency models, and formal verification techniques, with recent work exploring timed automata, pomsets, and algebraic frameworks for concurrent systems. Advising & Grants : Currently supervising PhD students Enzo Erlich (Université Paris Cité) and Safa Zouari (NTNU Gjøvik). Previously co-supervised Claus Thrane (PhD). Actively involved in PhD proposals on higher-dimensional automata and concurrency learning models. Labs & Teams : Leads the Automata and Applications group at LRE and co-founded the (i)Po(m)set Project—a collaborative initiative exploring concurrency theory, automata, and geometry. Key collaborators include researchers from NTNU, University of Warsaw, and École Polytechnique.

Tachio TerauchiView profile

Professor

• Programming Languages
• Program Verification
• Program Synthesis
• +6 more

Tachio Terauchi is a Professor in the Department of Computer Science and Engineering at Waseda University, Japan. Previously, he held academic positions at JAIST (Professor, 2014-2017), Nagoya University (Associate Professor, 2011-2014), and Tohoku University (Assistant Professor, 2007-2011). He actively participates in program committees for premier conferences including POPL, PLDI, and SPLASH, with current service for SPLASH 2025 and POPL 2025. His academic background: B.S. in Computer Science, Columbia University (2000) M.S. in Computer Science, University of California, Berkeley (2004) Ph.D. in Computer Science, University of California, Berkeley (2006) Terauchi's research centers on techniques for building reliable computational systems through programming languages and formal methods. His core contributions span program verification for higher-order functional programs, security analysis of timing channels and regex vulnerabilities, and refinement type systems. Recent work demonstrates particular expertise in regular expressions with backreferences and temporal logic verification. His publications from 2020-2025 reveal a dominant focus on regular expression security (ReDoS vulnerabilities and repair methods) and advanced program verification techniques. This work bridges theoretical foundations in automata theory and mathematical logic with practical security applications, showing increasing specialization in regex analysis since 2022 while maintaining contributions to verification frameworks. Scientific Awards: None explicitly mentioned in the provided text. He currently advises a substantial cohort of students across all academic levels at Waseda University, with his lab actively recruiting prospective students. The lab, located in room 209B of Building 62W, supports research in programming languages and security verification through regular appointments. PhD Students: Tianrui Chen (D2), Taisei Nogami (D1) Master's Students: Kazuma Kawahara (M2), Yuta Uchijo (M2), Naoya Anada (M2), Yuki Nakayama (M1), Taisei Iida (M1) Bachelor's Students: Riru Oda (B4), Riku Ito (B4), Haruto Ishiyama (B4), Rei Tomori (B3), Rio Onoda (B3) Visiting Scholar: Nariyoshi Chida

Johannes HölzlView profile

Researcher

• Formal Verification
• Probabilistic Programming
• Markov Chains
• +7 more

Johannes Hölzl is a Post-doctoral Researcher in the Faculty of Science , specifically within the Department of Computer Science at Vrije Universiteit Amsterdam . He works in the Section of Theoretical Computer Science , focusing on formal verification and probabilistic systems. His research integrates higher-order logic with programming languages to model and verify complex computational processes. Position: Post-doctoral Researcher Institution: Vrije Universiteit Amsterdam Department: Computer Science Section: Theoretical Computer Science Hölzl's research spans formal verification, probabilistic programming, and concurrency. He has contributed extensively to the Isabelle/HOL proof assistant, formalizing mathematical structures like measure theory, Markov chains, and timed automata. His work bridges theoretical analysis with practical verification tools, ensuring rigorous proofs in automated reasoning. His publications highlight advancements in probabilistic systems, including formalizing Markov decision processes (2017), verifying compilers for probability density functions (2015), and analyzing expected running times of probabilistic programs (2016). The 2025 article on probabilistic timed automata indicates ongoing exploration of concurrent probabilistic models. Hölzl has no explicitly listed scientific awards in the provided texts. His collaborations with researchers like Tobias Nipkow and Andrei Popescu underscore interdisciplinary efforts in formal methods and security verification. He contributes to the Theoretical Computer Science Section at VU Amsterdam, advancing foundational research in logic-based programming and probabilistic modeling.

Eva Marlene HausteinerView profile

Professor

• Political Theory
• History of Ideas
• Federalism
• +4 more

Eva Marlene Hausteiner is Professor of Political Theory and History of Ideas at Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), serving as Chair Holder and Institute Spokesperson for the Institute of Political Science since 2024. She has held this professorship since October 2022, following substitute professorships at the Universities of Passau (2022) and Greifswald (2021/2022). Her educational background includes a habilitation in Political Science from the University of Bonn (2021), a PhD with distinction (summa cum laude) on British imperialism (2013), and a Magister Artium in Political Science, Russian Studies, and Economics from Humboldt University Berlin, University of Potsdam, and La Sapienza University of Rome. Her international experience includes fellowships at Harvard University (John F. Kennedy Memorial Fellow), Princeton University, Columbia University, and NYU. Professor Hausteiner's research focuses on International Political Theory, Federalism, Democracy Theory, Empires and Imperialism, and Political Iconography . Her recent work increasingly addresses contemporary issues like conspiracy theories in digital democracies and dystopian political futures. She has developed a distinctive approach examining federal systems through historical imperial frameworks, while her recent publications reveal growing engagement with current democratic challenges including digital misinformation and political polarization. Her scholarly output demonstrates consistent quality with numerous peer-reviewed articles in journals like Contemporary Political Theory , Journal of International Political Theory , and Politische Vierteljahresschrift . Her monograph Greater than Rome: Neubestimmungen britischer Imperialität, 1870-1914 (2015) established her expertise in imperial political thought, while her habilitation Challenging federalism. Centralism, expansion, and expulsion in federal political thought (2020) extended this to contemporary federal systems. John F. Kennedy Memorial Fellow at Harvard University Center for European Studies Editor for Political Theory and History of Ideas at Politische Vierteljahresschrift Board member of the section 'Political Theory and History of Ideas' of the German Association for Political Science (2010-2022) Professor Hausteiner has demonstrated significant leadership through her role as Institute Spokesperson and her editorial work. Her research has evolved from historical imperial studies to increasingly address contemporary democratic challenges, particularly regarding digital misinformation and political polarization. She has also contributed to public discourse through media appearances in Süddeutsche Zeitung , ZEIT , and Deutschlandfunk Kultur. Her recent work on conspiracy theories during the pandemic demonstrates her ability to connect theoretical frameworks with urgent contemporary issues.