[{"date_created":"2026-10-21T12:12:11Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"ToHe"}],"_id":"23183","fulldoi":"https://doi.org/10.5281/zenodo.10065866","month":"11","ddc":["000"],"date_published":"2023-11-24T00:00:00Z","oa_version":"None","related_material":{"record":[{"id":"15333","status":"public","relation":"used_in_publication"}]},"oa":1,"date_updated":"2026-10-21T12:12:16Z","OA_place":"repository","citation":{"ista":"Chalupa M. 2023. Bubaak at SV-COMP 2024, Zenodo, <a href=\"https://doi.org/10.5281/zenodo.10065866\">10.5281/zenodo.10065866</a>.","ama":"Chalupa M. Bubaak at SV-COMP 2024. 2023. doi:<a href=\"https://doi.org/10.5281/zenodo.10065866\">10.5281/zenodo.10065866</a>","mla":"Chalupa, Marek. <i>Bubaak at SV-COMP 2024</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/zenodo.10065866\">10.5281/zenodo.10065866</a>.","chicago":"Chalupa, Marek. “Bubaak at SV-COMP 2024.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/zenodo.10065866\">https://doi.org/10.5281/zenodo.10065866</a>.","apa":"Chalupa, M. (2023). Bubaak at SV-COMP 2024. Zenodo. <a href=\"https://doi.org/10.5281/zenodo.10065866\">https://doi.org/10.5281/zenodo.10065866</a>","short":"M. Chalupa, (2023).","ieee":"M. Chalupa, “Bubaak at SV-COMP 2024.” Zenodo, 2023."},"year":"2023","doi":"10.5281/zenodo.10065866","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.10065866","open_access":"1"}],"OA_type":"green","author":[{"last_name":"Chalupa","full_name":"Chalupa, Marek","first_name":"Marek"}],"day":"24","publisher":"Zenodo","status":"public","contributor":[{"contributor_type":"project_member","first_name":"Cedric","last_name":"Richter"}],"type":"research_data_reference","article_processing_charge":"No","abstract":[{"text":"Cooperative verification is gaining momentum in recent years.  The usual setup in cooperative verification is that verifier A is run with some pre-defined resources, and if it is not able to verify the program, the verification task is passed to verifier B together with information learned about the program by the verifier A, then the chain can continue to verifier C, and so on. This scheme, which is employed by most of cooperative verification tools, is static and sequential: tools run one after another in a fixed pre-defined order and fixed parameters and resource limits.\r\n\r\nBubaak is a portfolio-based program analysis tool for verification of C programs that run multiple program verifiers in parallel and allows to exchange verification artifacts between them on run-time. Moreover, the new version of Bubaak allows to combine sequential and parallel portfolios into workflows. In brief, one or more verification tasks are initially started and each of the tasks, when it is done (e.g., because of hitting a time limit or finishing its job), can rewrite itself into a new task or generate a set of new verification tasks. This all happens dynamically based on the result of the task that finished.\r\n\r\nThis artifact contains Bubaak and Bubaak-SpLit (which is a specific configuration for Bubaak) that competed in SV-COMP 2024.","lang":"eng"}],"title":"Bubaak at SV-COMP 2024"},{"quality_controlled":"1","publisher":"Springer Nature","project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"status":"public","acknowledgement":"The formal framework for quantitative monitoring which is presented in this invited talk was defined jointly with N. Ege Saraç at LICS 2021. This work was supported in part by the Wittgenstein Award Z211-N23 of the Austrian Science Fund.","title":"Quantitative monitoring of software","abstract":[{"lang":"eng","text":"We present a formal framework for the online black-box monitoring of software using monitors with quantitative verdict functions. Quantitative verdict functions have several advantages. First, quantitative monitors can be approximate, i.e., the value of the verdict function does not need to correspond exactly to the value of the property under observation. Second, quantitative monitors can be quantified universally, i.e., for every possible observed behavior, the monitor tries to make the best effort to estimate the value of the property under observation. Third, quantitative monitors can watch boolean as well as quantitative properties, such as average response time. Fourth, quantitative monitors can use non-finite-state resources, such as counters. As a consequence, quantitative monitors can be compared according to how many resources they use (e.g., the number of counters) and how precisely they approximate the property under observation. This allows for a rich spectrum of cost-precision trade-offs in monitoring software."}],"citation":{"ieee":"T. A. Henzinger, “Quantitative monitoring of software,” in <i>Software Verification</i>, New Haven, CT, United States, 2022, vol. 13124, pp. 3–6.","short":"T.A. Henzinger, in:, Software Verification, Springer Nature, 2022, pp. 3–6.","apa":"Henzinger, T. A. (2022). Quantitative monitoring of software. In <i>Software Verification</i> (Vol. 13124, pp. 3–6). New Haven, CT, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-95561-8_1\">https://doi.org/10.1007/978-3-030-95561-8_1</a>","chicago":"Henzinger, Thomas A. “Quantitative Monitoring of Software.” In <i>Software Verification</i>, 13124:3–6. LNCS. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-030-95561-8_1\">https://doi.org/10.1007/978-3-030-95561-8_1</a>.","mla":"Henzinger, Thomas A. “Quantitative Monitoring of Software.” <i>Software Verification</i>, vol. 13124, Springer Nature, 2022, pp. 3–6, doi:<a href=\"https://doi.org/10.1007/978-3-030-95561-8_1\">10.1007/978-3-030-95561-8_1</a>.","ama":"Henzinger TA. Quantitative monitoring of software. In: <i>Software Verification</i>. Vol 13124. LNCS. Springer Nature; 2022:3-6. doi:<a href=\"https://doi.org/10.1007/978-3-030-95561-8_1\">10.1007/978-3-030-95561-8_1</a>","ista":"Henzinger TA. 2022. Quantitative monitoring of software. Software Verification. NSV: Numerical Software VerificationLNCS vol. 13124, 3–6."},"publication_status":"published","year":"2022","volume":13124,"doi":"10.1007/978-3-030-95561-8_1","series_title":"LNCS","publication":"Software Verification","oa_version":"None","intvolume":"     13124","isi":1,"date_updated":"2025-04-15T06:25:58Z","date_created":"2022-03-20T23:01:40Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"ToHe"}],"conference":{"location":"New Haven, CT, United States","name":"NSV: Numerical Software Verification","end_date":"2021-10-19","start_date":"2021-10-18"},"_id":"10891","month":"02","day":"22","type":"conference","article_processing_charge":"No","corr_author":"1","page":"3-6","scopus_import":"1","publication_identifier":{"isbn":["9783030955601"],"eissn":["1611-3349"],"issn":["0302-9743"]},"author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724"}],"external_id":{"isi":["000771713200001"]},"date_published":"2022-02-22T00:00:00Z","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-030-95561-8_1"},{"oa_version":"Preprint","publication":"2022 International Conference on Robotics and Automation","oa":1,"date_updated":"2025-09-10T09:39:53Z","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2022-09-04T22:02:02Z","department":[{"_id":"ToHe"}],"conference":{"start_date":"2022-05-23","name":"ICRA: International Conference on Robotics and Automation","end_date":"2022-05-27","location":"Philadelphia, PA, United States"},"_id":"12010","ec_funded":1,"month":"07","quality_controlled":"1","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"publisher":"IEEE","status":"public","acknowledgement":"L.B. was supported by the Doctoral College Resilient Embedded Systems. M.L. was supported in part by the ERC2020-AdG 101020093 and the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. were supported by The Boeing Company and the Office of Naval Research (ONR) Grant N00014-18-1-2830. R.G. was partially supported by the Horizon-2020 ECSEL Project grant No. 783163 (iDev40) and A.B. by FFG Project ADEX.","abstract":[{"lang":"eng","text":"World models learn behaviors in a latent imagination space to enhance the sample-efficiency of deep reinforcement learning (RL) algorithms. While learning world models for high-dimensional observations (e.g., pixel inputs) has become practicable on standard RL benchmarks and some games, their effectiveness in real-world robotics applications has not been explored. In this paper, we investigate how such agents generalize to real-world autonomous vehicle control tasks, where advanced model-free deep RL algorithms fail. In particular, we set up a series of time-lap tasks for an F1TENTH racing robot, equipped with a high-dimensional LiDAR sensor, on a set of test tracks with a gradual increase in their complexity. In this continuous-control setting, we show that model-based agents capable of learning in imagination substantially outperform model-free agents with respect to performance, sample efficiency, successful task completion, and generalization. Moreover, we show that the generalization ability of model-based agents strongly depends on the choice of their observation model. We provide extensive empirical evidence for the effectiveness of world models provided with long enough memory horizons in sim2real tasks."}],"title":"Latent imagination facilitates zero-shot transfer in autonomous racing","publication_status":"published","citation":{"ista":"Brunnbauer A, Berducci L, Brandstatter A, Lechner M, Hasani R, Rus D, Grosu R. 2022. Latent imagination facilitates zero-shot transfer in autonomous racing. 2022 International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, 7513–7520.","ama":"Brunnbauer A, Berducci L, Brandstatter A, et al. Latent imagination facilitates zero-shot transfer in autonomous racing. In: <i>2022 International Conference on Robotics and Automation</i>. IEEE; 2022:7513-7520. doi:<a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">10.1109/ICRA46639.2022.9811650</a>","mla":"Brunnbauer, Axel, et al. “Latent Imagination Facilitates Zero-Shot Transfer in Autonomous Racing.” <i>2022 International Conference on Robotics and Automation</i>, IEEE, 2022, pp. 7513–20, doi:<a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">10.1109/ICRA46639.2022.9811650</a>.","chicago":"Brunnbauer, Axel, Luigi Berducci, Andreas Brandstatter, Mathias Lechner, Ramin Hasani, Daniela Rus, and Radu Grosu. “Latent Imagination Facilitates Zero-Shot Transfer in Autonomous Racing.” In <i>2022 International Conference on Robotics and Automation</i>, 7513–20. IEEE, 2022. <a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">https://doi.org/10.1109/ICRA46639.2022.9811650</a>.","apa":"Brunnbauer, A., Berducci, L., Brandstatter, A., Lechner, M., Hasani, R., Rus, D., &#38; Grosu, R. (2022). Latent imagination facilitates zero-shot transfer in autonomous racing. In <i>2022 International Conference on Robotics and Automation</i> (pp. 7513–7520). Philadelphia, PA, United States: IEEE. <a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">https://doi.org/10.1109/ICRA46639.2022.9811650</a>","short":"A. Brunnbauer, L. Berducci, A. Brandstatter, M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, 2022 International Conference on Robotics and Automation, IEEE, 2022, pp. 7513–7520.","ieee":"A. Brunnbauer <i>et al.</i>, “Latent imagination facilitates zero-shot transfer in autonomous racing,” in <i>2022 International Conference on Robotics and Automation</i>, Philadelphia, PA, United States, 2022, pp. 7513–7520."},"year":"2022","doi":"10.1109/ICRA46639.2022.9811650","date_published":"2022-07-12T00:00:00Z","external_id":{"arxiv":["2103.04909"],"isi":["000941277600124"]},"arxiv":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1109/ICRA46639.2022.9811650","day":"12","type":"conference","article_processing_charge":"No","page":"7513-7520","publication_identifier":{"issn":["1050-4729"],"isbn":["9781728196817"]},"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2103.04909","open_access":"1"}],"author":[{"last_name":"Brunnbauer","first_name":"Axel","full_name":"Brunnbauer, Axel"},{"last_name":"Berducci","first_name":"Luigi","full_name":"Berducci, Luigi"},{"full_name":"Brandstatter, Andreas","first_name":"Andreas","last_name":"Brandstatter"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}]},{"type":"journal_article","article_processing_charge":"No","day":"15","scopus_import":"1","publication_identifier":{"issn":["2522-5839"]},"author":[{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"last_name":"Amini","first_name":"Alexander","full_name":"Amini, Alexander"},{"last_name":"Liebenwein","full_name":"Liebenwein, Lucas","first_name":"Lucas"},{"full_name":"Ray, Aaron","first_name":"Aaron","last_name":"Ray"},{"last_name":"Tschaikowski","first_name":"Max","full_name":"Tschaikowski, Max"},{"last_name":"Teschl","first_name":"Gerald","full_name":"Teschl, Gerald"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"}],"page":"992-1003","keyword":["Artificial Intelligence","Computer Networks and Communications","Computer Vision and Pattern Recognition","Human-Computer Interaction","Software"],"language":[{"iso":"eng"}],"external_id":{"isi":["000884215600003"],"arxiv":["2106.13898"]},"date_published":"2022-11-15T00:00:00Z","arxiv":1,"has_accepted_license":"1","fulldoi":"https://doi.org/10.1038/s42256-022-00556-7","ddc":["000"],"acknowledgement":"This research was supported in part by the AI2050 program at Schmidt Futures (grant G-22-63172), the Boeing Company, and the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under cooperative agreement number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes, notwithstanding any copyright notation herein. This work was further supported by The Boeing Company and Office of Naval Research grant N00014-18-1-2830. M.T. is supported by the Poul Due Jensen Foundation, grant 883901. M.L. was supported in part by the Austrian Science Fund under grant Z211-N23 (Wittgenstein Award). A.A. was supported by the National Science Foundation Graduate Research Fellowship Program. We thank T.-H. Wang, P. Kao, M. Chahine, W. Xiao, X. Li, L. Yin and Y. Ben for useful suggestions and for testing of CfC models to confirm the results across other domains.","abstract":[{"lang":"eng","text":"Continuous-time neural networks are a class of machine learning systems that can tackle representation learning on spatiotemporal decision-making tasks. These models are typically represented by continuous differential equations. However, their expressive power when they are deployed on computers is bottlenecked by numerical differential equation solvers. This limitation has notably slowed down the scaling and understanding of numerous natural physical phenomena such as the dynamics of nervous systems. Ideally, we would circumvent this bottleneck by solving the given dynamical system in closed form. This is known to be intractable in general. Here, we show that it is possible to closely approximate the interaction between neurons and synapses—the building blocks of natural and artificial neural networks—constructed by liquid time-constant networks efficiently in closed form. To this end, we compute a tightly bounded approximation of the solution of an integral appearing in liquid time-constant dynamics that has had no known closed-form solution so far. This closed-form solution impacts the design of continuous-time and continuous-depth neural models. For instance, since time appears explicitly in closed form, the formulation relaxes the need for complex numerical solvers. Consequently, we obtain models that are between one and five orders of magnitude faster in training and inference compared with differential equation-based counterparts. More importantly, in contrast to ordinary differential equation-based continuous networks, closed-form networks can scale remarkably well compared with other deep learning instances. Lastly, as these models are derived from liquid networks, they show good performance in time-series modelling compared with advanced recurrent neural network models."}],"title":"Closed-form continuous-time neural networks","quality_controlled":"1","project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publisher":"Springer Nature","issue":"11","status":"public","doi":"10.1038/s42256-022-00556-7","publication_status":"published","citation":{"ista":"Hasani R, Lechner M, Amini A, Liebenwein L, Ray A, Tschaikowski M, Teschl G, Rus D. 2022. Closed-form continuous-time neural networks. Nature Machine Intelligence. 4(11), 992–1003.","ama":"Hasani R, Lechner M, Amini A, et al. Closed-form continuous-time neural networks. <i>Nature Machine Intelligence</i>. 2022;4(11):992-1003. doi:<a href=\"https://doi.org/10.1038/s42256-022-00556-7\">10.1038/s42256-022-00556-7</a>","mla":"Hasani, Ramin, et al. “Closed-Form Continuous-Time Neural Networks.” <i>Nature Machine Intelligence</i>, vol. 4, no. 11, Springer Nature, 2022, pp. 992–1003, doi:<a href=\"https://doi.org/10.1038/s42256-022-00556-7\">10.1038/s42256-022-00556-7</a>.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Lucas Liebenwein, Aaron Ray, Max Tschaikowski, Gerald Teschl, and Daniela Rus. “Closed-Form Continuous-Time Neural Networks.” <i>Nature Machine Intelligence</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s42256-022-00556-7\">https://doi.org/10.1038/s42256-022-00556-7</a>.","apa":"Hasani, R., Lechner, M., Amini, A., Liebenwein, L., Ray, A., Tschaikowski, M., … Rus, D. (2022). Closed-form continuous-time neural networks. <i>Nature Machine Intelligence</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42256-022-00556-7\">https://doi.org/10.1038/s42256-022-00556-7</a>","short":"R. Hasani, M. Lechner, A. Amini, L. Liebenwein, A. Ray, M. Tschaikowski, G. Teschl, D. Rus, Nature Machine Intelligence 4 (2022) 992–1003.","ieee":"R. Hasani <i>et al.</i>, “Closed-form continuous-time neural networks,” <i>Nature Machine Intelligence</i>, vol. 4, no. 11. Springer Nature, pp. 992–1003, 2022."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":4,"year":"2022","related_material":{"link":[{"url":"https://doi.org/10.1038/s42256-022-00597-y","relation":"erratum"}]},"oa":1,"date_updated":"2025-04-15T06:26:02Z","file":[{"date_created":"2023-01-24T09:49:44Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":3259553,"checksum":"b4789122ce04bfb4ac042390f59aaa8b","file_name":"2022_NatureMachineIntelligence_Hasani.pdf","creator":"dernst","success":1,"file_id":"12355","date_updated":"2023-01-24T09:49:44Z"}],"isi":1,"oa_version":"Published Version","publication":"Nature Machine Intelligence","intvolume":"         4","file_date_updated":"2023-01-24T09:49:44Z","_id":"12147","month":"11","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2023-01-12T12:07:21Z","article_type":"original","department":[{"_id":"ToHe"}]},{"author":[{"orcid":"0000-0003-2936-5719","last_name":"Garcia Soto","first_name":"Miriam","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","full_name":"Garcia Soto, Miriam"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"last_name":"Schilling","orcid":"0000-0003-3658-1065","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","full_name":"Schilling, Christian"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2208.06383","open_access":"1"}],"scopus_import":"1","publication_identifier":{"isbn":["9783031199912"],"eissn":["1611-3349"],"eisbn":["9783031199929"],"issn":["0302-9743"]},"corr_author":"1","page":"337-353","article_processing_charge":"No","type":"conference","day":"21","fulldoi":"https://doi.org/10.1007/978-3-031-19992-9_22","language":[{"iso":"eng"}],"arxiv":1,"external_id":{"isi":["001456146500022"],"arxiv":["2208.06383"]},"alternative_title":["LNCS"],"date_published":"2022-10-21T00:00:00Z","doi":"10.1007/978-3-031-19992-9_22","volume":13505,"year":"2022","citation":{"ama":"Garcia Soto M, Henzinger TA, Schilling C. Synthesis of parametric hybrid automata from time series. In: <i>20th International Symposium on Automated Technology for Verification and Analysis</i>. Vol 13505. Springer Nature; 2022:337-353. doi:<a href=\"https://doi.org/10.1007/978-3-031-19992-9_22\">10.1007/978-3-031-19992-9_22</a>","mla":"Garcia Soto, Miriam, et al. “Synthesis of Parametric Hybrid Automata from Time Series.” <i>20th International Symposium on Automated Technology for Verification and Analysis</i>, vol. 13505, Springer Nature, 2022, pp. 337–53, doi:<a href=\"https://doi.org/10.1007/978-3-031-19992-9_22\">10.1007/978-3-031-19992-9_22</a>.","ista":"Garcia Soto M, Henzinger TA, Schilling C. 2022. Synthesis of parametric hybrid automata from time series. 20th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 13505, 337–353.","short":"M. Garcia Soto, T.A. Henzinger, C. Schilling, in:, 20th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2022, pp. 337–353.","ieee":"M. Garcia Soto, T. A. Henzinger, and C. Schilling, “Synthesis of parametric hybrid automata from time series,” in <i>20th International Symposium on Automated Technology for Verification and Analysis</i>, Virtual, 2022, vol. 13505, pp. 337–353.","chicago":"Garcia Soto, Miriam, Thomas A Henzinger, and Christian Schilling. “Synthesis of Parametric Hybrid Automata from Time Series.” In <i>20th International Symposium on Automated Technology for Verification and Analysis</i>, 13505:337–53. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-19992-9_22\">https://doi.org/10.1007/978-3-031-19992-9_22</a>.","apa":"Garcia Soto, M., Henzinger, T. A., &#38; Schilling, C. (2022). Synthesis of parametric hybrid automata from time series. In <i>20th International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 13505, pp. 337–353). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-19992-9_22\">https://doi.org/10.1007/978-3-031-19992-9_22</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"We propose an algorithmic approach for synthesizing linear hybrid automata from time-series data. Unlike existing approaches, our approach provides a whole family of models with the same discrete structure but different dynamics. Each model in the family is guaranteed to capture the input data up to a precision error ε, in the following sense: For each time series, the model contains an execution that is ε-close to the data points. Our construction allows to effectively choose a model from this family with minimal precision error ε. We demonstrate the algorithm’s efficiency and its ability to find precise models in two case studies."}],"title":"Synthesis of parametric hybrid automata from time series","acknowledgement":"This work was supported in part by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 847635, by the ERC-2020-AdG 101020093, by DIREC - Digital Research Centre Denmark, and by the Villum Investigator Grant S4OS.","status":"public","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"publisher":"Springer Nature","quality_controlled":"1","month":"10","_id":"12171","ec_funded":1,"conference":{"location":"Virtual","end_date":"2022-10-28","name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2022-10-25"},"department":[{"_id":"ToHe"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2023-01-12T12:11:16Z","isi":1,"date_updated":"2025-09-10T09:50:08Z","oa":1,"intvolume":"     13505","publication":"20th International Symposium on Automated Technology for Verification and Analysis","oa_version":"Preprint"},{"date_updated":"2025-09-10T09:50:45Z","isi":1,"oa":1,"intvolume":"     13608","publication":"16th International Conference on Reachability Problems","oa_version":"Preprint","month":"10","ec_funded":1,"_id":"12175","conference":{"start_date":"2022-10-17","location":"Kaiserslautern, Germany","name":"RC: Reachability Problems","end_date":"2022-10-21"},"department":[{"_id":"ToHe"}],"date_created":"2023-01-12T12:11:57Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"History-deterministic timed automata are not determinizable","abstract":[{"lang":"eng","text":"An automaton is history-deterministic (HD) if one can safely resolve its non-deterministic choices on the fly. In a recent paper, Henzinger, Lehtinen and Totzke studied this in the context of Timed Automata [9], where it was conjectured that the class of timed ω-languages recognised by HD-timed automata strictly extends that of deterministic ones. We provide a proof for this fact."}],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, the EPSRC project EP/V025848/1, and the EPSRC project EP/X017796/1.","status":"public","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"publisher":"Springer Nature","quality_controlled":"1","doi":"10.1007/978-3-031-19135-0_5","volume":13608,"year":"2022","publication_status":"published","citation":{"apa":"Bose, S., Henzinger, T. A., Lehtinen, K., Schewe, S., &#38; Totzke, P. (2022). History-deterministic timed automata are not determinizable. In <i>16th International Conference on Reachability Problems</i> (Vol. 13608, pp. 67–76). Kaiserslautern, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-19135-0_5\">https://doi.org/10.1007/978-3-031-19135-0_5</a>","chicago":"Bose, Sougata, Thomas A Henzinger, Karoliina Lehtinen, Sven Schewe, and Patrick Totzke. “History-Deterministic Timed Automata Are Not Determinizable.” In <i>16th International Conference on Reachability Problems</i>, 13608:67–76. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-19135-0_5\">https://doi.org/10.1007/978-3-031-19135-0_5</a>.","ieee":"S. Bose, T. A. Henzinger, K. Lehtinen, S. Schewe, and P. Totzke, “History-deterministic timed automata are not determinizable,” in <i>16th International Conference on Reachability Problems</i>, Kaiserslautern, Germany, 2022, vol. 13608, pp. 67–76.","short":"S. Bose, T.A. Henzinger, K. Lehtinen, S. Schewe, P. Totzke, in:, 16th International Conference on Reachability Problems, Springer Nature, 2022, pp. 67–76.","ista":"Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. 2022. History-deterministic timed automata are not determinizable. 16th International Conference on Reachability Problems. RC: Reachability Problems, LNCS, vol. 13608, 67–76.","mla":"Bose, Sougata, et al. “History-Deterministic Timed Automata Are Not Determinizable.” <i>16th International Conference on Reachability Problems</i>, vol. 13608, Springer Nature, 2022, pp. 67–76, doi:<a href=\"https://doi.org/10.1007/978-3-031-19135-0_5\">10.1007/978-3-031-19135-0_5</a>.","ama":"Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. History-deterministic timed automata are not determinizable. In: <i>16th International Conference on Reachability Problems</i>. Vol 13608. Springer Nature; 2022:67-76. doi:<a href=\"https://doi.org/10.1007/978-3-031-19135-0_5\">10.1007/978-3-031-19135-0_5</a>"},"language":[{"iso":"eng"}],"external_id":{"isi":["001333698300005"]},"alternative_title":["LNCS"],"date_published":"2022-10-12T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-031-19135-0_5","article_processing_charge":"No","type":"conference","day":"12","author":[{"first_name":"Sougata","full_name":"Bose, Sougata","last_name":"Bose"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"first_name":"Karoliina","full_name":"Lehtinen, Karoliina","last_name":"Lehtinen"},{"last_name":"Schewe","first_name":"Sven","full_name":"Schewe, Sven"},{"last_name":"Totzke","first_name":"Patrick","full_name":"Totzke, Patrick"}],"main_file_link":[{"open_access":"1","url":"https://hal.science/hal-03849398/"}],"publication_identifier":{"isbn":["9783031191343"],"eissn":["1611-3349"],"eisbn":["9783031191350"],"issn":["0302-9743"]},"scopus_import":"1","page":"67-76"},{"page":"109-129","scopus_import":"1","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031131875"],"eisbn":["9783031131882"]},"author":[{"full_name":"Doveri, Kyveli","first_name":"Kyveli","last_name":"Doveri"},{"last_name":"Ganty","full_name":"Ganty, Pierre","first_name":"Pierre"},{"full_name":"Mazzocchi, Nicolas Adrien","first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","last_name":"Mazzocchi"}],"day":"06","type":"conference","article_processing_charge":"No","has_accepted_license":"1","fulldoi":"https://doi.org/10.1007/978-3-031-13188-2_6","ddc":["000"],"date_published":"2022-08-06T00:00:00Z","external_id":{"isi":["000870310500006"],"arxiv":["2207.13549"]},"alternative_title":["LNCS"],"arxiv":1,"language":[{"iso":"eng"}],"publication_status":"published","citation":{"mla":"Doveri, Kyveli, et al. “FORQ-Based Language Inclusion Formal Testing.” <i>Computer Aided Verification</i>, vol. 13372, Springer Nature, 2022, pp. 109–29, doi:<a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">10.1007/978-3-031-13188-2_6</a>.","ama":"Doveri K, Ganty P, Mazzocchi NA. FORQ-based language inclusion formal testing. In: <i>Computer Aided Verification</i>. Vol 13372. Springer Nature; 2022:109-129. doi:<a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">10.1007/978-3-031-13188-2_6</a>","ista":"Doveri K, Ganty P, Mazzocchi NA. 2022. FORQ-based language inclusion formal testing. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13372, 109–129.","ieee":"K. Doveri, P. Ganty, and N. A. Mazzocchi, “FORQ-based language inclusion formal testing,” in <i>Computer Aided Verification</i>, Haifa, Israel, 2022, vol. 13372, pp. 109–129.","short":"K. Doveri, P. Ganty, N.A. Mazzocchi, in:, Computer Aided Verification, Springer Nature, 2022, pp. 109–129.","apa":"Doveri, K., Ganty, P., &#38; Mazzocchi, N. A. (2022). FORQ-based language inclusion formal testing. In <i>Computer Aided Verification</i> (Vol. 13372, pp. 109–129). Haifa, Israel: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">https://doi.org/10.1007/978-3-031-13188-2_6</a>","chicago":"Doveri, Kyveli, Pierre Ganty, and Nicolas Adrien Mazzocchi. “FORQ-Based Language Inclusion Formal Testing.” In <i>Computer Aided Verification</i>, 13372:109–29. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">https://doi.org/10.1007/978-3-031-13188-2_6</a>."},"volume":13372,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2022","doi":"10.1007/978-3-031-13188-2_6","quality_controlled":"1","publisher":"Springer Nature","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"}],"status":"public","acknowledgement":"This work was partially funded by the ESF Investing in your future, the Madrid regional project S2018/TCS-4339 BLOQUES, the Spanish project PGC2018-102210-B-I00 BOSCO, the Ramón y Cajal fellowship RYC-2016-20281, and the ERC grant PR1001ERC02.","title":"FORQ-based language inclusion formal testing","abstract":[{"lang":"eng","text":"We propose a novel algorithm to decide the language inclusion between (nondeterministic) Büchi automata, a PSPACE-complete problem. Our approach, like others before, leverage a notion of quasiorder to prune the search for a counterexample by discarding candidates which are subsumed by others for the quasiorder. Discarded candidates are guaranteed to not compromise the completeness of the algorithm. The novelty of our work lies in the quasiorder used to discard candidates. We introduce FORQs (family of right quasiorders) that we obtain by adapting the notion of family of right congruences put forward by Maler and Staiger in 1993. We define a FORQ-based inclusion algorithm which we prove correct and instantiate it for a specific FORQ, called the structural FORQ, induced by the Büchi automaton to the right of the inclusion sign. The resulting implementation, called FORKLIFT, scales up better than the state-of-the-art on a variety of benchmarks including benchmarks from program verification and theorem proving for word combinatorics. Artifact: https://doi.org/10.5281/zenodo.6552870"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2023-01-16T10:06:31Z","department":[{"_id":"ToHe"}],"conference":{"location":"Haifa, Israel","end_date":"2022-08-10","name":"CAV: Computer Aided Verification","start_date":"2022-08-07"},"_id":"12302","ec_funded":1,"month":"08","publication":"Computer Aided Verification","oa_version":"Published Version","intvolume":"     13372","file_date_updated":"2023-01-30T12:51:02Z","oa":1,"isi":1,"file":[{"relation":"main_file","file_size":497682,"checksum":"edc363b1be5447a09063e115c247918a","content_type":"application/pdf","date_created":"2023-01-30T12:51:02Z","access_level":"open_access","date_updated":"2023-01-30T12:51:02Z","file_id":"12465","success":1,"creator":"dernst","file_name":"2022_LNCS_Doveri.pdf"}],"date_updated":"2025-04-14T07:55:56Z"},{"acknowledgement":"Guy Avni: Work partially supported by the Israel Science Foundation, ISF grant agreement\r\nno 1679/21.\r\nThomas A. Henzinger: This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe would like to thank all our collaborators Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful for you as it was for us.","abstract":[{"lang":"eng","text":"A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an \"auction\" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We summarize how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games."}],"title":"An updated survey of bidding games on graphs","quality_controlled":"1","status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi":"10.4230/LIPIcs.MFCS.2022.3","citation":{"ista":"Avni G, Henzinger TA. 2022. An updated survey of bidding games on graphs. 47th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceLeibniz International Proceedings in Informatics (LIPIcs) vol. 241, 3:1-3:6.","mla":"Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on Graphs.” <i>47th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 3:1-3:6, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">10.4230/LIPIcs.MFCS.2022.3</a>.","ama":"Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: <i>47th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">10.4230/LIPIcs.MFCS.2022.3</a>","apa":"Avni, G., &#38; Henzinger, T. A. (2022). An updated survey of bidding games on graphs. In <i>47th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">https://doi.org/10.4230/LIPIcs.MFCS.2022.3</a>","chicago":"Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games on Graphs.” In <i>47th International Symposium on Mathematical Foundations of Computer Science</i>, 241:3:1-3:6. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">https://doi.org/10.4230/LIPIcs.MFCS.2022.3</a>.","ieee":"G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in <i>47th International Symposium on Mathematical Foundations of Computer Science</i>, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.","short":"G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 3:1-3:6."},"publication_status":"published","volume":241,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2022","file":[{"date_updated":"2023-02-06T09:13:04Z","file_id":"12519","success":1,"creator":"dernst","file_name":"2022_LIPICs_Avni.pdf","file_size":624586,"checksum":"1888ec9421622f9526fbec2de035f132","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_created":"2023-02-06T09:13:04Z"}],"date_updated":"2025-07-10T11:50:27Z","oa":1,"oa_version":"Published Version","publication":"47th International Symposium on Mathematical Foundations of Computer Science","file_date_updated":"2023-02-06T09:13:04Z","intvolume":"       241","_id":"12509","ec_funded":1,"conference":{"location":"Vienna, Austria","end_date":"2022-08-26","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2022-08-22"},"month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-02-05T17:26:01Z","department":[{"_id":"ToHe"}],"type":"conference","article_processing_charge":"No","place":"Dagstuhl, Germany","day":"22","scopus_import":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772563"]},"author":[{"last_name":"Avni","orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"corr_author":"1","page":"3:1-3:6","language":[{"iso":"eng"}],"date_published":"2022-08-22T00:00:00Z","has_accepted_license":"1","ddc":["000"],"fulldoi":"https://doi.org/10.4230/LIPIcs.MFCS.2022.3"},{"keyword":["General Medicine"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2107.08467"]},"date_published":"2022-06-28T00:00:00Z","arxiv":1,"fulldoi":"https://doi.org/10.1609/aaai.v36i6.20631","type":"journal_article","article_processing_charge":"No","day":"28","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2107.08467"}],"publication_identifier":{"issn":["2159-5399"],"isbn":["978577358350"],"eissn":["2374-3468"]},"scopus_import":"1","author":[{"last_name":"Gruenbacher","first_name":"Sophie A.","full_name":"Gruenbacher, Sophie A."},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"first_name":"Scott A.","full_name":"Smolka, Scott A.","last_name":"Smolka"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"page":"6755-6764","date_updated":"2025-04-15T06:26:14Z","oa":1,"oa_version":"Preprint","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","intvolume":"        36","ec_funded":1,"_id":"12510","month":"06","date_created":"2023-02-05T17:27:42Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"article_type":"original","acknowledgement":"SG is funded by the Austrian Science Fund (FWF) project number W1255-N23. ML and TH are supported in part by FWF under grant Z211-N23 (Wittgenstein Award) and the ERC-2020-AdG 101020093. SS is supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832. RH and DR are partially supported by Boeing. RG is partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40).","abstract":[{"text":"We introduce a new statistical verification algorithm that formally quantifies the behavioral robustness of any time-continuous process formulated as a continuous-depth model. Our algorithm solves a set of global optimization (Go) problems over a given time horizon to construct a tight enclosure (Tube) of the set of all process executions starting from a ball of initial states. We call our algorithm GoTube. Through its construction, GoTube ensures that the bounding tube is conservative up to a desired probability and up to a desired tightness.\r\n GoTube is implemented in JAX and optimized to scale to complex continuous-depth neural network models. Compared to advanced reachability analysis tools for time-continuous neural networks, GoTube does not accumulate overapproximation errors between time steps and avoids the infamous wrapping effect inherent in symbolic techniques. We show that GoTube substantially outperforms state-of-the-art verification tools in terms of the size of the initial ball, speed, time-horizon, task completion, and scalability on a large set of experiments.\r\n GoTube is stable and sets the state-of-the-art in terms of its ability to scale to time horizons well beyond what has been previously possible.","lang":"eng"}],"title":"GoTube: Scalable statistical verification of continuous-depth models","quality_controlled":"1","issue":"6","status":"public","project":[{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"publisher":"Association for the Advancement of Artificial Intelligence","doi":"10.1609/aaai.v36i6.20631","publication_status":"published","citation":{"short":"S.A. Gruenbacher, M. Lechner, R. Hasani, D. Rus, T.A. Henzinger, S.A. Smolka, R. Grosu, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 6755–6764.","ieee":"S. A. Gruenbacher <i>et al.</i>, “GoTube: Scalable statistical verification of continuous-depth models,” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 6. Association for the Advancement of Artificial Intelligence, pp. 6755–6764, 2022.","chicago":"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.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2022. <a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">https://doi.org/10.1609/aaai.v36i6.20631</a>.","apa":"Gruenbacher, S. A., Lechner, M., Hasani, R., Rus, D., Henzinger, T. A., Smolka, S. A., &#38; Grosu, R. (2022). GoTube: Scalable statistical verification of continuous-depth models. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">https://doi.org/10.1609/aaai.v36i6.20631</a>","ama":"Gruenbacher SA, Lechner M, Hasani R, et al. GoTube: Scalable statistical verification of continuous-depth models. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. 2022;36(6):6755-6764. doi:<a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">10.1609/aaai.v36i6.20631</a>","mla":"Gruenbacher, Sophie A., et al. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 6, Association for the Advancement of Artificial Intelligence, 2022, pp. 6755–64, doi:<a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">10.1609/aaai.v36i6.20631</a>.","ista":"Gruenbacher SA, Lechner M, Hasani R, Rus D, Henzinger TA, Smolka SA, Grosu R. 2022. GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. 36(6), 6755–6764."},"volume":36,"year":"2022"},{"arxiv":1,"date_published":"2022-06-28T00:00:00Z","external_id":{"arxiv":["2112.09495"]},"language":[{"iso":"eng"}],"keyword":["General Medicine"],"fulldoi":"https://doi.org/10.1609/aaai.v36i7.20695","day":"28","article_processing_charge":"No","type":"journal_article","page":"7326-7336","corr_author":"1","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"main_file_link":[{"url":"https://arxiv.org/abs/2112.09495","open_access":"1"}],"scopus_import":"1","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["9781577358350"]},"intvolume":"        36","oa_version":"Preprint","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","date_updated":"2026-04-07T13:27:55Z","oa":1,"related_material":{"record":[{"id":"14539","status":"public","relation":"dissertation_contains"}]},"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-02-05T17:29:50Z","month":"06","ec_funded":1,"_id":"12511","status":"public","issue":"7","publisher":"Association for the Advancement of Artificial Intelligence","project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"quality_controlled":"1","abstract":[{"text":"We consider the problem of formally verifying almost-sure (a.s.) asymptotic stability in discrete-time nonlinear stochastic control systems. While verifying stability in deterministic control systems is extensively studied in the literature, verifying stability in stochastic control systems is an open problem. The few existing works on this topic either consider only specialized forms of stochasticity or make restrictive assumptions on the system, rendering them inapplicable to learning algorithms with neural network policies. \r\n In this work, we present an approach for general nonlinear stochastic control problems with two novel aspects: (a) instead of classical stochastic extensions of Lyapunov functions, we use ranking supermartingales (RSMs) to certify a.s. asymptotic stability, and (b) we present a method for learning neural network RSMs. \r\n We prove that our approach guarantees a.s. asymptotic stability of the system and\r\n provides the first method to obtain bounds on the stabilization time, which stochastic Lyapunov functions do not.\r\n Finally, we validate our approach experimentally on a set of nonlinear stochastic reinforcement learning environments with neural network policies.","lang":"eng"}],"title":"Stability verification in stochastic control systems via neural network supermartingales","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme\r\nunder the Marie Skłodowska-Curie Grant Agreement No. 665385.","volume":36,"year":"2022","citation":{"mla":"Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:<a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">10.1609/aaai.v36i7.20695</a>.","ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. Stability verification in stochastic control systems via neural network supermartingales. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. 2022;36(7):7326-7336. doi:<a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">10.1609/aaai.v36i7.20695</a>","ista":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. 2022. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 36(7), 7326–7336.","ieee":"M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.","short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 7326–7336.","apa":"Lechner, M., Zikelic, D., Chatterjee, K., &#38; Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">https://doi.org/10.1609/aaai.v36i7.20695</a>","chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2022. <a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">https://doi.org/10.1609/aaai.v36i7.20695</a>."},"publication_status":"published","doi":"10.1609/aaai.v36i7.20695"},{"article_number":"2210.05308","corr_author":"1","main_file_link":[{"url":"https://arxiv.org/abs/2210.05308","open_access":"1"}],"author":[{"last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"},{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"day":"29","type":"preprint","article_processing_charge":"No","fulldoi":"https://doi.org/10.48550/ARXIV.2210.05308","external_id":{"arxiv":["2210.05308"]},"date_published":"2022-11-29T00:00:00Z","arxiv":1,"language":[{"iso":"eng"}],"citation":{"mla":"Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” <i>ArXiv</i>, 2210.05308, doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">10.48550/ARXIV.2210.05308</a>.","ama":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">10.48550/ARXIV.2210.05308</a>","ista":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv, 2210.05308.","ieee":"D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” <i>arXiv</i>. .","short":"D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, ArXiv (n.d.).","apa":"Zikelic, D., Lechner, M., Henzinger, T. A., &#38; Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">https://doi.org/10.48550/ARXIV.2210.05308</a>","chicago":"Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">https://doi.org/10.48550/ARXIV.2210.05308</a>."},"OA_place":"repository","publication_status":"draft","tmp":{"short":"CC BY-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","image":"/images/cc_by_sa.png","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"year":"2022","doi":"10.48550/ARXIV.2210.05308","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"},{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"status":"public","abstract":[{"text":"We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold $p\\in[0,1]$ over the infinite time horizon. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees by imposing constraints on what can be viewed as a stochastic extension of level sets of Lyapunov functions for deterministic systems. Our approach solves several important problems -- it can be used to learn a control policy from scratch, to verify a reach-avoid specification for a fixed control policy, or to fine-tune a pre-trained policy if it does not satisfy the reach-avoid specification. We validate our approach on $3$ stochastic non-linear reinforcement learning tasks.","lang":"eng"}],"title":"Learning control policies for stochastic systems with reach-avoid guarantees","date_created":"2023-11-24T13:10:09Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ec_funded":1,"_id":"14600","month":"11","oa_version":"Preprint","publication":"arXiv","related_material":{"record":[{"relation":"later_version","id":"14830","status":"public"},{"id":"14539","status":"public","relation":"dissertation_contains"}]},"oa":1,"date_updated":"2026-04-07T13:27:56Z"},{"OA_place":"repository","citation":{"ista":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv, 2205.11991.","ama":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2205.11991\">10.48550/arXiv.2205.11991</a>","mla":"Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control Systems.” <i>ArXiv</i>, 2205.11991, doi:<a href=\"https://doi.org/10.48550/arXiv.2205.11991\">10.48550/arXiv.2205.11991</a>.","chicago":"Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger. “Learning Stabilizing Policies in Stochastic Control Systems.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2205.11991\">https://doi.org/10.48550/arXiv.2205.11991</a>.","apa":"Zikelic, D., Lechner, M., Chatterjee, K., &#38; Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2205.11991\">https://doi.org/10.48550/arXiv.2205.11991</a>","short":"D. Zikelic, M. Lechner, K. Chatterjee, T.A. Henzinger, ArXiv (n.d.).","ieee":"D. Zikelic, M. Lechner, K. Chatterjee, and T. A. Henzinger, “Learning stabilizing policies in stochastic control systems,” <i>arXiv</i>. ."},"publication_status":"draft","year":"2022","doi":"10.48550/arXiv.2205.11991","status":"public","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"title":"Learning stabilizing policies in stochastic control systems","abstract":[{"text":"In this work, we address the problem of learning provably stable neural\r\nnetwork policies for stochastic control systems. While recent work has\r\ndemonstrated the feasibility of certifying given policies using martingale\r\ntheory, the problem of how to learn such policies is little explored. Here, we\r\nstudy the effectiveness of jointly learning a policy together with a martingale\r\ncertificate that proves its stability using a single learning algorithm. We\r\nobserve that the joint optimization problem becomes easily stuck in local\r\nminima when starting from a randomly initialized policy. Our results suggest\r\nthat some form of pre-training of the policy is required for the joint\r\noptimization to repair and verify the policy successfully.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-11-24T13:22:30Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ec_funded":1,"_id":"14601","month":"05","publication":"arXiv","oa_version":"Preprint","related_material":{"record":[{"relation":"dissertation_contains","id":"14539","status":"public"}]},"date_updated":"2026-04-07T13:27:56Z","oa":1,"corr_author":"1","article_number":"2205.11991","main_file_link":[{"url":"https://arxiv.org/abs/2205.11991","open_access":"1"}],"author":[{"orcid":"0000-0002-4681-1699","last_name":"Zikelic","full_name":"Zikelic, Dorde","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"day":"24","type":"preprint","article_processing_charge":"No","fulldoi":"https://doi.org/10.48550/arXiv.2205.11991","date_published":"2022-05-24T00:00:00Z","external_id":{"arxiv":["2205.11991"]},"arxiv":1,"language":[{"iso":"eng"}]},{"article_processing_charge":"No","type":"conference","day":"14","author":[{"first_name":"Ezio","full_name":"Bartocci, Ezio","last_name":"Bartocci"},{"orcid":"0000-0001-5199-3143","last_name":"Ferrere","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan"},{"last_name":"Da Costa","full_name":"Da Costa, Ana Oliveira","first_name":"Ana Oliveira"}],"publication_identifier":{"eisbn":["9783030945831"],"isbn":["9783030945824"],"eissn":["1611-3349"],"issn":["0302-9743"]},"scopus_import":"1","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2105.02013"}],"page":"1-19","language":[{"iso":"eng"}],"arxiv":1,"alternative_title":["LNCS"],"date_published":"2022-01-14T00:00:00Z","external_id":{"arxiv":["2105.02013"],"isi":["001059208500001"]},"fulldoi":"https://doi.org/10.1007/978-3-030-94583-1_1","title":"Flavors of sequential information flow","abstract":[{"lang":"eng","text":"We study the problem of specifying sequential information-flow properties of systems. Information-flow properties are hyperproperties, as they compare different traces of a system. Sequential information-flow properties can express changes, over time, in the information-flow constraints. For example, information-flow constraints during an initialization phase of a system may be different from information-flow constraints that are required during the operation phase. We formalize several variants of interpreting sequential information-flow constraints, which arise from different assumptions about what can be observed of the system. For this purpose, we introduce a first-order logic, called Hypertrace Logic, with both trace and time quantifiers for specifying linear-time hyperproperties. We prove that HyperLTL, which corresponds to a fragment of Hypertrace Logic with restricted quantifier prefixes, cannot specify the majority of the studied variants of sequential information flow, including all variants in which the transition between sequential phases (such as initialization and operation) happens asynchronously. Our results rely on new equivalences between sets of traces that cannot be distinguished by certain classes of formulas from Hypertrace Logic. This presents a new approach to proving inexpressiveness results for HyperLTL."}],"acknowledgement":"This work was funded in part by the Wittgenstein Award Z211-N23 of the Austrian Science Fund (FWF) and by the FWF project W1255-N23.","publisher":"Springer Nature","project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"status":"public","quality_controlled":"1","doi":"10.1007/978-3-030-94583-1_1","volume":13182,"year":"2022","publication_status":"published","citation":{"chicago":"Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira Da Costa. “Flavors of Sequential Information Flow.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, 13182:1–19. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-030-94583-1_1\">https://doi.org/10.1007/978-3-030-94583-1_1</a>.","apa":"Bartocci, E., Ferrere, T., Henzinger, T. A., Nickovic, D., &#38; Da Costa, A. O. (2022). Flavors of sequential information flow. In <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 13182, pp. 1–19). Philadelphia, PA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-94583-1_1\">https://doi.org/10.1007/978-3-030-94583-1_1</a>","short":"E. Bartocci, T. Ferrere, T.A. Henzinger, D. Nickovic, A.O. Da Costa, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2022, pp. 1–19.","ieee":"E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. O. Da Costa, “Flavors of sequential information flow,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Philadelphia, PA, United States, 2022, vol. 13182, pp. 1–19.","ista":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Da Costa AO. 2022. Flavors of sequential information flow. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 13182, 1–19.","ama":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Da Costa AO. Flavors of sequential information flow. In: <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 13182. Springer Nature; 2022:1-19. doi:<a href=\"https://doi.org/10.1007/978-3-030-94583-1_1\">10.1007/978-3-030-94583-1_1</a>","mla":"Bartocci, Ezio, et al. “Flavors of Sequential Information Flow.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, vol. 13182, Springer Nature, 2022, pp. 1–19, doi:<a href=\"https://doi.org/10.1007/978-3-030-94583-1_1\">10.1007/978-3-030-94583-1_1</a>."},"oa":1,"date_updated":"2026-04-16T09:13:43Z","isi":1,"intvolume":"     13182","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","oa_version":"Preprint","month":"01","conference":{"location":"Philadelphia, PA, United States","end_date":"2022-01-18","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","start_date":"2022-01-16"},"_id":"10774","department":[{"_id":"ToHe"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2022-02-20T23:01:34Z"},{"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_created":"2022-08-08T17:09:09Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"09","conference":{"start_date":"2022-09-28","name":"RV: Runtime Verification","end_date":"2022-09-30","location":"Tbilisi, Georgia"},"_id":"11775","ec_funded":1,"intvolume":"     13498","file_date_updated":"2023-01-20T07:34:50Z","publication":"22nd International Conference on Runtime Verification","oa_version":"Published Version","oa":1,"date_updated":"2026-07-27T12:48:18Z","isi":1,"file":[{"file_size":477110,"checksum":"05c7dcfbb9053a98f46441fb2eccb213","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_created":"2023-01-20T07:34:50Z","date_updated":"2023-01-20T07:34:50Z","file_id":"12317","success":1,"creator":"dernst","file_name":"2022_LNCS_RV_Henzinger.pdf"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20147"}]},"volume":13498,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2022","citation":{"short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 22nd International Conference on Runtime Verification, Springer Nature, 2022, pp. 200–220.","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Abstract monitors for quantitative specifications,” in <i>22nd International Conference on Runtime Verification</i>, Tbilisi, Georgia, 2022, vol. 13498, pp. 200–220.","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Abstract Monitors for Quantitative Specifications.” In <i>22nd International Conference on Runtime Verification</i>, 13498:200–220. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">https://doi.org/10.1007/978-3-031-17196-3_11</a>.","apa":"Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2022). Abstract monitors for quantitative specifications. In <i>22nd International Conference on Runtime Verification</i> (Vol. 13498, pp. 200–220). Tbilisi, Georgia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">https://doi.org/10.1007/978-3-031-17196-3_11</a>","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Abstract monitors for quantitative specifications. In: <i>22nd International Conference on Runtime Verification</i>. Vol 13498. Springer Nature; 2022:200-220. doi:<a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">10.1007/978-3-031-17196-3_11</a>","mla":"Henzinger, Thomas A., et al. “Abstract Monitors for Quantitative Specifications.” <i>22nd International Conference on Runtime Verification</i>, vol. 13498, Springer Nature, 2022, pp. 200–20, doi:<a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">10.1007/978-3-031-17196-3_11</a>.","ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2022. Abstract monitors for quantitative specifications. 22nd International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 13498, 200–220."},"publication_status":"published","doi":"10.1007/978-3-031-17196-3_11","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"publisher":"Springer Nature","status":"public","quality_controlled":"1","abstract":[{"text":"Quantitative monitoring can be universal and approximate: For every finite sequence of observations, the specification provides a value and the monitor outputs a best-effort approximation of it. The quality of the approximation may depend on the resources that are available to the monitor. By taking to the limit the sequences of specification values and monitor outputs, we obtain precision-resource trade-offs also for limit monitoring. This paper provides a formal framework for studying such trade-offs using an abstract interpretation for monitors: For each natural number n, the aggregate semantics of a monitor at time n is an equivalence relation over all sequences of at most n observations so that two equivalent sequences are indistinguishable to the monitor and thus mapped to the same output. This abstract interpretation of quantitative monitors allows us to measure the number of equivalence classes (or “resource use”) that is necessary for a certain precision up to a certain time, or at any time. Our framework offers several insights. For example, we identify a family of specifications for which any resource-optimal exact limit monitor is independent of any error permitted over finite traces. Moreover, we present a specification for which any resource-optimal approximate limit monitor does not minimize its resource use at any time. ","lang":"eng"}],"title":"Abstract monitors for quantitative specifications","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","fulldoi":"https://doi.org/10.1007/978-3-031-17196-3_11","ddc":["000"],"has_accepted_license":"1","alternative_title":["LNCS"],"external_id":{"isi":["000866539700011"]},"date_published":"2022-09-23T00:00:00Z","language":[{"iso":"eng"}],"page":"200-220","corr_author":"1","author":[{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien"},{"full_name":"Sarac, Naci E","first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","last_name":"Sarac"}],"scopus_import":"1","publication_identifier":{"issn":["0302-9743"]},"day":"23","article_processing_charge":"Yes","type":"conference"},{"department":[{"_id":"ToHe"}],"date_created":"2022-05-12T13:20:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","_id":"11366","ec_funded":1,"oa_version":"Preprint","publication":"arXiv","oa":1,"date_updated":"2026-08-12T06:40:15Z","related_material":{"record":[{"relation":"dissertation_contains","id":"11362","status":"public"},{"relation":"later_version","id":"12704","status":"public"}]},"year":"2022","publication_status":"draft","citation":{"ista":"Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. arXiv, 2204.07373.","mla":"Lechner, Mathias, et al. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” <i>ArXiv</i>, 2204.07373, doi:<a href=\"https://doi.org/10.48550/arXiv.2204.07373\">10.48550/arXiv.2204.07373</a>.","ama":"Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2204.07373\">10.48550/arXiv.2204.07373</a>","apa":"Lechner, M., Amini, A., Rus, D., &#38; Henzinger, T. A. (n.d.). Revisiting the adversarial robustness-accuracy tradeoff in robot learning. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2204.07373\">https://doi.org/10.48550/arXiv.2204.07373</a>","chicago":"Lechner, Mathias, Alexander Amini, Daniela Rus, and Thomas A Henzinger. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2204.07373\">https://doi.org/10.48550/arXiv.2204.07373</a>.","ieee":"M. Lechner, A. Amini, D. Rus, and T. A. Henzinger, “Revisiting the adversarial robustness-accuracy tradeoff in robot learning,” <i>arXiv</i>. .","short":"M. Lechner, A. Amini, D. Rus, T.A. Henzinger, ArXiv (n.d.)."},"OA_place":"repository","doi":"10.48550/arXiv.2204.07373","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"status":"public","abstract":[{"text":"Adversarial training (i.e., training on adversarially perturbed input data) is a well-studied method for making neural networks robust to potential adversarial attacks during inference. However, the improved robustness does not\r\ncome for free but rather is accompanied by a decrease in overall model accuracy and performance. Recent work has shown that, in practical robot learning applications, the effects of adversarial training do not pose a fair trade-off\r\nbut inflict a net loss when measured in holistic robot performance. This work revisits the robustness-accuracy trade-off in robot learning by systematically analyzing if recent advances in robust training methods and theory in\r\nconjunction with adversarial robot learning can make adversarial training suitable for real-world robot applications. We evaluate a wide variety of robot learning tasks ranging from autonomous driving in a high-fidelity environment\r\namenable to sim-to-real deployment, to mobile robot gesture recognition. Our results demonstrate that, while these techniques make incremental improvements on the trade-off on a relative scale, the negative side-effects caused by\r\nadversarial training still outweigh the improvements by an order of magnitude. We conclude that more substantial advances in robust learning methods are necessary before they can benefit robot learning tasks in practice.","lang":"eng"}],"title":"Revisiting the adversarial robustness-accuracy tradeoff in robot learning","acknowledgement":"This work was supported in parts by the ERC-2020-AdG 101020093, National Science Foundation (NSF), and JP\r\nMorgan Graduate Fellowships. We thank Christoph Lampert for inspiring this work.\r\n","fulldoi":"https://doi.org/10.48550/arXiv.2204.07373","arxiv":1,"external_id":{"arxiv":["2204.07373"]},"date_published":"2022-04-15T00:00:00Z","language":[{"iso":"eng"}],"article_number":"2204.07373","corr_author":"1","author":[{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"last_name":"Amini","full_name":"Amini, Alexander","first_name":"Alexander"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2204.07373"}],"day":"15","article_processing_charge":"No","type":"preprint"},{"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_created":"2022-05-12T07:14:01Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"05","_id":"11362","ec_funded":1,"file_date_updated":"2022-05-17T15:19:39Z","oa_version":"Published Version","oa":1,"date_updated":"2026-08-19T09:28:05Z","file":[{"relation":"source_file","file_size":13210143,"checksum":"8eefa9c7c10ca7e1a2ccdd731962a645","content_type":"application/zip","date_created":"2022-05-13T12:33:26Z","access_level":"closed","date_updated":"2022-05-13T12:49:00Z","file_id":"11378","file_name":"src.zip","creator":"mlechner"},{"checksum":"1b9e1e5a9a83ed9d89dad2f5133dc026","file_size":2732536,"relation":"main_file","access_level":"open_access","date_created":"2022-05-16T08:02:28Z","content_type":"application/pdf","date_updated":"2022-05-17T15:19:39Z","file_id":"11382","creator":"mlechner","file_name":"thesis_main-a2.pdf"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"11366","status":"public"},{"relation":"part_of_dissertation","id":"7808","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"10666"},{"id":"10667","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"10665","relation":"part_of_dissertation"}]},"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"year":"2022","publication_status":"published","citation":{"apa":"Lechner, M. (2022). <i>Learning verifiable representations</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11362\">https://doi.org/10.15479/at:ista:11362</a>","chicago":"Lechner, Mathias. “Learning Verifiable Representations.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11362\">https://doi.org/10.15479/at:ista:11362</a>.","ieee":"M. Lechner, “Learning verifiable representations,” Institute of Science and Technology Austria, 2022.","short":"M. Lechner, Learning Verifiable Representations, Institute of Science and Technology Austria, 2022.","ista":"Lechner M. 2022. Learning verifiable representations. Institute of Science and Technology Austria.","mla":"Lechner, Mathias. <i>Learning Verifiable Representations</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11362\">10.15479/at:ista:11362</a>.","ama":"Lechner M. Learning verifiable representations. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11362\">10.15479/at:ista:11362</a>"},"OA_place":"publisher","doi":"10.15479/at:ista:11362","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"}],"publisher":"Institute of Science and Technology Austria","status":"public","license":"https://creativecommons.org/licenses/by-nd/4.0/","supervisor":[{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"Deep learning has enabled breakthroughs in challenging computing problems and has emerged as the standard problem-solving tool for computer vision and natural language processing tasks.\r\nOne exception to this trend is safety-critical tasks where robustness and resilience requirements contradict the black-box nature of neural networks. \r\nTo deploy deep learning methods for these tasks, it is vital to provide guarantees on neural network agents' safety and robustness criteria. \r\nThis can be achieved by developing formal verification methods to verify the safety and robustness properties of neural networks.\r\n\r\nOur goal is to design, develop and assess safety verification methods for neural networks to improve their reliability and trustworthiness in real-world applications.\r\nThis thesis establishes techniques for the verification of compressed and adversarially trained models as well as the design of novel neural networks for verifiably safe decision-making.\r\n\r\nFirst, we establish the problem of verifying quantized neural networks. Quantization is a technique that trades numerical precision for the computational efficiency of running a neural network and is widely adopted in industry.\r\nWe show that neglecting the reduced precision when verifying a neural network can lead to wrong conclusions about the robustness and safety of the network, highlighting that novel techniques for quantized network verification are necessary. We introduce several bit-exact verification methods explicitly designed for quantized neural networks and experimentally confirm on realistic networks that the network's robustness and other formal properties are affected by the quantization.\r\n\r\nFurthermore, we perform a case study providing evidence that adversarial training, a standard technique for making neural networks more robust, has detrimental effects on the network's performance. This robustness-accuracy tradeoff has been studied before regarding the accuracy obtained on classification datasets where each data point is independent of all other data points. On the other hand, we investigate the tradeoff empirically in robot learning settings where a both, a high accuracy and a high robustness, are desirable.\r\nOur results suggest that the negative side-effects of adversarial training outweigh its robustness benefits in practice.\r\n\r\nFinally, we consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with systems over the infinite time horizon. Bayesian neural networks are probabilistic models for learning uncertainties in the data and are therefore often used on robotic and healthcare applications where data is inherently stochastic.\r\nWe introduce a method for recalibrating Bayesian neural networks so that they yield probability distributions over safe decisions only.\r\nOur method learns a safety certificate that guarantees safety over the infinite time horizon to determine which decisions are safe in every possible state of the system.\r\nWe demonstrate the effectiveness of our approach on a series of reinforcement learning benchmarks.","lang":"eng"}],"title":"Learning verifiable representations","fulldoi":"https://doi.org/10.15479/at:ista:11362","degree_awarded":"PhD","ddc":["004"],"has_accepted_license":"1","date_published":"2022-05-12T00:00:00Z","alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"keyword":["neural networks","verification","machine learning"],"page":"124","corr_author":"1","author":[{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"}],"publication_identifier":{"isbn":["978-3-99078-017-6"]},"day":"12","article_processing_charge":"No","type":"dissertation"},{"page":"3-22","author":[{"first_name":"Ezio","full_name":"Bartocci, Ezio","last_name":"Bartocci"},{"orcid":"0000-0001-5199-3143","last_name":"Ferrere","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724"},{"full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic"},{"first_name":"Ana Oliveira","full_name":"Da Costa, Ana Oliveira","last_name":"Da Costa"}],"scopus_import":"1","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030994280"],"issn":["0302-9743"]},"day":"29","article_processing_charge":"No","type":"conference","ddc":["000"],"fulldoi":"https://doi.org/10.1007/978-3-030-99429-7_1","has_accepted_license":"1","external_id":{"isi":["000782393600001"]},"date_published":"2022-03-29T00:00:00Z","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"year":"2022","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":13241,"citation":{"ista":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Da Costa AO. 2022. Information-flow interfaces. Fundamental Approaches to Software Engineering. FASE: Fundamental Approaches to Software Engineering, LNCS, vol. 13241, 3–22.","ama":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Da Costa AO. Information-flow interfaces. In: <i>Fundamental Approaches to Software Engineering</i>. Vol 13241. Springer Nature; 2022:3-22. doi:<a href=\"https://doi.org/10.1007/978-3-030-99429-7_1\">10.1007/978-3-030-99429-7_1</a>","mla":"Bartocci, Ezio, et al. “Information-Flow Interfaces.” <i>Fundamental Approaches to Software Engineering</i>, vol. 13241, Springer Nature, 2022, pp. 3–22, doi:<a href=\"https://doi.org/10.1007/978-3-030-99429-7_1\">10.1007/978-3-030-99429-7_1</a>.","chicago":"Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira Da Costa. “Information-Flow Interfaces.” In <i>Fundamental Approaches to Software Engineering</i>, 13241:3–22. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-030-99429-7_1\">https://doi.org/10.1007/978-3-030-99429-7_1</a>.","apa":"Bartocci, E., Ferrere, T., Henzinger, T. A., Nickovic, D., &#38; Da Costa, A. O. (2022). Information-flow interfaces. In <i>Fundamental Approaches to Software Engineering</i> (Vol. 13241, pp. 3–22). Munich, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-99429-7_1\">https://doi.org/10.1007/978-3-030-99429-7_1</a>","short":"E. Bartocci, T. Ferrere, T.A. Henzinger, D. Nickovic, A.O. Da Costa, in:, Fundamental Approaches to Software Engineering, Springer Nature, 2022, pp. 3–22.","ieee":"E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. O. Da Costa, “Information-flow interfaces,” in <i>Fundamental Approaches to Software Engineering</i>, Munich, Germany, 2022, vol. 13241, pp. 3–22."},"publication_status":"published","doi":"10.1007/978-3-030-99429-7_1","status":"public","publisher":"Springer Nature","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"quality_controlled":"1","title":"Information-flow interfaces","abstract":[{"text":"Contract-based design is a promising methodology for taming the complexity of developing sophisticated systems. A formal contract distinguishes between assumptions, which are constraints that the designer of a component puts on the environments in which the component can be used safely, and guarantees, which are promises that the designer asks from the team that implements the component. A theory of formal contracts can be formalized as an interface theory, which supports the composition and refinement of both assumptions and guarantees.\r\nAlthough there is a rich landscape of contract-based design methods that address functional and extra-functional properties, we present the first interface theory that is designed for ensuring system-wide security properties. Our framework provides a refinement relation and a composition operation that support both incremental design and independent implementability. We develop our theory for both stateless and stateful interfaces. We illustrate the applicability of our framework with an example inspired from the automotive domain.","lang":"eng"}],"acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 956123 and was funded in part by the FWF project W1255-N23 and by the ERC-2020-AdG 101020093.","department":[{"_id":"ToHe"}],"date_created":"2022-05-08T22:01:44Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"03","_id":"11355","ec_funded":1,"conference":{"start_date":"2022-04-02","name":"FASE: Fundamental Approaches to Software Engineering","end_date":"2022-04-07","location":"Munich, Germany"},"file_date_updated":"2022-05-09T06:52:44Z","intvolume":"     13241","publication":"Fundamental Approaches to Software Engineering","oa_version":"Published Version","file":[{"success":1,"file_id":"11357","date_updated":"2022-05-09T06:52:44Z","creator":"dernst","file_name":"2022_LNCS_Bartocci.pdf","file_size":479146,"checksum":"7f6f860b20b8de2a249e9c1b4eee15cf","relation":"main_file","access_level":"open_access","date_created":"2022-05-09T06:52:44Z","content_type":"application/pdf"}],"date_updated":"2026-10-21T12:02:28Z","isi":1,"oa":1,"related_material":{"record":[{"relation":"extended_version","status":"public","id":"17094"}]}},{"has_accepted_license":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14","ddc":["000"],"language":[{"iso":"eng"}],"date_published":"2022-09-06T00:00:00Z","alternative_title":["LIPIcs"],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772464"]},"scopus_import":"1","author":[{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lehtinen","full_name":"Lehtinen, Karoliina","first_name":"Karoliina"},{"last_name":"Totzke","full_name":"Totzke, Patrick","first_name":"Patrick"}],"corr_author":"1","page":"14:1-14:21","type":"conference","article_processing_charge":"No","day":"06","conference":{"end_date":"2022-09-16","name":"CONCUR: Conference on Concurrency Theory","location":"Warsaw, Poland","start_date":"2022-09-13"},"ec_funded":1,"_id":"12508","month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-02-05T17:24:23Z","department":[{"_id":"ToHe"}],"das_tickbox":"1","related_material":{"record":[{"status":"public","id":"18530","relation":"later_version"}]},"oa":1,"file":[{"access_level":"open_access","content_type":"application/pdf","date_created":"2023-02-06T09:21:09Z","checksum":"9e97e15628f66b2ad77f535bb0327dee","file_size":717940,"relation":"main_file","creator":"dernst","file_name":"2022_LIPICs_Henzinger2.pdf","file_id":"12520","date_updated":"2023-02-06T09:21:09Z","success":1}],"date_updated":"2026-10-21T13:12:36Z","publication":"33rd International Conference on Concurrency Theory","oa_version":"Published Version","intvolume":"       243","file_date_updated":"2023-02-06T09:21:09Z","doi":"10.4230/LIPIcs.CONCUR.2022.14","citation":{"mla":"Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.” <i>33rd International Conference on Concurrency Theory</i>, vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">10.4230/LIPIcs.CONCUR.2022.14</a>.","ama":"Henzinger TA, Lehtinen K, Totzke P. History-deterministic timed automata. In: <i>33rd International Conference on Concurrency Theory</i>. Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:14:1-14:21. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">10.4230/LIPIcs.CONCUR.2022.14</a>","ista":"Henzinger TA, Lehtinen K, Totzke P. 2022. History-deterministic timed automata. 33rd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 14:1-14:21.","ieee":"T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed automata,” in <i>33rd International Conference on Concurrency Theory</i>, Warsaw, Poland, 2022, vol. 243, p. 14:1-14:21.","short":"T.A. Henzinger, K. Lehtinen, P. Totzke, in:, 33rd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21.","apa":"Henzinger, T. A., Lehtinen, K., &#38; Totzke, P. (2022). History-deterministic timed automata. In <i>33rd International Conference on Concurrency Theory</i> (Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.14</a>","chicago":"Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic Timed Automata.” In <i>33rd International Conference on Concurrency Theory</i>, 243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.14</a>."},"publication_status":"published","volume":243,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2022","acknowledgement":"Thomas A. Henzinger: This work was supported in part by the ERC-2020-AdG 101020093.\r\nPatrick Totzke: acknowledges support from the EPSRC, project no. EP/V025848/1.\r\n","abstract":[{"lang":"eng","text":"We explore the notion of history-determinism in the context of timed automata (TA). History-deterministic automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterisations, and history-deterministic specifications allow for game-based verification without an expensive determinization step.\r\nWe show yet another characterisation of history-determinism in terms of fair simulation, at the general level of labelled transition systems: a system is history-deterministic precisely if and only if it fairly simulates all language smaller systems.\r\nFor timed automata over infinite timed words it is known that universality is undecidable for Büchi TA. We show that for history-deterministic TA with arbitrary parity acceptance, timed universality, inclusion, and synthesis all remain decidable and are ExpTime-complete.\r\nFor the subclass of TA with safety or reachability acceptance, we show that checking whether such an automaton is history-deterministic is decidable (in ExpTime), and history-deterministic TA with safety acceptance are effectively determinizable without introducing new automata states."}],"title":"History-deterministic timed automata","quality_controlled":"1","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public"},{"doi":"10.1007/978-3-030-88494-9_12","publication_status":"published","citation":{"ama":"Mühlböck F, Henzinger TA. Differential monitoring. In: <i>International Conference on Runtime Verification</i>. Vol 12974. Cham: Springer Nature; 2021:231-243. doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">10.1007/978-3-030-88494-9_12</a>","mla":"Mühlböck, Fabian, and Thomas A. Henzinger. “Differential Monitoring.” <i>International Conference on Runtime Verification</i>, vol. 12974, Springer Nature, 2021, pp. 231–43, doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">10.1007/978-3-030-88494-9_12</a>.","ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring. International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 231–243.","short":"F. Mühlböck, T.A. Henzinger, in:, International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 231–243.","ieee":"F. Mühlböck and T. A. Henzinger, “Differential monitoring,” in <i>International Conference on Runtime Verification</i>, Virtual, 2021, vol. 12974, pp. 231–243.","chicago":"Mühlböck, Fabian, and Thomas A Henzinger. “Differential Monitoring.” In <i>International Conference on Runtime Verification</i>, 12974:231–43. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">https://doi.org/10.1007/978-3-030-88494-9_12</a>.","apa":"Mühlböck, F., &#38; Henzinger, T. A. (2021). Differential monitoring. In <i>International Conference on Runtime Verification</i> (Vol. 12974, pp. 231–243). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">https://doi.org/10.1007/978-3-030-88494-9_12</a>"},"year":"2021","volume":12974,"acknowledgement":"The authors would like to thank Borzoo Bonakdarpour, Derek Dreyer, Adrian Francalanza, Owolabi Legunsen, Mae Milano, Manuel Rigger, Cesar Sanchez, and the members of the IST Verification Seminar for their helpful comments and insights on various stages of this work, as well as the reviewers of RV’21 for their helpful suggestions on the actual paper.","abstract":[{"text":"We argue that the time is ripe to investigate differential monitoring, in which the specification of a program's behavior is implicitly given by a second program implementing the same informal specification. Similar ideas have been proposed before, and are currently implemented in restricted form for testing and specialized run-time analyses, aspects of which we combine. We discuss the challenges of implementing differential monitoring as a general-purpose, black-box run-time monitoring framework, and present promising results of a preliminary implementation, showing low monitoring overheads for diverse programs.","lang":"eng"}],"title":"Differential monitoring","quality_controlled":"1","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"publisher":"Springer Nature","status":"public","conference":{"location":"Virtual","name":"RV: Runtime Verification","end_date":"2021-10-14","start_date":"2021-10-11"},"_id":"10108","month":"10","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2021-10-07T23:30:10Z","department":[{"_id":"ToHe"}],"related_material":{"record":[{"relation":"extended_version","id":"9946","status":"public"}]},"oa":1,"file":[{"relation":"main_file","file_size":350632,"checksum":"554c7fdb259eda703a8b6328a6dad55a","content_type":"application/pdf","date_created":"2021-10-07T23:32:18Z","access_level":"open_access","file_id":"10109","date_updated":"2021-10-07T23:32:18Z","success":1,"file_name":"differentialmonitoring-cameraready-openaccess.pdf","creator":"fmuehlbo"}],"isi":1,"date_updated":"2025-04-15T06:26:12Z","oa_version":"Preprint","publication":"International Conference on Runtime Verification","intvolume":"     12974","file_date_updated":"2021-10-07T23:32:18Z","scopus_import":"1","publication_identifier":{"eisbn":["978-3-030-88494-9"],"eissn":["1611-3349"],"isbn":["978-3-030-88493-2"],"issn":["0302-9743"]},"author":[{"orcid":"0000-0003-1548-0177","last_name":"Mühlböck","full_name":"Mühlböck, Fabian","first_name":"Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"corr_author":"1","page":"231-243","type":"conference","article_processing_charge":"No","place":"Cham","day":"06","has_accepted_license":"1","fulldoi":"https://doi.org/10.1007/978-3-030-88494-9_12","ddc":["005"],"keyword":["run-time verification","software engineering","implicit specification"],"language":[{"iso":"eng"}],"alternative_title":["LNCS"],"date_published":"2021-10-06T00:00:00Z","external_id":{"isi":["000719383800012"]}},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2021-10-19T12:48:44Z","department":[{"_id":"ToHe"}],"article_type":"original","_id":"10153","conference":{"location":"Chicago, IL, United States","name":"OOPSLA: Object-Oriented Programming, Systems, Languages, and Applications","end_date":"2021-10-23","start_date":"2021-10-17"},"month":"10","publication":"Proceedings of the ACM on Programming Languages","oa_version":"Published Version","file_date_updated":"2021-10-19T12:52:23Z","intvolume":"         5","date_updated":"2025-04-15T06:25:55Z","file":[{"relation":"main_file","checksum":"71011efd2da771cafdec7f0d9693f8c1","file_size":770269,"date_created":"2021-10-19T12:52:23Z","content_type":"application/pdf","access_level":"open_access","success":1,"file_id":"10154","date_updated":"2021-10-19T12:52:23Z","file_name":"monnom-oopsla21.pdf","creator":"fmuehlbo"}],"oa":1,"publication_status":"published","citation":{"apa":"Mühlböck, F., &#38; Tate, R. (2021). Transitioning from structural to nominal code with efficient gradual typing. <i>Proceedings of the ACM on Programming Languages</i>. Chicago, IL, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485504\">https://doi.org/10.1145/3485504</a>","chicago":"Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485504\">https://doi.org/10.1145/3485504</a>.","ieee":"F. Mühlböck and R. Tate, “Transitioning from structural to nominal code with efficient gradual typing,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5. Association for Computing Machinery, 2021.","short":"F. Mühlböck, R. Tate, Proceedings of the ACM on Programming Languages 5 (2021).","ista":"Mühlböck F, Tate R. 2021. Transitioning from structural to nominal code with efficient gradual typing. Proceedings of the ACM on Programming Languages. 5, 127.","mla":"Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, 127, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3485504\">10.1145/3485504</a>.","ama":"Mühlböck F, Tate R. Transitioning from structural to nominal code with efficient gradual typing. <i>Proceedings of the ACM on Programming Languages</i>. 2021;5. doi:<a href=\"https://doi.org/10.1145/3485504\">10.1145/3485504</a>"},"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"volume":5,"year":"2021","doi":"10.1145/3485504","quality_controlled":"1","status":"public","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"publisher":"Association for Computing Machinery","acknowledgement":"We thank the reviewers for their valuable suggestions towards improving the paper. We also \r\nthank Mae Milano and Adrian Sampson, as well as the members of the Programming Languages Discussion Group at Cornell University and of the Programming Research Laboratory at Northeastern University, for their helpful feedback on preliminary findings of this work.\r\n\r\nThis material is based upon work supported in part by the National Science Foundation (NSF) through grant CCF-1350182 and the Austrian Science Fund (FWF) through grant Z211-N23 (Wittgenstein~Award).\r\nAny opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF or the FWF.","abstract":[{"lang":"eng","text":"Gradual typing is a principled means for mixing typed and untyped code. But typed and untyped code often exhibit different programming patterns. There is already substantial research investigating gradually giving types to code exhibiting typical untyped patterns, and some research investigating gradually removing types from code exhibiting typical typed patterns. This paper investigates how to extend these established gradual-typing concepts to give formal guarantees not only about how to change types as code evolves but also about how to change such programming patterns as well.\r\n\r\nIn particular, we explore mixing untyped \"structural\" code with typed \"nominal\" code in an object-oriented language. But whereas previous work only allowed \"nominal\" objects to be treated as \"structural\" objects, we also allow \"structural\" objects to dynamically acquire certain nominal types, namely interfaces. We present a calculus that supports such \"cross-paradigm\" code migration and interoperation in a manner satisfying both the static and dynamic gradual guarantees, and demonstrate that the calculus can be implemented efficiently."}],"title":"Transitioning from structural to nominal code with efficient gradual typing","has_accepted_license":"1","ddc":["005"],"fulldoi":"https://doi.org/10.1145/3485504","date_published":"2021-10-15T00:00:00Z","keyword":["gradual typing","gradual guarantee","nominal","structural","call tags"],"language":[{"iso":"eng"}],"article_number":"127","publication_identifier":{"eissn":["2475-1421"]},"scopus_import":"1","author":[{"orcid":"0000-0003-1548-0177","last_name":"Mühlböck","full_name":"Mühlböck, Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian"},{"full_name":"Tate, Ross","first_name":"Ross","last_name":"Tate"}],"day":"15","type":"journal_article","article_processing_charge":"No"}]