Scholar
Ehsan Kafshdar Goharshady
Google Scholar ID: jE3J-CwAAAAJ
PhD Candidate, IST Austria
Citations & Impact
Citations
199
H-index
7
i10-index
5
Publications
12
Co-authors
13
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Published several papers, including:
- - "Qualitative Analysis of ω-Regular Objectives on Robust MDPs" (AAAI'26)
- - "PolyQEnt: A Polynomial Quantified Entailment Solver" (ATVA'25), which won the distinguished tool paper award
- - "Refuting Equivalence in Probabilistic Programs with Conditioning" (TACAS'25)
- - "Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization" (AAAI'25)
- - "Bidding Games with Charging" (CONCUR'24), nominated for best paper
- - "Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs" (FM'24), awarded distinguished paper
- - "Solving Long-run Average Reward Robust MDPs via Stochastic Games" (IJCAI'24)
- - "Equivalence and Similarity Refutation for Probabilistic Programs" (PLDI'24)
- - "On Lexicographic Proof Rules for Probabilistic Termination" (FM'21)
- - "Proving Non-Termination by Program Reversal" (PLDI'21)
- - "Polynomial Invariant Generation for Non-Deterministic Recursive Programs" (PLDI'20)
- - "The Treewidth of Smart Contracts" (SAC'19)
- Received multiple awards, including Distinguished Paper Award at FM 2024, Best Paper Nomination at CONCUR 2024, Silver and Bronze medals at the Iranian Mathematics Competition for University Students (IMS), and Silver medal at the International Collegiate Programming Contest (ICPC) – West Asia Regional Contest.
Research Experience
- Serves as a PhD candidate at ISTA, involved in multiple research projects.
Education
- Completed a bachelor's degree in Pure Mathematics and Computer Science at Ferdowsi University of Mashhad, Iran; currently a PhD candidate at the Institute of Science and Technology Austria (ISTA), supervised by Krishnendu Chatterjee.
Background
- Research interests include theoretical computer science, specifically program analysis, model checking, and automata theory.
