Find Academic Supervisors

Pavel PanchekhaView profile

Assistant Professor

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

Pavel Panchekha is an Assistant Professor in the School of Computing at the University of Utah, where he holds the Warnock Chair for Junior Faculty. His research spans programming languages, web browsers, and numerical analysis, with a focus on developing programming language techniques to address challenges across computer science. Dr. Panchekha received his educational training at prestigious institutions: PhD in Computer Science from the Paul G. Allen School for Computer Science and Engineering at the University of Washington, advised by Michael D. Ernst and Zachary Tatlock BS in Mathematics from MIT Panchekha's research program has two major thrusts. First, he works on web browser internals , with projects including fuzzing layout invalidation, multi-tenant garbage collection, and optimizing 2D graphics. He is also authoring a textbook on web browsers that informs much of this research. Second, he focuses on automatic numerical analysis , with projects such as automatic accuracy improvement, synthesis via term rewriting, scalable static accuracy analysis, and math library implementation. He leads the FPBench and Herbie projects, which are major deployments of his research. His scholarly output demonstrates consistent contributions across programming languages, verification, and numerical methods. Recent work shows a growing emphasis on bidirectional typing systems, layout invalidation in browsers, and robust floating-point error analysis. His publications reveal a trajectory from foundational work on floating-point accuracy (notably the Herbie tool that won a Distinguished Paper Award at PLDI 2015) toward more comprehensive systems for program synthesis, verification, and browser optimization. Panchekha has received significant recognition for his research contributions: NSF Fellowship ARCS Foundation Fellowship Adobe Research Fellowship Wissner-Slivka Foundation Fellowship 2015 PLDI Distinguished Paper Award for work on the Herbie numerical analysis and repair tool As an advisor, Panchekha mentors a substantial group of students across multiple levels. He currently advises six students: Marisa Kirisame (PhD), Bhargav Kulkarni (PhD), Yumeng He (PhD), Artem Yadrov (MS), Jesus Ponce (BS), and Jonas Regehr (BS). Previously, he has advised over twenty students including PhD candidates like Ian Briggs and numerous MS and BS students. His advising spans theoretical topics in programming languages and practical applications in web browsers and numerical computing. Panchekha leads research groups focused on programming languages applications to web browsers and numerical analysis. His work on the Herbie tool for floating-point accuracy improvement has become influential in the programming languages community, and his more recent work on browser internals is shaping how researchers understand and optimize modern web rendering engines. He is currently developing a textbook on web browsers that aims to synthesize knowledge about browser architecture and implementation.

• Database Systems
• Distributed Systems
• Machine Learning Systems
• +3 more

Tim Kraska is an Associate Professor in the Department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT), affiliated with the Computer Science and Artificial Intelligence Laboratory (CSAIL) within the School of Engineering. His research spans foundational areas in modern data systems: Database Systems Distributed Systems Machine Learning Systems Learned Indexes Cloud Databases Dr. Kraska pioneers the integration of machine learning into core database components, developing "learned systems" that replace traditional algorithms with ML models for significant performance gains. His work on learned indexes redefined indexing paradigms, while recent research extends this approach to garbage collection, query optimization, and concurrency control. His publication trends reveal a strategic shift toward applying ML to low-level systems problems, particularly in memory management and runtime optimization as demonstrated by his PLDI 2020 paper on Learned Garbage Collection. Award highlights include: ACM SIGMOD Jim Gray Doctoral Dissertation Award VLDB Early Career Research Contribution Award Marie Curie Fellowship At MIT, he leads a research group focused on next-generation data systems, securing grants from NSF and industry partners to explore the theoretical and practical boundaries of learned components in database engines. His team collaborates extensively with industry research labs on real-world deployment challenges. As a core member of CSAIL's distributed systems group, he contributes to MIT's leadership in reimagining data infrastructure for the AI era through cross-lab initiatives on scalable machine learning systems.

Nikolaos PapaspyrouView profile

