An abstraction-refinement methodology for reasoning about network games
G. Avni, S. Guha, O. Kupferman, Games 9 (2018).
LibreCat: https://research-explorer.ista.ac.at/record/6006
DOI: 10.3390/g9030039

Contracts for system design
A. Benveniste, D. Nickovic, B. Caillaud, R. Passerone, J.B. Raclet, P. Reinkemeier, A. Sangiovanni-Vincentelli, W. Damm, T.A. Henzinger, K.G. Larsen, Foundations and Trends in Electronic Design Automation 12 (2018) 124–400.
LibreCat: https://research-explorer.ista.ac.at/record/5677
DOI: 10.1561/1000000053

A new proof rule for almost-sure termination
A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).
LibreCat: https://research-explorer.ista.ac.at/record/10418
DOI: 10.1145/3158121
arXiv: 1711.03588

Faster statistical model checking for unbounded temporal properties
P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).
LibreCat: https://research-explorer.ista.ac.at/record/471
DOI: 10.1145/3060139

Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).
LibreCat: https://research-explorer.ista.ac.at/record/467
DOI: 10.1145/3152769
arXiv: 1606.03598