Ehsan Goharshady

Graduate School
Chatterjee Group

3 Publications

Mark all

[3]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
Chatterjee K, Goharshady E, Novotný P, Zikelic D. Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. 2024;8. doi:10.1145/3656462
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. Solving long-run average reward robust MDPs via stochastic games. In: 33rd International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence; 2024:6707-6715.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[1]
2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. In: 24th International Symposium on Formal Methods. Vol 13047. Springer Nature; 2021:619-639. doi: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

Export / Embed

Grants


3 Publications

Mark all

[3]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
Chatterjee K, Goharshady E, Novotný P, Zikelic D. Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. 2024;8. doi:10.1145/3656462
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. Solving long-run average reward robust MDPs via stochastic games. In: 33rd International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence; 2024:6707-6715.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[1]
2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. In: 24th International Symposium on Formal Methods. Vol 13047. Springer Nature; 2021:619-639. doi: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

Export / Embed