Summary
Daneshvar Amrollahi is a Stanford Computer Science PhD student and research assistant with a decade of experience building program verification and synthesis tools. He has contributed to state-of-the-art theorem provers and static analyzers—integrating recursive program synthesis into Vampire and extending loop-invariant generation in Polar, work that earned a Radhia Cousot Young Research Best Paper Award. His internships at EPFL, ETH Zürich, and TU Wien focused on scaling symbolic execution and verifying initialization code, demonstrating a practical bent for turning theoretical methods into robust tooling. He also spent time as an applied scientist in AWS’s Automated Reasoning Group, blending research rigor with applied cloud-scale problems. Based in Palo Alto, he brings deep formal methods expertise plus hands-on systems experience across compilers, symbolic engines, and verification pipelines. Colleagues describe him as someone who pairs mathematical precision with an eye for pragmatic implementation details that make formal techniques usable in practice.
10 years of coding experience
High School Diploma, Mathematics, GPA: 19.48 / 20.00, High School Diploma, Mathematics, GPA: 19.48 / 20.00 at Allameh Tabatabaei High School
Bachelor's degree, Computer Engineering, Bachelor's degree, Computer Engineering at University of Tehran
Doctor of Philosophy - PhD, Computer Science, Doctor of Philosophy - PhD, Computer Science at Stanford University