Ehsan Goharshady
5 Publications
2025 | Published | Conference Paper | IST-REx-ID: 19667 | 
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 AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 11, pp. 11158–11166.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 19744 |
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
2024 | Published | Conference Paper | IST-REx-ID: 18160 |
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
2024 | Published | Journal Article | IST-REx-ID: 17283 |
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
2021 | Published | Conference Paper | IST-REx-ID: 10414 |
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
Grants
5 Publications
2025 | Published | Conference Paper | IST-REx-ID: 19667 |
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 AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 11, pp. 11158–11166.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 19744 |
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
2024 | Published | Conference Paper | IST-REx-ID: 18160 |
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
2024 | Published | Journal Article | IST-REx-ID: 17283 |
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
2021 | Published | Conference Paper | IST-REx-ID: 10414 |
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