Lukina, A., Schilling, C., &; Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In 21st International Conference on Runtime Verification (Vol. 12974, pp. 42–61). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-88494-9_3 

Hasani, R., Lechner, M., Amini, A., Rus, D., &; Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (pp. 4082–4093). Virtual.

Ferrere, T., Henzinger, T. A., &; Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CSL.2020.20 

Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D.,https://doi.org/10.29007/7dt2__Wetzlinger, M. (2020). ARCH-COM Category Report: Continuous and hybrid systems with linear dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair.https://doi.org/10.29007/7dt2 

Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X.,https://doi.org/10.29007/zkf6__Schilling, C. (2020). ARCH-COM Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 74, pp. 49–75). EasyChair.https://doi.org/10.29007/zkf6 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2020.23 

Avni, G., &; Henzinger, T. A. (2020). A survey of bidding games on graphs. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2020.2 

Alamdari, P. A., Avni, G., Henzinger, T. A., &; Lukina, A. (2020). Formal methods with a touch of magic. In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien Academic Press.https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21 

Singh, S. P., &; Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression. In Advances in Neural Information Processing Systems (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.

Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., &; Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE.https://doi.org/10.1109/CDC42340.2020.9304042 

Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In 8th International Conference on Learning Representations. Virtualf; Addis Ababa, Ethiopia: ICLR.

Giacobbe, M., Henzinger, T. A., &; Lechner, M. (2020). How many bits does it take to quantize your neural network? In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12079, pp. 79–97). Dublin, Ireland: Springer Nature.https://doi.org/10.1007/978-3-030-45237-7_5 

Avni, G., Henzinger, T. A., &; Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2019.06.031 

Henzinger, T. A., Lukina, A., &; Schilling, C. (2020). Outside the box: Abstraction-based monitoring of neural networks. In 24th European Conference on Artificial Intelligence (Vol. 325, pp. 2433–2440). Santiago de Compostela, Spain: IOS Press.https://doi.org/10.3233/FAIA200375 

Baranowski, M., He, S., Lechner, M., Nguyen, T. S., &; Rakamari, Z. (2020). An SMT theory of fixed-point arithmetic. In Automated Reasoning (Vol. 12166, pp. 13–31). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-030-51074-9_2 

Lechner, M., Hasani, R., Amini, A., Henzinger, T. A., Rus, D., &; Grosu, R. (2020). Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. Springer Nature.https://doi.org/10.1038/s42256-020-00237-3 

Lechner, M., Hasani, R., Rus, D., &; Grosu, R. (2020). Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In Proceedings - IEEE International Conference on Robotics and Automation (pp. 5446–5452). Paris, France: IEEE.https://doi.org/10.1109/ICRA40945.2020.9196608 

Forets, M., Freire, D., &; Schilling, C. (2020). Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. In 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. Virtual Conference: IEEE.https://doi.org/10.1109/MEMOCODE51338.2020.9314994 

Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &; Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. In Proceedings of the International Conference on Embedded Software. Virtual .

Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &; Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE.https://doi.org/10.1109/TCAD.2020.3012859 

Avni, G., Ibsen-Jensen, R., &; Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v34i02.5546 

Henzinger, T. A., &; Sarac, N. E. (2020). Monitorability under assumptions. In Runtime Verification (Vol. 12399, pp. 3–18). Los Angeles, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-030-60508-7_1 

Kragl, B., Qadeer, S., &; Henzinger, T. A. (2020). Refinement for structured concurrent programs. In Computer Aided Verification (Vol. 12224, pp. 275–298). Springer Nature.https://doi.org/10.1007/978-3-030-53288-8_14 

Kragl, B., Enea, C., Henzinger, T. A., Mutluergil, S. O., &; Qadeer, S. (2020). Inductive sequentialization of asynchronous programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 227–242). London, United Kingdom: Association for Computing Machinery.https://doi.org/10.1145/3385412.3385980 

Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., &; Ulus, D. (2020). AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. International Journal on Software Tools for Technology Transfer. Springer Nature.https://doi.org/10.1007/s10009-020-00582-z 