Professor

• Programming Languages
• Software Engineering
• Formal Verification
• +4 more

Nikolaos Papaspyrou is a Professor at the School of Electrical and Computer Engineering of the National Technical University of Athens (NTUA) and a member of the Software Engineering Laboratory . His research focuses on the theory and implementation of programming languages, including semantics, type systems, compilers, static analysis, and formal verification. Since October 2021, he has been on leave from NTUA, working as a Software Engineer for Google in the memory management team for the V8 JavaScript and WebAssembly engine. He previously served as Director of the Division of Computer Science (2017-2019) and was on sabbatical with Google's compiler group in Munich (2015-2016). His work includes the RELEASE project (EU FP7 STREP) for reliable large-scale server software and uncertainty handling in distributed databases (European Social Fund). Ph.D. and Diploma in Electrical and Computer Engineering from NTUA M.Sc. in Computer Science from Cornell University His research interests span programming languages , software engineering , and formal verification , with recent publications on coinductive proofs in Liquid Haskell, concurrency semantics, and quantum compilation. He has supervised over 50 diploma projects and mentored numerous students now at institutions like MIT, Princeton, and UC Berkeley. Awards include conference organizing and program committee roles, though no formal scientific prizes are listed.

Michael D. BondView profile

Professor

• Programming Languages
• Systems
• Security
• +6 more

Michael D. Bond is a Professor in the Department of Computer Science & Engineering at Ohio State University's College of Engineering. He leads the Programming Languages and Software Systems (PLaSS) Research Group, which focuses on designing program analyses and software and hardware systems that enhance computing reliability, scalability, and security. His academic service includes general chair for PLDI 2027, program committee membership for multiple top conferences, and committee roles in SIGPLAN Research Highlights (2024-2027). Professor Bond's research spans programming languages, systems, and security, with particular expertise in memory management, concurrency, hardware transactional memory, information flow control, and predictive race detection. His work bridges theoretical foundations with practical implementations, as evidenced by numerous open-source projects accompanying his publications. The PLaSS group has made significant contributions to understanding and improving memory models, developing efficient garbage collection techniques for modern architectures, and creating novel approaches to secure programming in languages like Rust. Analysis of his recent publications reveals a clear trajectory toward addressing security and reliability challenges in modern computing systems, particularly through language-based approaches. His work increasingly focuses on Rust programming language security mechanisms, memory disaggregation for datacenters, and advanced techniques for detecting and preventing concurrency bugs. The research demonstrates strong continuity in exploring memory models and concurrency while adapting to emerging hardware trends and security challenges. Outstanding Teaching Award, Department of Computer Science and Engineering, Ohio State University (2018) Lumley Research Award, College of Engineering, Ohio State University (2016) OOPSLA 2015 Distinguished Paper and Artifact Awards NSF CAREER Award ACM SIGPLAN Outstanding Doctoral Dissertation Award Intel PhD Fellowship Professor Bond actively mentors several PhD students including Chujun Geng, Vincent Beardsley, Chris Xiong, Victor Chen, and Noah Charlton, with external co-advisee Zixian Cai at Australian National University. His research is currently supported by multiple NSF grants including SaTC-2348754 (2024-2027), CyberCorps-2336531 (2024-2029), and CSR-2106117 (2021-2025), reflecting sustained funding for his work in information flow control, security, and systems research. The PLaSS Research Group maintains a strong presence in both academic and industrial communities, with graduated PhD students securing positions at major technology companies like Google, Amazon Web Services, and Huawei, as well as academic positions at institutions like UIUC and IIT Kanpur. The group's work combines theoretical rigor with practical implementation, consistently producing open-source artifacts that enable reproducibility and further research in the systems and programming languages community.

Steve BlackburnView profile

Professor

• Memory Management
• Garbage Collection
• Virtual Machine Design and Implementation
• +7 more

