Find Academic Supervisors

Xiaokang QiuView profile

Associate Professor

• Programming Languages
• Software Engineering
• Program Verification
• +6 more

Xiaokang Qiu is an Associate Professor at the Elmore Family School of Electrical and Computer Engineering , Purdue University , with a Ph.D. in Computer Science from University of Illinois at Urbana-Champaign (2013). His research focuses on Programming Languages and Software Engineering , particularly theories, algorithms, and tools for program synthesis, verification, and logic-based analysis. Research Interests His work addresses: Formal methods for heap-manipulating programs using separation logic Automated deduction and decision procedures for data structures Syntax-guided synthesis of concurrent and bit-vector programs Integration of machine learning with formal verification Scalable verification of hardware memory consistency Network protocol optimization through program synthesis Recent Publications Recent work includes PLDI 2025 on concurrent string synthesis, POPL 2024 on bit-vector synthesis, and POPL 2023 on comparative network design. His tools like STRAND and VCDryad enable automated verification of complex data-structure manipulations. Grants & Awards Recipient of: NSF SHF Small Award (2024, co-PI, $593K) NSF FMitF Award (2023, PI, $750K) Tenure at Purdue (2023) Professional Service Active in program committees for PLDI , POPL , CAV , and ATVA conferences. Developed tools like DryadSynth (PLDI 2020), ImpSynt (OOPSLA 2017), and JSketch (ESEC/FSE 2015).

Sophia KnightView profile

Associate Professor

• Epistemic Logic
• Concurrency Theory
• Multi-agent Systems
• +7 more

Sophia Knight serves as Associate Professor in the Department of Computer Science at the Swenson College of Science and Engineering, University of Minnesota Duluth. Her academic credentials include: PhD (2013) from École Polytechnique (LIX) under Frank Valencia and Catuscia Palamidessi in the COMETE team, dissertation analyzing information flow between agents using game semantics, modal logic, and process calculus Master's degree (2009) from McGill University's School of Computer Science supervised by Prakash Panangaden in the Reasoning and Learning Laboratory, thesis on game semantics for process algebra modeling anonymity protocols Dr. Knight's research examines knowledge dynamics and communication in multi-agent systems through epistemic logic and concurrency theory frameworks. Her work addresses security challenges in social networks and personal data systems using: Asynchronous communication effects on knowledge modeling Epistemic strategy logic for agent uncertainty Constraint programming for distributed knowledge reasoning Topological semantics for dynamic epistemic logics (with Aybüke Özgün) Prior appointments include: Postdoctoral researcher (2016-2018) at Uppsala University's Concurrency group Postdoctoral researcher (2013-2016) at LORIA, Université de Lorraine in Hans van Ditmarsch's CELLO team

• Theoretical Chemistry
• Quantum Chemistry
• Computational Chemistry
• +6 more

Yoshifumi Nishimura is an Assistant Professor at Waseda University’s Research Institute for Science and Engineering and concurrently serves in Tokyo University of Science’s Faculty of Science, Division of Applied Chemistry. He completed both his bachelor’s (2008) and doctoral degrees (2013) in chemistry at Nagoya University, followed by post-doctoral research at National Chiao Tung University, Taiwan, and a project-researcher position at the Institute for Molecular Science. Education: Doctor of Science, Nagoya University, 2013 Bachelor of Science, Nagoya University, 2008 Research Interests: Nishimura develops linear-scaling quantum chemical methodologies, especially the divide-and-conquer density-functional tight-binding (DC-DFTB) approach, enabling million-atom simulations on supercomputers. His work spans proton-transfer dynamics in water, ice and proteins, CO₂ absorption chemistry, battery electrolytes, photochemical events in retinal proteins, and growth mechanisms of carbon nanotubes and graphene nanoribbons. Awards: CSJ Presentation Award, Chemical Society of Japan, 2017 President’s Award, Nagoya University, 2008 Software & Leadership: He is the lead developer of the open-source DCDFTBMD package, which has been optimised for the K-computer and Fugaku, and he serves on the editorial committee of the 分子シミュレーション学会 journal “アンサンブル” and on organising committees of domestic theoretical-chemistry conferences.

Piotr HofmanView profile

Assistant Professor

• Theoretical Computer Science
• Automata Theory
• Formal Verification
• +3 more

