Ferrere, Thomas. The Compound Interest in Relaxing Punctuality. Vol. 10951, Springer, 2018, pp. 147–64, doi:10.1007/978-3-319-95582-7_9.
LibreCat: https://research-explorer.ista.ac.at/record/156
DOI: 10.1007/978-3-319-95582-7_9
WoS: 000489765800009

Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.”10.1109/emsoft.2018.8537203__2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10, doi:10.1109/emsoft.2018.8537203.
LibreCat: https://research-explorer.ista.ac.at/record/5959
DOI: 10.1109/emsoft.2018.8537203
WoS: 000492828500005

Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.
LibreCat: https://research-explorer.ista.ac.at/record/24
DOI: 10.24963/ijcai.2018/652
WoS: 000764175404117
arXiv: 1804.10601

Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.”10.3390/g9030039__Games, vol. 9, no. 3, 39, MDPI AG, 2018, doi:10.3390/g9030039.
LibreCat: https://research-explorer.ista.ac.at/record/6006
DOI: 10.3390/g9030039

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

Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.”10.1145/3158121__Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:10.1145/3158121.
LibreCat: https://research-explorer.ista.ac.at/record/10418
DOI: 10.1145/3158121
arXiv: 1711.03588

Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.”10.1145/3060139__ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139.
LibreCat: https://research-explorer.ista.ac.at/record/471
DOI: 10.1145/3060139

Chatterjee, Krishnendu, et al. “Nested Weighted Automata.”10.1145/3152769__ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.
LibreCat: https://research-explorer.ista.ac.at/record/467
DOI: 10.1145/3152769
arXiv: 1606.03598

Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.”10.23638/LMCS-13(3:23)2017__Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi: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, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.”10.1007/978-3-319-63121-9_18__Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi: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, Stanley, et al. Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees. Edited by Alessandro Abate and Sylvie Bodo, vol. 10381, Springer, 2017, pp. 83–89, doi: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, Alexey, et al. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi: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, Sergiy, et al., editors. Numerical Software Verification. Vol. 10152, Springer, 2017, doi: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, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi: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, Hui, et al. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.”10.1145/3049797.3049814__Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–72, doi:10.1145/3049797.3049814.
LibreCat: https://research-explorer.ista.ac.at/record/663
DOI: 10.1145/3049797.3049814

Chatterjee, Krishnendu, et al. Bidirectional Nested Weighted Automata. Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.5.
LibreCat: https://research-explorer.ista.ac.at/record/711
DOI: 10.4230/LIPIcs.CONCUR.2017.5

Avni, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37.
LibreCat: https://research-explorer.ista.ac.at/record/963
DOI: 10.4230/LIPIcs.MFCS.2017.37

Le, Xuan, et al. “JFIX: Semantics-Based Repair of Java Programs via Symbolic  PathFinder.”10.1145/3092703.3098225__Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2017, pp. 376–79, doi:10.1145/3092703.3098225.
LibreCat: https://research-explorer.ista.ac.at/record/941
DOI: 10.1145/3092703.3098225

Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi: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, Przemyslaw. Statistical and Logical Methods for Property Checking. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:TH_730.
LibreCat: https://research-explorer.ista.ac.at/record/1155
DOI: 10.15479/AT:ISTA:TH_730