I am a 3rd-year Computer Science PhD student at Stanford University, advised by Clark Barrett.
My interests center on combining formal reasoning with large language models (LLMs). More specifically, I have been working on the faithfulness of LLMs in autoformalization (translating natural-language into machine-checkable formal statements).
Previously, I have worked on SMT solvers, theorem provers, loop invariant generation, program synthesis, and verifying software network functions.
Email: daneshvar [at] cs [dot] stanford [dot] edu
Towards Improved Stability for SMT Solvers via Input Normalization got accepted to FMCAD 2025.Towards Improved Stability for SMT Solvers at the Center for Automated Reasoning (CENTAUR) annual meeting, Stanford University.Synthesis of Recursive Programs in Saturation got accepted to IJCAR 2024.