Ehsan Goharshady

10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
Asadi, A., Chatterjee, K., Goharshady, E., Karrabi, M., & Shafiee, A. (2026). Qualitative analysis of ω-regular objectives on robust MDPs. In Proceedings of the 40th AAAI Conference on Artificial Intelligence (Vol. 40, pp. 36137–36145). Singapore, Singapore: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v40i43.40931
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2026 | Published | Journal Article | IST-REx-ID: 22102 | OA | PlanS
Chatterjee, K., Goharshady, E., & Zikelic, D. (2026). SuperDP: Differential privacy refutation via supermartingales. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3808296
[Published Version] View | Files available | DOI | arXiv
 
[8]
2026 | Research Data Reference | IST-REx-ID: 22134 | OA
Chatterjee, K., Goharshady, E., & Zikelic, D. (2026). SuperDP: Differential Privacy Refutation via Supermartingales. Zenodo. https://doi.org/10.5281/ZENODO.18930113
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2026 | Published | Conference Paper | IST-REx-ID: 22920 | OA
Asadi, A., Henzinger, T. A., Goharshady, E., Kebis, P., & Mallik, K. (2026). Generalized bidding games: Where bidding and stochastic games meet. In 37th International Conference on Concurrency Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13
[Published Version] View | Files available | DOI | arXiv
 
[6]
2025 | Published | Conference Paper | IST-REx-ID: 19744 | OA
Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2025). Refuting equivalence in probabilistic programs with conditioning. In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 15697, pp. 279–300). Hamilton, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-90653-4_14
[Published Version] View | Files available | DOI | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 19667 | OA
Chatterjee, K., Goharshady, E., Karrabi, M., Motwani, H. J., Seeliger, M., & Zikelic, D. (2025). Quantified linear and polynomial arithmetic satisfiability via template-based skolemization. In Proceedings of the 39th AAAI Conference on Artificial Intelligence (Vol. 39, pp. 11158–11166). Philadelphia, PA, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v39i11.33213
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20648 | OA
Chatterjee, K., Goharshady, A. K., Goharshady, E., Karrabi, M., Saadat, M., Seeliger, M., & Zikelic, D. (2025). PolyQEnt: A polynomial quantified entailment solver. In 23rd International Symposium on Automated Technology for Verification and Analysis (Vol. 16145, pp. 411–424). Bengaluru, India: Springer Nature. https://doi.org/10.1007/978-3-032-08707-2_19
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
Chatterjee, K., Goharshady, E., Karrabi, M., Novotný, P., & Zikelic, D. (2024). Solving long-run average reward robust MDPs via stochastic games. In 33rd International Joint Conference on Artificial Intelligence (pp. 6707–6715). Jeju, South Korea: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/741
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2024). Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3656462
[Published Version] View | Files available | DOI | arXiv
 
[1]
earlier version | 2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee, K., Goharshady, E., Novotný, P., Zárevúcky, J., & Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-90870-6_33
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

Grants


10 Publications

Mark all

[10]
2026 | Published | Conference Paper | IST-REx-ID: 21717 | OA
Asadi, A., Chatterjee, K., Goharshady, E., Karrabi, M., & Shafiee, A. (2026). Qualitative analysis of ω-regular objectives on robust MDPs. In Proceedings of the 40th AAAI Conference on Artificial Intelligence (Vol. 40, pp. 36137–36145). Singapore, Singapore: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v40i43.40931
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2026 | Published | Journal Article | IST-REx-ID: 22102 | OA | PlanS
Chatterjee, K., Goharshady, E., & Zikelic, D. (2026). SuperDP: Differential privacy refutation via supermartingales. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3808296
[Published Version] View | Files available | DOI | arXiv
 
[8]
2026 | Research Data Reference | IST-REx-ID: 22134 | OA
Chatterjee, K., Goharshady, E., & Zikelic, D. (2026). SuperDP: Differential Privacy Refutation via Supermartingales. Zenodo. https://doi.org/10.5281/ZENODO.18930113
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[7]
2026 | Published | Conference Paper | IST-REx-ID: 22920 | OA
Asadi, A., Henzinger, T. A., Goharshady, E., Kebis, P., & Mallik, K. (2026). Generalized bidding games: Where bidding and stochastic games meet. In 37th International Conference on Concurrency Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13
[Published Version] View | Files available | DOI | arXiv
 
[6]
2025 | Published | Conference Paper | IST-REx-ID: 19744 | OA
Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2025). Refuting equivalence in probabilistic programs with conditioning. In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 15697, pp. 279–300). Hamilton, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-90653-4_14
[Published Version] View | Files available | DOI | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 19667 | OA
Chatterjee, K., Goharshady, E., Karrabi, M., Motwani, H. J., Seeliger, M., & Zikelic, D. (2025). Quantified linear and polynomial arithmetic satisfiability via template-based skolemization. In Proceedings of the 39th AAAI Conference on Artificial Intelligence (Vol. 39, pp. 11158–11166). Philadelphia, PA, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v39i11.33213
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20648 | OA
Chatterjee, K., Goharshady, A. K., Goharshady, E., Karrabi, M., Saadat, M., Seeliger, M., & Zikelic, D. (2025). PolyQEnt: A polynomial quantified entailment solver. In 23rd International Symposium on Automated Technology for Verification and Analysis (Vol. 16145, pp. 411–424). Bengaluru, India: Springer Nature. https://doi.org/10.1007/978-3-032-08707-2_19
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
Chatterjee, K., Goharshady, E., Karrabi, M., Novotný, P., & Zikelic, D. (2024). Solving long-run average reward robust MDPs via stochastic games. In 33rd International Joint Conference on Artificial Intelligence (pp. 6707–6715). Jeju, South Korea: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/741
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2024). Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3656462
[Published Version] View | Files available | DOI | arXiv
 
[1]
earlier version | 2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee, K., Goharshady, E., Novotný, P., Zárevúcky, J., & Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-90870-6_33
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed