Find Academic Supervisors

• Computer Engineering
• Information Systems Engineering
• Operating Systems
• +4 more

M. Anton Ertl is an Associate Professor at TU Wien's Faculty of Informatics, Department of Compilers and Languages. His roles include teaching courses such as 'Compilers,' 'Efficient Programs,' and 'Stack-based languages.' He specializes in compiler back-ends, Forth, interpreters, programming languages, operating systems, and computer architectures. Ertl's research focuses on optimizing interpreters, compiler design, and hardware security, particularly addressing vulnerabilities like Spectre. His research interests span interpreter performance, compiler optimization, and Forth language evolution. Recent work includes exploring hardware-based Spectre mitigation, decompilers for Gforth, and stack-based language efficiency. He actively contributes to the EuroForth conferences as an editor and presenter. Ertl supervises students on topics like compiler construction, reverse engineering, and interpreter optimization. His academic contributions include over 50 publications, with a focus on virtual machine performance, compiler back-ends, and Forth-related advancements. He is a key figure in the Gforth project and regularly teaches advanced courses on programming languages and computer systems.

Sarah E. ChasinsView profile

Assistant Professor

• Programming Languages
• Human-Computer Interaction
• Program Synthesis
• +3 more

Sarah E. Chasins is an Assistant Professor at the University of California at Berkeley , affiliated with the College of Engineering and Department of Electrical Engineering and Computer Sciences . She leads the PLAIT Lab (Programming Languages for Approachable and Inclusive Tools), with additional affiliations at the Berkeley Institute for Data Science (BIDS) and collaborations across disciplines. Her research focuses on democratizing programming through Program synthesis Human-Computer Interaction for programming languages Tools for non-traditional programmers Embedded domain-specific language design Web automation frameworks She has developed systems like Ringer for browser automation and Skip Blocks for execution history reuse. Recent publications highlight trends in Direct manipulation programming Synthesis-backed refactoring Sequence-to-tree code search DSL usability for domain experts Functional programming practices Web script optimization She has advised numerous graduate and undergraduate researchers, including: Current PhD students: Justin Lubin, Eric Rawn, Parker Ziegler Alumni: Gabriel Matute (MSc), Rebecca Hicke (undergraduate) Her service includes committee roles at top conferences like OOPSLA, PLDI, and PLATEAU, as well as teaching courses on CS164: Programming Languages and Compilers CS294-184: Building User-Centered Programming Tools CS39-001: Technology, Society, and Power

Fabrice RastelloView profile

Researcher

• Automatic Parallelization
• Compiler Back-End Optimization
• Static Single Assignment (SSA)
• +4 more

Fabrice Rastello is a leading researcher at Inria, France, where he serves as the leader of the CORSE (Compiler Optimization and Runtime SystEms) research team. His expertise spans automatic parallelization and compiler back-end optimization, with significant contributions to Static Single Assignment (SSA) form theory and register allocation techniques. Affiliated with University Grenoble Alpes - Inria - CNRS - Grenoble INP - LIG, he maintains an active research profile with continuous publications in top-tier conferences including PLDI, CGO, and PPoPP. His research interests focus on combining theoretical foundations with practical applications in compiler design. Key areas include automatic parallelization techniques (building on his PhD work on tiling as a loop transformation), compiler back-end optimization, and the emerging field of hybrid compilation that bridges static compilation with runtime techniques. He has made significant contributions to register allocation for JIT compilation in the context of SSA properties, advising three PhD students on related topics. Analysis of his recent publications reveals a strong trend toward data movement optimization, with numerous papers on I/O complexity bounds, cache modeling, and microarchitectural performance analysis. His work spans both theoretical computer science and practical applications, including contributions to healthcare technology during the pandemic with the eSpiro ventilator project. He has also explored intersections between compiler techniques and machine learning, particularly in using ML for performance modeling. Fabrice Rastello serves on program committees for major conferences in the field, including PLDI, CGO, and CC, demonstrating his standing in the research community. His 2022 book 'SSA-based Compiler Design' as editor further establishes his authority in compiler theory and practice. His recent work shows continued innovation in compiler techniques, with publications in 2024 demonstrating ongoing research activity across multiple domains including cache modeling, program analysis, and machine learning applications.