Piotr Hofman is an Assistant Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics , University of Warsaw. His research focuses on theoretical computer science, particularly automata theory, formal verification, and computational complexity related to systems with infinite alphabets and data constraints. PhD in Computer Science (2014) from the University of Warsaw under Sławomir Lasota. Postdoc (2013-2014) at University of Bayreuth with Wim Martens. Postdoc (2014-2016) at LSV de Cachan with Stefan Göller. His work explores algorithmic problems in automata over infinite alphabets, including one-counter nets, Petri nets with data, and unambiguous vector addition systems (VASS). Key contributions include decidability results for bisimulation and simulation problems, complexity bounds for equivalence checking, and novel techniques for reachability and coverability analysis. Recent publications address orbit-finite linear equations, Parikh's theorem for infinite alphabets, and lower bounds for coverability in pushdown VAS. He has received grants like NCN UMO-2016/21/D/ST6/01368 for algebraic invariants in data nets. He supervises research projects and collaborates with institutions in Poland, France, and India. His teaching includes concurrency theory and software engineering courses.

• Modular development of specification languages
• Algorithms for models of computation
• Coalgebra
• +4 more

Alexandra Silva is a Professor of Computer Science at Cornell University with prior affiliations as a Royal Society Wolfson Fellow and Professor of Algebra, Semantics, and Computation at University College London . She leads a research group focusing on the modular development of specification languages and algorithms for models of computation, emphasizing coalgebra as a unifying mathematical framework. Research Interests Her work spans foundational and applied areas in theoretical computer science, including: Coalgebraic methods for formal verification Automata theory and learning algorithms Probabilistic programming and semantics Programming language design (e.g., NetKAT, Kleene Algebra with Tests) Concurrency theory and distributed systems Algebraic structures in computation Recent publications address network verification (StacKAT), symbolic automata learning, probabilistic regular expressions, and outcome logic for correctness/incorrectness reasoning. She is actively involved in organizing academic events like OPLSS 2025 and co-authoring foundational works in Formal Aspects of Computing and Theoretical Computer Science . Scientific Awards Distinguished Paper Award (ACM SIGPLAN POPL, 2020) Best Paper Award (RTA, 2015) She teaches courses on Kleene Algebra with Tests (KAT) and verification at summer schools like Marktoberdorf 2025 , and her research includes collaborations on probabilistic network verification (ProbNV) and stochastic system modeling.

Adam ChlipalaView profile

Professor

• Programming Languages
• Formal Methods
• Computer Systems
• +5 more

Adam Chlipala is a Professor at the Massachusetts Institute of Technology working at the intersection of programming languages, formal methods, and computer systems. His research focuses on building practical verified systems with end-to-end machine-checked proofs, particularly using the Coq proof assistant. His educational background includes a Computer Science undergraduate degree from Carnegie Mellon University (2003) and a PhD in Computer Science from the University of California, Berkeley (2007). Following a postdoctoral position at Harvard University through 2011, he joined MIT as faculty. Chlipala's research spans multiple domains with strong emphasis on dependent types , verified compilation , and hardware-software co-verification . His work consistently bridges theoretical foundations with practical implementation, as evidenced by his development of the Ur/Web programming language and his focus on creating clean-slate hardware-software stacks with formal guarantees. Key research thrusts include cryptographic constant-time verification, side-channel security, and verified tensor compilation. His recent publications (2020-2025) reveal a clear trajectory toward increasingly complex verified systems, with growing emphasis on hardware-software integration, cryptographic implementations, and performance-critical applications. The work consistently leverages Coq for machine-checked proofs while addressing real-world constraints like timing channels and hardware interfaces. Chlipala is the author of the influential textbook Certified Programming with Dependent Types , which serves as a primary educational resource for Coq at numerous institutions worldwide. His professional activities include significant service to the PL community through program committees for major conferences including PLDI, POPL, ICFP, and CPP. He leads research initiatives connecting hardware and software verification, most notably through the DeepSpec project which aims to build fully verified computing stacks. His current work focuses on practical applications of dependent types for business applications through Ur/Web and verified cryptographic implementations.

Nate FosterView profile

Professor

• Programming Languages
• Networking
• Software-Defined Networking
• +5 more

