| Website | https://cs.wellesley.edu/~avh/ |
Priya was my mentee, colleague, and a good friend. Their passing came as a shock to all of us. If Priya touched your life in any way, academically or otherwise, please feel free to reach out to me to add to the post
In ~1 hour (9pm ET/6pm PT), I'll give this virtual talk/Q&A hosted by the Women in Compilers & Tools working group!
It will have:
+ lightweight formal methods
+ boundless enthusiasm for compilers
+ time for me to extol the virtues of the undergraduate-focused academic career path (and share job market tips) ✨
EGRAPHS talk yesterday on Cranelift's (a)egraphs mid-end was great fun; slides are now up [0]! Unfortunately the streaming setup was broken in our workshop room, so no recording exists (sorry!).
Thanks again to @mwillsey, @ztatlock and the rest of the egraphs-workshop crew for inviting me. Was fantastic to finally meet some collaborators and other compiler folks in person, too; only regret is not having more time to catch up!
[0] https://cfallin.org/pubs/egraphs2023_aegraphs_slides.pdf
I successfully defended my PhD thesis yesterday!
An unbounded thank you to the best advisor, Adrian Sampson @adrian, and my wonderful committee, collaborators, mentors, cohort, labmates, and my community outside of grad school that made this possible✨
Attached: 1 image Gigantic congratulations to Prof. Dr. @avanhatt, who successfully defended today!!!! She has done a truly awesome series of super-practical applications of formal methods to compilers and things—stuff people will be using and building on for a long time. 🎉👏🦀
@avanhatt' group has been working on formal verification for Cranelift's instruction selection and found a cool result today. There had been a bug in the aarch64 backend where it zero-extended some 8-bit/16-bit inputs instead of sign-extending them. They demonstrated that their verifier can detect that bug!
That particular bug had already been fixed, but it shows how it's possible to automatically detect subtle bugs like that.
The EGRAPHS workshop will be taking place again at PLDI 2023 in Orlando! See you there!
Start thinking about a talk that will generate great discussion about anything related to e-graphs. Deadline: Apr 5
Research on and around e-graphs has recently exploded in both quantity and diversity. The data structure that powers SMT solvers is now seeing use in synthesis, optimization, and verification via equality saturation and related techniques. In addition to recent advances in the core data structure and techniques, researchers and practitioners are applying e-graphs to domains such as compilers, floating point accuracy, test generation, computational fabrication, automatic vectorization, deep learning compute graphs, symbolic computation, and more. The second EGRAPHS workshop will bring toge ...
SIGPLAN
Rachit
Chris Fallin
Adrian Sampson
Dan Gohman
Max Willsey