Cătălin HrițcuView profile

Professor

• Formal Methods for Security
• Secure Compilation
• Compartmentalization
• +15 more

Cătălin Hrițcu is a tenured faculty member and head of the Formally Verified Security group at the Max Planck Institute for Security and Privacy (MPI-SP) in Bochum, Germany. His work bridges programming languages, formal verification, and systems security, with a strong focus on developing foundational methods for secure compilation and verified systems. His research interests include formal methods for security, programming languages, and the design and verification of security-critical systems. Specifically, he works on secure compilation, compartmentalization, memory safety, information flow control, security protocols, program verification, proof assistants (especially F*), dependent types, formal semantics, mechanized metatheory, and property-based testing. His research group develops techniques to ensure that high-assurance verified code remains secure when interacting with untrusted or weakly-typed components. The recent publications show a consistent focus on foundational verification of security properties, particularly in the context of the F* language and secure compilation. Key themes include secure interoperability between verified and unverified code, end-to-end verification of cryptographic implementations, and formal proofs of compiler correctness. His work often combines deep theoretical insight with practical implementation, targeting real-world systems like CHERI and high-speed cryptography. Scientific awards include: ERC Starting Grant on formally secure compilation Hrițcu has advised numerous students and researchers, though specific names are not listed in the source. He has led significant research grants, notably the ERC Starting Grant, which supports foundational work in secure compilation. His leadership extends to major conferences where he has served as program chair, steering committee chair, and organizing committee member across POPL, ICFP, CPP, and PriSC. He leads the Formally Verified Security group at MPI-SP, which focuses on building and verifying secure systems using formal methods. The group actively contributes to the F* verification system and works on projects involving secure compilation chains, reference monitors, and tagged architectures.

• Cryptography
• Algorithm Design
• Compiler Construction
• +3 more

Mauro Leoncini is a Full Professor at the Department of Physical, Computer and Mathematical Sciences, University of Modena and Reggio Emilia. His academic profile focuses on computer science, specifically in cryptography and compiler design. He teaches courses such as Cryptographic Algorithms (for Computer Science and Mathematics Master's programs) and Compilers (for Computer Science undergraduates). Courses: Cryptographic Algorithms, Compilers Research Areas: Cryptography, Compiler Technology, Social Engineering in Cybersecurity, Algorithm Design Contact: mauro.leoncini@unimore.it His Cryptographic Algorithms course covers asymmetric encryption (RSA, ElGamal), digital signatures, elliptic curve cryptography, and human factors in security vulnerabilities. The Compilers course emphasizes modern compiler architecture (front-end, middle-end, back-end), LLVM IR implementation, and hardware-specific optimizations. Both courses combine theoretical instruction with hands-on laboratory work.

Xavier LeroyView profile

Professor

• Formal verification
• Programming languages
• Functional programming
• +5 more

Xavier Leroy is a Professor at the Collège de France , holding the Software Science chair. His research focuses on enhancing software reliability, safety, and security through mathematically rigorous approaches like formal semantics, program logic, and deductive systems. He is a key member of the Cambium project-team , a joint venture with Inria, advancing formal verification methods and programming language design. Education: École normale supérieure and Université Paris-Diderot (PhD in 1992), postdoc at Stanford University. Research Themes: Type systems, deductive verification, shared-memory parallelism, weakly consistent memory models, and secure computing on encrypted data (2025 lecture series). Major Contributions: Architect of the OCaml functional programming language and CompCert, a formally verified compiler for mission-critical embedded software. Leroy previously served as Research Director at Inria (2000–present via Cambium) and led the Gallium research team (2006–2019). His work bridges theoretical foundations (e.g., Curry-Howard correspondence) with practical tools for secure software development.