Banerjee, Tamajit, et al. “Fast Symbolic Algorithms for Mega-Regular Games under Strong Transition Fairness.”10.46298/theoretics.23.4__TheoretiCS, vol. 2, 4, EPI Sciences, 2023, doi:10.46298/theoretics.23.4.
LibreCat: https://research-explorer.ista.ac.at/record/14920
DOI: 10.46298/theoretics.23.4
arXiv: 2202.07480

Majumdar, Rupak, et al. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.”10.1007/978-3-031-37709-9_1__35th International Conference on Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 3–15, doi:10.1007/978-3-031-37709-9_1.
LibreCat: https://research-explorer.ista.ac.at/record/14758
DOI: 10.1007/978-3-031-37709-9_1

Ferrere, Thomas, et al. A Theory of Register Monitors. Vol. Part 8033, IEEE, 2018, pp. 394–403, doi:10.1145/3209108.3209194.
LibreCat: https://research-explorer.ista.ac.at/record/144
DOI: 10.1145/3209108.3209194
WoS: 000545262800041

Svoreová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”10.1016/j.nahs.2016.04.006__Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:10.1016/j.nahs.2016.04.006.
LibreCat: https://research-explorer.ista.ac.at/record/1407
DOI: 10.1016/j.nahs.2016.04.006
WoS: 000390637000014
arXiv: 1410.5387

Haas, Andreas, et al. “Local Linearizability for Concurrent Container-Type Data Structures.”10.4230/LIPIcs.CONCUR.2016.6__Leibniz International Proceedings in Informatics, vol. 59, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.6.
LibreCat: https://research-explorer.ista.ac.at/record/1095
DOI: 10.4230/LIPIcs.CONCUR.2016.6

Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.”10.1145/2491956.2462184__Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–31, doi:10.1145/2491956.2462184.
LibreCat: https://research-explorer.ista.ac.at/record/2301
DOI: 10.1145/2491956.2462184

Zufferey, Damien. Analysis of Dynamic Message Passing Programs. Institute of Science and Technology Austria, 2013, doi:10.15479/at:ista:1405.
LibreCat: https://research-explorer.ista.ac.at/record/1405
DOI: 10.15479/at:ista:1405

Henzinger, Thomas A., and Maria Mateescu. “The Propagation Approach for Computing Biochemical Reaction Networks.”10.1109/TCBB.2012.91__IEEE ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2, IEEE, 2012, pp. 310–22, doi:10.1109/TCBB.2012.91.
LibreCat: https://research-explorer.ista.ac.at/record/2302
DOI: 10.1109/TCBB.2012.91
PMID: 22778152

Henzinger, Thomas A., and Maria Mateescu. Propagation Models for Computing Biochemical Reaction Networks. Springer, 2011, pp. 1–3, doi:10.1145/2037509.2037510.
LibreCat: https://research-explorer.ista.ac.at/record/3299
DOI: 10.1145/2037509.2037510

Henzinger, Thomas A., et al. Invariant and Type Inference for Matrices. Vol. 5944, Springer, 2010, pp. 163–79, doi:10.1007/978-3-642-11319-2_14.
LibreCat: https://research-explorer.ista.ac.at/record/3839
DOI: 10.1007/978-3-642-11319-2_14

Kuncak, Viktor, et al. Building a Calculus of Data Structures. Edited by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44, doi:10.1007/978-3-642-11319-2_6.
LibreCat: https://research-explorer.ista.ac.at/record/4378
DOI: 10.1007/978-3-642-11319-2_6

Beyer, Dirk, et al. Shape Refinement through Explicit Heap Analysis. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 263–77, doi:10.1007/978-3-642-12029-9_19.
LibreCat: https://research-explorer.ista.ac.at/record/4396
DOI: 10.1007/978-3-642-12029-9_19