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.

454 Publications


2021 | Published | Conference Paper | IST-REx-ID: 9646 | OA
Quantitative analysis of assertion violations in probabilistic programs
J. Wang, Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1171–1186.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 9987 | OA
Stateless model checking under a reads-value-from equivalence
P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd International Conference on Computer-Aided Verification , Springer Nature, 2021, pp. 341–366.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2021 | Published | Journal Article | IST-REx-ID: 9997 | OA
The evolution of indirect reciprocity under action and assessment generosity
L. Schmid, P. Shati, C. Hilbe, K. Chatterjee, Scientific Reports 11 (2021).
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2021 | Published | Conference Paper | IST-REx-ID: 10002 | OA
Symbolic time and space tradeoffs for probabilistic verification
K. Chatterjee, W. Dvorak, M.H. Henzinger, A. Svozil, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10004 | OA
Stochastic processes with expected stopping time
K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10052 | OA
Decomposing permutation automata
I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10054 | OA
Faster algorithms for bounded liveness in graphs and game graphs
K. Chatterjee, M.H. Henzinger, S.S. Kale, A. Svozil, in:, 48th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI
 

2021 | Published | Conference Paper | IST-REx-ID: 10055 | OA
A Ramsey theorem for finite monoids
I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | WoS
 

2021 | Published | Conference Paper | IST-REx-ID: 10075 | OA
A bit of nondeterminism makes pushdown automata expressive and succinct
S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann, in:, 46th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Journal Article | IST-REx-ID: 10191 | OA
The reads-from equivalence for the TSO and PSO memory models
T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Thesis | IST-REx-ID: 10199 | OA
Improved verification techniques for concurrent systems
V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 

2021 | Published | Thesis | IST-REx-ID: 10293 | OA
Evolution of cooperation via (in)direct reciprocity under imperfect information
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 | OA
On lexicographic proof rules for probabilistic termination
K. Chatterjee, E.K. 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
 

2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
Quantitative verification on product graphs of small treewidth
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI
 

2021 | Published | Conference Paper | IST-REx-ID: 10630 | OA
On the complexity of intersection non-emptiness for star-free language classes
E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10667 | OA
Infinite time horizon safety of Bayesian neural networks
M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
Infinite-duration all-pay bidding games
G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10847 | OA
Solving partially observable stochastic shortest-path games
P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, K. Chatterjee, in:, 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–4189.
[Published Version] View | DOI | Download Published Version (ext.)
 

2020 | Published | Conference Paper | IST-REx-ID: 7810 | OA
Optimal and perfectly parallel algorithms for on-demand data-flow analysis
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, European Symposium on Programming, Springer Nature, 2020, pp. 112–140.
[Published Version] View | Files available | DOI | WoS
 

2020 | Published | Conference Paper | IST-REx-ID: 7955 | OA
Approximating values of generalized-reachability stochastic games
P. Ashok, K. Chatterjee, J. Kretinsky, M. Weininger, T. Winkler, in:, Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , Association for Computing Machinery, 2020, pp. 102–115.
[Published Version] View | Files available | DOI | WoS | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Export / Embed