Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
454 Publications
2021 |
Published |
Conference Paper |
IST-REx-ID: 9644 |
K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination by program reversal,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1033–1048.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 9645 |
A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial reachability witnesses via Stellensätze,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 772–787.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 |
Published |
Conference Paper |
IST-REx-ID: 9646 |
J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative analysis of assertion violations in probabilistic programs,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1171–1186.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 10002 |
K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 10004 |
K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 10052 |
I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in 32nd International Conference on Concurrency Theory, Paris, France, 2021, vol. 203.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 10054 |
K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.
[Published Version]
View
| Files available
| DOI
2021 |
Published |
Conference Paper |
IST-REx-ID: 10055 |
I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 2021, vol. 187.
[Published Version]
View
| Files available
| DOI
| WoS
2021 |
Published |
Conference Paper |
IST-REx-ID: 10075 |
S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol. 202.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |
Published |
Journal Article |
IST-REx-ID: 10191 |
T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |
Published |
Thesis | PhD |
IST-REx-ID: 10199 |
V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.
[Published Version]
View
| Files available
| DOI
2021 |
Published |
Thesis | PhD |
IST-REx-ID: 10293 |
L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect information,” Institute of Science and Technology Austria, 2021.
[Published Version]
View
| Files available
| DOI
2021 |
Published |
Conference Paper |
IST-REx-ID: 10414 |
K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in 24th International Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 10629 |
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
[Published Version]
View
| Files available
| DOI
2021 |
Published |
Conference Paper |
IST-REx-ID: 10630 |
E. Arrighi et al., “On the complexity of intersection non-emptiness for star-free language classes,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 12767 |
S. Bansal, K. Chatterjee, and M. Y. Vardi, “On satisficing in quantitative games,” in 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2021, vol. 12651, pp. 20–37.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 9987 |
P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 |
Published |
Journal Article |
IST-REx-ID: 9997 |
L. Schmid, P. Shati, C. Hilbe, and K. Chatterjee, “The evolution of indirect reciprocity under action and assessment generosity,” Scientific Reports, vol. 11, no. 1. Springer Nature, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2020 |
Published |
Conference Paper |
IST-REx-ID: 7810 |
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal and perfectly parallel algorithms for on-demand data-flow analysis,” in European Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.
[Published Version]
View
| Files available
| DOI
| WoS
2020 |
Published |
Conference Paper |
IST-REx-ID: 7955 |
P. Ashok, K. Chatterjee, J. Kretinsky, M. Weininger, and T. Winkler, “Approximating values of generalized-reachability stochastic games,” in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , Saarbrücken, Germany, 2020, pp. 102–115.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv