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

Benveniste, A., Nickovic, D., Caillaud, B., Passerone, R., Raclet, J. B., Reinkemeier, P.,https://doi.org/10.1561/1000000053__Larsen, K. G. (2018). Contracts for system design. Foundations and Trends in Electronic Design Automation. Now Publishers.https://doi.org/10.1561/1000000053 
LibreCat: https://research-explorer.ista.ac.at/record/5677
DOI: 10.1561/1000000053

Mciver, A., Morgan, C., Kaminski, B. L., &; Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3158121 
LibreCat: https://research-explorer.ista.ac.at/record/10418
DOI: 10.1145/3158121
arXiv: 1711.03588

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

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

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.23638/LMCS-13(3:23)2017 
LibreCat: https://research-explorer.ista.ac.at/record/465
DOI: 10.23638/LMCS-13(3:23)2017

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, &; R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer.https://doi.org/10.1007/978-3-319-63121-9_18 
LibreCat: https://research-explorer.ista.ac.at/record/625
DOI: 10.1007/978-3-319-63121-9_18

Bak, S., Bogomolov, S., Henzinger, T. A., &; Kumar, A. (2017). Challenges and tool implementation of hybrid rapidly exploring random trees. In A. Abate &; S. Bodo (Eds.) (Vol. 10381, pp. 83–89). Presented at the NSV: Numerical Software Verification, Heidelberg, Germany: Springer.https://doi.org/10.1007/978-3-319-63501-9_6 
LibreCat: https://research-explorer.ista.ac.at/record/633
DOI: 10.1007/978-3-319-63501-9_6

Bakhirkin, A., Ferrere, T., Maler, O., &; Ulus, D. (2017). On the quantitative semantics of regular expressions over real-valued signals. In A. Abate &; G. Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer.https://doi.org/10.1007/978-3-319-65765-3_11 
LibreCat: https://research-explorer.ista.ac.at/record/636
DOI: 10.1007/978-3-319-65765-3_11

Bogomolov, S., Martel, M., &; Prabhakar, P. (Eds.). (2017). Numerical Software Verification (Vol. 10152). Presented at the NSV: Numerical Software Verification, Toronto, ON, Canada: Springer.https://doi.org/10.1007/978-3-319-54292-8 
LibreCat: https://research-explorer.ista.ac.at/record/638
DOI: 10.1007/978-3-319-54292-8

Henzinger, T. A., Kragl, B., &; Qadeer, S. (2017). Synchronizing the asynchronous. IST Austria.https://doi.org/10.15479/AT:IST-2018-853-v2-2 
LibreCat: https://research-explorer.ista.ac.at/record/6426
DOI: 10.15479/AT:IST-2018-853-v2-2

Kong, H., Bogomolov, S., Schilling, C., Jiang, Y., &; Henzinger, T. A. (2017). Safety verification of nonlinear hybrid systems based on invariant clusters. In Proceedings of the 20th International Conference on Hybrid Systems (pp. 163–172). Pittsburgh, PA, United States: ACM.https://doi.org/10.1145/3049797.3049814 
LibreCat: https://research-explorer.ista.ac.at/record/663
DOI: 10.1145/3049797.3049814

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2017.5 
LibreCat: https://research-explorer.ista.ac.at/record/711
DOI: 10.4230/LIPIcs.CONCUR.2017.5

Avni, G., Guha, S., &; Kupferman, O. (2017). Timed network games with clocks (Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2017.37 
LibreCat: https://research-explorer.ista.ac.at/record/963
DOI: 10.4230/LIPIcs.MFCS.2017.37

Le, X., Chu, D. H., Lo, D., Le Goues, C., &; Visser, W. (2017). JFIX: Semantics-based repair of Java programs via symbolic  PathFinder. In Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis (pp. 376–379). Santa Barbara, CA, United States: ACM.https://doi.org/10.1145/3092703.3098225 
LibreCat: https://research-explorer.ista.ac.at/record/941
DOI: 10.1145/3092703.3098225

Avni, G., Henzinger, T. A., &; Chonev, V. K. (2017). Infinite-duration bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2017.21 
LibreCat: https://research-explorer.ista.ac.at/record/950
DOI: 10.4230/LIPIcs.CONCUR.2017.21
arXiv: 1705.01433

Daca, P. (2017). Statistical and logical methods for property checking. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:TH_730 
LibreCat: https://research-explorer.ista.ac.at/record/1155
DOI: 10.15479/AT:ISTA:TH_730

Bogomolov, S., Giacobbe, M., Henzinger, T. A., &; Kong, H. (2017). Conic abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer.https://doi.org/10.1007/978-3-319-65765-3_7 
LibreCat: https://research-explorer.ista.ac.at/record/647
DOI: 10.1007/978-3-319-65765-3_7

Bogomolov, S., Frehse, G., Giacobbe, M., &; Henzinger, T. A. (2017). Counterexample guided refinement of template polyhedra (Vol. 10205, pp. 589–606). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden: Springer.https://doi.org/10.1007/978-3-662-54577-5_34 
LibreCat: https://research-explorer.ista.ac.at/record/631
DOI: 10.1007/978-3-662-54577-5_34

Svoreová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cbrná, I., &; Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier.https://doi.org/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