Trinh, Giang, Belaid Benhamou, Samuel Pastva, and Sylvain Soliman. “Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming.”https://doi.org/10.1609/aaai.v38i9.28943__In Proceedings of the 38th AAAI Conference on Artificial Intelligence, 38:10714–22. Association for the Advancement of Artificial Intelligence, 2024.https://doi.org/10.1609/aaai.v38i9.28943 .

Chalupa, Marek, and Thomas A Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.”https://doi.org/10.1007/978-3-031-30820-8_32__In Tools and Algorithms for the Construction and Analysis of Systems, 13994:535–40. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30820-8_32 .

Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. “Vamos: Middleware for Best-Effort Third-Party Monitoring.”https://doi.org/10.1007/978-3-031-30826-0_15__In Fundamental Approaches to Software Engineering, 13991:260–81. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30826-0_15 .

Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023.https://doi.org/10.15479/AT:ISTA:12407 .

Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.”https://doi.org/10.1007/978-3-031-30823-9_1__In Tools and Algorithms for the Construction and Analysis of Systems , 13993:3–25. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30823-9_1 .

Anand, Ashwani, Kaushik Mallik, Satya Prakash Nayak, and Anne Kathrin Schmuck. “Computing Adequately Permissive Assumptions for Synthesis.”https://doi.org/10.1007/978-3-031-30820-8_15__In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, 13994:211–28. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30820-8_15 .

Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Safety and Liveness.”https://doi.org/10.1007/978-3-031-30829-1_17__In 26th International Conference Foundations of Software Science and Computation Structures, 13992:349–70. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30829-1_17 .

Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Regular Methods for Operator Precedence Languages.”https://doi.org/10.4230/LIPIcs.ICALP.2023.129__In 50th International Colloquium on Automata, Languages, and Programming, 261:129:1--129:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.ICALP.2023.129 .

Lechner, Mathias, Alexander Amini, Daniela Rus, and Thomas A Henzinger. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.”https://doi.org/10.1109/LRA.2023.3240930__IEEE Robotics and Automation Letters. Institute of Electrical and Electronics Engineers, 2023.https://doi.org/10.1109/LRA.2023.3240930 .

Benes, Nikola, Lubos Brim, Ondej Huvar, Samuel Pastva, and David Safránek. “Boolean Network Sketches: A Unifying Framework for Logical Model Inference.”https://doi.org/10.1093/bioinformatics/btad158__Bioinformatics. Oxford Academic, 2023.https://doi.org/10.1093/bioinformatics/btad158 .

Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, Thomas A Henzinger, and Daniela Rus. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.”https://doi.org/10.1609/aaai.v37i12.26747__In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:14964–73. Association for the Advancement of Artificial Intelligence, 2023.https://doi.org/10.1609/aaai.v37i12.26747 .

Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Bidding Graph Games with Partially-Observable Budgets.”https://doi.org/10.1609/aaai.v37i5.25679__In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:5464–71, 2023.https://doi.org/10.1609/aaai.v37i5.25679 .

Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness.”https://doi.org/10.1007/978-3-031-37703-7_17__In Computer Aided Verification, 13965:358–382. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-37703-7_17 .

Boker, Udi, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Safety and Liveness of Quantitative Automata.”https://doi.org/10.4230/LIPIcs.CONCUR.2023.17__In 34th International Conference on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.CONCUR.2023.17 .

Bartocci, Ezio, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Hypernode Automata.”https://doi.org/10.4230/LIPIcs.CONCUR.2023.21__In 34th International Conference on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.CONCUR.2023.21 .

Henzinger, Thomas A, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness under Partial Observations.”https://doi.org/10.1007/978-3-031-44267-4_15__In 23rd International Conference on Runtime Verification, 14245:291–311. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-44267-4_15 .

Avni, Guy, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, and Dorde Zikelic. “Reachability Poorman Discrete-Bidding Games.”https://doi.org/10.3233/FAIA230264__In Frontiers in Artificial Intelligence and Applications, 372:141–48. IOS Press, 2023.https://doi.org/10.3233/FAIA230264 .

Ansaripour, Matin, Krishnendu Chatterjee, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.”https://doi.org/10.1007/978-3-031-45329-8_17__In 21st International Symposium on Automated Technology for Verification and Analysis, 14215:357–79. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-45329-8_17 .

Trinh, Van Giang, Belaid Benhamou, Thomas A Henzinger, and Samuel Pastva. “Trap Spaces of Multi-Valued Networks: Definition, Computation, and Applications.”https://doi.org/10.1093/bioinformatics/btad262__Bioinformatics. Oxford Academic, 2023.https://doi.org/10.1093/bioinformatics/btad262 .

Majumdar, Rupak, Kaushik Mallik, Anne Kathrin Schmuck, and Sadegh Soudjani. “Symbolic Control for Stochastic Systems via Finite Parity Games.”https://doi.org/10.1016/j.nahs.2023.101430__Nonlinear Analysis: Hybrid Systems. Elsevier, 2023.https://doi.org/10.1016/j.nahs.2023.101430 .

Pastva, Samuel, and Thomas A Henzinger. “Binary Decision Diagrams on Modern Hardware.”https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20__In Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, 122–31. TU Vienna Academic Press, 2023.https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20 .

Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”https://doi.org/10.1609/aaai.v37i10.26407__In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:11926–35. Association for the Advancement of Artificial Intelligence, 2023.https://doi.org/10.1609/aaai.v37i10.26407 .

Kueffner, Konstantin, Anna Lukina, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks (Extended Version).”https://doi.org/10.1007/s10009-023-00711-4__International Journal on Software Tools for Technology Transfer. Springer Nature, 2023.https://doi.org/10.1007/s10009-023-00711-4 .

Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. “Fast Symbolic Algorithms for Mega-Regular Games under Strong Transition Fairness.”https://doi.org/10.46298/theoretics.23.4__TheoretiCS. EPI Sciences, 2023.https://doi.org/10.46298/theoretics.23.4 .

Benes, Nikola, Lubos Brim, Samuel Pastva, David Safránek, and Eva Smijáková. “Phenotype Control of Partially Specified Boolean Networks.”https://doi.org/10.1007/978-3-031-42697-1_2__In 21st International Conference on Computational Methods in Systems Biology, 14137:18–35. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-42697-1_2 .

Majumdar, Rupak, Kaushik Mallik, Mateusz Rychlicki, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.”https://doi.org/10.1007/978-3-031-37709-9_1__In 35th International Conference on Computer Aided Verification, 13966:3–15. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-37709-9_1 .

Majumdar, Rupak, Kaushik Mallik, Mateusz Rychlicki, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.”https://doi.org/10.5281/ZENODO.7877790__Zenodo, 2023.https://doi.org/10.5281/ZENODO.7877790 .

Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In 37th Conference on Neural Information Processing Systems, 2023.

Chalupa, Marek, and Thomas A Henzinger. “Monitoring Hyperproperties with Prefix Transducers.”https://doi.org/10.1007/978-3-031-44267-4_9__In 23nd International Conference on Runtime Verification, 14245:168–90. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-44267-4_9 .

Chalupa, Marek, and Thomas A Henzinger. “Monitoring Hyperproperties with Prefix Transducers.”https://doi.org/10.5281/ZENODO.8191723__Zenodo, 2023.https://doi.org/10.5281/ZENODO.8191723 .

Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik. “Runtime Monitoring of Dynamic Fairness Properties.”https://doi.org/10.1145/3593013.3594028__In FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, 604–14. Association for Computing Machinery, 2023.https://doi.org/10.1145/3593013.3594028 .

Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira Da Costa. “Flavors of Sequential Information Flow.”https://doi.org/10.1007/978-3-030-94583-1_1__In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 13182:1–19. Springer Nature, 2022.https://doi.org/10.1007/978-3-030-94583-1_1 .

Brunnbauer, Axel, Luigi Berducci, Andreas Brandstatter, Mathias Lechner, Ramin Hasani, Daniela Rus, and Radu Grosu. “Latent Imagination Facilitates Zero-Shot Transfer in Autonomous Racing.”https://doi.org/10.1109/ICRA46639.2022.9811650__In 2022 International Conference on Robotics and Automation, 7513–20. IEEE, 2022.https://doi.org/10.1109/ICRA46639.2022.9811650 .

Garcia Soto, Miriam, Thomas A Henzinger, and Christian Schilling. “Synthesis of Parametric Hybrid Automata from Time Series.”https://doi.org/10.1007/978-3-031-19992-9_22__In 20th International Symposium on Automated Technology for Verification and Analysis, 13505:337–53. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-19992-9_22 .

Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic Timed Automata.”https://doi.org/10.4230/LIPIcs.CONCUR.2022.14__In 33rd International Conference on Concurrency Theory, 243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.CONCUR.2022.14 .

Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games on Graphs.”https://doi.org/10.4230/LIPIcs.MFCS.2022.3__In 47th International Symposium on Mathematical Foundations of Computer Science, 241:3:1-3:6. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.MFCS.2022.3 .

Lechner, Mathias, Alexander Amini, Daniela Rus, and Thomas A Henzinger. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.”https://doi.org/10.48550/arXiv.2204.07373__ArXiv, n.d.https://doi.org/10.48550/arXiv.2204.07373 .

Henzinger, Thomas A. “Quantitative Monitoring of Software.”https://doi.org/10.1007/978-3-030-95561-8_1__In Software Verification, 13124:3–6. LNCS. Springer Nature, 2022.https://doi.org/10.1007/978-3-030-95561-8_1 .

Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira Da Costa. “Information-Flow Interfaces.”https://doi.org/10.1007/978-3-030-99429-7_1__In Fundamental Approaches to Software Engineering, 13241:3–22. Springer Nature, 2022.https://doi.org/10.1007/978-3-030-99429-7_1 .

Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Abstract Monitors for Quantitative Specifications.”https://doi.org/10.1007/978-3-031-17196-3_11__In 22nd International Conference on Runtime Verification, 13498:200–220. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-17196-3_11 .

Hasani, Ramin, Mathias Lechner, Alexander Amini, Lucas Liebenwein, Aaron Ray, Max Tschaikowski, Gerald Teschl, and Daniela Rus. “Closed-Form Continuous-Time Neural Networks.”https://doi.org/10.1038/s42256-022-00556-7__Nature Machine Intelligence. Springer Nature, 2022.https://doi.org/10.1038/s42256-022-00556-7 .

Lechner, Mathias. “Learning Verifiable Representations.”https://doi.org/10.15479/at:ista:11362__Institute of Science and Technology Austria, 2022.https://doi.org/10.15479/at:ista:11362 .

