Ehsan Kafshdar Goharshady

According to our database, Ehsan Kafshdar Goharshady authored at least 16 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Automated Approach for Solving Infinite-state Polynomial Reachability Games.

Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Maximilian Seeliger, Dorde Zikelic

CoRR, May, 2026

SuperDP: Differential Privacy Refutation via Supermartingales.

Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Dorde Zikelic

CoRR, March, 2026

Strongly Polynomial Time Complexity of Policy Iteration for L_∞ Robust MDPs.

Ali Asadi, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Alipasha Montaseri, Carlo Pagano

CoRR, January, 2026

Qualitative Analysis of ω-Regular Objectives on Robust MDPs.

Ali Asadi, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Ali Shafiee

Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025

Refuting Equivalence in Probabilistic Programs with Conditioning.

Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2025

PolyQEnt: A Polynomial Quantified Entailment Solver.

Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Milad Saadat, Maximilian Seeliger, Dorde Zikelic

Proceedings of the Automated Technology for Verification and Analysis, 2025

Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization.

Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Harshit J. Motwani, Maximilian Seeliger, Dorde Zikelic

Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024

Equivalence and Similarity Refutation for Probabilistic Programs.

Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic

Proc. ACM Program. Lang., 2024

PolyHorn: A Polynomial Horn Clause Solver.

Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Milad Saadat, Dorde Zikelic

CoRR, 2024

Solving Long-run Average Reward Robust MDPs via Stochastic Games.

Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Petr Novotný, Dorde Zikelic

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.

Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Dorde Zikelic

Proceedings of the Formal Methods - 26th International Symposium, 2024

Bidding Games with Charging.

Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, Kaushik Mallik

Proceedings of the 35th International Conference on Concurrency Theory, 2024

2021

Proving non-termination by program reversal.

Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic

Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

On Lexicographic Proof Rules for Probabilistic Termination.

Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic

Proceedings of the Formal Methods - 24th International Symposium, 2021

2020

Polynomial invariant generation for non-deterministic recursive programs.

Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady

Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2019

The treewidth of smart contracts.

Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady

Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019