Steve Blackburn is a research scientist at Google DeepMind and professor of computer science at the Australian National University in the College of Engineering and Computer Science. His primary research focus is on programming language implementation, with expertise spanning memory management, virtual machines, and performance analysis. He has served in significant leadership roles including Associate Dean for Diversity and Inclusion (2016-2019) and as Program Chair for PLDI 2015 and General Chair for PLDI 2023. Blackburn's research interests center on making software run faster and more power-efficiently on modern hardware. His primary areas include microarchitectural support for managed languages, fast and efficient garbage collection, and the design and implementation of virtual machines. He maintains a strong interest in sound methodology and infrastructure for successful research innovation. His work bridges theoretical computer science with practical systems implementation, with particular focus on memory management frameworks and performance benchmarking. His publication record reveals a consistent focus on memory management systems, with recent work exploring garbage collection in modern contexts including CRuby, Julia, mobile devices, and memory-disaggregated datacenters. His research shows an evolution from foundational garbage collection algorithms toward practical implementations addressing real-world constraints in contemporary programming languages and hardware platforms. A notable trend is his increasing focus on quantifying and understanding the true costs of garbage collection in production environments. Fellow of the ACM Blackburn has supervised numerous doctoral students including Zhen He, John Zigman, Robin Garner, Ting Cao, and currently advises Wenyu Zhao, Zixian Cai, and others. He has also served on multiple program committees for major conferences including PLDI, ASPLOS, ISMM, and OOPSLA, demonstrating his significant contributions to the programming languages and systems research community. His service includes editorial roles for ACM Transactions on Programming Language Applications and Systems from 2017-2020. He leads two major research infrastructure projects: the MMTk memory management framework and the DaCapo benchmark suite, both of which have become foundational tools for researchers in programming languages and systems. These projects reflect his commitment to shared research infrastructure and reproducible methodology in systems research.

• Programming Languages
• Semantics
• Type Systems
• +5 more

Nikolaos S. Papaspyrou is a Professor at the School of Electrical and Computer Engineering of the National Technical University of Athens (NTUA), affiliated with the Software Engineering Laboratory and the Division of Computer Science. His research focuses on programming languages, compilers, formal verification, and concurrency. Since October 2021, he has been on leave from NTUA while working as a Software Engineer at Google's V8 JavaScript and WebAssembly engine team. Previously, he served as Director of the Division of Computer Science (2017–2019) and held a sabbatical at Google's Munich compiler group (2015–2016). His academic contributions include pioneering work on Erlang/OTP scalability, concolic testing for functional languages, and static analysis techniques. He has authored numerous publications in top venues like ACM Transactions on Programming Languages and Systems and IEEE conferences. Papaspyrou has supervised over 50 diploma students and multiple PhD candidates, contributing to the education of future researchers and engineers. He actively participates in programming competitions, coaching Greek Olympiad teams, and volunteers in the Hellenic Informatics Society. He teaches advanced courses on programming languages, compilers, and software engineering at NTUA, emphasizing practical applications of theoretical concepts. His educational philosophy integrates problem-solving through programming, as highlighted in his FedCSIS 2013 paper on teaching methodologies.

Diego GarbervetskyView profile

Associate Professor

• Static Analysis
• Dynamic Analysis
• Reverse Engineering
• +7 more

Diego Garbervetsky is an Associate Professor at the Computer Science Department, School of Sciences, University of Buenos Aires, and a Researcher at ICC/CONICET. He also serves as Director of the Institute of Research in Computer Sciences (ICC). His academic career spans software engineering, programming languages, and formal methods with a focus on program analysis and verification. His research interests include: Static and dynamic program analysis Reverse engineering and compiler optimizations Program understanding and validation Testing and verification of programs featuring rich protocols Automatic symbolic resource analysis (gas consumption, dynamic memory, energy, etc.) Garbervetsky's recent work focuses on smart contract analysis and verification, particularly for Solidity on Ethereum blockchain. His research bridges theoretical program analysis with practical applications in security-critical domains. He has developed several tools including Contractor for behavior validation, JConsume2 for heap memory analysis, and BudaPest for automated software verification. His scientific contributions have been presented at top-tier conferences including ICSE, FSE, ISSTA, and PLDI. Garbervetsky has served on numerous program committees for major software engineering conferences and has advised multiple PhD and undergraduate students through their research.

Panagiota FatourouView profile

Professor

• Parallel and Distributed Computing
• Concurrent Data Structures
• Transactional Memory
• +8 more

Dr. Panagiota Fatourou is a Professor in the Department of Computer Science at the University of Crete and a senior researcher at the Institute of Computer Science (ICS), Foundation for Research and Technology - Hellas (FORTH). She holds a dual affiliation, contributing significantly to both institutions. She has previously served as faculty at the University of Ioannina and held postdoctoral positions at the Max-Planck-Institut für Informatik and the University of Toronto. She has also been a visiting professor at École Polytechnique Fédérale de Lausanne (EPFL). Her research spans the theoretical and practical foundations of parallel and distributed computing. She is a leading expert in concurrent data structures, transactional memory, and the use of persistent memory in system design. Her work integrates theoretical rigor with practical implementation, often publishing in top-tier venues like PPoPP, PODC, SPAA, and PVLDB. Recent publications highlight her focus on efficient garbage collection for multiversioning, persistent data structures, and distributed data series similarity search, reflecting a trend towards high-performance, fault-tolerant systems for modern hardware. Best Paper Award, PPoPP 2022 Marie-Curie Individual Fellowship FSMP Distinguished Professor Fellowship ACM Distinguished Speaker Featured ACM Member Dr. Fatourou has a strong record of leadership and mentorship. She has advised numerous MSc and PhD students and is actively recruiting for her PERSIST project, funded by HFRI. She has led major research initiatives, including the EU-funded TransForm network and the GreenVM project. Her leadership extends to the broader community, where she has served as Past Chair of the ACM Europe Council, Chair of the Greek ACM-W Chapter, and on the steering committees of PODC and OPODIS. She has also co-organized key events on gender equality in computing, such as the Summits on Gender Equality in Computing (GEC) and the WISTEM Summer School. She is deeply involved in the academic service, frequently serving on program committees for premier conferences such as SPAA, NETYS, and SRDS. Her laboratory and research team at FORTH ICS and the University of Crete focus on building the theoretical underpinnings and practical implementations of next-generation concurrent and distributed systems.

Delphine DemangeView profile

Associate Professor

• Programming Languages
• Compiler Verification
• Formal Semantics
• +3 more

Delphine Demange is an Associate Professor in Computer Science at University of Rennes, working in the Epicure research group (formerly Celtique) at IRISA (UMR 6074 / Inria). Her research focuses on formal methods for programming languages and compilers, with particular emphasis on compiler verification, program semantics, and language-based security. Her research interests include formal semantics of programming languages, program transformations, compiler verification, static analysis, computer-aided verification, and language-based security. She has made significant contributions to the formal verification of compiler intermediate representations, particularly static single assignment (SSA) form, and has worked extensively on verified compilation techniques. Her publication record shows a consistent focus on formal verification of programming language constructs and compiler components. Recent work (2023-2025) centers on dataflow circuits and solvers, while earlier work (2015-2020) focused on SSA-based optimizations, garbage collection verification, and information-flow security architectures. Her research demonstrates a strong commitment to applying formal methods to practical compiler and language implementation problems. Her scientific awards include the EAPLS Best PhD Dissertation Award in 2012 and the Gilles Kahn PhD Thesis Award in 2013 for her thesis Semantic Foundations of Intermediate Program Representations . She serves on numerous program committees for major programming languages conferences including CC, CGO, OOPSLA, and POPL, and has held leadership roles such as Program Co-Chair for CC 2021 and General Co-Chair for JFLA 2023 and 2024. She is also a member of the CC Steering Committee (2021-2024). Her teaching portfolio includes undergraduate and graduate courses in programming, algorithmics, compilation, and program verification, with a particular focus on trustworthy programming techniques using deductive verification in Why3.