Doveri, Kyveli, Pierre Ganty, and Nicolas Adrien Mazzocchi. “FORQ-Based Language Inclusion Formal Testing.”https://doi.org/10.1007/978-3-031-13188-2_6__In Computer Aided Verification, 13372:109–29. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-13188-2_6 .

Bose, Sougata, Thomas A Henzinger, Karoliina Lehtinen, Sven Schewe, and Patrick Totzke. “History-Deterministic Timed Automata Are Not Determinizable.”https://doi.org/10.1007/978-3-031-19135-0_5__In 16th International Conference on Reachability Problems, 13608:67–76. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-19135-0_5 .

Gruenbacher, Sophie A., Mathias Lechner, Ramin Hasani, Daniela Rus, Thomas A Henzinger, Scott A. Smolka, and Radu Grosu. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.”https://doi.org/10.1609/aaai.v36i6.20631__Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022.https://doi.org/10.1609/aaai.v36i6.20631 .

Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.”https://doi.org/10.1609/aaai.v36i7.20695__Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022.https://doi.org/10.1609/aaai.v36i7.20695 .

Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger. “Learning Stabilizing Policies in Stochastic Control Systems.”https://doi.org/10.48550/arXiv.2205.11991__ArXiv, n.d.https://doi.org/10.48550/arXiv.2205.11991 .

Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”https://doi.org/10.48550/ARXIV.2210.05308__ArXiv, n.d.https://doi.org/10.48550/ARXIV.2210.05308 .

Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.”https://doi.org/10.1145/3485504__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021.https://doi.org/10.1145/3485504 .

Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic Guarantees.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:11525–35. AAAI Press, 2021.

Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “Liquid Time-Constant Networks.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:7657–66. AAAI Press, 2021.

Babaiee, Zahra, Ramin Hasani, Mathias Lechner, Daniela Rus, and Radu Grosu. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” In Proceedings of the 38th International Conference on Machine Learning, 139:478–89. ML Research Press, 2021.

Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In 35th Conference on Neural Information Processing Systems, 2021.

Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.”https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23__In Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021.https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23 .

Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.”https://doi.org/10.48550/arXiv.2103.11389__ArXiv, n.d.https://doi.org/10.48550/arXiv.2103.11389 .

Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:3787–95. AAAI Press, 2021.

Lechner, Mathias, Ðore dikeli, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.”https://doi.org/10.48550/arXiv.2111.03165__In 35th Conference on Neural Information Processing Systems, 2021.https://doi.org/10.48550/arXiv.2111.03165 .

Sarac, Naci E, Ömer Faruk Altun, Kamil Tolga Atam, Sertac Karahoda, Kamer Kaya, and Hüsnü Yenigün. “Boosting Expensive Synchronizing Heuristics.”https://doi.org/10.1016/j.eswa.2020.114203__Expert Systems with Applications. Elsevier, 2021.https://doi.org/10.1016/j.eswa.2020.114203 .

Garcia Soto, Miriam, Thomas A Henzinger, and Christian Schilling. “Synthesis of Hybrid Automata with Affine Dynamics from Time-Series Data.”https://doi.org/10.1145/3447928.3456704__In HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control, 2102.12734. Association for Computing Machinery, 2021.https://doi.org/10.1145/3447928.3456704 .

Avni, Guy, Thomas A Henzinger, and ore dikeli. “Bidding Mechanisms in Graph Games.”https://doi.org/10.1016/j.jcss.2021.02.008__Journal of Computer and System Sciences. Elsevier, 2021.https://doi.org/10.1016/j.jcss.2021.02.008 .

Henzinger, Thomas A, and Naci E Sarac. “Quantitative and Approximate Monitoring.”https://doi.org/10.1109/LICS52264.2021.9470547__In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers, 2021.https://doi.org/10.1109/LICS52264.2021.9470547 .

Petrov, Tatjana, Claudia Igler, Ali Sezgin, Thomas A Henzinger, and Calin C Guet. “Long Lived Transients in Gene Regulation.”https://doi.org/10.1016/j.tcs.2021.05.023__Theoretical Computer Science. Elsevier, 2021.https://doi.org/10.1016/j.tcs.2021.05.023 .

Mühlböck, Fabian, and Thomas A Henzinger. “Differential Monitoring.”https://doi.org/10.1007/978-3-030-88494-9_12__In International Conference on Runtime Verification, 12974:231–43. Cham: Springer Nature, 2021.https://doi.org/10.1007/978-3-030-88494-9_12 .

Mühlböck, Fabian, and Thomas A Henzinger. Differential Monitoring. IST Austria, 2021.https://doi.org/10.15479/AT:ISTA:9946 .

Sietzen, Stefan, Mathias Lechner, Judy Borowski, Ramin Hasani, and Manuela Waldner. “Interactive Analysis of CNN Robustness.”https://doi.org/10.1111/cgf.14418__Computer Graphics Forum. Wiley, 2021.https://doi.org/10.1111/cgf.14418 .

Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games.”https://doi.org/10.23638/LMCS-17(1:10)2021__Logical Methods in Computer Science. International Federation for Computational Logic, 2021.https://doi.org/10.23638/LMCS-17(1:10)2021 .

Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.”https://doi.org/10.1109/ICRA48506.2021.9561036__In 2021 IEEE International Conference on Robotics and Automation, 4140–47. ICRA, 2021.https://doi.org/10.1109/ICRA48506.2021.9561036 .

Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks.”https://doi.org/10.1007/978-3-030-88494-9_3__In 21st International Conference on Runtime Verification, 12974:42–61. Cham: Springer Nature, 2021.https://doi.org/10.1007/978-3-030-88494-9_3 .

Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In Proceedings of the 37th International Conference on Machine Learning, 4082–93. PMLR, 2020.

Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event Frequencies.”https://doi.org/10.4230/LIPIcs.CSL.2020.20__In 28th EACSL Annual Conference on Computer Science Logic, Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.CSL.2020.20 .

Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse, Daniel Freire, Niklas Kochdumper, et al. “ARCH-COM Category Report: Continuous and Hybrid Systems with Linear Dynamics.”https://doi.org/10.29007/7dt2__In EPiC Series in Computing, 74:16–48. EasyChair, 2020.https://doi.org/10.29007/7dt2 .

Geretti, Luca, Julien Alexandre Dit Sandretto, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Pieter Collins, et al. “ARCH-COM Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.”https://doi.org/10.29007/zkf6__In EPiC Series in Computing, 74:49–75. EasyChair, 2020.https://doi.org/10.29007/zkf6 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.”https://doi.org/10.4230/LIPIcs.CONCUR.2020.23__In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.CONCUR.2020.23 .

Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.”https://doi.org/10.4230/LIPIcs.CONCUR.2020.2__In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.CONCUR.2020.2 .

Alamdari, Par Alizadeh, Guy Avni, Thomas A Henzinger, and Anna Lukina. “Formal Methods with a Touch of Magic.”https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21__In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, 138–47. TU Wien Academic Press, 2020.https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21 .

Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” In Advances in Neural Information Processing Systems, 33:18098–109. Curran Associates, 2020.

Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam, Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.”https://doi.org/10.1109/CDC42340.2020.9304042__In Proceedings of the 59th IEEE Conference on Decision and Control, 2020:1556–63. IEEE, 2020.https://doi.org/10.1109/CDC42340.2020.9304042 .

Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In 8th International Conference on Learning Representations. ICLR, 2020.

Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits Does It Take to Quantize Your Neural Network?”https://doi.org/10.1007/978-3-030-45237-7_5__In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12079:79–97. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-45237-7_5 .

Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games.”https://doi.org/10.1016/j.tcs.2019.06.031__Theoretical Computer Science. Elsevier, 2020.https://doi.org/10.1016/j.tcs.2019.06.031 .

Henzinger, Thomas A, Anna Lukina, and Christian Schilling. “Outside the Box: Abstraction-Based Monitoring of Neural Networks.”https://doi.org/10.3233/FAIA200375__In 24th European Conference on Artificial Intelligence, 325:2433–40. IOS Press, 2020.https://doi.org/10.3233/FAIA200375 .

Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir Rakamari. “An SMT Theory of Fixed-Point Arithmetic.”https://doi.org/10.1007/978-3-030-51074-9_2__In Automated Reasoning, 12166:13–31. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-51074-9_2 .

Lechner, Mathias, Ramin Hasani, Alexander Amini, Thomas A Henzinger, Daniela Rus, and Radu Grosu. “Neural Circuit Policies Enabling Auditable Autonomy.”https://doi.org/10.1038/s42256-020-00237-3__Nature Machine Intelligence. Springer Nature, 2020.https://doi.org/10.1038/s42256-020-00237-3 .

Lechner, Mathias, Ramin Hasani, Daniela Rus, and Radu Grosu. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.”https://doi.org/10.1109/ICRA40945.2020.9196608__In Proceedings - IEEE International Conference on Robotics and Automation, 5446–52. IEEE, 2020.https://doi.org/10.1109/ICRA40945.2020.9196608 .

Forets, Marcelo, Daniel Freire, and Christian Schilling. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with  Time-Triggered Transitions.”https://doi.org/10.1109/MEMOCODE51338.2020.9314994__In 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. IEEE, 2020.https://doi.org/10.1109/MEMOCODE51338.2020.9314994 .

Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” In Proceedings of the International Conference on Embedded Software, 2020.

Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.”https://doi.org/10.1109/TCAD.2020.3012859__IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE, 2020.https://doi.org/10.1109/TCAD.2020.3012859 .

Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.”https://doi.org/10.1609/aaai.v34i02.5546__Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020.https://doi.org/10.1609/aaai.v34i02.5546 .

Henzinger, Thomas A, and Naci E Sarac. “Monitorability under Assumptions.”https://doi.org/10.1007/978-3-030-60508-7_1__In Runtime Verification, 12399:3–18. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-60508-7_1 .

Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.”https://doi.org/10.1007/978-3-030-53288-8_14__In Computer Aided Verification, 12224:275–98. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-53288-8_14 .

Kragl, Bernhard, Constantin Enea, Thomas A Henzinger, Suha Orhun Mutluergil, and Shaz Qadeer. “Inductive Sequentialization of Asynchronous Programs.”https://doi.org/10.1145/3385412.3385980__In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 227–42. Association for Computing Machinery, 2020.https://doi.org/10.1145/3385412.3385980 .

Nickovic, Dejan, Olivier Lebeltel, Oded Maler, Thomas Ferrere, and Dogan Ulus. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic.”https://doi.org/10.1007/s10009-020-00582-z__International Journal on Software Tools for Technology Transfer. Springer Nature, 2020.https://doi.org/10.1007/s10009-020-00582-z .

Kragl, Bernhard. “Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization.”https://doi.org/10.15479/AT:ISTA:8332__Institute of Science and Technology Austria, 2020.https://doi.org/10.15479/AT:ISTA:8332 .

Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.”https://doi.org/10.1109/RTSS49844.2020.00031__In 2020 IEEE Real-Time Systems Symposium, 244–56. IEEE, 2020.https://doi.org/10.1109/RTSS49844.2020.00031 .

Garcia Soto, Miriam, and Pavithra Prabhakar. “Abstraction Based Verification of Stability of Polyhedral Switched Systems.”https://doi.org/10.1016/j.nahs.2020.100856__Nonlinear Analysis: Hybrid Systems. Elsevier, 2020.https://doi.org/10.1016/j.nahs.2020.100856 .

Frehse, Goran, Alessandro Abate, Dieky Adzkiya, Anna Becchi, Lei Bu, Alessandro Cimatti, Mirco Giacobbe, et al. “ARCH-COM Category Report: Hybrid Systems with Piecewise Constant Dynamics.”https://doi.org/10.29007/rjwn__In ARC. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, 61:1–13. EasyChair, 2019.https://doi.org/10.29007/rjwn .

Kundu, Atreyee, Miriam Garcia Soto, and Pavithra Prabhakar. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.”https://doi.org/10.1109/INDIANCC.2019.8715598__In 5th Indian Control Conference Proceedings. IEEE, 2019.https://doi.org/10.1109/INDIANCC.2019.8715598 .

Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.”https://doi.org/10.1007/978-3-030-30806-3_1__In https://doi.org/10.1007/978-3-030-30806-3_1__Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019.https://doi.org/10.1007/978-3-030-30806-3_1 .

Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.”https://doi.org/10.1109/icra.2019.8793840__In Proceedings - IEEE International Conference on Robotics and Automation, Vol. 2019–May. IEEE, 2019.https://doi.org/10.1109/icra.2019.8793840 .

Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games,”https://doi.org/10.4230/LIPICS.CONCUR.2019.20__Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.20 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,”https://doi.org/10.4230/LIPICS.CONCUR.2019.27__Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.27 .

Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu, and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.”https://doi.org/10.1109/ijcnn.2019.8851954__In Proceedings of the International Joint Conference on Neural Networks. IEEE, 2019.https://doi.org/10.1109/ijcnn.2019.8851954 .

Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius Mikudionis. “Continuous-Time Models for System Design and Analysis.”https://doi.org/10.1007/978-3-319-91908-9_22__In Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77. LNCS. Springer Nature, 2019.https://doi.org/10.1007/978-3-319-91908-9_22 .

Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian Schilling. “ARCH-COM Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.”https://doi.org/10.29007/m75b__In EPiC Series in Computing, 61:41–61. EasyChair Publications, 2019.https://doi.org/10.29007/m75b .

Althoff, Matthias, Stanley Bak, Marcelo Forets, Goran Frehse, Niklas Kochdumper, Rajarshi Ray, Christian Schilling, and Stefan Schupp. “ARCH-COM Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.”https://doi.org/10.29007/bj1w__In EPiC Series in Computing, 61:14–40. EasyChair, 2019.https://doi.org/10.29007/bj1w .

Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in Graph Games,”https://doi.org/10.4230/LIPICS.MFCS.2019.11__Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.MFCS.2019.11 .

Christakis, Maria, Matthias Heizmann, Muhammad Numair Mansur, Christian Schilling, and Valentin Wüstholz. “Semantic Fault Localization and Suspiciousness Ranking.”https://doi.org/10.1007/978-3-030-17462-0_13__In 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , 11427:226–43. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-17462-0_13 .

Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “JuliaReach: A Toolbox for Set-Based Reachability.”https://doi.org/10.1145/3302504.3311804__In Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control, 22:39–44. ACM, 2019.https://doi.org/10.1145/3302504.3311804 .

Ferrere, Thomas, Dejan Nickovic, Alexandre Donzé, Hisahiro Ito, and James Kapinski. “Interface-Aware Signal Temporal Logic.”https://doi.org/10.1145/3302504.3311800__In Proceedings of the 2019 22nd ACM International Conference on Hybrid Systems: Computation and Control, 57–66. ACM, 2019.https://doi.org/10.1145/3302504.3311800 .

Avni, Guy, Roderick Bloem, Krishnendu Chatterjee, Thomas A Henzinger, Bettina Konighofer, and Stefan Pranger. “Run-Time Optimization for Learned Controllers through Quantitative Games.”https://doi.org/10.1007/978-3-030-25540-4_36__In 31st International Conference on Computer-Aided Verification, 11561:630–49. Springer, 2019.https://doi.org/10.1007/978-3-030-25540-4_36 .

Garcia Soto, Miriam, Thomas A Henzinger, Christian Schilling, and Luka Zeleznik. “Membership-Based Synthesis of Linear Hybrid Automata.”https://doi.org/10.1007/978-3-030-25540-4_16__In 31st International Conference on Computer-Aided Verification, 11561:297–314. Springer, 2019.https://doi.org/10.1007/978-3-030-25540-4_16 .

Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration Bidding Games.”https://doi.org/10.1145/3340295__Journal of the ACM. ACM, 2019.https://doi.org/10.1145/3340295 .

Ferrere, Thomas, Oded Maler, Dejan Nidkovi, and Amir Pnueli. “From Real-Time Logic to Timed Automata.”https://doi.org/10.1145/3286976__Journal of the ACM. ACM, 2019.https://doi.org/10.1145/3286976 .

Guet, Calin C, Thomas A Henzinger, Claudia Igler, Tatjana Petrov, and Ali Sezgin. “Transient Memory in Gene Regulation.”https://doi.org/10.1007/978-3-030-31304-3_9__In 17th International Conference on Computational Methods in Systems Biology, 11773:155–87. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-31304-3_9 .

Nidkovi, Dejan, Xin Qin, Thomas Ferrere, Cristinel Mateis, and Jyotirmoy Deshmukh. “Shape Expressions for Specifying and Extracting Signal Features.”https://doi.org/10.1007/978-3-030-32079-9_17__In 19th International Conference on Runtime Verification, 11757:292–309. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-32079-9_17 .

Kong, Hui, Ezio Bartocci, Yu Jiang, and Thomas A Henzinger. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.”https://doi.org/10.1007/978-3-030-29662-9_8__In 17th International Conference on Formal Modeling and Analysis of Timed Systems, 11750:123–41. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-29662-9_8 .

Ferrere, Thomas, Oded Maler, and Dejan Nickovic. “Mixed-Time Signal Temporal Logic.”https://doi.org/10.1007/978-3-030-29662-9_4__In 17th International Conference on Formal Modeling and Analysis of Timed Systems, 11750:59–75. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-29662-9_4 .

Giacobbe, Mirco. “Automatic Time-Unbounded Reachability Analysis of Hybrid Systems.”https://doi.org/10.15479/AT:ISTA:6894__Institute of Science and Technology Austria, 2019.https://doi.org/10.15479/AT:ISTA:6894 .

Clarke, Edmund M., Thomas A Henzinger, Helmut Veith, and Roderick Bloem. Handbook of Model Checking. 1st ed. Cham: Springer Nature, 2018.https://doi.org/10.1007/978-3-319-10575-8 .

Clarke, Edmund, Thomas A Henzinger, and Helmut Veith. “Introduction to Model Checking.”https://doi.org/10.1007/978-3-319-10575-8_1__In Handbook of Model Checking, edited by Thomas A Henzinger, 1–26. Handbook of Model Checking. Springer, 2018.https://doi.org/10.1007/978-3-319-10575-8_1 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.”https://doi.org/10.1007/978-3-319-95246-8_9__In Principles of Modeling, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018.https://doi.org/10.1007/978-3-319-95246-8_9 .

Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,”https://doi.org/10.4230/LIPICS.MFCS.2018.23__Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPICS.MFCS.2018.23 .

Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the Asynchronous,”https://doi.org/10.4230/LIPIcs.CONCUR.2018.21__Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.CONCUR.2018.21 .

Nickovic, Dejan, Olivier Lebeltel, Oded Maler, Thomas Ferrere, and Dogan Ulus. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic.”https://doi.org/10.1007/978-3-319-89963-3_18__edited by Dirk Beyer and Marieke Huisman, 10806:303–19. Springer, 2018.https://doi.org/10.1007/978-3-319-89963-3_18 .

Ferrere, Thomas, Thomas A Henzinger, and Ege Saraç. “A Theory of Register Monitors,”https://doi.org/10.1145/3209108.3209194__Part 8033:394–403. IEEE, 2018.https://doi.org/10.1145/3209108.3209194 .

Bakhirkin, Alexey, Thomas Ferrere, and Oded Maler. “Efficient Parametric Identification for STL.”https://doi.org/10.1145/3178126.3178132__In Proceedings of the 21st International Conference on Hybrid Systems, 177–86. ACM, 2018.https://doi.org/10.1145/3178126.3178132 .

Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,”https://doi.org/10.1007/978-3-030-04612-5_2__11316:21–36. Springer, 2018.https://doi.org/10.1007/978-3-030-04612-5_2 .

Kragl, Bernhard, and Shaz Qadeer. “Layered Concurrent Programs,”https://doi.org/10.1007/978-3-319-96145-3_5__10981:79–102. Springer, 2018.https://doi.org/10.1007/978-3-319-96145-3_5 .

Bartocci, Ezio, Thomas Ferrere, Niveditha Manjunath, and Dejan Nickovic. “Localizing Faults in Simulink/Stateflow Models with STL,”https://doi.org/10.1145/3178126.3178131__197–206. Association for Computing Machinery, Inc, 2018.https://doi.org/10.1145/3178126.3178131 .

Elgyütt, Adrian, Thomas Ferrere, and Thomas A Henzinger. “Monitoring Temporal Logic with Clock Variables,”https://doi.org/10.1007/978-3-030-00151-3_4__11022:53–70. Springer, 2018.https://doi.org/10.1007/978-3-030-00151-3_4 .

Bakhirkin, Alexey, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene Asarin. “Online Timed Pattern Matching Using Automata,”https://doi.org/10.1007/978-3-030-00151-3_13__11022:215–32. Springer, 2018.https://doi.org/10.1007/978-3-030-00151-3_13 .

Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,”https://doi.org/10.1007/978-3-319-99154-2_4__11024:53–70. Springer, 2018.https://doi.org/10.1007/978-3-319-99154-2_4 .

Kong, Hui, Ezio Bartocci, and Thomas A Henzinger. “Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes,”https://doi.org/10.1007/978-3-319-96145-3_24__10981:449–67. Springer, 2018.https://doi.org/10.1007/978-3-319-96145-3_24 .

Jiang, Yu, Han Liu, Huobing Song, Hui Kong, Rui Wang, Yong Guan, and Lui Sha. “Safety-Assured Model-Driven Design of the Multifunction Vehicle Bus Controller.”https://doi.org/10.1109/TITS.2017.2778077__IEEE Transactions on Intelligent Transportation Systems. IEEE, 2018.https://doi.org/10.1109/TITS.2017.2778077 .

Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,”https://doi.org/10.1007/978-3-319-96145-3_25__10981:468–86. Springer, 2018.https://doi.org/10.1007/978-3-319-96145-3_25 .

Brázdil, Tomás, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,”https://doi.org/10.1007/978-3-319-89960-2_21__10805:385–407. Springer, 2018.https://doi.org/10.1007/978-3-319-89960-2_21 .

Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.”https://doi.org/10.1016/j.tcs.2017.11.001__Theoretical Computer Science. Elsevier, 2018.https://doi.org/10.1016/j.tcs.2017.11.001 .

Ferrere, Thomas. “The Compound Interest in Relaxing Punctuality,”https://doi.org/10.1007/978-3-319-95582-7_9__10951:147–64. Springer, 2018.https://doi.org/10.1007/978-3-319-95582-7_9 .

Bakhirkin, Alexey, Thomas Ferrere, Thomas A Henzinger, and Deian Nickovicl. “Keynote: The First-Order Logic of Signals.”https://doi.org/10.1109/emsoft.2018.8537203__In 2018 International Conference on Embedded Software, 1–10. IEEE, 2018.https://doi.org/10.1109/emsoft.2018.8537203 .

Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,”https://doi.org/10.24963/ijcai.2018/652__2018:4692–99. IJCAI, 2018.https://doi.org/10.24963/ijcai.2018/652 .

Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games.”https://doi.org/10.3390/g9030039__Games. MDPI AG, 2018.https://doi.org/10.3390/g9030039 .

Benveniste, Albert, Dejan Nickovic, Benoît Caillaud, Roberto Passerone, Jean Baptiste Raclet, Philipp Reinkemeier, Alberto Sangiovanni-Vincentelli, Werner Damm, Thomas A Henzinger, and Kim G. Larsen. “Contracts for System Design.”https://doi.org/10.1561/1000000053__Foundations and Trends in Electronic Design Automation. Now Publishers, 2018.https://doi.org/10.1561/1000000053 .

Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost P Katoen. “A New Proof Rule for Almost-Sure Termination.”https://doi.org/10.1145/3158121__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017.https://doi.org/10.1145/3158121 .

Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.”https://doi.org/10.1145/3060139__ACM Transactions on Computational Logic (TOCL). ACM, 2017.https://doi.org/10.1145/3060139 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.”https://doi.org/10.1145/3152769__ACM Transactions on Computational Logic (TOCL). ACM, 2017.https://doi.org/10.1145/3152769 .

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.”https://doi.org/10.23638/LMCS-13(3:23)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.https://doi.org/10.23638/LMCS-13(3:23)2017 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.”https://doi.org/10.1007/978-3-319-63121-9_18__In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017.https://doi.org/10.1007/978-3-319-63121-9_18 .

Bak, Stanley, Sergiy Bogomolov, Thomas A Henzinger, and Aviral Kumar. “Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees.”https://doi.org/10.1007/978-3-319-63501-9_6__edited by Alessandro Abate and Sylvie Bodo, 10381:83–89. Springer, 2017.https://doi.org/10.1007/978-3-319-63501-9_6 .

Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the Quantitative Semantics of Regular Expressions over Real-Valued Signals.”https://doi.org/10.1007/978-3-319-65765-3_11__edited by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017.https://doi.org/10.1007/978-3-319-65765-3_11 .

Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. Numerical Software Verification. Vol. 10152. LNCS. Springer, 2017.https://doi.org/10.1007/978-3-319-54292-8 .

Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. Synchronizing the Asynchronous. IST Austria, 2017.https://doi.org/10.15479/AT:IST-2018-853-v2-2 .

Kong, Hui, Sergiy Bogomolov, Christian Schilling, Yu Jiang, and Thomas A Henzinger. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.”https://doi.org/10.1145/3049797.3049814__In Proceedings of the 20th International Conference on Hybrid Systems, 163–72. ACM, 2017.https://doi.org/10.1145/3049797.3049814 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,”https://doi.org/10.4230/LIPIcs.CONCUR.2017.5__Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.CONCUR.2017.5 .

Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,”https://doi.org/10.4230/LIPIcs.MFCS.2017.37__Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.MFCS.2017.37 .

Le, Xuan, Duc Hiep Chu, David Lo, Claire Le Goues, and Willem Visser. “JFIX: Semantics-Based Repair of Java Programs via Symbolic  PathFinder.”https://doi.org/10.1145/3092703.3098225__In Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, 376–79. ACM, 2017.https://doi.org/10.1145/3092703.3098225 .

Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration Bidding Games,”https://doi.org/10.4230/LIPIcs.CONCUR.2017.21__Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.CONCUR.2017.21 .

Daca, Przemyslaw. “Statistical and Logical Methods for Property Checking.”https://doi.org/10.15479/AT:ISTA:TH_730__Institute of Science and Technology Austria, 2017.https://doi.org/10.15479/AT:ISTA:TH_730 .

Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic Abstractions for Hybrid Systems,”https://doi.org/10.1007/978-3-319-65765-3_7__10419:116–32. Springer, 2017.https://doi.org/10.1007/978-3-319-65765-3_7 .

Bogomolov, Sergiy, Goran Frehse, Mirco Giacobbe, and Thomas A Henzinger. “Counterexample Guided Refinement of Template Polyhedra,”https://doi.org/10.1007/978-3-662-54577-5_34__10205:589–606. Springer, 2017.https://doi.org/10.1007/978-3-662-54577-5_34 .

Svoreová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cbrná, and Celin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”https://doi.org/10.1016/j.nahs.2016.04.006__Nonlinear Analysis: Hybrid Systems. Elsevier, 2017.https://doi.org/10.1016/j.nahs.2016.04.006 .

Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.”https://doi.org/10.1007/s10703-016-0256-5__Formal Methods in System Design. Springer, 2017.https://doi.org/10.1007/s10703-016-0256-5 .

Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago Paixao, and Tatjana Petrov. “Model Checking the Evolution of Gene Regulatory Networks.”https://doi.org/10.1007/s00236-016-0278-x__Acta Informatica. Springer, 2017.https://doi.org/10.1007/s00236-016-0278-x .

Henzinger, Thomas A, and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.”https://doi.org/10.1016/j.nahs.2016.09.001__Nonlinear Analysis: Hybrid Systems. Elsevier, 2017.https://doi.org/10.1016/j.nahs.2016.09.001 .

Avni, Guy, Shubham Goel, Thomas A Henzinger, and Guillermo Rodríguez Navas. “Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults,”https://doi.org/10.1007/978-3-662-54580-5_10__10206:169–87. Springer, 2017.https://doi.org/10.1007/978-3-662-54580-5_10 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. “Quantitative Fair Simulation Games.”https://doi.org/10.1016/j.ic.2016.10.006__Information and Computation. Elsevier, 2017.https://doi.org/10.1016/j.ic.2016.10.006 .

Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.”https://doi.org/10.1007/978-3-662-54434-1_11__edited by Hongseok Yang, 10201:287–313. Springer, 2017.https://doi.org/10.1007/978-3-662-54434-1_11 .

Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games,”https://doi.org/10.24963/ijcai.2017/11__70–76. AAAI Press, 2017.https://doi.org/10.24963/ijcai.2017/11 .

Trinh, Minh, Duc Hiep Chu, and Joxan Jaffar. “Model Counting for Recursively-Defined Strings.”https://doi.org/10.1007/978-3-319-63390-9_21__edited by Rupak Majumdar and Viktor Kundak, 10427:399–418. Springer, 2017.https://doi.org/10.1007/978-3-319-63390-9_21 .

Le, Xuan, Duc Hiep Chu, David Lo, Claire Le Goues, and Willem Visser. “: Syntax- and Semantic-Guided Repair Synthesis via Programming by Examples,”https://doi.org/10.1145/3106237.3106309__0154:593–604. ACM, 2017.https://doi.org/10.1145/3106237.3106309 .

Gottlob, Georg, Thomas A Henzinger, and Georg Weißenbacher. “Preface of the Special Issue in Memoriam Helmut Veith.”https://doi.org/10.1007/s10703-017-0307-6__Formal Methods in System Design. Springer, 2017.https://doi.org/10.1007/s10703-017-0307-6 .

Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.”https://doi.org/10.4204/EPTCS.259.3__In Electronic Proceedings in Theoretical Computer Science, 259:31–38. Open Publishing Association, 2017.https://doi.org/10.4204/EPTCS.259.3 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,”https://doi.org/10.4230/LIPIcs.MFCS.2016.24__Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.MFCS.2016.24 .

Haas, Andreas, Thomas A Henzinger, Andreas Holzer, Christoph Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, and Helmut Veith. “Local Linearizability for Concurrent Container-Type Data Structures.”https://doi.org/10.4230/LIPIcs.CONCUR.2016.6__In Leibniz International Proceedings in Informatics, Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.CONCUR.2016.6 .

Gurung, Amit, Arup Deka, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, and Rajarshi Ray. “Parallel Reachability Analysis for Hybrid Systems.”https://doi.org/10.1109/MEMCOD.2016.7797741__IEEE, 2016.https://doi.org/10.1109/MEMCOD.2016.7797741 .

Avni, Guy, Shibashis Guha, and Guillermo Rodríguez Navas. “Synthesizing Time Triggered Schedules for Switched Networks with Faulty Links.”https://doi.org/10.1145/2968478.2968499__In Proceedings of the 13th International Conference on Embedded Software . ACM, 2016.https://doi.org/10.1145/2968478.2968499 .

Duggirala, Parasara, Chuchu Fan, Matthew Potok, Bolun Qi, Sayan Mitra, Mahesh Viswanathan, Stanley Bak, et al. “Tutorial: Software Tools for Hybrid Systems Verification Transformation and Synthesishttps://doi.org/10.1109/CCA.2016.7587948__HyST and TuLiP.”https://doi.org/10.1109/CCA.2016.7587948__In 2016 IEEE Conference on Control Applications. IEEE, 2016.https://doi.org/10.1109/CCA.2016.7587948 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Automata under Probabilistic Semantics.”https://doi.org/10.1145/2933575.2933588__In Proceedings of the 31st Annual ACM/IEEE Symposium, 76–85. IEEE, 2016.https://doi.org/10.1145/2933575.2933588 .

Kong, Hui, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, Thomas A Henzinger, Yu Jiang, and Christian Schilling. “Discrete Abstraction of Multiaffine Systems,”https://doi.org/10.1007/978-3-319-47151-8_9__9957:128–44. Springer, 2016.https://doi.org/10.1007/978-3-319-47151-8_9 .

Jiang, Yu, Yixiao Yang, Han Liu, Hui Kong, Ming Gu, Jiaguang Sun, and Lui Sha. “From Stateflow Simulation to Verified Implementation: A Verification Approach and a Real-Time Train Controller Design.”https://doi.org/10.1109/RTAS.2016.7461337__IEEE, 2016.https://doi.org/10.1109/RTAS.2016.7461337 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Monitor Automata,”https://doi.org/10.1007/978-3-662-53413-7_2__9837:23–38. Springer, 2016.https://doi.org/10.1007/978-3-662-53413-7_2 .

D’Antoni, Loris, Roopsha Samanta, and Rishabh Singh. “QLOSE: Program Repair with Quantitative Objectives,”https://doi.org/10.1007/978-3-319-41540-6_21__9780:383–401. Springer, 2016.https://doi.org/10.1007/978-3-319-41540-6_21 .

Bak, Stanley, Sergiy Bogomolov, Thomas A Henzinger, Taylor Johnson, and Pradyot Prakash. “Scalable Static Hybridization Methods for Analysis of Nonlinear Systems,”https://doi.org/10.1145/2883817.2883837__155–64. Springer, 2016.https://doi.org/10.1145/2883817.2883837 .

Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “PSYNC: A Partially Synchronous Language for Fault-Tolerant Distributed Algorithms,”https://doi.org/10.1145/2837614.2837650__20–22:400–415. ACM, 2016.https://doi.org/10.1145/2837614.2837650 .

Beica, Andreea, Calin C Guet, and Tatjana Petrov. “Efficient Reduction of Kappa Models by Static Inspection of the Rule-Set,”https://doi.org/10.1007/978-3-319-26916-0_10__9271:173–91. Springer, 2016.https://doi.org/10.1007/978-3-319-26916-0_10 .

Henzinger, Thomas A, Jan Otop, and Roopsha Samanta. “Lipschitz Robustness of Timed I/O Systems,”https://doi.org/10.1007/978-3-662-49122-5_12__9583:250–67. Springer, 2016.https://doi.org/10.1007/978-3-662-49122-5_12 .

Schilling, Christian, Sergiy Bogomolov, Thomas A Henzinger, Andreas Podelski, and Jakob Ruess. “Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks.”https://doi.org/10.1016/j.biosystems.2016.07.005__Biosystems. Elsevier, 2016.https://doi.org/10.1016/j.biosystems.2016.07.005 .

Bogomolov, Sergiy, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor Johnson, Hamed Ladan, Andreas Podelski, and Martin Wehrle. “Guided Search for Hybrid Systems Based on Coarse-Grained Space Abstractions.”https://doi.org/10.1007/s10009-015-0393-y__International Journal on Software Tools for Technology Transfer. Springer, 2016.https://doi.org/10.1007/s10009-015-0393-y .

Jiang, Yu, Han Liu, Hui Kong, Rui Wang, Mohamad Hosseini, Jiaguang Sun, and Lui Sha. “Use Runtime Verification to Improve the Quality of Medical Care Practice.”https://doi.org/10.1145/2889160.2889233__In Proceedings of the 38th International Conference on Software Engineering Companion , 112–21. IEEE, 2016.https://doi.org/10.1145/2889160.2889233 .

Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016:3225–32. AAAI Press, 2016.

Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games,”https://doi.org/10.1007/978-3-662-53354-3_13__9928:153–66. Springer, 2016.https://doi.org/10.1007/978-3-662-53354-3_13 .

Tarrach, Thorsten. “Automatic Synthesis of Synchronisation Primitives for Concurrent Programs.”https://doi.org/10.15479/at:ista:1130__Institute of Science and Technology Austria, 2016.https://doi.org/10.15479/at:ista:1130 .

Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Linear Distances between Markov Chains,”https://doi.org/10.4230/LIPIcs.CONCUR.2016.20__Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.CONCUR.2016.20 .

Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties,”https://doi.org/10.1007/978-3-662-49674-9_7__9636:112–29. Springer, 2016.https://doi.org/10.1007/978-3-662-49674-9_7 .

Daca, Przemyslaw, Ashutosh Gupta, and Thomas A Henzinger. “Abstraction-Driven Concolic Testing,”https://doi.org/10.1007/978-3-662-49122-5_16__9583:328–47. Springer, 2016.https://doi.org/10.1007/978-3-662-49122-5_16 .

Daca, Przemyslaw, Thomas A Henzinger, and Andrey Kupriyanov. “Array Folds Logic,”https://doi.org/10.1007/978-3-319-41540-6_13__9780:230–48. Springer, 2016.https://doi.org/10.1007/978-3-319-41540-6_13 .

Jiang, Yu, Han Liu, Houbing Song, Hui Kong, Ming Gu, Jiaguang Sun, and Lui Sha. “Safety Assured Formal Model Driven Design of the Multifunction Vehicle Bus Controller,”https://doi.org/10.1007/978-3-319-48989-6_47__9995:757–63. Springer, 2016.https://doi.org/10.1007/978-3-319-48989-6_47 .

Parise, Francesca, John Lygeros, and Jakob Ruess. “Bayesian Inference for Stochastic Individual-Based Models of Ecological Systems: A Pest Control Simulation Study.”https://doi.org/10.3389/fenvs.2015.00042__Frontiers in Environmental Science. Frontiers, 2015.https://doi.org/10.3389/fenvs.2015.00042 .

Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “The Need for Language Support for Fault-Tolerant Distributed Systems.”https://doi.org/10.4230/LIPIcs.SNAPL.2015.90__Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015.https://doi.org/10.4230/LIPIcs.SNAPL.2015.90 .

Kretinsky, Jan, Kim Larsen, Simon Laursen, and Jií Srba. “Polynomial Time Decidability of Weighted Synchronization under Partial Observability,”https://doi.org/10.4230/LIPIcs.CONCUR.2015.142__42:142–54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015.https://doi.org/10.4230/LIPIcs.CONCUR.2015.142 .

Ruess, Jakob. “Minimal Moment Equations for Stochastic Models of Biochemical Reaction Networks with Partially Finite State Space.”https://doi.org/10.1063/1.4937937__Journal of Chemical Physics. American Institute of Physics, 2015.https://doi.org/10.1063/1.4937937 .

Ruess, Jakob, Francesca Parise, Andreas Milias Argeitis, Mustafa Khammash, and John Lygeros. “Iterative Experiment Design Guides the Characterization of a Light-Inducible Gene Expression Circuit.”https://doi.org/10.1073/pnas.1423947112__PNAS. National Academy of Sciences, 2015.https://doi.org/10.1073/pnas.1423947112 .

Ray, Rajarshi, Amit Gurung, Binayak Das, Ezio Bartocci, Sergiy Bogomolov, and Radu Grosu. “XSpeed: Accelerating Reachability Analysis on Multi-Core Processors.”https://doi.org/10.1007/978-3-319-26287-1_1__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-319-26287-1_1 .

Forejt, Vojtbch, Jan Krdál, and Jan Kretinsky. “Controller Synthesis for MDPs and Frequency LTL\'47U,”https://doi.org/10.1007/978-3-662-48899-7_12__9450:162–77. Springer, 2015.https://doi.org/10.1007/978-3-662-48899-7_12 .

Babiak, Tomás, Frantisek Blahoudek, Alexandre Duret Lutz, Joachim Klein, Jan Kretinsky, Daniel Mueller, David Parker, and Jan Strejdek. “The Hanoi Omega-Automata Format,”https://doi.org/10.1007/978-3-319-21690-4_31__9206:479–86. Springer, 2015.https://doi.org/10.1007/978-3-319-21690-4_31 .

Bogomolov, Sergiy, Christian Schilling, Ezio Bartocci, Grégory Batt, Hui Kong, and Radu Grosu. “Abstraction-Based Parameter Synthesis for Multiaffine Systems,”https://doi.org/10.1007/978-3-319-26287-1_2__9434:19–35. Springer, 2015.https://doi.org/10.1007/978-3-319-26287-1_2 .

Nguyen, Luan, Christian Schilling, Sergiy Bogomolov, and Taylor Johnson. “Runtime Verification for Hybrid Analysis Tools.”https://doi.org/10.1007/978-3-319-23820-3_19__In 6th International Conference, 9333:281–86. Springer Nature, 2015.https://doi.org/10.1007/978-3-319-23820-3_19 .

Bogomolov, Sergiy, Thomas A Henzinger, Andreas Podelski, Jakob Ruess, and Christian Schilling. “Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks.”https://doi.org/10.1007/978-3-319-23401-4_8__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-319-23401-4_8 .

Bogomolov, Sergiy, Daniele Magazzeni, Stefano Minopoli, and Martin Wehrle. “PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior,” 42–46. AAAI Press, 2015.

Michaliszyn, Jakub, Jan Otop, and Emanuel Kieroski. “On the Decidability of Elementary Modal Logics.”https://doi.org/10.1145/2817825__ACM Transactions on Computational Logic. ACM, 2015.https://doi.org/10.1145/2817825 .

Frehse, Goran, Sergiy Bogomolov, Marius Greitschus, Thomas Strump, and Andreas Podelski. “Eliminating Spurious Transitions in Reachability with Support Functions.”https://doi.org/10.1145/2728606.2728622__In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 149–58. ACM, 2015.https://doi.org/10.1145/2728606.2728622 .

Bak, Stanley, Sergiy Bogomolov, and Taylor Johnson. “HYST: A Source Transformation and Translation Tool for Hybrid Automaton Models,”https://doi.org/10.1145/2728606.2728630__128–33. Springer, 2015.https://doi.org/10.1145/2728606.2728630 .

Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.”https://doi.org/10.1016/j.ic.2015.03.001__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.03.001 .

Gupta, Ashutosh, and Thomas A Henzinger. “Guest Editors’ Introduction to Special Issue on Computational Methods in Systems Biology.”https://doi.org/10.1145/2745799__ACM Transactions on Modeling and Computer Simulation. ACM, 2015.https://doi.org/10.1145/2745799 .

Cerny, Pavol, Thomas A Henzinger, Laura Kovács, Arjun Radhakrishna, and Jakob Zwirchmayr. “Segment Abstraction for Worst-Case Execution Time Analysis.”https://doi.org/10.1007/978-3-662-46669-8_5__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-662-46669-8_5 .

Benes, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert, and Jií Srba. “Refinement Checking on Parametric Modal Transition Systems.”https://doi.org/10.1007/s00236-015-0215-4__Acta Informatica. Springer, 2015.https://doi.org/10.1007/s00236-015-0215-4 .

Geiger, Bernhard, Tatjana Petrov, Gernot Kubin, and Heinz Koeppl. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.”https://doi.org/10.1109/TAC.2014.2364971__IEEE Transactions on Automatic Control. IEEE, 2015.https://doi.org/10.1109/TAC.2014.2364971 .

Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.”https://doi.org/10.1145/2688906__ACM Transactions on Modeling and Computer Simulation. ACM, 2015.https://doi.org/10.1145/2688906 .

Henzinger, Thomas A, and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.”https://doi.org/10.1145/2701001__Communications of the ACM. ACM, 2015.https://doi.org/10.1145/2701001 .

Fahrenberg, Uli, Jan Kretinsky, Axel Legay, and Louis Traonouez. “Compositionality for Quantitative Specifications,”https://doi.org/10.1007/978-3-319-15317-9_19__8997:306–24. Springer, 2015.https://doi.org/10.1007/978-3-319-15317-9_19 .

Gupta, Ashutosh, Thomas A Henzinger, Arjun Radhakrishna, Roopsha Samanta, and Thorsten Tarrach. “Succinct Representation of Concurrent Trace Sets,”https://doi.org/10.1145/2676726.2677008__433–44. ACM, 2015.https://doi.org/10.1145/2676726.2677008 .

Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.”https://doi.org/10.2168/LMCS-11(1:20)2015__Logical Methods in Computer Science. International Federation of Computational Logic, 2015.https://doi.org/10.2168/LMCS-11(1:20)2015 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.”https://doi.org/10.1016/j.ic.2015.06.003__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.06.003 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.”https://doi.org/10.1145/2699430__Journal of the ACM. ACM, 2015.https://doi.org/10.1145/2699430 .

Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.”https://doi.org/10.1109/LICS.2015.32__LICS. IEEE, 2015.https://doi.org/10.1109/LICS.2015.32 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.”https://doi.org/10.1109/LICS.2015.72__In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015.https://doi.org/10.1109/LICS.2015.72 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-170-v2-2 .

Boker, Udi, Thomas A Henzinger, and Jan Otop. “The Target Discounted-Sum Problem.”https://doi.org/10.1109/LICS.2015.74__In LICS, 750–61. Logic in Computer Science. IEEE, 2015.https://doi.org/10.1109/LICS.2015.74 .

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.”https://doi.org/10.1007/978-3-662-47666-6_10__In 42nd International Colloquium, 9135:121–33. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-47666-6_10 .

Boker, Udi, Thomas A Henzinger, and Jan Otop. The Target Discounted-Sum Problem. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-335-v1-1 .

Benes, Nikola, Przemyslaw Daca, Thomas A Henzinger, Jan Kretinsky, and Dejan Nickovic. “Complete Composition Operators for IOCO-Testing Theory,”https://doi.org/10.1145/2737166.2737175__101–10. ACM, 2015.https://doi.org/10.1145/2737166.2737175 .

Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.”https://doi.org/10.1007/s10703-015-0235-2__Formal Methods in System Design. Springer, 2015.https://doi.org/10.1007/s10703-015-0235-2 .

Svoreová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cbrná, and Celin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”https://doi.org/10.1145/2728606.2728608__In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015.https://doi.org/10.1145/2728606.2728608 .

Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.”https://doi.org/10.1007/978-3-319-21668-3_11__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-319-21668-3_11 .

Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago Paixao, and Tatjana Petrov. “Model Checking Gene Regulatory Networks.”https://doi.org/10.1007/978-3-662-46681-0_47__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-662-46681-0_47 .

Brázdil, Tomás, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,”https://doi.org/10.1007/978-3-319-21690-4_10__9206:158–77. Springer, 2015.https://doi.org/10.1007/978-3-319-21690-4_10 .

Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.”https://doi.org/10.15479/AT:ISTA:28__Institute of Science and Technology Austria, 2015.https://doi.org/10.15479/AT:ISTA:28 .

Dragoi, Cezara, Thomas A Henzinger, Helmut Veith, Josef Widder, and Damien Zufferey. “A Logic-Based Framework for Verifying Consensus Algorithms,”https://doi.org/10.1007/978-3-642-54013-4_10__8318:161–81. Springer, 2014.https://doi.org/10.1007/978-3-642-54013-4_10 .

Gordon, Andrew, Thomas A Henzinger, Aditya Nori, and Sriram Rajamani. “Probabilistic Programming.”https://doi.org/10.1145/2593882.2593900__In Proceedings of the on Future of Software Engineering, 167–81. ACM, 2014.https://doi.org/10.1145/2593882.2593900 .

Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.”https://doi.org/10.4204/EPTCS.169.5__In Electronic Proceedings in Theoretical Computer Science, EPTCS, 169:31–38. Open Publishing, 2014.https://doi.org/10.4204/EPTCS.169.5 .

Hofferek, Georg, and Ashutosh Gupta. “Suraq - a Controller Synthesis Tool Using Uninterpreted Functions.”https://doi.org/10.1007/978-3-319-13338-6_6__In HVC 2014, edited by Eran Yahav, 8855:68–74. Springer, 2014.https://doi.org/10.1007/978-3-319-13338-6_6 .

Gupta, Ashutosh, Laura Kovács, Bernhard Kragl, and Andrei Voronkov. “Extensional Crisis and Proving Identity.”https://doi.org/10.1007/978-3-319-11936-6_14__In ATVA 2014, edited by Franck Cassez and Jean-François Raskin, 8837:185–200. Springer, 2014.https://doi.org/10.1007/978-3-319-11936-6_14 .

Henzinger, Thomas A, Jan Otop, and Roopsha Samanta. “Lipschitz Robustness of Finite-State Transducers.”https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431__In Leibniz International Proceedings in Informatics, LIPIcs, 29:431–43. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431 .

Samanta, Roopsha, Oswaldo Olivo, and Emerson Allen. “Cost-Aware Automatic Program Repair.”https://doi.org/10.1007/978-3-319-10936-7_17__edited by Markus Müller-Olm and Helmut Seidl, 8723:268–84. Springer, 2014.https://doi.org/10.1007/978-3-319-10936-7_17 .

Brázdil, Tomás, Krishnendu Chatterjee, Martin Chmelik, Vojtbch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.”https://doi.org/10.1007/978-3-319-11936-6_8__In https://doi.org/10.1007/978-3-319-11936-6_8__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, 8837:98–114. Society of Industrial and Applied Mathematics, 2014.https://doi.org/10.1007/978-3-319-11936-6_8 .

Komárková, Zuzana, and Jan Kretinsky. “Rabinizer 3: Safraless Translation of Ltl to Small Deterministic Automata.”https://doi.org/10.1007/978-3-319-11936-6_17__In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, 8837:235–41. Springer, 2014.https://doi.org/10.1007/978-3-319-11936-6_17 .

Hermanns, Holger, Jan Krdál, and Jan Kretinsky. “Probabilistic Bisimulation: Naturally on Distributions.”https://doi.org/10.1007/978-3-662-44584-6_18__In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:249–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.https://doi.org/10.1007/978-3-662-44584-6_18 .

Ganguly, Arnab, Tatjana Petrov, and Heinz Koeppl. “Markov Chain Aggregation and Its Applications to Combinatorial Reaction Networks.”https://doi.org/10.1007/s00285-013-0738-7__Journal of Mathematical Biology. Springer, 2014.https://doi.org/10.1007/s00285-013-0738-7 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.”https://doi.org/10.1007/s00236-013-0191-5__Acta Informatica. Springer, 2014.https://doi.org/10.1007/s00236-013-0191-5 .

Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata: A Safraless Compositional Approach,”https://doi.org/10.1007/978-3-319-08867-9_13__8559:192–208. Springer, 2014.https://doi.org/10.1007/978-3-319-08867-9_13 .

Boker, Udi, and Thomas A Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.”https://doi.org/10.2168/LMCS-10(1:10)2014__Logical Methods in Computer Science. International Federation of Computational Logic, 2014.https://doi.org/10.2168/LMCS-10(1:10)2014 .

Boker, Udi, Thomas A Henzinger, and Arjun Radhakrishna. “Battery Transition Systems,”https://doi.org/10.1145/2535838.2535875__49:595–606. ACM, 2014.https://doi.org/10.1145/2535838.2535875 .

Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.”https://doi.org/10.1016/j.tcs.2014.08.019__Theoretical Computer Science. Elsevier, 2014.https://doi.org/10.1016/j.tcs.2014.08.019 .

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.”https://doi.org/10.1145/2629686__ACM Transactions on Computational Logic (TOCL). ACM, 2014.https://doi.org/10.1145/2629686 .

Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic. Compositional Specifications for IOCO Testing. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-148-v2-1 .

Henzinger, Thomas A, and Jan Otop. “Model Measuring for Hybrid Systems.”https://doi.org/10.1145/2562059.2562130__In Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, 213–22. Springer, 2014.https://doi.org/10.1145/2562059.2562130 .

Henzinger, Thomas A, and Jan Otop. From Model Checking to Model Measuring. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-172-v1-1 .

Henzinger, Thomas A, and Jan Otop. Model Measuring for Hybrid Systems. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-171-v1-1 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-170-v1-1 .

Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Regression-Free Synthesis for Concurrency,”https://doi.org/10.1007/978-3-319-08867-9_38__8559:568–84. Springer, 2014.https://doi.org/10.1007/978-3-319-08867-9_38 .

Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic. “Compositional Specifications for IOCO Testing.”https://doi.org/10.1109/ICST.2014.50__In IEEE 7th International Conference on Software Testing, Verification and Validation. IEEE, 2014.https://doi.org/10.1109/ICST.2014.50 .

Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,”https://doi.org/10.1007/978-3-319-08867-9_31__8559:473–90. Springer, 2014.https://doi.org/10.1007/978-3-319-08867-9_31 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. Quantitative Fair Simulation Games. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-315-v1-1 .

Haas, Andreas, Michael Lippautz, Thomas A Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, and Ali Sezgin. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.”https://doi.org/10.1145/2482767.2482789__In Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. ACM Press, 2013.https://doi.org/10.1145/2482767.2482789 .

Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.”https://doi.org/10.1109/FMCAD.2013.6679394__In 2013 Formal Methods in Computer-Aided Design, 77–84. IEEE, 2013.https://doi.org/10.1109/FMCAD.2013.6679394 .

Boker, Udi, Denis Kuperberg, Orna Kupferman, and Micha Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.”https://doi.org/10.1007/978-3-642-39212-2_11__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-39212-2_11 .

Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.”https://doi.org/10.1145/2429069.2429109__In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 317–28. ACM, 2013.https://doi.org/10.1145/2429069.2429109 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.”https://doi.org/10.1145/2429069.2429085__In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 115–28. ACM, 2013.https://doi.org/10.1145/2429069.2429085 .

Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.”https://doi.org/10.1007/978-3-642-45221-5_13__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-45221-5_13 .

Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.”https://doi.org/10.4230/LIPIcs.CSL.2013.563__Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013.https://doi.org/10.4230/LIPIcs.CSL.2013.563 .

Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.”https://doi.org/10.1007/s00450-013-0251-7__Computer Science Research and Development. Springer, 2013.https://doi.org/10.1007/s00450-013-0251-7 .

Gupta, Ashutosh, and Thomas A Henzinger, eds. Computational Methods in Systems Biology. Vol. 8130. Springer, 2013.https://doi.org/10.1007/978-3-642-40708-6 .

Dragoi, Cezara, Constantin Enea, and Mihaela Sighireanu. “Local Shape Analysis for Overlaid Data Structures,”https://doi.org/10.1007/978-3-642-38856-9_10__7935:150–71. Springer, 2013.https://doi.org/10.1007/978-3-642-38856-9_10 .

Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.”https://doi.org/10.1007/s10009-011-0207-9__International Journal on Software Tools for Technology Transfer. Springer, 2013.https://doi.org/10.1007/s10009-011-0207-9 .

Desai, Ankush, Vivek Gupta, Ethan Jackson, Shaz Qadeer, Sriram Rajamani, and Damien Zufferey. “P: Safe Asynchronous Event-Driven Programming.”https://doi.org/10.1145/2491956.2462184__In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, 321–31. ACM, 2013.https://doi.org/10.1145/2491956.2462184 .

Henzinger, Thomas A, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.”https://doi.org/10.1007/978-3-642-40184-8_18__Lecture Notes in Computer Science. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013.https://doi.org/10.1007/978-3-642-40184-8_18 .

Piskac, Ruzica, Thomas Wies, and Damien Zufferey. “Automating Separation Logic Using SMT.”https://doi.org/10.1007/978-3-642-39799-8_54__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-39799-8_54 .

Almagor, Shaull, Udi Boker, and Orna Kupferman. “Formalizing and Reasoning about Quality.”https://doi.org/10.1007/978-3-642-39212-2_3__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-39212-2_3 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.”https://doi.org/10.1016/j.jcss.2012.12.001__Journal of Computer and System Sciences. Elsevier, 2013.https://doi.org/10.1016/j.jcss.2012.12.001 .

Kucera, Antonin, Thomas A Henzinger, Jaroslav Nesetril, Tomas Vojnar, and David Antos, eds. Mathematical and Engineering Methods in Computer Science. Vol. 7721. Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-36046-6 .

Henzinger, Thomas A, and Ali Sezgin. How Free Is Your Linearizable Concurrent Data Structure? IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-123-v1-1 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.”https://doi.org/10.1109/FMCAD.2013.6679386__In 13th International Conference on Formal Methods in Computer-Aided Design, 18–25. IEEE, 2013.https://doi.org/10.1109/FMCAD.2013.6679386 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. Distributed Synthesis for LTL Fragments. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-130-v1-1 .

Henzinger, Thomas A, and Jan Otop. “From Model Checking to Model Measuring.”https://doi.org/10.1007/978-3-642-40184-8_20__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-40184-8_20 .

Henzinger, Thomas A, Hannes Payer, and Ali Sezgin. Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues . IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-124-v1-1 .

Dragoi, Cezara, Ashutosh Gupta, and Thomas A Henzinger. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.”https://doi.org/10.1007/978-3-642-39799-8_11__In Computer Aided Verification, 8044:174–90. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.https://doi.org/10.1007/978-3-642-39799-8_11 .

Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.”https://doi.org/10.15479/at:ista:1405__Institute of Science and Technology Austria, 2013.https://doi.org/10.15479/at:ista:1405 .

Bansal, Kshitij, Eric Koskinen, Thomas Wies, and Damien Zufferey. “Structural Counter Abstraction.”https://doi.org/10.1007/978-3-642-36742-7_5__Edited by Nir Piterman and Scott Smolka. Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-36742-7_5 .

Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Efficient Synthesis for Concurrency by Semantics-Preserving Transformations,”https://doi.org/10.1007/978-3-642-39799-8_68__8044:951–67. Springer, 2013.https://doi.org/10.1007/978-3-642-39799-8_68 .

Beyer, Dirk, Thomas A Henzinger, Mehmet Keremoglu, and Philipp Wendler. “Conditional Model Checking: A Technique to Pass Information between Verifiers.”https://doi.org/10.1145/2393596.2393664__In Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. ACM, 2012.https://doi.org/10.1145/2393596.2393664 .

Henzinger, Thomas A, and Maria Mateescu. “The Propagation Approach for Computing Biochemical Reaction Networks.”https://doi.org/10.1109/TCBB.2012.91__IEEE ACM Transactions on Computational Biology and Bioinformatics. IEEE, 2012.https://doi.org/10.1109/TCBB.2012.91 .

Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary Game Dynamics in Populations with Different Learners.”https://doi.org/10.1016/j.jtbi.2012.02.021__Journal of Theoretical Biology. Elsevier, 2012.https://doi.org/10.1016/j.jtbi.2012.02.021 .

Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.”https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362__In Leibniz International Proceedings in Informatics, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362 .

Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and Nishant Totla. “Synthesis from Incompatible Specifications.”https://doi.org/10.1145/2380356.2380371__In Proceedings of the Tenth ACM International Conference on Embedded Software, 53–62. ACM, 2012.https://doi.org/10.1145/2380356.2380371 .

Henzinger, Thomas A. “Quantitative Reactive Models.”https://doi.org/10.1007/978-3-642-33666-9_1__In Conference Proceedings MODELS 2012, 7590:1–2. Springer, 2012.https://doi.org/10.1007/978-3-642-33666-9_1 .

Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.”https://doi.org/10.4204/EPTCS.96.3__In Electronic Proceedings in Theoretical Computer Science, 96:29–42. EPTCS, 2012.https://doi.org/10.4204/EPTCS.96.3 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.”https://doi.org/10.1145/2380356.2380370__In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012.https://doi.org/10.1145/2380356.2380370 .

Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability of Viewpoints.”https://doi.org/10.1007/978-3-642-34059-8_20__In https://doi.org/10.1007/978-3-642-34059-8_20__Conference Proceedings Monterey Workshop 2012, 7539:380–95. Springer, 2012.https://doi.org/10.1007/978-3-642-34059-8_20 .

Guet, Calin C, Ashutosh Gupta, Thomas A Henzinger, Maria Mateescu, and Ali Sezgin. “Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits,”https://doi.org/10.1007/978-3-642-31424-7_24__7358:294–309. Springer, 2012.https://doi.org/10.1007/978-3-642-31424-7_24 .

Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. “Parametric Identification of Temporal Properties,”https://doi.org/10.1007/978-3-642-29860-8_12__7186:147–60. Springer, 2012.https://doi.org/10.1007/978-3-642-29860-8_12 .

Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data,”https://doi.org/10.1007/978-3-642-27940-9_1__7148:1–22. Springer, 2012.https://doi.org/10.1007/978-3-642-27940-9_1 .

Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.”https://doi.org/10.1016/j.tcs.2011.12.059__Theoretical Computer Science. Elsevier, 2012.https://doi.org/10.1016/j.tcs.2011.12.059 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic <9 Regular Games.”https://doi.org/10.1016/j.jcss.2011.05.002__Journal of Computer and System Sciences. Elsevier, 2012.https://doi.org/10.1016/j.jcss.2011.05.002 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.”https://doi.org/10.1007/s10703-012-0164-2__Formal Methods in System Design. Springer, 2012.https://doi.org/10.1007/s10703-012-0164-2 .

Delahaye, Benoît, Uli Fahrenberg, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Synchronous Interface Theories and Time Triggered Scheduling,”https://doi.org/10.1007/978-3-642-30793-5_13__7273:203–18. Springer, 2012.https://doi.org/10.1007/978-3-642-30793-5_13 .

Ghosal, Arkadeb, Daniel Iercan, Christoph Kirsch, Thomas A Henzinger, and Alberto Sangiovanni Vincentelli. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.”https://doi.org/10.1016/j.scico.2010.06.004__Science of Computer Programming. Elsevier, 2012.https://doi.org/10.1016/j.scico.2010.06.004 .

Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.”https://doi.org/10.1145/2287718.2287727__ACM Transactions on Computational Logic (TOCL). ACM, 2012.https://doi.org/10.1145/2287718.2287727 .

Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.”https://doi.org/10.1145/2362355.2362357__ACM Transactions on Computational Logic (TOCL). ACM, 2012.https://doi.org/10.1145/2362355.2362357 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances.”https://doi.org/10.1016/j.tcs.2011.08.002__Theoretical Computer Science. Elsevier, 2012.https://doi.org/10.1016/j.tcs.2011.08.002 .

Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.”https://doi.org/10.1007/978-3-642-33386-6_14__In Automated Technology for Verification and Analysis, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-33386-6_14 .

Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.”https://doi.org/10.1007/978-3-642-28756-5_46__In Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-28756-5_46 .

Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.”https://doi.org/10.1007/978-3-642-33386-6_10__In Automated Technology for Verification and Analysis, 7561:107–21. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.https://doi.org/10.1007/978-3-642-33386-6_10 .

Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,”https://doi.org/10.1007/978-3-642-27940-9_29__7148:445–60. Springer, 2012.https://doi.org/10.1007/978-3-642-27940-9_29 .

Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Solving Recursion-Free Horn Clauses over LI+UIF.”https://doi.org/10.1007/978-3-642-25318-8_16__edited by Hongseok Yang, 7078:188–203. Springer, 2011.https://doi.org/10.1007/978-3-642-25318-8_16 .

Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds,” 1–6. USENIX, 2011.

Henzinger, Thomas A, and Maria Mateescu. “Tail Approximation for the Chemical Master Equation.” Tampere International Center for Signal Processing, 2011.

Henzinger, Thomas A, and Maria Mateescu. “Propagation Models for Computing Biochemical Reaction Networks,”https://doi.org/10.1145/2037509.2037510__1–3. Springer, 2011.https://doi.org/10.1145/2037509.2037510 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.”https://doi.org/10.1109/SIES.2011.5953660__In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011.https://doi.org/10.1109/SIES.2011.5953660 .

Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.”https://doi.org/10.1145/1985342.1985345__ACM Transactions on Programming Languages and Systems (TOPLAS). ACM, 2011.https://doi.org/10.1145/1985342.1985345 .

Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,”https://doi.org/10.1109/QEST.2011.40__255–64. IEEE, 2011.https://doi.org/10.1109/QEST.2011.40 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.”https://doi.org/10.1145/1970398.1970404__ACM Transactions on Computational Logic (TOCL). ACM, 2011.https://doi.org/10.1145/1970398.1970404 .

Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.”https://doi.org/10.1145/2001269.2001289__Communications of the ACM. ACM, 2011.https://doi.org/10.1145/2001269.2001289 .

Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,”https://doi.org/10.1007/978-3-642-23217-6_27__6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011.https://doi.org/10.1007/978-3-642-23217-6_27 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,”https://doi.org/10.1007/978-3-642-19835-9_24__6605:267–71. Springer, 2011.https://doi.org/10.1007/978-3-642-19835-9_24 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.

Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models.”https://doi.org/10.1142/S0129054111008441__IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing, 2011.https://doi.org/10.1142/S0129054111008441 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.”https://doi.org/10.2168/LMCS-7(4:8)2011__Logical Methods in Computer Science. International Federation of Computational Logic, 2011.https://doi.org/10.2168/LMCS-7(4:8)2011 .

Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata ,”https://doi.org/10.1007/978-3-642-24372-1_37__6996:482–91. Springer, 2011.https://doi.org/10.1007/978-3-642-24372-1_37 .

Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,”https://doi.org/10.1145/1926385.1926454__46:599–610. ACM, 2011.https://doi.org/10.1145/1926385.1926454 .

Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.”https://doi.org/10.1007/978-3-642-18275-4_26__edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011.https://doi.org/10.1007/978-3-642-18275-4_26 .

Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,”https://doi.org/10.4230/LIPIcs.CSL.2011.82__12:82–96. Springer, 2011.https://doi.org/10.4230/LIPIcs.CSL.2011.82 .

Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,”https://doi.org/10.1109/CSF.2011.21__205–17. IEEE, 2011.https://doi.org/10.1109/CSF.2011.21 .

Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,”https://doi.org/10.1145/1966445.1966476__329–42. ACM, 2011.https://doi.org/10.1145/1966445.1966476 .

Cerny, Pavol, and Thomas A Henzinger. “From Boolean to Quantitative Synthesis,”https://doi.org/10.1145/2038642.2038666__149–54. ACM, 2011.https://doi.org/10.1145/2038642.2038666 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.”https://doi.org/10.1007/978-3-642-21254-3_17__edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011.https://doi.org/10.1007/978-3-642-21254-3_17 .

Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes.”https://doi.org/10.1016/j.tcs.2010.10.022__Theoretical Computer Science. Elsevier, 2011.https://doi.org/10.1016/j.tcs.2010.10.022 .

Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of STM on Relaxed Memory Models.”https://doi.org/10.1007/s10703-011-0131-3__Formal Methods in System Design. Springer, 2011.https://doi.org/10.1007/s10703-011-0131-3 .

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.”https://doi.org/10.1109/LICS.2011.33__IEEE, 2011.https://doi.org/10.1109/LICS.2011.33 .

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0003 .

Wies, Thomas, Marco Muñiz, and Viktor Kuncak. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0005 .

Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure for Imperative Tree Data Structures,”https://doi.org/10.1007/978-3-642-22438-6_36__6803:476–91. Springer, 2011.https://doi.org/10.1007/978-3-642-22438-6_36 .

Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.”https://doi.org/10.1007/978-3-642-22110-1_20__edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011.https://doi.org/10.1007/978-3-642-22110-1_20 .

Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.”https://doi.org/10.1007/978-3-642-17511-4_7__In Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010.https://doi.org/10.1007/978-3-642-17511-4_7 .

Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule-Based Systems,” 40:142–61. Open Publishing Association, 2010.

Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks,”https://doi.org/10.1109/QEST.2010.33__193–94. IEEE, 2010.https://doi.org/10.1109/QEST.2010.33 .

Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrey Rybalchenko. “Aligators for Arrays,”https://doi.org/10.1007/978-3-642-16242-8_25__6397:348–56. Springer, 2010.https://doi.org/10.1007/978-3-642-16242-8_25 .

Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation.”https://doi.org/10.1049/iet-syb.2010.0005__IET Systems Biology. Institution of Engineering and Technology, 2010.https://doi.org/10.1049/iet-syb.2010.0005 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,”https://doi.org/10.1007/978-3-642-15155-2_23__6281:246–57. Springer, 2010.https://doi.org/10.1007/978-3-642-15155-2_23 .

Chatterjee, Krishnendu, and Thomas A Henzinger, eds. Formal Modeling and Analysis of Timed Systems. Vol. 6246. Springer, 2010.https://doi.org/10.1007/978-3-642-15297-9 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.”https://doi.org/10.1007/978-3-642-14295-6_36__edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_36 .

Nickovic, Dejan, and Nir Piterman. “From MTL to Deterministic Timed Automata.”https://doi.org/10.1007/978-3-642-15297-9_13__edited by Thomas A. Henzinger and Krishnendu Chatterjee, 6246:152–67. Springer, 2010.https://doi.org/10.1007/978-3-642-15297-9_13 .

Wolf, Verena, Rushil Goel, Maria Mateescu, and Thomas A Henzinger. “Solving the Chemical Master Equation Using Sliding Windows.”https://doi.org/10.1186/1752-0509-4-42__BMC Systems Biology. BioMed Central, 2010.https://doi.org/10.1186/1752-0509-4-42 .

Henzinger, Thomas A. “From Boolean to Quantitative Notions of Correctness,”https://doi.org/10.1145/1706299.1706319__45:157–58. ACM, 2010.https://doi.org/10.1145/1706299.1706319 .

Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrei Voronkov. “Invariant and Type Inference for Matrices,”https://doi.org/10.1007/978-3-642-11319-2_14__5944:163–79. Springer, 2010.https://doi.org/10.1007/978-3-642-11319-2_14 .

Henzinger, Thomas A, Maria Mateescu, Linar Mikeev, and Verena Wolf. “Hybrid Numerical Solution of the Chemical Master Equation,”https://doi.org/10.1145/1839764.1839772__55–65. Springer, 2010.https://doi.org/10.1145/1839764.1839772 .

Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,”https://doi.org/10.1007/978-3-642-15375-4_19__6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_19 .

Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,”https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505__8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,”https://doi.org/10.1007/978-3-642-14295-6_34__6174:380–95. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_34 .

Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.”https://doi.org/10.1016/j.ic.2009.09.006__Information and Computation. Elsevier, 2010.https://doi.org/10.1016/j.ic.2009.09.006 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.”https://doi.org/10.1016/j.ic.2009.07.004__Information and Computation. Elsevier, 2010.https://doi.org/10.1016/j.ic.2009.07.004 .

Singh, Vasu. “Runtime Verification for Software Transactional Memories.”https://doi.org/10.1007/978-3-642-16612-9_32__edited by Oleg Sokolsky, Grigore Rosu, Nikolai Tilmann, Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, and Gordon Pace, 6418:421–35. Springer, 2010.https://doi.org/10.1007/978-3-642-16612-9_32 .

Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building a Calculus of Data Structures.”https://doi.org/10.1007/978-3-642-11319-2_6__edited by Gilles Barthe and Manuel Hermenegildo, 5944:26–44. Springer, 2010.https://doi.org/10.1007/978-3-642-11319-2_6 .

Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment,”https://doi.org/10.1109/CLOUD.2010.71__83–90. IEEE, 2010.https://doi.org/10.1109/CLOUD.2010.71 .

Guerraoui, Rachid, Thomas A Henzinger, Michal Kapalka, and Vasu Singh. “Transactions in the Jungle,”https://doi.org/10.1145/1810479.1810529__263–72. ACM, 2010.https://doi.org/10.1145/1810479.1810529 .

Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “A Marketplace for Cloud Resources,”https://doi.org/10.1145/1879021.1879022__1–8. ACM, 2010.https://doi.org/10.1145/1879021.1879022 .

Doyen, Laurent, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Robustness of Sequential Circuits,”https://doi.org/10.1109/ACSD.2010.26__77–84. IEEE, 2010.https://doi.org/10.1109/ACSD.2010.26 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.”https://doi.org/10.1007/978-3-642-13754-9_3__In Time For Verification: Essays in Memory of Amir Pnueli, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010.https://doi.org/10.1007/978-3-642-13754-9_3 .

Beyer, Dirk, Thomas A Henzinger, Grégory Théoduloz, and Damien Zufferey. “Shape Refinement through Explicit Heap Analysis.”https://doi.org/10.1007/978-3-642-12029-9_19__edited by David Rosenblum and Gabriele Taenzer, 6013:263–77. Springer, 2010.https://doi.org/10.1007/978-3-642-12029-9_19 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.”https://doi.org/10.2168/LMCS-6(3:10)2010__Logical Methods in Computer Science. International Federation of Computational Logic, 2010.https://doi.org/10.2168/LMCS-6(3:10)2010 .

Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,”https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1__8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1 .

Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.”https://doi.org/10.1007/s10703-010-0102-0__Formal Methods in System Design. Springer, 2010.https://doi.org/10.1007/s10703-010-0102-0 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,”https://doi.org/10.1007/978-3-642-15375-4_18__6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_18 .

Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0004 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. Simulation Distances. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0003 .

Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,”https://doi.org/10.1007/978-3-642-14295-6_41__6174:465–79. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_41 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,”https://doi.org/10.1007/978-3-642-14295-6_57__6174:665–69. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_57 .

Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0001 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,”https://doi.org/10.1007/978-3-642-15643-4_1__6252:1–16. Springer, 2010.https://doi.org/10.1007/978-3-642-15643-4_1 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,”https://doi.org/10.1007/978-3-642-15155-2_24__6281:258–69. Springer, 2010.https://doi.org/10.1007/978-3-642-15155-2_24 .

Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.”https://doi.org/10.1007/978-3-642-12032-9_8__edited by Luke Ong, 6014:94–108. Springer, 2010.https://doi.org/10.1007/978-3-642-12032-9_8 .

Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation,”https://doi.org/10.1109/HiBi.2009.23__4:118–27. IEEE, 2009.https://doi.org/10.1109/HiBi.2009.23 .

Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models,”https://doi.org/10.1007/978-3-642-04420-5_2__5797:3–23. Springer, 2009.https://doi.org/10.1007/978-3-642-04420-5_2 .

Henzinger, Thomas A, Christoph Kirsch, Eduardo Marques, and Ana Sokolova. “Distributed, Modular HTL,”https://doi.org/10.1109/RTSS.2009.9__171–80. IEEE, 2009.https://doi.org/10.1109/RTSS.2009.9 .

Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “On Relational Interfaces.”https://doi.org/10.1145/1629335.1629346__In EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, 67–76. ACM, 2009.https://doi.org/10.1145/1629335.1629346 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. Gist: A Solver for Probabilistic Games. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0003 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0002 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0001 .