Formal Methods for Stochastic Models: Algorithms and Applications

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.

Stochastic games with lexicographic reachability-safety objectives
K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420.

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.

Infection dynamics of COVID-19 virus under lockdown and reopening
J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Scientific Reports 12 (2022).

Prioritised learning in snowdrift-type games
M. Kleshnina, S. Streipert, J. Filar, K. Chatterjee, Mathematics 8 (2020).

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.

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).

On lexicographic proof rules for probabilistic termination
K. Chatterjee, E.K. Goharshady, P. Novotný, J. Zárevúcky, Đ. Žikelić, in:, 24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.

Fast and strong amplifiers of natural selection
J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Nature Communications 12 (2021).

Proving non-termination by program reversal
K. Chatterjee, E.K. Goharshady, P. Novotný, D. Zikelic, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–1048.

Polynomial reachability witnesses via Stellensätze
A. Asadi, K. Chatterjee, H. Fu, A.K. Goharshady, M. Mahdavi, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–787.

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.

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.

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.

Graph planning with expected finite horizon
K. Chatterjee, L. Doyen, Journal of Computer and System Sciences 129 (2022) 1–21.

Scalable verification of quantized neural networks
T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.

Differential cost analysis with simultaneous potentials and anti-potentials
D. Zikelic, B.-Y.E. Chang, P. Bolignano, F. Raimondi, in:, Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 442–457.

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.

Improved verification techniques for concurrent systems
V. Toman, Improved Verification Techniques for Concurrent Systems, IST Austria, 2021.

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.

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.

Mistakes can stabilise the dynamics of rock-paper-scissors games
M. Kleshnina, S.S. Streipert, J.A. Filar, K. Chatterjee, PLoS Computational Biology 17 (2021).

Sound and complete certificates for auantitative termination analysis of probabilistic programs
K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, in:, Proceedings of the 34th International Conference on Computer Aided Verification, Springer, 2022, pp. 55–78.

Algorithms and hardness results for computing cores of Markov chains
Ahmadi, Ali, Algorithms and hardness results for computing cores of Markov chains. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 250. 2022

Complexity of spatial games
Chatterjee, Krishnendu, Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 250. 2022

Evolution of cooperation via (in)direct reciprocity under imperfect information
L. Schmid, Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information, IST Austria, 2021.

The evolution of indirect reciprocity under action and assessment generosity
L. Schmid, P. Shati, C. Hilbe, K. Chatterjee, Scientific Reports 11 (2021).

A unified framework of direct and indirect reciprocity
L. Schmid, K. Chatterjee, C. Hilbe, M.A. Nowak, Nature Human Behaviour 5 (2021) 1292–1302.