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. Proceedings of the 40th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 40, 36137–36145.
[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. 10(PLDI), 218.
[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, 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 TA, Goharshady E, Kebis P, Mallik K. 2026. Generalized bidding games: Where bidding and stochastic games meet. 37th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 391, 13:1-13:20.
[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. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 279–300.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 19667 | OA
Chatterjee K, Goharshady E, Karrabi M, Motwani HJ, Seeliger M, Zikelic D. 2025. Quantified linear and polynomial arithmetic satisfiability via template-based skolemization. Proceedings of the 39th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 39, 11158–11166.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20648 | OA
Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Saadat M, Seeliger M, Zikelic D. 2025. PolyQEnt: A polynomial quantified entailment solver. 23rd International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 16145, 411–424.
[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. 33rd International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 6707–6715.
[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. 8, 232.
[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. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

1 Grants


Verification of Relational Properties in Probabilistic Programs

2026-09-01 – 2028-08-31
Österreichische Akademie der Wissenschaften

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. Proceedings of the 40th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 40, 36137–36145.
[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. 10(PLDI), 218.
[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, 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 TA, Goharshady E, Kebis P, Mallik K. 2026. Generalized bidding games: Where bidding and stochastic games meet. 37th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 391, 13:1-13:20.
[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. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 279–300.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 19667 | OA
Chatterjee K, Goharshady E, Karrabi M, Motwani HJ, Seeliger M, Zikelic D. 2025. Quantified linear and polynomial arithmetic satisfiability via template-based skolemization. Proceedings of the 39th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 39, 11158–11166.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20648 | OA
Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Saadat M, Seeliger M, Zikelic D. 2025. PolyQEnt: A polynomial quantified entailment solver. 23rd International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 16145, 411–424.
[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. 33rd International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 6707–6715.
[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. 8, 232.
[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. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed