5 Publications

Mark all

[5]
2025 | Published | Conference Paper | IST-REx-ID: 19667 | OA
Quantified linear and polynomial arithmetic satisfiability via template-based skolemization
K. Chatterjee, E. Goharshady, M. Karrabi, H.J. Motwani, M. Seeliger, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2025, pp. 11158–11166.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 19744 | OA
Refuting equivalence in probabilistic programs with conditioning
K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 279–300.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
Solving long-run average reward robust MDPs via stochastic games
K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, D. Zikelic, in:, 33rd International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–6715.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
Equivalence and similarity refutation for probabilistic programs
K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024).
[Published Version] View | Files available | DOI | arXiv
 
[1]
2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
On lexicographic proof rules for probabilistic termination
K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:, 24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed

Grants


5 Publications

Mark all

[5]
2025 | Published | Conference Paper | IST-REx-ID: 19667 | OA
Quantified linear and polynomial arithmetic satisfiability via template-based skolemization
K. Chatterjee, E. Goharshady, M. Karrabi, H.J. Motwani, M. Seeliger, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2025, pp. 11158–11166.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 19744 | OA
Refuting equivalence in probabilistic programs with conditioning
K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 279–300.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2024 | Published | Conference Paper | IST-REx-ID: 18160 | OA
Solving long-run average reward robust MDPs via stochastic games
K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, D. Zikelic, in:, 33rd International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–6715.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2024 | Published | Journal Article | IST-REx-ID: 17283 | OA
Equivalence and similarity refutation for probabilistic programs
K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024).
[Published Version] View | Files available | DOI | arXiv
 
[1]
2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
On lexicographic proof rules for probabilistic termination
K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:, 24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed