معرفی
Max Willsey is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley, since 2024. He specializes in program optimization, leveraging techniques from programming languages, databases, and systems to develop robust and accessible compiler frameworks.
His research focuses on equality saturation, E-Graphs, and the integration of Datalog with compiler optimizations. He has contributed to advancements in unifying algorithmic approaches, enabling faster and more extensible program analysis.
- Teaching: CS 164 (Programming Languages and Compilers, Spring 2025), CS 265 (Compiler Optimization, Fall 2024), and CS 294-260 (Declarative Program Analysis and Optimization, Spring 2024).
- Research Highlights: Development of the egg and egglog projects, co-organizing the EGRAPHS workshop, and leading the EGRAPHS Community for e-graphs researchers.
His recent articles highlight trends in unifying traditional hash joins with worst-case optimal joins, applying equality saturation to diverse domains like Datalog and tensor graph optimization, and advancing E-Graphs for program synthesis and formal verification.
- Scientific Awards:
- SIGMOD Record Research Highlight, 2024
- MIT PL Review Selection, 2024
- Distinguished Paper, OOPSLA 2021 and POPL 2021
- NSF Graduate Research Fellowship Honorable Mention, 2018
- Qualcomm Innovation Fellow, 2019
- Service:
- Committee Member, PLDI 2025, POPL 2025, ASPLOS 2025
- Co-organizer, EGRAPHS 2024 and 2023 workshops
- Interviewer, UC Berkeley Graduate Admissions Committee, 2024
