| The treewidth of smart contracts K Chatterjee, AK Goharshady, EK Goharshady Proceedings of the 34th ACM/sigapp symposium on applied computing, 400-408, 2019 | 48 | 2019 |
| Polynomial invariant generation for non-deterministic recursive programs K Chatterjee, H Fu, AK Goharshady, EK Goharshady ACM Conference on Programming Language Design and Implementation (PLDI), 2020 | 39 | 2020 |
| Proving non-termination by program reversal K Chatterjee, EK Goharshady, P Novotný, Đ Žikelić Proceedings of the 42nd ACM SIGPLAN International Conference on Programming …, 2021 | 19 | 2021 |
| On lexicographic proof rules for probabilistic termination K Chatterjee, E Kafshdar Goharshady, P Novotný, J Zárevúcky, Đ Žikelić Formal Aspects of Computing 35 (2), 1-25, 2023 | 11 | 2023 |
| Equivalence and Similarity Refutation for Probabilistic Programs K Chatterjee, EK Goharshady, P Novotný, Đ Žikelić arXiv preprint arXiv:2404.03430, 2024 | | 2024 |
| Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs K Chatterjee, AK Goharshady, EK Goharshady, M Karrabi, Đ Žikelić arXiv preprint arXiv:2403.05386, 2024 | | 2024 |
| Solving Long-run Average Reward Robust MDPs via Stochastic Games K Chatterjee, EK Goharshady, M Karrabi, P Novotný, Đ Žikelić arXiv preprint arXiv:2312.13912, 2023 | | 2023 |
Krishnendu ChatterjeeProfessor, IST AustriaVerified email at ist.ac.at
