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, Ismael R. “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. https://doi.org/10.4230/LIPIcs.STACS.2021.44.
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Conference Paper | IST-REx-ID: 9987 |
Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In 33rd International Conference on Computer-Aided Verification , 12759:341–66. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 10191 |
Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021. https://doi.org/10.1145/3485541.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Thesis | IST-REx-ID: 10199 |
Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10199.
[Published Version]
View
| Files available
| DOI
2021 | Journal Article | IST-REx-ID: 9293 |
Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial Intelligence. Elsevier, 2021. https://doi.org/10.1016/j.artint.2021.103499.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 9393 |
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 10414 |
Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” In 24th International Symposium on Formal Methods, 13047:619–39. Springer Nature, 2021. https://doi.org/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, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “Proving Non-Termination by Program Reversal.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1033–48. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454093.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Research Data Reference | IST-REx-ID: 15284 |
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “RevTerm.” Association for Computing Machinery, 2021. https://doi.org/10.1145/3410304.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2021 | Thesis | IST-REx-ID: 8934 |
Goharshady, Amir Kafshdar. “Parameterized and Algebro-Geometric Advances in Static Program Analysis.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:8934.
[Published Version]
View
| Files available
| DOI