Kragl, B. (2020). Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:8332 

Garcia Soto, M., &; Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium (pp. 244–256). Houston, TX, USA : IEEE.https://doi.org/10.1109/RTSS49844.2020.00031 

Garcia Soto, M., &; Prabhakar, P. (2020). Abstraction based verification of stability of polyhedral switched systems. Nonlinear Analysis: Hybrid Systems. Elsevier.https://doi.org/10.1016/j.nahs.2020.100856 

Frehse, G., Abate, A., Adzkiya, D., Becchi, A., Bu, L., Cimatti, A.,https://doi.org/10.29007/rjwn__Zaffanella, E. (2019). ARCH-COM Category Report: Hybrid systems with piecewise constant dynamics. In G. Frehse &; M. Althoff (Eds.), ARC. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems (Vol. 61, pp. 1–13). Montreal, Canada: EasyChair.https://doi.org/10.29007/rjwn 

Kundu, A., Garcia Soto, M., &; Prabhakar, P. (2019). Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In 5th Indian Control Conference Proceedings. Delhi, India: IEEE.https://doi.org/10.1109/INDIANCC.2019.8715598 

Avni, G., Henzinger, T. A., Ibsen-Jensen, R., &; Novotny, P. (2019). Bidding games on Markov decision processes. In https://doi.org/10.1007/978-3-030-30806-3_1__Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer.https://doi.org/10.1007/978-3-030-30806-3_1 

Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., &; Grosu, R. (2019). Designing worm-inspired neural networks for interpretable robotic control. In Proceedings - IEEE International Conference on Robotics and Automation (Vol. 2019–May). Montreal, QC, Canada: IEEE.https://doi.org/10.1109/icra.2019.8793840 

Aghajohari, M., Avni, G., &; Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.20 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.27 

Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., &; Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In Proceedings of the International Joint Conference on Neural Networks. Budapest, Hungary: IEEE.https://doi.org/10.1109/ijcnn.2019.8851954 

Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., &; Mikudionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen &; G. Woeginger (Eds.), Computing and Software Science (Vol. 10000, pp. 452–477). Springer Nature.https://doi.org/10.1007/978-3-319-91908-9_22 

Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M.,https://doi.org/10.29007/m75b__Schilling, C. (2019). ARCH-COM Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair Publications.https://doi.org/10.29007/m75b 

Althoff, M., Bak, S., Forets, M., Frehse, G., Kochdumper, N., Ray, R.,https://doi.org/10.29007/bj1w__Schupp, S. (2019). ARCH-COM Category Report: Continuous and hybrid systems with linear continuous dynamics. In EPiC Series in Computing (Vol. 61, pp. 14–40). Montreal, Canada: EasyChair.https://doi.org/10.29007/bj1w 

Avni, G., Henzinger, T. A., &; Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.MFCS.2019.11 

Christakis, M., Heizmann, M., Mansur, M. N., Schilling, C., &; Wüstholz, V. (2019). Semantic fault localization and suspiciousness ranking. In 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems  (Vol. 11427, pp. 226–243). Prague, Czech Republic: Springer Nature.https://doi.org/10.1007/978-3-030-17462-0_13 

Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &; Schilling, C. (2019). JuliaReach: A toolbox for set-based reachability. In Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control (Vol. 22, pp. 39–44). Montreal, QC, Canada: ACM.https://doi.org/10.1145/3302504.3311804 

Ferrere, T., Nickovic, D., Donzé, A., Ito, H., &; Kapinski, J. (2019). Interface-aware signal temporal logic. In Proceedings of the 2019 22nd ACM International Conference on Hybrid Systems: Computation and Control (pp. 57–66). Montreal, Canada: ACM.https://doi.org/10.1145/3302504.3311800 

Avni, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., &; Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 630–649). New York, NY, United States: Springer.https://doi.org/10.1007/978-3-030-25540-4_36 