Nate Foster is a Professor of Computer Science at Cornell University's Bowers Computing and Information Science college. He also serves as a Visiting Professor at EPFL's Data Center Systems Laboratory during the 2023-24 academic year and as a Visiting Researcher at Jane Street. His research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems, with particular emphasis on software-defined networking. Dr. Foster's educational background includes: PhD in Computer Science from the University of Pennsylvania MPhil in History and Philosophy of Science from Cambridge University BA in Computer Science from Williams College Nate Foster's research spans multiple areas within programming languages and systems. His current work focuses on the design and implementation of languages for programming software-defined networks. He has also made significant contributions to bidirectional languages (also known as "lenses"), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His interdisciplinary approach combines theoretical foundations with practical systems building, seeking to bridge the gap between formal methods and real-world network programming. An analysis of Foster's recent publications reveals a strong focus on network programming languages, particularly NetKAT and P4. His work consistently applies formal methods to networking problems, with increasing emphasis on verification, equivalence checking, and symbolic execution techniques. The research trajectory shows progression from foundational language design to practical verification tools, demonstrating how theoretical programming language concepts can solve real-world networking challenges. Dr. Foster has received numerous prestigious awards for his contributions: Sloan Research Fellowship NSF CAREER Award ACM SIGPLAN Robin Milner Young Researcher Award (2023) Most Influential POPL Paper Award Tien '72 Teaching Award Google Research Award Yahoo! Academic Career Enhancement Award Cornell Engineering Research Excellence Award Morris and Dorothy Rubinoff Award ACM SIGCOMM Rising Star Award As an active member of the programming languages community, Foster has advised numerous graduate students and secured significant research funding through his NSF CAREER award and Google Research Award. He has served in leadership roles for major conferences including PLDI, POPL, and ICFP, demonstrating his commitment to mentoring the next generation of researchers through programs like PLMW@PLDI. His collaborative approach is evident in his extensive co-authorship network across academia and industry. Foster leads research in the area of programming languages for networking, with particular focus on the NetKAT framework for network verification. His work bridges the gap between formal methods and practical networking systems, creating tools that have influenced both academic research and industry practice in software-defined networking. His collaborations with institutions like EPFL and industry partners like Jane Street demonstrate the real-world impact of his research agenda.

Ori LahavView profile

Professor

• Programming Languages
• Verification
• Concurrency
• +4 more

Ori Lahav is a faculty member in the School of Computer Science at Tel Aviv University. He holds a PhD from Tel Aviv University (supervised by Arnon Avron), completed postdoctoral research at Tel Aviv University (hosted by Mooly Sagiv) and MPI-SWS in Germany (hosted by Viktor Vafeiadis and Derek Dreyer). His research is supported by an ERC Starting Grant and ISF Grant. His research focuses on programming languages, verification, concurrency, and relaxed memory models, with additional interests in proof theory, semantics of non-classical logics, and automated reasoning. His work bridges theoretical foundations with practical applications in compiler design, hardware verification, and distributed systems. Lahav's publications consistently explore concurrency paradigms, weak memory models, and verification techniques. Recent works emphasize formal methods for RDMA, persistent memory, compositional semantics, and automated tooling for memory consistency. Awards: Best Paper & Best Student Paper Awards (DISC 2024) Distinguished Paper Award (OOPSLA 2021) Best Paper Award (TABLEAUX 2017) Distinguished Paper Award (PLDI 2017) Best Paper Award (ECOOP 2017) Kleene Award for Best Student Paper (LICS 2013) He advises PhD and MSc students including Yoav Ben Shimon, Yotam Dvir, and Roy Margalit. His group investigates shared-memory concurrency, denotational semantics, and verification tools. Lahav co-organizes conferences (VMCAI 2024) and Dagstuhl seminars (2023, 2026). He teaches courses on Programming Language Foundations, Discrete Mathematics, and Weak Memory Concurrency.

Sam LindleyView profile

Associate Professor

• Programming Languages
• Type Systems
• Effect Handlers
• +5 more

