Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
459 Publications
2021 | Conference Paper | IST-REx-ID: 10055 | 
Jecker IR. A Ramsey theorem for finite monoids. In: 38th International Symposium on Theoretical Aspects of Computer Science. Vol 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.STACS.2021.44
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Conference Paper | IST-REx-ID: 9987 |
Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model checking under a reads-value-from equivalence. In: 33rd International Conference on Computer-Aided Verification . Vol 12759. Springer Nature; 2021:341-366. doi:10.1007/978-3-030-81685-8_16
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 10191 |
Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 2021;5(OOPSLA). doi:10.1145/3485541
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Thesis | IST-REx-ID: 10199 |
Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199
[Published Version]
View
| Files available
| DOI
2021 | Journal Article | IST-REx-ID: 9293 |
Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 2021;297(8). doi:10.1016/j.artint.2021.103499
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 9393 |
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 2021;57:401-428. doi:10.1007/s10703-021-00373-5
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 10414 |
Chatterjee K, Goharshady EK, 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
2021 | Conference Paper | IST-REx-ID: 9644 |
Chatterjee K, Goharshady EK, Novotný P, Zikelic D. Proving non-termination by program reversal. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:1033-1048. doi:10.1145/3453483.3454093
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Research Data Reference | IST-REx-ID: 15284 |
Chatterjee K, Goharshady AK, Novotný P, Zikelic D. RevTerm. 2021. doi:10.1145/3410304
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2021 | Thesis | IST-REx-ID: 8934 |
Goharshady AK. Parameterized and algebro-geometric advances in static program analysis. 2021. doi:10.15479/AT:ISTA:8934
[Published Version]
View
| Files available
| DOI