Matthew FlattView profile

Professor

• Programming Languages
• Functional Programming
• Runtime Systems
• +3 more

Matthew Flatt is a Professor in the School of Computing at the University of Utah, where he has been actively contributing to programming language research and development. His primary affiliation is with the PLT research group, which is responsible for the Racket programming language ecosystem. Flatt received his PhD from Rice University in 1999. His educational background laid the foundation for his extensive work in programming language design and implementation. His research focuses on extensible programming languages , runtime systems , and applications of functional programming . As one of the principal developers of the Racket programming language, Flatt has made significant contributions to macro systems, language composition, and domain-specific language design. His work demonstrates how language-oriented programming can solve complex software engineering challenges through careful language design and implementation techniques. Flatt has served in numerous leadership roles in major programming language conferences including as Program Chair for DLS 2020, ICFP 2018, and GPCE 2017, and as Program Committee member for numerous SIGPLAN conferences including PLDI, POPL, ICFP, and SPLASH across multiple years. His conference contributions reveal a consistent focus on practical language implementation techniques and metaprogramming systems. As an educator, Flatt has developed and taught courses on programming languages, computer systems, and software engineering, with many course materials including videos and slides publicly available. His teaching approach emphasizes hands-on implementation of language concepts, as evidenced by his MSD Software Engineering course materials that guide students through building an interpreter for a programming language called MSDscript.

Christoph KirschView profile

Professor

• Concurrent Programming
• Memory Management
• Virtualization
• +5 more

Christoph Kirsch is Professor and Chair of the Department of Computer Science at the University of Salzburg, Austria since January 2022, and Chair of the Computational Systems Group since April 2004. He also serves as Chair of the Programming Research Laboratory at Czech Technical University in Prague since October 2022. Dr. Kirsch earned his Dr.-Ing. from Saarland University in 1999 while at the Max Planck Institute for Computer Science. He worked as Postdoctoral Researcher at UC Berkeley (1999-2004) and later returned as Visiting Scholar (2008-2013) and Visiting Professor (2014). His research focuses on: Principled design of programming languages and runtime systems Server, quantum, embedded, real-time, and mobile systems Symbolic reasoning, memory management, and concurrency Dr. Kirsch co-invented embedded programming languages (Giotto, HTL, Embedded Machine) and has designed high-performance concurrent data structures. His recent work centers on symbolic execution frameworks like Selfie, with publications spanning efficient model checking, program analysis, and memory management systems. Professional recognitions include ACM Distinguished Speaker (2017-present). He co-founded EMSOFT (2001), served as ACM SIGBED chair (2011-2013), and was associate editor for IEEE TCAD and ACM TODAES. He has supervised 5 postdocs, 10 PhD students, and 18 Masters students since 2004, teaching undergraduate and graduate courses in Compiler Construction, Systems Engineering, and Introduction to Computer Science. Dr. Kirsch leads the Computational Systems Group at University of Salzburg, advancing programming language design, runtime systems, and formal verification methods.

Christos KotselidisView profile

Associate Professor

• Virtual Machines
• Compilers
• Hardware/Software Co-design
• +7 more

Christos Kotselidis is an Associate Professor at the University of Manchester's School of Computer Science and serves as Chief Engineer at Pierer Innovation (previously mentioned as KTM Innovation). He leads the TornadoVM project, a groundbreaking Java Virtual Machine for heterogeneous hardware acceleration. His work bridges academia and industry, focusing on hardware/software co-design for virtual machines and embedded systems. His research spans chip design, micro-architecture, compilers, virtual machines, and garbage collection. Dr. Kotselidis has pioneered work in heterogeneous computing, particularly in accelerating Java applications on GPUs, FPGAs, and RISC-V architectures. His team's recent development of GPULlama3.java demonstrates the practical application of his research in bringing LLM inference to pure Java with GPU acceleration. His publications show a consistent focus on bridging hardware capabilities with managed runtime systems. The research trajectory reveals increasing sophistication in handling memory hierarchies, parallelism, and cross-architecture execution. His work has significant implications for high-performance computing, AI acceleration, and sustainable computing practices. Dr. Kotselidis actively contributes to the academic community as a program committee member for conferences like ISMM and as an organizer for workshops including VMIL and MoreVMs. He's also involved in EU-funded projects like AERO and DARE, which focus on European processor initiatives and software ecosystems. As project lead for TornadoVM, he mentors a research team at Manchester including Michalis Papadimitriou, Mary Xekalaki, and Thanos Stratikopoulos. His lab (Beehive Lab) develops open-source tools that are widely used in both academic and industrial settings for heterogeneous computing.

Polyvios PratikakisView profile

Associate Professor

• Parallel Programming
• Distributed Systems
• Programming Languages
• +2 more

Polyvios Pratikakis is Associate Professor in the Computer Science Department at University of Crete and Visiting Researcher at FORTH-ICS. Research develops tools for parallel/distributed software execution, focusing on programming languages, runtimes, and static analysis for modern hardware. Current projects include EuroEXA (programming models for exascale applications) and ETAK (earthquake simulation deployment in cloud environments). Past projects include ASAP (big data workflows), Myrmics/BDDT/PARTEE (task-parallel runtimes), and GreenVM (JVM for non-cache-coherent architectures). Additional research examines software fault tolerance and static analysis for parallel programs. Teaching includes undergraduate/graduate courses on Parallel Programming, Type Systems, Multicore Programming, and Computer Science fundamentals. Supervises multiple MSc/PhD students in compiler design, runtime systems, and social network analytics. Service includes program committees (EuroPar, CF), HiPEAC organization, and faculty committees at University of Crete.

Foivos ZakkakView profile

Researcher

• Process Virtual Machines
• Managed Runtime Systems
• Garbage Collection Systems
• +3 more

Foivos Zakkak is a Software Engineer at Red Hat’s Java platform team, focusing on Mandrel, GraalVM, and Quarkus. Previously, he held academic roles including Research Associate and Research Software Engineer at the Advanced Processor Technologies (APT) group at the University of Manchester, and Postdoctoral Researcher at the Computer Architecture and VLSI Systems Laboratory (CARV) of FORTH-ICS. He holds a PhD, MSc, and BSc in Computer Science from the University of Crete. His research interests center around Process Virtual Machines, Managed Runtime Systems, Garbage Collection, and Systems Software. Key projects include leading the Maxine VM (a metacircular Java-in-Java VM), developing DiSquawk (a JVM for non-cache-coherent architectures), and contributions to task-based runtime systems like TPC, BDDT, and PARTEE. His work spans optimizing managed applications for NUMA architectures and reducing memory pressure in big data frameworks. Publications include studies on NUMA system performance, memory analysis of Java benchmarks, and JIT compilation on ARM architectures. His technical expertise extends to system software development and performance engineering.

Saksham GoelView profile

Assistant Professor

• Programming Languages
• Compilers
• Memory Management
• +3 more

Saksham Goel serves as an Assistant Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Bombay, where he conducts research at the intersection of programming languages and systems engineering. His research focuses on advanced memory management techniques, with core expertise in: Garbage collection algorithms and optimizations Compiler design for memory safety Runtime systems for efficient resource utilization Program analysis for liveness domains Dr. Goel's work demonstrates significant contributions to memory management systems, particularly through his ISMM 2020 publication on finite liveness domains. His research addresses critical challenges in reducing memory overhead while maintaining performance in modern programming environments, with applications spanning cloud infrastructure and latency-sensitive applications. He actively participates in premier programming languages conferences including PLDI and its co-located events, contributing to the advancement of compiler technology and runtime systems through both theoretical frameworks and practical implementations.