Garcia Soto, M., Henzinger, T. A., Schilling, C., &; Zeleznik, L. (2019). Membership-based synthesis of linear hybrid automata. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 297–314). New York City, NY, USA: Springer.https://doi.org/10.1007/978-3-030-25540-4_16 

Avni, G., Henzinger, T. A., &; Chonev, V. K. (2019). Infinite-duration bidding games. Journal of the ACM. ACM.https://doi.org/10.1145/3340295 

Ferrere, T., Maler, O., Nidkovi, D., &; Pnueli, A. (2019). From real-time logic to timed automata. Journal of the ACM. ACM.https://doi.org/10.1145/3286976 

Guet, C. C., Henzinger, T. A., Igler, C., Petrov, T., &; Sezgin, A. (2019). Transient memory in gene regulation. In 17th International Conference on Computational Methods in Systems Biology (Vol. 11773, pp. 155–187). Trieste, Italy: Springer Nature.https://doi.org/10.1007/978-3-030-31304-3_9 

Nidkovi, D., Qin, X., Ferrere, T., Mateis, C., &; Deshmukh, J. (2019). Shape expressions for specifying and extracting signal features. In 19th International Conference on Runtime Verification (Vol. 11757, pp. 292–309). Porto, Portugal: Springer Nature.https://doi.org/10.1007/978-3-030-32079-9_17 

Kong, H., Bartocci, E., Jiang, Y., &; Henzinger, T. A. (2019). Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. In 17th International Conference on Formal Modeling and Analysis of Timed Systems (Vol. 11750, pp. 123–141). Amsterdam, The Netherlands: Springer Nature.https://doi.org/10.1007/978-3-030-29662-9_8 

Ferrere, T., Maler, O., &; Nickovic, D. (2019). Mixed-time signal temporal logic. In 17th International Conference on Formal Modeling and Analysis of Timed Systems (Vol. 11750, pp. 59–75). Amsterdam, The Netherlands: Springer Nature.https://doi.org/10.1007/978-3-030-29662-9_4 

Giacobbe, M. (2019). Automatic time-unbounded reachability analysis of hybrid systems. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:6894 

Clarke, E. M., Henzinger, T. A., Veith, H., &; Bloem, R. (2018). Handbook of Model Checking (1st ed.). Cham: Springer Nature.https://doi.org/10.1007/978-3-319-10575-8 

Clarke, E., Henzinger, T. A., &; Veith, H. (2018). Introduction to model checking. In T. A. Henzinger (Ed.), Handbook of Model Checking (pp. 1–26). Springer.https://doi.org/10.1007/978-3-319-10575-8_1 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, &; M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer.https://doi.org/10.1007/978-3-319-95246-8_9 

