Ehsan Goharshady

10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
A. Asadi, K. Chatterjee, E. Goharshady, M. Karrabi, and A. Shafiee, “Qualitative analysis of ω-regular objectives on robust MDPs,” in Proceedings of the 40th AAAI Conference on Artificial Intelligence, Singapore, Singapore, 2026, vol. 40, no. 43, pp. 36137–36145.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2026 | Published | Journal Article | IST-REx-ID: 22102 | OA | PlanS
K. Chatterjee, E. Goharshady, and D. Zikelic, “SuperDP: Differential privacy refutation via supermartingales,” Proceedings of the ACM on Programming Languages, vol. 10, no. PLDI. ACM, 2026.
[Published Version] View | Files available | DOI | arXiv
 
[8]
2026 | Research Data Reference | IST-REx-ID: 22134 | OA
K. Chatterjee, E. Goharshady, and D. Zikelic, “SuperDP: Differential Privacy Refutation via Supermartingales.” Zenodo, 2026.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2026 | Published | Conference Paper | IST-REx-ID: 22920 | OA
A. Asadi, T. A. Henzinger, E. Goharshady, P. Kebis, and K. Mallik, “Generalized bidding games: Where bidding and stochastic games meet,” in 37th International Conference on Concurrency Theory, Liverpool, United Kingdom, 2026, vol. 391.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2025 | Published | Conference Paper | IST-REx-ID: 19744 | OA
K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Refuting equivalence in probabilistic programs with conditioning,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15697, pp. 279–300.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 19667 | OA
K. Chatterjee, E. Goharshady, M. Karrabi, H. J. Motwani, M. Seeliger, and D. Zikelic, “Quantified linear and polynomial arithmetic satisfiability via template-based skolemization,” in Proceedings of the 39th AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 11, pp. 11158–11166.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20648 | OA
K. Chatterjee et al., “PolyQEnt: A polynomial quantified entailment solver,” in 23rd International Symposium on Automated Technology for Verification and Analysis, Bengaluru, India, 2025, vol. 16145, pp. 411–424.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, and D. Zikelic, “Solving long-run average reward robust MDPs via stochastic games,” in 33rd International Joint Conference on Artificial Intelligence, Jeju, South Korea, 2024, pp. 6707–6715.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Equivalence and similarity refutation for probabilistic programs,” Proceedings of the ACM on Programming Languages, vol. 8. Association for Computing Machinery, 2024.
[Published Version] View | Files available | DOI | arXiv
 
[1]
earlier version | 2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in 24th International Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

Grants


10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
A. Asadi, K. Chatterjee, E. Goharshady, M. Karrabi, and A. Shafiee, “Qualitative analysis of ω-regular objectives on robust MDPs,” in Proceedings of the 40th AAAI Conference on Artificial Intelligence, Singapore, Singapore, 2026, vol. 40, no. 43, pp. 36137–36145.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2026 | Published | Journal Article | IST-REx-ID: 22102 | OA | PlanS
K. Chatterjee, E. Goharshady, and D. Zikelic, “SuperDP: Differential privacy refutation via supermartingales,” Proceedings of the ACM on Programming Languages, vol. 10, no. PLDI. ACM, 2026.
[Published Version] View | Files available | DOI | arXiv
 
[8]
2026 | Research Data Reference | IST-REx-ID: 22134 | OA
K. Chatterjee, E. Goharshady, and D. Zikelic, “SuperDP: Differential Privacy Refutation via Supermartingales.” Zenodo, 2026.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2026 | Published | Conference Paper | IST-REx-ID: 22920 | OA
A. Asadi, T. A. Henzinger, E. Goharshady, P. Kebis, and K. Mallik, “Generalized bidding games: Where bidding and stochastic games meet,” in 37th International Conference on Concurrency Theory, Liverpool, United Kingdom, 2026, vol. 391.
[Published Version] View | Files available | DOI | arXiv
 
[6]
2025 | Published | Conference Paper | IST-REx-ID: 19744 | OA
K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Refuting equivalence in probabilistic programs with conditioning,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15697, pp. 279–300.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 19667 | OA
K. Chatterjee, E. Goharshady, M. Karrabi, H. J. Motwani, M. Seeliger, and D. Zikelic, “Quantified linear and polynomial arithmetic satisfiability via template-based skolemization,” in Proceedings of the 39th AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 11, pp. 11158–11166.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20648 | OA
K. Chatterjee et al., “PolyQEnt: A polynomial quantified entailment solver,” in 23rd International Symposium on Automated Technology for Verification and Analysis, Bengaluru, India, 2025, vol. 16145, pp. 411–424.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, and D. Zikelic, “Solving long-run average reward robust MDPs via stochastic games,” in 33rd International Joint Conference on Artificial Intelligence, Jeju, South Korea, 2024, pp. 6707–6715.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Equivalence and similarity refutation for probabilistic programs,” Proceedings of the ACM on Programming Languages, vol. 8. Association for Computing Machinery, 2024.
[Published Version] View | Files available | DOI | arXiv
 
[1]
earlier version | 2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in 24th International Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed