[{"abstract":[{"text":"The term “haplotype block” is commonly used in the developing field of haplotype-based inference methods. We argue that the term should be defined based on the structure of the Ancestral Recombination Graph (ARG), which contains complete information on the ancestry of a sample. We use simulated examples to demonstrate key features of the relationship between haplotype blocks and ancestral structure, emphasizing the stochasticity of the processes that generate them. Even the simplest cases of neutrality or of a “hard” selective sweep produce a rich structure, often missed by commonly used statistics. We highlight a number of novel methods for inferring haplotype structure, based on the full ARG, or on a sequence of trees, and illustrate how they can be used to define haplotype blocks using an empirical data set. While the advent of new, computationally efficient methods makes it possible to apply these concepts broadly, they (and additional new methods) could benefit from adding features to explore haplotype blocks, as we define them. Understanding and applying the concept of the haplotype block will be essential to fully exploit long and linked-read sequencing technologies.","lang":"eng"}],"external_id":{"pmid":["36433653"],"isi":["000900762000001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["570"],"publication_status":"published","volume":32,"quality_controlled":"1","department":[{"_id":"NiBa"}],"page":"1441-1457","date_published":"2023-03-01T00:00:00Z","publisher":"Wiley","project":[{"name":"The maintenance of alternative adaptive peaks in snapdragons","grant_number":"P32166","_id":"05959E1C-7A3F-11EA-A408-12923DDC885E"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"name":"Understanding the evolution of continuous genomes","grant_number":"101055327","_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00"}],"keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"date_created":"2023-01-12T12:09:17Z","citation":{"mla":"Shipilina, Daria, et al. “On the Origin and Structure of Haplotype Blocks.” <i>Molecular Ecology</i>, vol. 32, no. 6, Wiley, 2023, pp. 1441–57, doi:<a href=\"https://doi.org/10.1111/mec.16793\">10.1111/mec.16793</a>.","ista":"Shipilina D, Pal A, Stankowski S, Chan YF, Barton NH. 2023. On the origin and structure of haplotype blocks. Molecular Ecology. 32(6), 1441–1457.","chicago":"Shipilina, Daria, Arka Pal, Sean Stankowski, Yingguang Frank Chan, and Nicholas H Barton. “On the Origin and Structure of Haplotype Blocks.” <i>Molecular Ecology</i>. Wiley, 2023. <a href=\"https://doi.org/10.1111/mec.16793\">https://doi.org/10.1111/mec.16793</a>.","short":"D. Shipilina, A. Pal, S. Stankowski, Y.F. Chan, N.H. Barton, Molecular Ecology 32 (2023) 1441–1457.","ama":"Shipilina D, Pal A, Stankowski S, Chan YF, Barton NH. On the origin and structure of haplotype blocks. <i>Molecular Ecology</i>. 2023;32(6):1441-1457. doi:<a href=\"https://doi.org/10.1111/mec.16793\">10.1111/mec.16793</a>","ieee":"D. Shipilina, A. Pal, S. Stankowski, Y. F. Chan, and N. H. Barton, “On the origin and structure of haplotype blocks,” <i>Molecular Ecology</i>, vol. 32, no. 6. Wiley, pp. 1441–1457, 2023.","apa":"Shipilina, D., Pal, A., Stankowski, S., Chan, Y. F., &#38; Barton, N. H. (2023). On the origin and structure of haplotype blocks. <i>Molecular Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/mec.16793\">https://doi.org/10.1111/mec.16793</a>"},"year":"2023","acknowledgement":"We thank the Barton group for useful discussion and feedback during the writing of this article. Comments from Roger Butlin, Molly Schumer's Group, the tskit development team, editors and three reviewers greatly improved the manuscript. Funding was provided by SCAS (Natural Sciences Programme, Knut and Alice Wallenberg Foundation), an FWF Wittgenstein grant (PT1001Z211), an FWF standalone grant (grant P 32166), and an ERC Advanced Grant. YFC was supported by the Max Planck Society and an ERC Proof of Concept Grant #101069216 (HAPLOTAGGING).","doi":"10.1111/mec.16793","_id":"12159","article_type":"original","file_date_updated":"2023-08-16T08:15:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"success":1,"file_id":"14062","file_name":"2023_MolecularEcology_Shipilina.pdf","checksum":"b10e0f8fa3dc4d72aaf77a557200978a","date_created":"2023-08-16T08:15:41Z","date_updated":"2023-08-16T08:15:41Z","creator":"dernst","relation":"main_file","file_size":7144607,"content_type":"application/pdf","access_level":"open_access"}],"oa_version":"Published Version","day":"01","month":"03","publication_identifier":{"issn":["0962-1083"],"eissn":["1365-294X"]},"author":[{"id":"428A94B0-F248-11E8-B48F-1D18A9856A87","last_name":"Shipilina","orcid":"0000-0002-1145-9226","first_name":"Daria","full_name":"Shipilina, Daria"},{"id":"6AAB2240-CA9A-11E9-9C1A-D9D1E5697425","last_name":"Pal","orcid":"0000-0002-4530-8469","first_name":"Arka","full_name":"Pal, Arka"},{"last_name":"Stankowski","id":"43161670-5719-11EA-8025-FABC3DDC885E","full_name":"Stankowski, Sean","first_name":"Sean"},{"first_name":"Yingguang Frank","full_name":"Chan, Yingguang Frank","last_name":"Chan"},{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"}],"type":"journal_article","status":"public","pmid":1,"intvolume":"        32","has_accepted_license":"1","scopus_import":"1","isi":1,"title":"On the origin and structure of haplotype blocks","article_processing_charge":"Yes (via OA deal)","issue":"6","oa":1,"date_updated":"2023-08-16T08:18:47Z","publication":"Molecular Ecology","language":[{"iso":"eng"}]},{"date_created":"2023-04-23T22:01:03Z","citation":{"ama":"Schmid L, Ekbatani F, Hilbe C, Chatterjee K. Quantitative assessment can stabilize indirect reciprocity under imperfect information. <i>Nature Communications</i>. 2023;14. doi:<a href=\"https://doi.org/10.1038/s41467-023-37817-x\">10.1038/s41467-023-37817-x</a>","ieee":"L. Schmid, F. Ekbatani, C. Hilbe, and K. Chatterjee, “Quantitative assessment can stabilize indirect reciprocity under imperfect information,” <i>Nature Communications</i>, vol. 14. Springer Nature, 2023.","short":"L. Schmid, F. Ekbatani, C. Hilbe, K. Chatterjee, Nature Communications 14 (2023).","mla":"Schmid, Laura, et al. “Quantitative Assessment Can Stabilize Indirect Reciprocity under Imperfect Information.” <i>Nature Communications</i>, vol. 14, 2086, Springer Nature, 2023, doi:<a href=\"https://doi.org/10.1038/s41467-023-37817-x\">10.1038/s41467-023-37817-x</a>.","ista":"Schmid L, Ekbatani F, Hilbe C, Chatterjee K. 2023. Quantitative assessment can stabilize indirect reciprocity under imperfect information. Nature Communications. 14, 2086.","chicago":"Schmid, Laura, Farbod Ekbatani, Christian Hilbe, and Krishnendu Chatterjee. “Quantitative Assessment Can Stabilize Indirect Reciprocity under Imperfect Information.” <i>Nature Communications</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s41467-023-37817-x\">https://doi.org/10.1038/s41467-023-37817-x</a>.","apa":"Schmid, L., Ekbatani, F., Hilbe, C., &#38; Chatterjee, K. (2023). Quantitative assessment can stabilize indirect reciprocity under imperfect information. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-023-37817-x\">https://doi.org/10.1038/s41467-023-37817-x</a>"},"year":"2023","acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). L.S. received additional partial support by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), and also thanks the support by the Stochastic Analysis and Application Research Center (SAARC) under National Research Foundation of Korea grant NRF-2019R1A5A1028324. The authors additionally thank Stefan Schmid for providing access to his lab infrastructure at the University of Vienna for the purpose of collecting simulation data.","article_number":"2086","ec_funded":1,"_id":"12861","article_type":"original","file_date_updated":"2023-04-25T09:13:53Z","doi":"10.1038/s41467-023-37817-x","publication_status":"published","abstract":[{"lang":"eng","text":"The field of indirect reciprocity investigates how social norms can foster cooperation when individuals continuously monitor and assess each other’s social interactions. By adhering to certain social norms, cooperating individuals can improve their reputation and, in turn, receive benefits from others. Eight social norms, known as the “leading eight,\" have been shown to effectively promote the evolution of cooperation as long as information is public and reliable. These norms categorize group members as either ’good’ or ’bad’. In this study, we examine a scenario where individuals instead assign nuanced reputation scores to each other, and only cooperate with those whose reputation exceeds a certain threshold. We find both analytically and through simulations that such quantitative assessments are error-correcting, thus facilitating cooperation in situations where information is private and unreliable. Moreover, our results identify four specific norms that are robust to such conditions, and may be relevant for helping to sustain cooperation in natural populations."}],"external_id":{"isi":["001003644100020"],"pmid":["37045828"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["000"],"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1","volume":14,"department":[{"_id":"KrCh"}],"date_published":"2023-04-12T00:00:00Z","publisher":"Springer Nature","title":"Quantitative assessment can stabilize indirect reciprocity under imperfect information","article_processing_charge":"No","oa":1,"date_updated":"2025-07-14T09:09:52Z","scopus_import":"1","has_accepted_license":"1","intvolume":"        14","isi":1,"language":[{"iso":"eng"}],"publication":"Nature Communications","author":[{"last_name":"Schmid","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6978-7329","full_name":"Schmid, Laura","first_name":"Laura"},{"last_name":"Ekbatani","full_name":"Ekbatani, Farbod","first_name":"Farbod"},{"first_name":"Christian","full_name":"Hilbe, Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","last_name":"Hilbe","orcid":"0000-0001-5116-955X"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"}],"file":[{"success":1,"checksum":"a4b3b7b36fbef068cabf4fb99501fef6","file_name":"2023_NatureComm_Schmid.pdf","file_id":"12868","date_created":"2023-04-25T09:13:53Z","date_updated":"2023-04-25T09:13:53Z","creator":"dernst","relation":"main_file","file_size":1786475,"access_level":"open_access","content_type":"application/pdf"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"12","oa_version":"Published Version","publication_identifier":{"eissn":["2041-1723"]},"month":"04","type":"journal_article","status":"public","pmid":1},{"ec_funded":1,"date_created":"2023-02-05T17:27:42Z","citation":{"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>","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.","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>","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.","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.","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>."},"keyword":["General Medicine"],"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).","year":"2022","doi":"10.1609/aaai.v36i6.20631","article_type":"original","_id":"12510","external_id":{"arxiv":["2107.08467"]},"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"}],"publication_status":"published","department":[{"_id":"ToHe"}],"page":"6755-6764","quality_controlled":"1","volume":36,"publisher":"Association for the Advancement of Artificial Intelligence","date_published":"2022-06-28T00:00:00Z","project":[{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"scopus_import":"1","intvolume":"        36","title":"GoTube: Scalable statistical verification of continuous-depth models","oa":1,"date_updated":"2023-09-26T10:46:59Z","article_processing_charge":"No","issue":"6","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2107.08467"}],"oa_version":"Preprint","day":"28","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","publication_identifier":{"isbn":["978577358350"],"eissn":["2374-3468"],"issn":["2159-5399"]},"author":[{"last_name":"Gruenbacher","first_name":"Sophie A.","full_name":"Gruenbacher, Sophie A."},{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Smolka","full_name":"Smolka, Scott A.","first_name":"Scott A."},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"arxiv":1,"type":"journal_article","status":"public"},{"author":[{"first_name":"Ezio","full_name":"Bartocci, Ezio","last_name":"Bartocci"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere","orcid":"0000-0001-5199-3143","first_name":"Thomas","full_name":"Ferrere, Thomas"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","full_name":"Nickovic, Dejan","first_name":"Dejan"},{"full_name":"Da Costa, Ana Oliveira","first_name":"Ana Oliveira","last_name":"Da Costa"}],"arxiv":1,"conference":{"start_date":"2022-01-16","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","end_date":"2022-01-18","location":"Philadelphia, PA, United States"},"month":"01","publication_identifier":{"isbn":["9783030945824"],"eissn":["16113349"],"issn":["03029743"]},"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2105.02013","open_access":"1"}],"day":"14","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"type":"conference","status":"public","date_updated":"2022-08-05T09:02:56Z","oa":1,"article_processing_charge":"No","title":"Flavors of sequential information flow","scopus_import":"1","intvolume":"     13182","language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","publication_status":"published","external_id":{"arxiv":["2105.02013"]},"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."}],"project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publisher":"Springer Nature","date_published":"2022-01-14T00:00:00Z","page":"1-19","department":[{"_id":"ToHe"}],"volume":13182,"quality_controlled":"1","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.","year":"2022","citation":{"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>","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.","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>","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.","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>.","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>.","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."},"date_created":"2022-02-20T23:01:34Z","_id":"10774","doi":"10.1007/978-3-030-94583-1_1"},{"series_title":"LNCS","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."}],"external_id":{"isi":["000771713200001"]},"publication_status":"published","date_published":"2022-02-22T00:00:00Z","publisher":"Springer Nature","volume":13124,"quality_controlled":"1","department":[{"_id":"ToHe"}],"page":"3-6","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"year":"2022","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.","date_created":"2022-03-20T23:01:40Z","citation":{"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>","ieee":"T. A. Henzinger, “Quantitative monitoring of software,” in <i>Software Verification</i>, New Haven, CT, United States, 2022, vol. 13124, pp. 3–6.","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>","short":"T.A. Henzinger, in:, Software Verification, Springer Nature, 2022, pp. 3–6.","ista":"Henzinger TA. 2022. Quantitative monitoring of software. Software Verification. NSV: Numerical Software VerificationLNCS vol. 13124, 3–6.","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>."},"doi":"10.1007/978-3-030-95561-8_1","_id":"10891","month":"02","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030955601"]},"conference":{"end_date":"2021-10-19","location":"New Haven, CT, United States","start_date":"2021-10-18","name":"NSV: Numerical Software Verification"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"22","oa_version":"None","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"status":"public","type":"conference","isi":1,"scopus_import":"1","intvolume":"     13124","article_processing_charge":"No","date_updated":"2023-08-03T06:11:55Z","title":"Quantitative monitoring of software","publication":"Software Verification","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"date_updated":"2025-07-14T09:10:11Z","oa":1,"article_processing_charge":"No","title":"Learning verifiable representations","has_accepted_license":"1","alternative_title":["ISTA Thesis"],"type":"dissertation","status":"public","author":[{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"}],"month":"05","publication_identifier":{"isbn":["978-3-99078-017-6"]},"day":"12","oa_version":"Published Version","file":[{"file_id":"11378","checksum":"8eefa9c7c10ca7e1a2ccdd731962a645","file_name":"src.zip","date_updated":"2022-05-13T12:49:00Z","date_created":"2022-05-13T12:33:26Z","creator":"mlechner","content_type":"application/zip","file_size":13210143,"relation":"source_file","access_level":"closed"},{"file_size":2732536,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","creator":"mlechner","date_created":"2022-05-16T08:02:28Z","date_updated":"2022-05-17T15:19:39Z","file_id":"11382","checksum":"1b9e1e5a9a83ed9d89dad2f5133dc026","file_name":"thesis_main-a2.pdf"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file_date_updated":"2022-05-17T15:19:39Z","_id":"11362","doi":"10.15479/at:ista:11362","year":"2022","date_created":"2022-05-12T07:14:01Z","citation":{"short":"M. Lechner, Learning Verifiable Representations, Institute of Science and Technology Austria, 2022.","ieee":"M. Lechner, “Learning verifiable representations,” Institute of Science and Technology Austria, 2022.","ama":"Lechner M. Learning verifiable representations. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11362\">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>.","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>.","ista":"Lechner M. 2022. Learning verifiable representations. Institute of Science and Technology Austria.","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>"},"keyword":["neural networks","verification","machine learning"],"ec_funded":1,"degree_awarded":"PhD","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"11366"},{"relation":"part_of_dissertation","id":"7808","status":"public"},{"status":"public","id":"10666","relation":"part_of_dissertation"},{"id":"10665","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"10667"}]},"project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"publisher":"Institute of Science and Technology Austria","license":"https://creativecommons.org/licenses/by-nd/4.0/","date_published":"2022-05-12T00:00:00Z","supervisor":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"page":"124","publication_status":"published","ddc":["004"],"tmp":{"image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"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"}]},{"author":[{"last_name":"Brunnbauer","full_name":"Brunnbauer, Axel","first_name":"Axel"},{"last_name":"Berducci","first_name":"Luigi","full_name":"Berducci, Luigi"},{"last_name":"Brandstatter","first_name":"Andreas","full_name":"Brandstatter, Andreas"},{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"arxiv":1,"conference":{"name":"ICRA: International Conference on Robotics and Automation","start_date":"2022-05-23","location":"Philadelphia, PA, United States","end_date":"2022-05-27"},"month":"07","publication_identifier":{"issn":["1050-4729"],"isbn":["9781728196817"]},"oa_version":"Preprint","day":"12","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2103.04909","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","type":"conference","date_updated":"2022-09-05T08:46:12Z","oa":1,"article_processing_charge":"No","title":"Latent imagination facilitates zero-shot transfer in autonomous racing","scopus_import":"1","language":[{"iso":"eng"}],"publication":"2022 International Conference on Robotics and Automation","publication_status":"published","external_id":{"arxiv":["2103.04909"]},"abstract":[{"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.","lang":"eng"}],"project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"publisher":"IEEE","date_published":"2022-07-12T00:00:00Z","department":[{"_id":"ToHe"}],"page":"7513-7520","quality_controlled":"1","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.","year":"2022","citation":{"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>","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.","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.","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>.","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.","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>"},"date_created":"2022-09-04T22:02:02Z","ec_funded":1,"_id":"12010","doi":"10.1109/ICRA46639.2022.9811650"},{"type":"journal_article","status":"public","day":"15","oa_version":"Published Version","file":[{"creator":"dernst","content_type":"application/pdf","file_size":3259553,"access_level":"open_access","relation":"main_file","success":1,"checksum":"b4789122ce04bfb4ac042390f59aaa8b","file_name":"2022_NatureMachineIntelligence_Hasani.pdf","file_id":"12355","date_created":"2023-01-24T09:49:44Z","date_updated":"2023-01-24T09:49:44Z"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"11","publication_identifier":{"issn":["2522-5839"]},"author":[{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias"},{"last_name":"Amini","first_name":"Alexander","full_name":"Amini, Alexander"},{"full_name":"Liebenwein, Lucas","first_name":"Lucas","last_name":"Liebenwein"},{"first_name":"Aaron","full_name":"Ray, Aaron","last_name":"Ray"},{"first_name":"Max","full_name":"Tschaikowski, Max","last_name":"Tschaikowski"},{"last_name":"Teschl","full_name":"Teschl, Gerald","first_name":"Gerald"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"}],"arxiv":1,"publication":"Nature Machine Intelligence","language":[{"iso":"eng"}],"intvolume":"         4","has_accepted_license":"1","scopus_import":"1","isi":1,"title":"Closed-form continuous-time neural networks","date_updated":"2023-08-04T09:00:10Z","oa":1,"article_processing_charge":"No","issue":"11","page":"992-1003","department":[{"_id":"ToHe"}],"quality_controlled":"1","volume":4,"publisher":"Springer Nature","date_published":"2022-11-15T00:00:00Z","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"external_id":{"isi":["000884215600003"],"arxiv":["2106.13898"]},"abstract":[{"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.","lang":"eng"}],"ddc":["000"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","doi":"10.1038/s42256-022-00556-7","file_date_updated":"2023-01-24T09:49:44Z","_id":"12147","article_type":"original","related_material":{"link":[{"url":"https://doi.org/10.1038/s42256-022-00597-y","relation":"erratum"}]},"date_created":"2023-01-12T12:07:21Z","citation":{"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>","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>","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.","short":"R. Hasani, M. Lechner, A. Amini, L. Liebenwein, A. Ray, M. Tschaikowski, G. Teschl, D. Rus, Nature Machine Intelligence 4 (2022) 992–1003.","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>.","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>.","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."},"keyword":["Artificial Intelligence","Computer Networks and Communications","Computer Vision and Pattern Recognition","Human-Computer Interaction","Software"],"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.","year":"2022"},{"author":[{"full_name":"Sarac, Naci E","first_name":"Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"},{"first_name":"Ömer Faruk","full_name":"Altun, Ömer Faruk","last_name":"Altun"},{"last_name":"Atam","first_name":"Kamil Tolga","full_name":"Atam, Kamil Tolga"},{"last_name":"Karahoda","full_name":"Karahoda, Sertac","first_name":"Sertac"},{"last_name":"Kaya","first_name":"Kamer","full_name":"Kaya, Kamer"},{"first_name":"Hüsnü","full_name":"Yenigün, Hüsnü","last_name":"Yenigün"}],"day":"01","oa_version":"Submitted Version","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_size":634967,"creator":"esarac","date_created":"2020-12-02T13:33:51Z","date_updated":"2020-12-02T13:33:51Z","file_name":"synchroPaperRevised.pdf","checksum":"600c2f81bc898a725bcfa7cf26ff4fed","file_id":"8913"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"issn":["09574174"]},"month":"04","status":"public","type":"journal_article","title":"Boosting expensive synchronizing heuristics","date_updated":"2023-08-04T11:19:00Z","oa":1,"article_processing_charge":"No","issue":"4","scopus_import":"1","has_accepted_license":"1","intvolume":"       167","isi":1,"language":[{"iso":"eng"}],"publication":"Expert Systems with Applications","publication_status":"published","external_id":{"isi":["000640531100038"]},"abstract":[{"text":"For automata, synchronization, the problem of bringing an automaton to a particular state regardless of its initial state, is important. It has several applications in practice and is related to a fifty-year-old conjecture on the length of the shortest synchronizing word. Although using shorter words increases the effectiveness in practice, finding a shortest one (which is not necessarily unique) is NP-hard. For this reason, there exist various heuristics in the literature. However, high-quality heuristics such as SynchroP producing relatively shorter sequences are very expensive and can take hours when the automaton has tens of thousands of states. The SynchroP heuristic has been frequently used as a benchmark to evaluate the performance of the new heuristics. In this work, we first improve the runtime of SynchroP and its variants by using algorithmic techniques. We then focus on adapting SynchroP for many-core architectures,\r\nand overall, we obtain more than 1000× speedup on GPUs compared to naive sequential implementation that has been frequently used as a benchmark to evaluate new heuristics in the literature. We also propose two SynchroP variants and evaluate their performance.","lang":"eng"}],"ddc":["000"],"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"department":[{"_id":"ToHe"}],"volume":167,"quality_controlled":"1","publisher":"Elsevier","date_published":"2021-04-01T00:00:00Z","date_created":"2020-12-02T13:34:25Z","citation":{"short":"N.E. Sarac, Ö.F. Altun, K.T. Atam, S. Karahoda, K. Kaya, H. Yenigün, Expert Systems with Applications 167 (2021).","ama":"Sarac NE, Altun ÖF, Atam KT, Karahoda S, Kaya K, Yenigün H. Boosting expensive synchronizing heuristics. <i>Expert Systems with Applications</i>. 2021;167(4). doi:<a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">10.1016/j.eswa.2020.114203</a>","ieee":"N. E. Sarac, Ö. F. Altun, K. T. Atam, S. Karahoda, K. Kaya, and H. Yenigün, “Boosting expensive synchronizing heuristics,” <i>Expert Systems with Applications</i>, vol. 167, no. 4. Elsevier, 2021.","chicago":"Sarac, Naci E, Ömer Faruk Altun, Kamil Tolga Atam, Sertac Karahoda, Kamer Kaya, and Hüsnü Yenigün. “Boosting Expensive Synchronizing Heuristics.” <i>Expert Systems with Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">https://doi.org/10.1016/j.eswa.2020.114203</a>.","mla":"Sarac, Naci E., et al. “Boosting Expensive Synchronizing Heuristics.” <i>Expert Systems with Applications</i>, vol. 167, no. 4, 114203, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">10.1016/j.eswa.2020.114203</a>.","ista":"Sarac NE, Altun ÖF, Atam KT, Karahoda S, Kaya K, Yenigün H. 2021. Boosting expensive synchronizing heuristics. Expert Systems with Applications. 167(4), 114203.","apa":"Sarac, N. E., Altun, Ö. F., Atam, K. T., Karahoda, S., Kaya, K., &#38; Yenigün, H. (2021). Boosting expensive synchronizing heuristics. <i>Expert Systems with Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">https://doi.org/10.1016/j.eswa.2020.114203</a>"},"acknowledgement":"This work was supported by The Scientific and Technological Research Council of Turkey (TUBITAK) [grant number 114E569]. This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). We would like to thank the authors of (Roman & Szykula, 2015) for providing their heuristics implementations, which we used to compare our SynchroP implementation as given in Table 11.","year":"2021","article_number":"114203","file_date_updated":"2020-12-02T13:33:51Z","_id":"8912","article_type":"original","doi":"10.1016/j.eswa.2020.114203"},{"ddc":["000"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"external_id":{"isi":["000932821700028"],"arxiv":["2102.12734"]},"abstract":[{"text":"Formal design of embedded and cyber-physical systems relies on mathematical modeling. In this paper, we consider the model class of hybrid automata whose dynamics are defined by affine differential equations. Given a set of time-series data, we present an algorithmic approach to synthesize a hybrid automaton exhibiting behavior that is close to the data, up to a specified precision, and changes in synchrony with the data. A fundamental problem in our synthesis algorithm is to check membership of a time series in a hybrid automaton. Our solution integrates reachability and optimization techniques for affine dynamical systems to obtain both a sufficient and a necessary condition for membership, combined in a refinement framework. The algorithm processes one time series at a time and hence can be interrupted, provide an intermediate result, and be resumed. We report experimental results demonstrating the applicability of our synthesis approach.","lang":"eng"}],"publication_status":"published","publisher":"Association for Computing Machinery","date_published":"2021-05-01T00:00:00Z","department":[{"_id":"ToHe"}],"page":"2102.12734","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"ec_funded":1,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411.","year":"2021","citation":{"mla":"Garcia Soto, Miriam, et al. “Synthesis of Hybrid Automata with Affine Dynamics from Time-Series Data.” <i>HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control</i>, Association for Computing Machinery, 2021, p. 2102.12734, doi:<a href=\"https://doi.org/10.1145/3447928.3456704\">10.1145/3447928.3456704</a>.","ista":"Garcia Soto M, Henzinger TA, Schilling C. 2021. Synthesis of hybrid automata with affine dynamics from time-series data. HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control. HSCC: International Conference on Hybrid Systems Computation and Control, 2102.12734.","chicago":"Garcia Soto, Miriam, Thomas A Henzinger, and Christian Schilling. “Synthesis of Hybrid Automata with Affine Dynamics from Time-Series Data.” In <i>HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control</i>, 2102.12734. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3447928.3456704\">https://doi.org/10.1145/3447928.3456704</a>.","short":"M. Garcia Soto, T.A. Henzinger, C. Schilling, in:, HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control, Association for Computing Machinery, 2021, p. 2102.12734.","ieee":"M. Garcia Soto, T. A. Henzinger, and C. Schilling, “Synthesis of hybrid automata with affine dynamics from time-series data,” in <i>HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control</i>, Nashville, TN, United States, 2021, p. 2102.12734.","ama":"Garcia Soto M, Henzinger TA, Schilling C. Synthesis of hybrid automata with affine dynamics from time-series data. In: <i>HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control</i>. Association for Computing Machinery; 2021:2102.12734. doi:<a href=\"https://doi.org/10.1145/3447928.3456704\">10.1145/3447928.3456704</a>","apa":"Garcia Soto, M., Henzinger, T. A., &#38; Schilling, C. (2021). Synthesis of hybrid automata with affine dynamics from time-series data. In <i>HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control</i> (p. 2102.12734). Nashville, TN, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3447928.3456704\">https://doi.org/10.1145/3447928.3456704</a>"},"date_created":"2021-02-26T16:30:39Z","keyword":["hybrid automaton","membership","system identification"],"doi":"10.1145/3447928.3456704","file_date_updated":"2021-05-25T13:53:22Z","_id":"9200","conference":{"start_date":"2021-05-19","name":"HSCC: International Conference on Hybrid Systems Computation and Control","end_date":"2021-05-21","location":"Nashville, TN, United States"},"publication_identifier":{"isbn":["9781450383394"]},"month":"05","oa_version":"Published Version","day":"01","file":[{"date_updated":"2021-05-25T13:53:22Z","date_created":"2021-05-25T13:53:22Z","file_id":"9424","file_name":"2021_HSCC_Soto.pdf","checksum":"4c1202c1abf71384c3ee6fea88c2f80e","success":1,"content_type":"application/pdf","file_size":1474786,"relation":"main_file","access_level":"open_access","creator":"kschuh"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"orcid":"0000-0003-2936-5719","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","last_name":"Garcia Soto","first_name":"Miriam","full_name":"Garcia Soto, Miriam"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"first_name":"Christian","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"arxiv":1,"type":"conference","status":"public","isi":1,"scopus_import":"1","has_accepted_license":"1","oa":1,"date_updated":"2023-08-07T13:49:33Z","article_processing_charge":"No","title":"Synthesis of hybrid automata with affine dynamics from time-series data","publication":"HSCC '21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control","language":[{"iso":"eng"}]},{"status":"public","type":"conference","conference":{"location":"Online","end_date":"2021-07-02","name":"LICS: Symposium on Logic in Computer Science","start_date":"2021-06-29"},"month":"06","oa_version":"Published Version","day":"29","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_size":641990,"creator":"esarac","date_updated":"2021-06-16T08:23:54Z","date_created":"2021-06-16T08:23:54Z","checksum":"6e4cba3f72775f479c5b1b75d1a4a0c4","file_id":"9557","file_name":"qam.pdf","success":1}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Sarac, Naci E","first_name":"Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"arxiv":1,"publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","language":[{"iso":"eng"}],"isi":1,"scopus_import":"1","has_accepted_license":"1","oa":1,"date_updated":"2023-08-08T13:52:56Z","article_processing_charge":"No","title":"Quantitative and approximate monitoring","publisher":"Institute of Electrical and Electronics Engineers","date_published":"2021-06-29T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"quality_controlled":"1","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"ddc":["000"],"external_id":{"arxiv":["2105.08353"],"isi":["000947350400021"]},"abstract":[{"lang":"eng","text":"In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision."}],"publication_status":"published","doi":"10.1109/LICS52264.2021.9470547","file_date_updated":"2021-06-16T08:23:54Z","_id":"9356","article_number":"9470547","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","year":"2021","citation":{"ieee":"T. A. Henzinger and N. E. Sarac, “Quantitative and approximate monitoring,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Online, 2021.","ama":"Henzinger TA, Sarac NE. Quantitative and approximate monitoring. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers; 2021. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>","short":"T.A. Henzinger, N.E. Sarac, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021.","mla":"Henzinger, Thomas A., and Naci E. Sarac. “Quantitative and Approximate Monitoring.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 9470547, Institute of Electrical and Electronics Engineers, 2021, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>.","chicago":"Henzinger, Thomas A, and Naci E Sarac. “Quantitative and Approximate Monitoring.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>.","ista":"Henzinger TA, Sarac NE. 2021. Quantitative and approximate monitoring. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 9470547.","apa":"Henzinger, T. A., &#38; Sarac, N. E. (2021). Quantitative and approximate monitoring. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Online: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>"},"date_created":"2021-04-30T17:30:47Z"},{"conference":{"name":"RV: Runtime Verification","start_date":"2021-10-11","location":"Virtual","end_date":"2021-10-14"},"publication_identifier":{"eissn":["1611-3349"],"eisbn":["978-3-030-88494-9"],"isbn":["978-3-030-88493-2"],"issn":["0302-9743"]},"month":"10","oa_version":"Preprint","day":"06","file":[{"date_created":"2021-10-07T23:32:18Z","date_updated":"2021-10-07T23:32:18Z","success":1,"file_name":"differentialmonitoring-cameraready-openaccess.pdf","checksum":"554c7fdb259eda703a8b6328a6dad55a","file_id":"10109","file_size":350632,"access_level":"open_access","content_type":"application/pdf","relation":"main_file","creator":"fmuehlbo"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"orcid":"0000-0003-1548-0177","last_name":"Mühlböck","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian","full_name":"Mühlböck, Fabian"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["LNCS"],"type":"conference","status":"public","isi":1,"has_accepted_license":"1","scopus_import":"1","intvolume":"     12974","oa":1,"date_updated":"2023-08-14T07:20:30Z","article_processing_charge":"No","title":"Differential monitoring","publication":"International Conference on Runtime Verification","language":[{"iso":"eng"}],"ddc":["005"],"external_id":{"isi":["000719383800012"]},"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"}],"place":"Cham","publication_status":"published","publisher":"Springer Nature","date_published":"2021-10-06T00:00:00Z","page":"231-243","department":[{"_id":"ToHe"}],"quality_controlled":"1","volume":12974,"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"related_material":{"record":[{"status":"public","relation":"extended_version","id":"9946"}]},"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.","year":"2021","date_created":"2021-10-07T23:30:10Z","citation":{"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>","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>.","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>.","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.","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>"},"keyword":["run-time verification","software engineering","implicit specification"],"doi":"10.1007/978-3-030-88494-9_12","file_date_updated":"2021-10-07T23:32:18Z","_id":"10108"},{"language":[{"iso":"eng"}],"publication":"Proceedings of the ACM on Programming Languages","title":"Transitioning from structural to nominal code with efficient gradual typing","oa":1,"date_updated":"2021-11-12T11:30:07Z","article_processing_charge":"No","has_accepted_license":"1","intvolume":"         5","status":"public","type":"journal_article","author":[{"full_name":"Mühlböck, Fabian","first_name":"Fabian","orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","last_name":"Mühlböck"},{"last_name":"Tate","full_name":"Tate, Ross","first_name":"Ross"}],"day":"15","oa_version":"Published Version","file":[{"creator":"fmuehlbo","relation":"main_file","file_size":770269,"access_level":"open_access","content_type":"application/pdf","checksum":"71011efd2da771cafdec7f0d9693f8c1","file_id":"10154","file_name":"monnom-oopsla21.pdf","success":1,"date_updated":"2021-10-19T12:52:23Z","date_created":"2021-10-19T12:52:23Z"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","conference":{"name":"OOPSLA: Object-Oriented Programming, Systems, Languages, and Applications","start_date":"2021-10-17","location":"Chicago, IL, United States","end_date":"2021-10-23"},"publication_identifier":{"eissn":["2475-1421"]},"month":"10","file_date_updated":"2021-10-19T12:52:23Z","article_type":"original","_id":"10153","doi":"10.1145/3485504","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>","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>.","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>.","short":"F. Mühlböck, R. Tate, Proceedings of the ACM on Programming Languages 5 (2021).","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.","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>"},"date_created":"2021-10-19T12:48:44Z","keyword":["gradual typing","gradual guarantee","nominal","structural","call tags"],"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.","year":"2021","article_number":"127","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"department":[{"_id":"ToHe"}],"quality_controlled":"1","volume":5,"publisher":"Association for Computing Machinery","date_published":"2021-10-15T00:00:00Z","publication_status":"published","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."}],"ddc":["005"],"tmp":{"image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"}},{"day":"06","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.06429"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","conference":{"start_date":"2021-10-11","name":"RV: Runtime Verification","end_date":"2021-10-14","location":"Virtual"},"publication_identifier":{"eisbn":["978-3-030-88494-9"],"eissn":["1611-3349"],"isbn":["9-783-0308-8493-2"],"issn":["0302-9743"]},"month":"10","author":[{"full_name":"Lukina, Anna","first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","last_name":"Lukina"},{"orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","first_name":"Christian","full_name":"Schilling, Christian"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"arxiv":1,"alternative_title":["LNCS"],"status":"public","type":"conference","scopus_import":"1","isi":1,"title":"Into the unknown: active monitoring of neural networks","date_updated":"2024-01-30T12:06:56Z","oa":1,"article_processing_charge":"No","publication":"21st International Conference on Runtime Verification","language":[{"iso":"eng"}],"external_id":{"arxiv":["2009.06429"],"isi":["000719383800003"]},"abstract":[{"text":"Neural-network classifiers achieve high accuracy when predicting the class of an input that they were trained to identify. Maintaining this accuracy in dynamic environments, where inputs frequently fall outside the fixed set of initially known classes, remains a challenge. The typical approach is to detect inputs from novel classes and retrain the classifier on an augmented dataset. However, not only the classifier but also the detection mechanism needs to adapt in order to distinguish between newly learned and yet unknown input classes. To address this challenge, we introduce an algorithmic framework for active monitoring of a neural network. A monitor wrapped in our framework operates in parallel with the neural network and interacts with a human user via a series of interpretable labeling queries for incremental adaptation. In addition, we propose an adaptive quantitative monitor to improve precision. An experimental evaluation on a diverse set of benchmarks with varying numbers of classes confirms the benefits of our active monitoring framework in dynamic scenarios.","lang":"eng"}],"publication_status":"published","place":"Cham","page":"42-61","department":[{"_id":"ToHe"}],"volume":"12974 ","quality_controlled":"1","publisher":"Springer Nature","date_published":"2021-10-06T00:00:00Z","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"ec_funded":1,"related_material":{"record":[{"status":"public","id":"13234","relation":"extended_version"}]},"citation":{"apa":"Lukina, A., Schilling, C., &#38; Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In <i>21st International Conference on Runtime Verification</i> (Vol. 12974, pp. 42–61). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>","ista":"Lukina A, Schilling C, Henzinger TA. 2021. Into the unknown: active monitoring of neural networks. 21st International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 42–61.","mla":"Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.” <i>21st International Conference on Runtime Verification</i>, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>.","chicago":"Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks.” In <i>21st International Conference on Runtime Verification</i>, 12974:42–61. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>.","short":"A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.","ama":"Lukina A, Schilling C, Henzinger TA. Into the unknown: active monitoring of neural networks. In: <i>21st International Conference on Runtime Verification</i>. Vol 12974. Cham: Springer Nature; 2021:42-61. doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>","ieee":"A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: active monitoring of neural networks,” in <i>21st International Conference on Runtime Verification</i>, Virtual, 2021, vol. 12974, pp. 42–61."},"date_created":"2021-10-31T23:01:31Z","keyword":["monitoring","neural networks","novelty detection"],"acknowledgement":"We thank Christoph Lampert and Alex Greengold for fruitful discussions. This research was supported in part by the Simons Institute for the Theory of Computing, the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411.","year":"2021","doi":"10.1007/978-3-030-88494-9_3","_id":"10206"},{"date_created":"2021-11-15T17:12:57Z","citation":{"apa":"Schmid, L. (2021). <i>Evolution of cooperation via (in)direct reciprocity under imperfect information</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10293\">https://doi.org/10.15479/at:ista:10293</a>","ista":"Schmid L. 2021. Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria.","chicago":"Schmid, Laura. “Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10293\">https://doi.org/10.15479/at:ista:10293</a>.","mla":"Schmid, Laura. <i>Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10293\">10.15479/at:ista:10293</a>.","ieee":"L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect information,” Institute of Science and Technology Austria, 2021.","ama":"Schmid L. Evolution of cooperation via (in)direct reciprocity under imperfect information. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10293\">10.15479/at:ista:10293</a>","short":"L. Schmid, Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information, Institute of Science and Technology Austria, 2021."},"year":"2021","degree_awarded":"PhD","related_material":{"record":[{"relation":"part_of_dissertation","id":"9997","status":"public"},{"relation":"part_of_dissertation","id":"2","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"9402"}]},"ec_funded":1,"_id":"10293","file_date_updated":"2022-12-20T23:30:08Z","doi":"10.15479/at:ista:10293","publication_status":"published","abstract":[{"text":"Indirect reciprocity in evolutionary game theory is a prominent mechanism for explaining the evolution of cooperation among unrelated individuals. In contrast to direct reciprocity, which is based on individuals meeting repeatedly, and conditionally cooperating by using their own experiences, indirect reciprocity is based on individuals’ reputations. If a player helps another, this increases the helper’s public standing, benefitting them in the future. This lets cooperation in the population emerge without individuals having to meet more than once. While the two modes of reciprocity are intertwined, they are difficult to compare. Thus, they are usually studied in isolation. Direct reciprocity can maintain cooperation with simple strategies, and is robust against noise even when players do not remember more\r\nthan their partner’s last action. Meanwhile, indirect reciprocity requires its successful strategies, or social norms, to be more complex. Exhaustive search previously identified eight such norms, called the “leading eight”, which excel at maintaining cooperation. However, as the first result of this thesis, we show that the leading eight break down once we remove the fundamental assumption that information is synchronized and public, such that everyone agrees on reputations. Once we consider a more realistic scenario of imperfect information, where reputations are private, and individuals occasionally misinterpret or miss observations, the leading eight do not promote cooperation anymore. Instead, minor initial disagreements can proliferate, fragmenting populations into subgroups. In a next step, we consider ways to mitigate this issue. We first explore whether introducing “generosity” can stabilize cooperation when players use the leading eight strategies in noisy environments. This approach of modifying strategies to include probabilistic elements for coping with errors is known to work well in direct reciprocity. However, as we show here, it fails for the more complex norms of indirect reciprocity. Imperfect information still prevents cooperation from evolving. On the other hand, we succeeded to show in this thesis that modifying the leading eight to use “quantitative assessment”, i.e. tracking reputation scores on a scale beyond good and bad, and making overall judgments of others based on a threshold, is highly successful, even when noise increases in the environment. Cooperation can flourish when reputations\r\nare more nuanced, and players have a broader understanding what it means to be “good.” Finally, we present a single theoretical framework that unites the two modes of reciprocity despite their differences. Within this framework, we identify a novel simple and successful strategy for indirect reciprocity, which can cope with noisy environments and has an analogue in direct reciprocity. We can also analyze decision making when different sources of information are available. Our results help highlight that for sustaining cooperation, already the most simple rules of reciprocity can be sufficient.","lang":"eng"}],"ddc":["519","576"],"project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"page":"171","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"supervisor":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}],"date_published":"2021-11-17T00:00:00Z","publisher":"Institute of Science and Technology Austria","title":"Evolution of cooperation via (in)direct reciprocity under imperfect information","article_processing_charge":"No","date_updated":"2025-07-14T09:10:09Z","oa":1,"has_accepted_license":"1","language":[{"iso":"eng"}],"author":[{"orcid":"0000-0002-6978-7329","last_name":"Schmid","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","full_name":"Schmid, Laura","first_name":"Laura"}],"file":[{"file_id":"10305","checksum":"86a05b430756ca12ae8107b6e6f3c1e5","file_name":"submission_new.zip","date_updated":"2022-12-20T23:30:08Z","date_created":"2021-11-18T12:41:46Z","embargo_to":"open_access","creator":"lschmid","relation":"source_file","file_size":29703124,"content_type":"application/zip","access_level":"closed"},{"creator":"lschmid","access_level":"open_access","file_size":8320985,"relation":"main_file","content_type":"application/pdf","file_name":"thesis_new_upload.pdf","file_id":"10306","checksum":"d940af042e94660c6b6a7b4f0b184d47","embargo":"2022-10-18","date_updated":"2022-12-20T23:30:08Z","date_created":"2021-11-18T12:59:15Z"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","day":"17","publication_identifier":{"issn":["2663-337X"]},"month":"11","status":"public","type":"dissertation","alternative_title":["ISTA Thesis"]},{"language":[{"iso":"eng"}],"publication":"Computer Graphics Forum","title":"Interactive analysis of CNN robustness","date_updated":"2023-08-14T13:11:42Z","oa":1,"article_processing_charge":"No","issue":"7","intvolume":"        40","scopus_import":"1","isi":1,"type":"journal_article","status":"public","author":[{"last_name":"Sietzen","first_name":"Stefan","full_name":"Sietzen, Stefan"},{"first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Borowski","first_name":"Judy","full_name":"Borowski, Judy"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"last_name":"Waldner","first_name":"Manuela","full_name":"Waldner, Manuela"}],"arxiv":1,"oa_version":"Preprint","day":"27","main_file_link":[{"url":"https://arxiv.org/abs/2110.07667","open_access":"1"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"11","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"article_type":"original","_id":"10404","doi":"10.1111/cgf.14418","date_created":"2021-12-05T23:01:40Z","citation":{"ista":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. 2021. Interactive analysis of CNN robustness. Computer Graphics Forum. 40(7), 253–264.","chicago":"Sietzen, Stefan, Mathias Lechner, Judy Borowski, Ramin Hasani, and Manuela Waldner. “Interactive Analysis of CNN Robustness.” <i>Computer Graphics Forum</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/cgf.14418\">https://doi.org/10.1111/cgf.14418</a>.","mla":"Sietzen, Stefan, et al. “Interactive Analysis of CNN Robustness.” <i>Computer Graphics Forum</i>, vol. 40, no. 7, Wiley, 2021, pp. 253–64, doi:<a href=\"https://doi.org/10.1111/cgf.14418\">10.1111/cgf.14418</a>.","short":"S. Sietzen, M. Lechner, J. Borowski, R. Hasani, M. Waldner, Computer Graphics Forum 40 (2021) 253–264.","ama":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. Interactive analysis of CNN robustness. <i>Computer Graphics Forum</i>. 2021;40(7):253-264. doi:<a href=\"https://doi.org/10.1111/cgf.14418\">10.1111/cgf.14418</a>","ieee":"S. Sietzen, M. Lechner, J. Borowski, R. Hasani, and M. Waldner, “Interactive analysis of CNN robustness,” <i>Computer Graphics Forum</i>, vol. 40, no. 7. Wiley, pp. 253–264, 2021.","apa":"Sietzen, S., Lechner, M., Borowski, J., Hasani, R., &#38; Waldner, M. (2021). Interactive analysis of CNN robustness. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14418\">https://doi.org/10.1111/cgf.14418</a>"},"acknowledgement":"We thank Robert Geirhos and Roland Zimmermann for their participation in the case study and valuable feedback, Chris Olah and Nick Cammarata for valuable discussions in the early phase of the project, as well as the Distill Slack workspace as a platform for discussions. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). J.B. is supported by the German Federal Ministry of Education and Research\r\n(BMBF) through the Competence Center for Machine Learning (TUE.AI, FKZ 01IS18039A) and the International Max Planck Research School for Intelligent Systems (IMPRS-IS). R.H. is partially supported by Boeing and Horizon-2020 ECSEL (grant 783163, iDev40).\r\n","year":"2021","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"page":"253-264","department":[{"_id":"ToHe"}],"quality_controlled":"1","volume":40,"publisher":"Wiley","date_published":"2021-11-27T00:00:00Z","publication_status":"published","external_id":{"isi":["000722952000024"],"arxiv":["2110.07667"]},"abstract":[{"lang":"eng","text":"While convolutional neural networks (CNNs) have found wide adoption as state-of-the-art models for image-related tasks, their predictions are often highly sensitive to small input perturbations, which the human vision is robust against. This paper presents Perturber, a web-based application that allows users to instantaneously explore how CNN activations and predictions evolve when a 3D input scene is interactively perturbed. Perturber offers a large variety of scene modifications, such as camera controls, lighting and shading effects, background modifications, object morphing, as well as adversarial attacks, to facilitate the discovery of potential vulnerabilities. Fine-tuned model versions can be directly compared for qualitative evaluation of their robustness. Case studies with machine learning experts have shown that Perturber helps users to quickly generate hypotheses about model vulnerabilities and to qualitatively compare model behavior. Using quantitative analyses, we could replicate users’ insights with other CNN architectures and input images, yielding new insights about the vulnerability of adversarially trained models."}]},{"language":[{"iso":"eng"}],"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","oa":1,"date_updated":"2025-07-14T09:10:11Z","issue":"5A","article_processing_charge":"No","title":"Scalable verification of quantized neural networks","intvolume":"        35","scopus_import":"1","has_accepted_license":"1","alternative_title":["Technical Tracks"],"type":"conference","status":"public","author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde"}],"arxiv":1,"conference":{"location":"Virtual","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence","start_date":"2021-02-02"},"month":"05","publication_identifier":{"issn":["2159-5399"],"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"]},"day":"28","main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496","open_access":"1"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"mlechner","file_size":137235,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","file_id":"10684","checksum":"2bc8155b2526a70fba5b7301bc89dbd1","success":1,"date_updated":"2022-01-26T07:41:16Z","date_created":"2022-01-26T07:41:16Z"}],"file_date_updated":"2022-01-26T07:41:16Z","_id":"10665","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","year":"2021","date_created":"2022-01-25T15:15:02Z","citation":{"apa":"Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2021). Scalable verification of quantized neural networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.","chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:3787–95. AAAI Press, 2021.","ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795.","mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95.","ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:3787-3795.","ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795."},"ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"11362","status":"public"}]},"project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"publisher":"AAAI Press","date_published":"2021-05-28T00:00:00Z","page":"3787-3795","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"quality_controlled":"1","volume":35,"publication_status":"published","ddc":["000"],"external_id":{"arxiv":["2012.08185"]},"abstract":[{"lang":"eng","text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches."}]},{"doi":"10.1109/ICRA48506.2021.9561036","_id":"10666","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11362"}]},"citation":{"mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” <i>2021 IEEE International Conference on Robotics and Automation</i>, 2021, pp. 4140–47, doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>.","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and AutomationICRA, 4140–4147.","chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International Conference on Robotics and Automation</i>, 4140–47. ICRA, 2021. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>.","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. ICRA. ; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in <i>2021 IEEE International Conference on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.","short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–4147.","apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>"},"date_created":"2022-01-25T15:44:54Z","year":"2021","acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).","quality_controlled":"1","page":"4140-4147","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_published":"2021-01-01T00:00:00Z","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"abstract":[{"text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning.","lang":"eng"}],"external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"tmp":{"short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"series_title":"ICRA","ddc":["000"],"publication_status":"published","publication":"2021 IEEE International Conference on Robotics and Automation","language":[{"iso":"eng"}],"has_accepted_license":"1","isi":1,"title":"Adversarial training is not ready for robot learning","article_processing_charge":"No","oa":1,"date_updated":"2023-08-17T06:58:38Z","status":"public","type":"conference","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08187"}],"oa_version":"None","publication_identifier":{"eissn":["2577-087X"],"eisbn":["978-1-7281-9077-8"],"isbn":["978-1-7281-9078-5"],"issn":["1050-4729"]},"conference":{"location":"Xi'an, China","end_date":"2021-06-05","name":"ICRA: International Conference on Robotics and Automation","start_date":"2021-05-30"},"arxiv":1,"author":[{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}]},{"conference":{"location":"Virtual","end_date":"2021-12-10","name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06"},"month":"12","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html"}],"oa_version":"Published Version","day":"01","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"mlechner","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_size":452492,"success":1,"checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","file_name":"infinite_time_horizon_safety_o.pdf","file_id":"10682","date_created":"2022-01-26T07:39:59Z","date_updated":"2022-01-26T07:39:59Z"}],"author":[{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"first_name":"Ðorđe","full_name":"Žikelić, Ðorđe","last_name":"Žikelić"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"arxiv":1,"alternative_title":[" Advances in Neural Information Processing Systems"],"status":"public","type":"conference","has_accepted_license":"1","date_updated":"2025-07-14T09:10:12Z","oa":1,"article_processing_charge":"No","title":"Infinite time horizon safety of Bayesian neural networks","publication":"35th Conference on Neural Information Processing Systems","language":[{"iso":"eng"}],"ddc":["000"],"tmp":{"short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"external_id":{"arxiv":["2111.03165"]},"abstract":[{"lang":"eng","text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications."}],"publication_status":"published","date_published":"2021-12-01T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"ec_funded":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11362"}]},"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","year":"2021","date_created":"2022-01-25T15:45:58Z","citation":{"apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>."},"doi":"10.48550/arXiv.2111.03165","file_date_updated":"2022-01-26T07:39:59Z","_id":"10667"},{"publication":"Proceedings of the 38th International Conference on Machine Learning","language":[{"iso":"eng"}],"has_accepted_license":"1","intvolume":"       139","title":"On-off center-surround receptive fields for accurate and robust image classification","article_processing_charge":"No","date_updated":"2022-05-04T15:02:27Z","oa":1,"status":"public","type":"conference","alternative_title":["PMLR"],"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2022-01-26T07:38:32Z","date_created":"2022-01-26T07:38:32Z","checksum":"d30eae62561bb517d9f978437d7677db","file_id":"10681","file_name":"babaiee21a.pdf","success":1,"content_type":"application/pdf","access_level":"open_access","file_size":4246561,"relation":"main_file","creator":"mlechner"}],"oa_version":"Published Version","main_file_link":[{"url":"https://proceedings.mlr.press/v139/babaiee21a","open_access":"1"}],"day":"01","publication_identifier":{"issn":["2640-3498"]},"month":"07","conference":{"start_date":"2021-07-18","name":"ML: Machine Learning","end_date":"2021-07-24","location":"Virtual"},"author":[{"last_name":"Babaiee","full_name":"Babaiee, Zahra","first_name":"Zahra"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"_id":"10668","file_date_updated":"2022-01-26T07:38:32Z","citation":{"ista":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. 2021. On-off center-surround receptive fields for accurate and robust image classification. Proceedings of the 38th International Conference on Machine Learning. ML: Machine Learning, PMLR, vol. 139, 478–489.","chicago":"Babaiee, Zahra, Ramin Hasani, Mathias Lechner, Daniela Rus, and Radu Grosu. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” In <i>Proceedings of the 38th International Conference on Machine Learning</i>, 139:478–89. ML Research Press, 2021.","mla":"Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” <i>Proceedings of the 38th International Conference on Machine Learning</i>, vol. 139, ML Research Press, 2021, pp. 478–89.","ama":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. On-off center-surround receptive fields for accurate and robust image classification. In: <i>Proceedings of the 38th International Conference on Machine Learning</i>. Vol 139. ML Research Press; 2021:478-489.","ieee":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, and R. Grosu, “On-off center-surround receptive fields for accurate and robust image classification,” in <i>Proceedings of the 38th International Conference on Machine Learning</i>, Virtual, 2021, vol. 139, pp. 478–489.","short":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, R. Grosu, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 478–489.","apa":"Babaiee, Z., Hasani, R., Lechner, M., Rus, D., &#38; Grosu, R. (2021). On-off center-surround receptive fields for accurate and robust image classification. In <i>Proceedings of the 38th International Conference on Machine Learning</i> (Vol. 139, pp. 478–489). Virtual: ML Research Press."},"date_created":"2022-01-25T15:46:33Z","year":"2021","acknowledgement":"Z.B. is supported by the Doctoral College Resilient Embedded Systems, which is run jointly by the TU Wien’s Faculty of Informatics and the UAS Technikum Wien. R.G. is partially supported by the Horizon 2020 Era-Permed project Persorad, and ECSEL Project grant no. 783163 (iDev40). R.H and D.R were partially supported by Boeing and MIT. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","volume":139,"quality_controlled":"1","page":"478-489","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_published":"2021-07-01T00:00:00Z","publisher":"ML Research Press","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"abstract":[{"text":"Robustness to variations in lighting conditions is a key objective for any deep vision system. To this end, our paper extends the receptive field of convolutional neural networks with two residual components, ubiquitous in the visual processing system of vertebrates: On-center and off-center pathways, with an excitatory center and inhibitory surround; OOCS for short. The On-center pathway is excited by the presence of a light stimulus in its center, but not in its surround, whereas the Off-center pathway is excited by the absence of a light stimulus in its center, but not in its surround. We design OOCS pathways via a difference of Gaussians, with their variance computed analytically from the size of the receptive fields. OOCS pathways complement each other in their response to light stimuli, ensuring this way a strong edge-detection capability, and as a result an accurate and robust inference under challenging lighting conditions. We provide extensive empirical evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness from the novel edge representation, compared to other baselines.","lang":"eng"}],"tmp":{"short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"ddc":["000"],"publication_status":"published"}]