Avni, G., Guha, S., &; Kupferman, O. (2018). Timed network games with clocks (Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.MFCS.2018.23 

Kragl, B., Qadeer, S., &; Henzinger, T. A. (2018). Synchronizing the asynchronous (Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2018.21 

Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., &; Ulus, D. (2018). AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. In D. Beyer &; M. Huisman (Eds.) (Vol. 10806, pp. 303–319). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer.https://doi.org/10.1007/978-3-319-89963-3_18 

Ferrere, T., Henzinger, T. A., &; Saraç, E. (2018). A theory of register monitors (Vol. Part 8033, pp. 394–403). Presented at the LICS: Logic in Computer Science, Oxford, UK: IEEE.https://doi.org/10.1145/3209108.3209194 

Bakhirkin, A., Ferrere, T., &; Maler, O. (2018). Efficient parametric identification for STL. In Proceedings of the 21st International Conference on Hybrid Systems (pp. 177–186). Porto, Portugal: ACM.https://doi.org/10.1145/3178126.3178132 

Avni, G., Henzinger, T. A., &; Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer.https://doi.org/10.1007/978-3-030-04612-5_2 

Kragl, B., &; Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer.https://doi.org/10.1007/978-3-319-96145-3_5 

Bartocci, E., Ferrere, T., Manjunath, N., &; Nickovic, D. (2018). Localizing faults in simulink/stateflow models with STL (pp. 197–206). Presented at the HSCC: Hybrid Systems: Computation and Control, Porto, Portugal: Association for Computing Machinery, Inc.https://doi.org/10.1145/3178126.3178131 

Elgyütt, A., Ferrere, T., &; Henzinger, T. A. (2018). Monitoring temporal logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer.https://doi.org/10.1007/978-3-030-00151-3_4 

Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., &; Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer.https://doi.org/10.1007/978-3-030-00151-3_13 

Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., &; Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer.https://doi.org/10.1007/978-3-319-99154-2_4 

Kong, H., Bartocci, E., &; Henzinger, T. A. (2018). Reachable set over-approximation for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer.https://doi.org/10.1007/978-3-319-96145-3_24 

Jiang, Y., Liu, H., Song, H., Kong, H., Wang, R., Guan, Y., &; Sha, L. (2018). Safety-assured model-driven design of the multifunction vehicle bus controller. IEEE Transactions on Intelligent Transportation Systems. IEEE.https://doi.org/10.1109/TITS.2017.2778077 

Frehse, G., Giacobbe, M., &; Henzinger, T. A. (2018). Space-time interpolants (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer.https://doi.org/10.1007/978-3-319-96145-3_25 

Brázdil, T., Chatterjee, K., Kretinsky, J., &; Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer.https://doi.org/10.1007/978-3-319-89960-2_21 

Avni, G., &; Kupferman, O. (2018). Synthesis from component libraries with costs. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2017.11.001 

Ferrere, T. (2018). The compound interest in relaxing punctuality (Vol. 10951, pp. 147–164). Presented at the FM: International Symposium on Formal Methods, Oxford, UK: Springer.https://doi.org/10.1007/978-3-319-95582-7_9 

Bakhirkin, A., Ferrere, T., Henzinger, T. A., &; Nickovicl, D. (2018). Keynote: The first-order logic of signals. In 2018 International Conference on Embedded Software (pp. 1–10). Turin, Italy: IEEE.https://doi.org/10.1109/emsoft.2018.8537203 

Chatterjee, K., Elgyütt, A., Novotný, P., &; Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI.https://doi.org/10.24963/ijcai.2018/652 

Avni, G., Guha, S., &; Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. Games. MDPI AG.https://doi.org/10.3390/g9030039 

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

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

Daca, P., Henzinger, T. A., Kretinsky, J., &; Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/3060139 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/3152769 

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

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

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

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

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

Henzinger, T. A., Kragl, B., &; Qadeer, S. (2017). Synchronizing the asynchronous. IST Austria.https://doi.org/10.15479/AT:IST-2018-853-v2-2 

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

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

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

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

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

Daca, P. (2017). Statistical and logical methods for property checking. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:TH_730 

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

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

Svoreová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cbrná, I., &; Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier.https://doi.org/10.1016/j.nahs.2016.04.006 

Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., &; Tarrach, T. (2017). From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-016-0256-5 

Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., &; Petrov, T. (2017). Model checking the evolution of gene regulatory networks. Acta Informatica. Springer.https://doi.org/10.1007/s00236-016-0278-x 

Henzinger, T. A., &; Otop, J. (2017). Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. Elsevier.https://doi.org/10.1016/j.nahs.2016.09.001 

Avni, G., Goel, S., Henzinger, T. A., &; Rodríguez Navas, G. (2017). Computing scores of forwarding schemes in switched networks with probabilistic faults (Vol. 10206, pp. 169–187). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden: Springer.https://doi.org/10.1007/978-3-662-54580-5_10 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Velner, Y. (2017). Quantitative fair simulation games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2016.10.006 

Chatterjee, K., Kragl, B., Mishra, S., &; Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer.https://doi.org/10.1007/978-3-662-54434-1_11 

Avni, G., Guha, S., &; Kupferman, O. (2017). An abstraction-refinement methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia: AAAI Press.https://doi.org/10.24963/ijcai.2017/11