H. Kong, E. Bartocci, and T. A. Henzinger, “Reachable set over-approximation for nonlinear systems using piecewise barrier tubes,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 449–467.
LibreCat: https://research-explorer.ista.ac.at/record/142
DOI: 10.1007/978-3-319-96145-3_24
WoS: 000491481600024

Y. Jiang et al., “Safety-assured model-driven design of the multifunction vehicle bus controller,” IEEE Transactions on Intelligent Transportation Systems, vol. 19, no. 10. IEEE, pp. 3320–3333, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/434
DOI: 10.1109/TITS.2017.2778077
WoS: 000446651100020

G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 468–486.
LibreCat: https://research-explorer.ista.ac.at/record/140
DOI: 10.1007/978-3-319-96145-3_25
WoS: 000491481600025

T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.
LibreCat: https://research-explorer.ista.ac.at/record/297
DOI: 10.1007/978-3-319-89960-2_21
WoS: 000546326300021

G. Avni and O. Kupferman, “Synthesis from component libraries with costs,” Theoretical Computer Science, vol. 712. Elsevier, pp. 50–72, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/608
DOI: 10.1016/j.tcs.2017.11.001
WoS: 000424959200003

T. Ferrere, “The compound interest in relaxing punctuality,” presented at the FM: International Symposium on Formal Methods, Oxford, UK, 2018, vol. 10951, pp. 147–164.
LibreCat: https://research-explorer.ista.ac.at/record/156
DOI: 10.1007/978-3-319-95582-7_9
WoS: 000489765800009

A. Bakhirkin, T. Ferrere, T. A. Henzinger, and D. Nickovicl, “Keynote: The first-order logic of signals,” in 2018 International Conference on Embedded Software, Turin, Italy, 2018, pp. 1–10.
LibreCat: https://research-explorer.ista.ac.at/record/5959
DOI: 10.1109/emsoft.2018.8537203
WoS: 000492828500005

K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.
LibreCat: https://research-explorer.ista.ac.at/record/24
DOI: 10.24963/ijcai.2018/652
WoS: 000764175404117
arXiv: 1804.10601

G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” Games, vol. 9, no. 3. MDPI AG, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/6006
DOI: 10.3390/g9030039

A. Benveniste et al., “Contracts for system design,” Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3. Now Publishers, pp. 124–400, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/5677
DOI: 10.1561/1000000053

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

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

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

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

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

S. Bak, S. Bogomolov, T. A. Henzinger, and A. Kumar, “Challenges and tool implementation of hybrid rapidly exploring random trees,” presented at the NSV: Numerical Software Verification, Heidelberg, Germany, 2017, vol. 10381, pp. 83–89.
LibreCat: https://research-explorer.ista.ac.at/record/633
DOI: 10.1007/978-3-319-63501-9_6

A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics of regular expressions over real-valued signals,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 189–206.
LibreCat: https://research-explorer.ista.ac.at/record/636
DOI: 10.1007/978-3-319-65765-3_11

S. Bogomolov, M. Martel, and P. Prabhakar, Eds., Numerical Software Verification, vol. 10152. Springer, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/638
DOI: 10.1007/978-3-319-54292-8

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

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