Formal Methods for Stochastic Models: Algorithms and Applications

Project Period: 2020-10-01 – 2025-09-30
Externally Funded
Acronym
ForM-SMArt
Principal Investigator
Krishnendu Chatterjee
Department(s)
Chatterjee Group
Grant Number
863818
Funding Organisation
EC/H2020

17 Publications

2020 | 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.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 8272 | OA
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.
View | Files available | DOI | arXiv
 
2020 | Journal Article | IST-REx-ID: 8789 | OA
Prioritised learning in snowdrift-type games
M. Kleshnina, S. Streipert, J. Filar, K. Chatterjee, Mathematics 8 (2020).
View | Files available | DOI
 
2021 | Journal Article | IST-REx-ID: 9381 | OA
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).
View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 10002 | OA
Symbolic time and space tradeoffs for probabilistic verification
K. Chatterjee, W. Dvorak, M. 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.
View | DOI | Download Preprint (ext.) | arXiv
 
2021 | 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.
View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 10054 | OA
Faster algorithms for bounded liveness in graphs and game graphs
K. Chatterjee, M. Henzinger, S.S. Kale, A. Svozil, in:, 48th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
View | Files available | DOI | Download Published Version (ext.)
 
2021 | Journal Article | IST-REx-ID: 9640 | OA
Fast and strong amplifiers of natural selection
J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Nature Communications 12 (2021).
View | Files available | DOI | PubMed | Europe PMC
 
2021 | Conference Paper | IST-REx-ID: 9644 | OA
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.
View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Conference Paper | IST-REx-ID: 9645 | OA
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.
View | DOI | Download Submitted Version (ext.)
 
2021 | 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.
View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Thesis | IST-REx-ID: 10199 | OA
Improved verification techniques for concurrent systems
V. Toman, Improved Verification Techniques for Concurrent Systems, IST Austria, 2021.
View | Files available | DOI
 
2021 | 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).
View | Files available | DOI | arXiv
 
2021 | 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.
View | Files available | DOI | Download Published Version (ext.) | arXiv
 
2021 | Thesis | IST-REx-ID: 10293
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.
View | Files available | DOI
 
2021 | 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).
View | Files available | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 
2021 | Journal Article | IST-REx-ID: 9402
A unified framework of direct and indirect reciprocity
L. Schmid, K. Chatterjee, C. Hilbe, M.A. Nowak, Nature Human Behaviour (2021).
View | Files available | DOI