Sam Lindley is a Reader in Programming Language Design and Implementation at the Laboratory for Foundations of Computer Science within the School of Informatics at The University of Edinburgh. He holds a prestigious UKRI Future Leaders Fellowship focused on Effect Handler Oriented Programming. His academic career spans multiple institutions including Heriot-Watt University and Imperial College London. His research interests center on programming language theory and implementation, with specific expertise in type systems, effect handlers, session types, and functional programming. Lindley's work bridges theoretical foundations with practical implementation, particularly in compiler design and language semantics. His research has significant implications for language safety, efficiency, and expressiveness. Lindley's publication record demonstrates consistent contributions to top programming languages venues including PLDI, POPL, ICFP, and OOPSLA. His recent work explores modal effect types, scoped effects, and the application of effect handlers to systems programming and WebAssembly. The trend shows increasing focus on practical applications of theoretical concepts in real-world language implementations. Major Awards: UKRI Future Leaders Fellowship in Effect Handler Oriented Programming Lindley has served in significant leadership roles including ICFP 2023 Program Chair and PLDI 2025 Area Chair. He actively participates in the programming languages community through numerous program committees and workshop organization. His research is conducted within the Laboratory for Foundations of Computer Science, a leading center for theoretical computer science research at Edinburgh.

Kunle OlukotunView profile

Professor

• Computer Architecture
• Parallel Programming
• Chip Multiprocessors
• +4 more

Kunle Olukotun is a Professor of Electrical Engineering and Computer Science at Stanford University's School of Engineering, where he has been faculty since 1991. He directs the Stanford Pervasive Parallelism Lab (PPL) and co-leads the Transactional Coherence and Consistency (TCC) project. His research focuses on computer architecture, parallel programming environments, and scalable parallel systems. Key areas include chip multiprocessors (CMPs), transactional memory systems, domain-specific languages (DSLs) for heterogeneous computing, and hardware-software co-design for machine learning workloads. His work bridges theoretical foundations with practical systems implementation. Notable contributions include the Stanford Hydra research project (one of the first chip multiprocessors with thread-level speculation), founding Afara Websystems (acquired by Sun Microsystems), and developing the Niagara processor architecture. His DSL frameworks like Green-Marl and Spatial enable efficient graph analysis and hardware acceleration. His publications reveal strong trends in parallel systems evolution: from foundational CMP research (2000s) to transactional memory (2004-2010), then DSLs for heterogeneous computing (2010-2015), and currently foundation model systems (2023-2025). Subfield analysis shows consistent focus on hardware-software co-design, sparse computation, and compiler techniques across decades. ACM Fellow (2006) for contributions to multiprocessors on a chip and multi-threaded processor design Best Paper Award at IEEE International Symposium on Workload Characteristics (IISWC '10) for EigenBench Olukotun actively mentors researchers through the Stanford Pervasive Parallelism Lab (PPL), which seeks to proliferate parallelism across application domains. His projects have secured significant industry partnerships, including the acquisition of his startup Afara Websystems by Sun Microsystems. Current research focuses on compiler frameworks for foundation model systems and hardware acceleration for sparse machine learning workloads, supported by collaborations with major tech companies. He leads the Stanford Pervasive Parallelism Lab (PPL), which develops compiler and runtime systems for heterogeneous architectures. The lab's work spans DSLs, hardware acceleration, and parallel programming models, with strong industry ties to companies like NVIDIA and Google. Current initiatives include the Mosaic compiler framework and Stardust architecture for sparse tensor computation.

• Concurrency Theory
• Process Algebra
• Trustworthy Systems
• +7 more

Alessandro Aldini is an Associate Professor in the Section of Informatics and Mathematics within the Department of Pure and Applied Sciences (DiSPeA) at the University of Urbino Carlo Bo. His academic work focuses on theoretical computer science with applications to security and verification of complex systems. His research interests span several key areas: Design and verification of concurrent and distributed computer, network, and software systems Trust models and trustworthy systems Concurrency theory and (nondeterministic, probabilistic, and Markovian) process algebra Exact and approximate behavioral equivalences and equivalence checking Exact and approximate noninterference approach to information flow analysis Modal logics and model checking Security, dependability, and performability analysis Professor Aldini serves as the UNIURB research unit leader for the PRIN project AsCoT-SCE (Assessing Compliance of IoT API for Security Critical Environments) and participates in other significant research initiatives including DeKLA (Developing Kleene Logics and their Applications) and NiRvAna (Noninterference and Reversibility Analysis in Private Blockchains). He is actively involved in the academic community through the Italian Chapter of the EATCS and IFIP WG 11.14 Secure Engineering. His teaching responsibilities include Programming Languages and Software Verification and Cybersecurity courses across multiple Informatics degree programs. Professor Aldini has supervised numerous PhD students and postdoctoral researchers. His academic contributions include the book "A Process Algebraic Approach to Software Architecture Design" and his PhD thesis "Security and Performance Analyses in Distributed Systems."

Sjouke MauwView profile

Professor

• Information Security
• Formal Methods
• Privacy
• +8 more

Sjouke Mauw is a full professor in "Security and Trust of Software Systems" at the University of Luxembourg , leading the Department of Computer Science and the SaToSS research group. His work bridges formal methods with real-world security and trust challenges. Current affiliation: University of Luxembourg (Faculty of Science, Technology and Communication) Previous roles: Associate Professor at Eindhoven University of Technology, Senior Researcher at CWI Research Focus Security protocols and their formal verification Attack trees and defense trees for structured threat analysis Privacy in voting systems and digital exchange Trust management frameworks and risk assessment RFID and e-voting security Cyber-physical socio-technical systems Recent Article Trends (2023-2025) include applications of deep learning to privacy risks, formal verification of distance-bounding protocols, and anomaly detection in resource-constrained environments like cubesats. These works span machine learning, cryptography, and aerospace engineering. Academic Contributions include over 50 refereed publications, supervision of 15+ PhD students, and leadership in European research projects (e.g., Meteor, Concur). He has developed formal methods for security protocols, attack-defense trees, and GNSS signal integrity frameworks.

• Programming Language Semantics
• Computational Effects and Coeffects
• Relational Reasoning
• +3 more

Francesco Gavazzo is an Assistant Professor at the Department of Mathematics, University of Padua. His research focuses on theoretical computer science, particularly in programming language semantics, computational effects, relational reasoning, and inductive/coinductive methods. PhD in Computer Science and Engineering, with Honor Mention MSc in Logic and Computer Science BA in Philosophy His work bridges formal methods with practical applications in program equivalence, quantitative semantics, and effect systems. Recent contributions include frameworks for effectful program distancing and relational theories of effects. Scientific awards include recognition by the Accademia delle Scienze dell'Istituto di Bologna (Top 10 in Science) and the Best Italian PhD Thesis in Theoretical Computer Science (EATCS Italian Chapter). He serves on program committees for POPL and ICFP.

Guilhem JaberView profile

Associate Professor

• Programming Languages
• Type Theory
• Game Semantics
• +7 more

Guilhem Jaber is an Associate Professor at University of Nantes , affiliated with the Gallinette team in the LS2N research laboratory . His work focuses on operational game semantics, contextual equivalence, and formal verification of higher-order programs with computational effects. Research Grants RECIPROG (2021-2025): ANR PRC Project, local coordinator CAVOC (2021-2025): Inria-Nomadic Labs agreement, project investigator CANofGAS (2022-2025): Inria Exploratory Action, co-investigator Scientific Awards Distinguished Paper Award at ICFP'21 Supervision Axel Kerinec: Postdoc on CANofGAS project Hamza Jaafar: PhD on CAVOC project Peio Borthelle: PhD co-advised with Beniamino Accattoli His research bridges game semantics with operational techniques, particularly for algebraic effects, parametric polymorphism, and separation logic. He actively participates in program committees for POPL, GALOP, and HOPE workshops.

Hiroshi UnnoView profile

Professor

• Programming Languages
• Software Verification
• Artificial Intelligence
• +3 more

Hiroshi Unno is a Professor at Tohoku University 's Research Institute of Electrical Communication and a Visiting Professor at the National Institute of Informatics. He has served on program committees for major conferences like POPL , PLDI , ICFP , and CAV . Dr. Unno's research focuses on Programming Languages Software Verification Artificial Intelligence Higher-Order Model Checking Refinement Type Systems Temporal Logic His recent work (2023-2025) includes advancements in algebraic effects , probabilistic program verification , and prophecy-based type systems . Key contributions appear in POPL , PLDI , and ICFP journals. Scientific awards include Distinguished Paper Award at POPL 2024 Distinguished Paper Award at POPL 2023 PPL 2014 Best Paper Award He leads development of tools like RCaml , Thrust , and EffCaml for refinement type checking. Current projects involve Kakenhi grants 20H04162 and 25H00446 . Dr. Unno actively contributes to academic communities through Program Committee roles at AAAI, CAV, and SAS Editorial work for IPSJ Transactions Organizing PPL Summer School (2022)