[{"oa":1,"month":"06","language":[{"iso":"eng"}],"date_published":"2022-06-28T00:00:00Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"arxiv":1,"publisher":"Association for the Advancement of Artificial Intelligence","date_updated":"2026-04-07T13:27:55Z","article_type":"original","intvolume":"        36","oa_version":"Preprint","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme\r\nunder the Marie Skłodowska-Curie Grant Agreement No. 665385.","type":"journal_article","_id":"12511","scopus_import":"1","citation":{"ieee":"M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.","short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 7326–7336.","ista":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. 2022. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 36(7), 7326–7336.","ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. Stability verification in stochastic control systems via neural network supermartingales. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. 2022;36(7):7326-7336. doi:<a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">10.1609/aaai.v36i7.20695</a>","apa":"Lechner, M., Zikelic, D., Chatterjee, K., &#38; Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">https://doi.org/10.1609/aaai.v36i7.20695</a>","chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2022. <a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">https://doi.org/10.1609/aaai.v36i7.20695</a>.","mla":"Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:<a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">10.1609/aaai.v36i7.20695</a>."},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"status":"public","day":"28","page":"7326-7336","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We consider the problem of formally verifying almost-sure (a.s.) asymptotic stability in discrete-time nonlinear stochastic control systems. While verifying stability in deterministic control systems is extensively studied in the literature, verifying stability in stochastic control systems is an open problem. The few existing works on this topic either consider only specialized forms of stochasticity or make restrictive assumptions on the system, rendering them inapplicable to learning algorithms with neural network policies. \r\n In this work, we present an approach for general nonlinear stochastic control problems with two novel aspects: (a) instead of classical stochastic extensions of Lyapunov functions, we use ranking supermartingales (RSMs) to certify a.s. asymptotic stability, and (b) we present a method for learning neural network RSMs. \r\n We prove that our approach guarantees a.s. asymptotic stability of the system and\r\n provides the first method to obtain bounds on the stabilization time, which stochastic Lyapunov functions do not.\r\n Finally, we validate our approach experimentally on a set of nonlinear stochastic reinforcement learning environments with neural network policies."}],"external_id":{"arxiv":["2112.09495"]},"publication_status":"published","title":"Stability verification in stochastic control systems via neural network supermartingales","keyword":["General Medicine"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"volume":36,"related_material":{"record":[{"relation":"dissertation_contains","id":"14539","status":"public"}]},"corr_author":"1","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2112.09495","open_access":"1"}],"year":"2022","date_created":"2023-02-05T17:29:50Z","issue":"7","doi":"10.1609/aaai.v36i7.20695","publication_identifier":{"issn":["2159-5399"],"isbn":["9781577358350"],"eissn":["2374-3468"]},"publication":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"citation":{"chicago":"Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">https://doi.org/10.48550/ARXIV.2210.05308</a>.","apa":"Zikelic, D., Lechner, M., Henzinger, T. A., &#38; Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">https://doi.org/10.48550/ARXIV.2210.05308</a>","mla":"Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” <i>ArXiv</i>, 2210.05308, doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">10.48550/ARXIV.2210.05308</a>.","short":"D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, ArXiv (n.d.).","ieee":"D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” <i>arXiv</i>. .","ista":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv, 2210.05308.","ama":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">10.48550/ARXIV.2210.05308</a>"},"status":"public","day":"29","ec_funded":1,"tmp":{"short":"CC BY-SA (4.0)","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode"},"arxiv":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2026-04-07T13:27:56Z","language":[{"iso":"eng"}],"month":"11","date_published":"2022-11-29T00:00:00Z","oa":1,"_id":"14600","type":"preprint","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2210.05308"}],"corr_author":"1","publication":"arXiv","doi":"10.48550/ARXIV.2210.05308","article_number":"2210.05308","year":"2022","date_created":"2023-11-24T13:10:09Z","title":"Learning control policies for stochastic systems with reach-avoid guarantees","abstract":[{"text":"We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold $p\\in[0,1]$ over the infinite time horizon. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees by imposing constraints on what can be viewed as a stochastic extension of level sets of Lyapunov functions for deterministic systems. Our approach solves several important problems -- it can be used to learn a control policy from scratch, to verify a reach-avoid specification for a fixed control policy, or to fine-tune a pre-trained policy if it does not satisfy the reach-avoid specification. We validate our approach on $3$ stochastic non-linear reinforcement learning tasks.","lang":"eng"}],"publication_status":"draft","external_id":{"arxiv":["2210.05308"]},"license":"https://creativecommons.org/licenses/by-sa/4.0/","article_processing_charge":"No","related_material":{"record":[{"status":"public","relation":"later_version","id":"14830"},{"id":"14539","relation":"dissertation_contains","status":"public"}]},"OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","last_name":"Zikelic","first_name":"Dorde"},{"first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"}]},{"oa":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"arxiv":1,"date_updated":"2026-04-07T13:27:56Z","language":[{"iso":"eng"}],"month":"05","date_published":"2022-05-24T00:00:00Z","type":"preprint","oa_version":"Preprint","_id":"14601","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"},{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"citation":{"short":"D. Zikelic, M. Lechner, K. Chatterjee, T.A. Henzinger, ArXiv (n.d.).","ieee":"D. Zikelic, M. Lechner, K. Chatterjee, and T. A. Henzinger, “Learning stabilizing policies in stochastic control systems,” <i>arXiv</i>. .","ama":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2205.11991\">10.48550/arXiv.2205.11991</a>","ista":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv, 2205.11991.","chicago":"Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger. “Learning Stabilizing Policies in Stochastic Control Systems.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2205.11991\">https://doi.org/10.48550/arXiv.2205.11991</a>.","apa":"Zikelic, D., Lechner, M., Chatterjee, K., &#38; Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2205.11991\">https://doi.org/10.48550/arXiv.2205.11991</a>","mla":"Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control Systems.” <i>ArXiv</i>, 2205.11991, doi:<a href=\"https://doi.org/10.48550/arXiv.2205.11991\">10.48550/arXiv.2205.11991</a>."},"ec_funded":1,"status":"public","day":"24","abstract":[{"text":"In this work, we address the problem of learning provably stable neural\r\nnetwork policies for stochastic control systems. While recent work has\r\ndemonstrated the feasibility of certifying given policies using martingale\r\ntheory, the problem of how to learn such policies is little explored. Here, we\r\nstudy the effectiveness of jointly learning a policy together with a martingale\r\ncertificate that proves its stability using a single learning algorithm. We\r\nobserve that the joint optimization problem becomes easily stuck in local\r\nminima when starting from a randomly initialized policy. Our results suggest\r\nthat some form of pre-training of the policy is required for the joint\r\noptimization to repair and verify the policy successfully.","lang":"eng"}],"external_id":{"arxiv":["2205.11991"]},"publication_status":"draft","article_processing_charge":"No","title":"Learning stabilizing policies in stochastic control systems","OA_place":"repository","author":[{"first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"14539"}]},"corr_author":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2205.11991"}],"article_number":"2205.11991","year":"2022","date_created":"2023-11-24T13:22:30Z","publication":"arXiv","doi":"10.48550/arXiv.2205.11991"},{"isi":1,"oa":1,"language":[{"iso":"eng"}],"month":"01","date_published":"2022-01-14T00:00:00Z","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","arxiv":1,"date_updated":"2026-04-16T09:13:43Z","oa_version":"Preprint","intvolume":"     13182","type":"conference","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.","_id":"10774","scopus_import":"1","citation":{"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>","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.","short":"E. Bartocci, T. Ferrere, T.A. Henzinger, D. Nickovic, A.O. Da Costa, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2022, pp. 1–19.","ieee":"E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. O. Da Costa, “Flavors of sequential information flow,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Philadelphia, PA, United States, 2022, vol. 13182, pp. 1–19.","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>.","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>"},"project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"alternative_title":["LNCS"],"day":"14","status":"public","page":"1-19","article_processing_charge":"No","abstract":[{"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.","lang":"eng"}],"publication_status":"published","external_id":{"isi":["001059208500001"],"arxiv":["2105.02013"]},"title":"Flavors of sequential information flow","author":[{"first_name":"Ezio","last_name":"Bartocci","full_name":"Bartocci, Ezio"},{"orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","first_name":"Thomas","last_name":"Ferrere"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan"},{"full_name":"Da Costa, Ana Oliveira","last_name":"Da Costa","first_name":"Ana Oliveira"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","volume":13182,"quality_controlled":"1","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2105.02013","open_access":"1"}],"conference":{"location":"Philadelphia, PA, United States","end_date":"2022-01-18","start_date":"2022-01-16","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation"},"year":"2022","date_created":"2022-02-20T23:01:34Z","publication_identifier":{"isbn":["9783030945824"],"eisbn":["9783030945831"],"issn":["0302-9743"],"eissn":["1611-3349"]},"doi":"10.1007/978-3-030-94583-1_1","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"type":"conference","acknowledgement":"Thomas A. Henzinger: This work was supported in part by the ERC-2020-AdG 101020093.\r\nPatrick Totzke: acknowledges support from the EPSRC, project no. EP/V025848/1.\r\n","oa_version":"Published Version","intvolume":"       243","scopus_import":"1","_id":"12508","file_date_updated":"2023-02-06T09:21:09Z","oa":1,"date_updated":"2026-07-07T13:37:45Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"date_published":"2022-09-06T00:00:00Z","language":[{"iso":"eng"}],"month":"09","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"day":"06","status":"public","alternative_title":["LIPIcs"],"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"citation":{"apa":"Henzinger, T. A., Lehtinen, K., &#38; Totzke, P. (2022). History-deterministic timed automata. In <i>33rd International Conference on Concurrency Theory</i> (Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.14</a>","chicago":"Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic Timed Automata.” In <i>33rd International Conference on Concurrency Theory</i>, 243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.14</a>.","mla":"Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.” <i>33rd International Conference on Concurrency Theory</i>, vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">10.4230/LIPIcs.CONCUR.2022.14</a>.","ieee":"T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed automata,” in <i>33rd International Conference on Concurrency Theory</i>, Warsaw, Poland, 2022, vol. 243, p. 14:1-14:21.","short":"T.A. Henzinger, K. Lehtinen, P. Totzke, in:, 33rd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21.","ama":"Henzinger TA, Lehtinen K, Totzke P. History-deterministic timed automata. In: <i>33rd International Conference on Concurrency Theory</i>. Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:14:1-14:21. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">10.4230/LIPIcs.CONCUR.2022.14</a>","ista":"Henzinger TA, Lehtinen K, Totzke P. 2022. History-deterministic timed automata. 33rd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 14:1-14:21."},"volume":243,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karoliina","last_name":"Lehtinen","full_name":"Lehtinen, Karoliina"},{"last_name":"Totzke","first_name":"Patrick","full_name":"Totzke, Patrick"}],"related_material":{"record":[{"relation":"later_version","id":"18530","status":"public"}]},"publication_status":"published","abstract":[{"text":"We explore the notion of history-determinism in the context of timed automata (TA). History-deterministic automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterisations, and history-deterministic specifications allow for game-based verification without an expensive determinization step.\r\nWe show yet another characterisation of history-determinism in terms of fair simulation, at the general level of labelled transition systems: a system is history-deterministic precisely if and only if it fairly simulates all language smaller systems.\r\nFor timed automata over infinite timed words it is known that universality is undecidable for Büchi TA. We show that for history-deterministic TA with arbitrary parity acceptance, timed universality, inclusion, and synthesis all remain decidable and are ExpTime-complete.\r\nFor the subclass of TA with safety or reachability acceptance, we show that checking whether such an automaton is history-deterministic is decidable (in ExpTime), and history-deterministic TA with safety acceptance are effectively determinizable without introducing new automata states.","lang":"eng"}],"article_processing_charge":"No","page":"14:1-14:21","title":"History-deterministic timed automata","date_created":"2023-02-05T17:24:23Z","year":"2022","das_tickbox":"1","publication":"33rd International Conference on Concurrency Theory","doi":"10.4230/LIPIcs.CONCUR.2022.14","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772464"]},"file":[{"file_id":"12520","relation":"main_file","checksum":"9e97e15628f66b2ad77f535bb0327dee","access_level":"open_access","file_size":717940,"date_updated":"2023-02-06T09:21:09Z","date_created":"2023-02-06T09:21:09Z","file_name":"2022_LIPICs_Henzinger2.pdf","content_type":"application/pdf","creator":"dernst","success":1}],"quality_controlled":"1","corr_author":"1","conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2022-09-13","location":"Warsaw, Poland","end_date":"2022-09-16"},"ddc":["000"],"has_accepted_license":"1"},{"publication":"22nd International Conference on Runtime Verification","publication_identifier":{"issn":["0302-9743"]},"doi":"10.1007/978-3-031-17196-3_11","year":"2022","date_created":"2022-08-08T17:09:09Z","conference":{"end_date":"2022-09-30","location":"Tbilisi, Georgia","name":"RV: Runtime Verification","start_date":"2022-09-28"},"ddc":["000"],"has_accepted_license":"1","quality_controlled":"1","file":[{"creator":"dernst","success":1,"date_created":"2023-01-20T07:34:50Z","content_type":"application/pdf","file_name":"2022_LNCS_RV_Henzinger.pdf","checksum":"05c7dcfbb9053a98f46441fb2eccb213","relation":"main_file","access_level":"open_access","file_size":477110,"date_updated":"2023-01-20T07:34:50Z","file_id":"12317"}],"corr_author":"1","related_material":{"record":[{"relation":"dissertation_contains","id":"20147","status":"public"}]},"volume":13498,"author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Mazzocchi","first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien"},{"first_name":"Naci E","last_name":"Sarac","full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Abstract monitors for quantitative specifications","abstract":[{"text":"Quantitative monitoring can be universal and approximate: For every finite sequence of observations, the specification provides a value and the monitor outputs a best-effort approximation of it. The quality of the approximation may depend on the resources that are available to the monitor. By taking to the limit the sequences of specification values and monitor outputs, we obtain precision-resource trade-offs also for limit monitoring. This paper provides a formal framework for studying such trade-offs using an abstract interpretation for monitors: For each natural number n, the aggregate semantics of a monitor at time n is an equivalence relation over all sequences of at most n observations so that two equivalent sequences are indistinguishable to the monitor and thus mapped to the same output. This abstract interpretation of quantitative monitors allows us to measure the number of equivalence classes (or “resource use”) that is necessary for a certain precision up to a certain time, or at any time. Our framework offers several insights. For example, we identify a family of specifications for which any resource-optimal exact limit monitor is independent of any error permitted over finite traces. Moreover, we present a specification for which any resource-optimal approximate limit monitor does not minimize its resource use at any time. ","lang":"eng"}],"publication_status":"published","external_id":{"isi":["000866539700011"]},"page":"200-220","article_processing_charge":"Yes","day":"23","status":"public","alternative_title":["LNCS"],"ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"citation":{"mla":"Henzinger, Thomas A., et al. “Abstract Monitors for Quantitative Specifications.” <i>22nd International Conference on Runtime Verification</i>, vol. 13498, Springer Nature, 2022, pp. 200–20, doi:<a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">10.1007/978-3-031-17196-3_11</a>.","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Abstract Monitors for Quantitative Specifications.” In <i>22nd International Conference on Runtime Verification</i>, 13498:200–220. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">https://doi.org/10.1007/978-3-031-17196-3_11</a>.","apa":"Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2022). Abstract monitors for quantitative specifications. In <i>22nd International Conference on Runtime Verification</i> (Vol. 13498, pp. 200–220). Tbilisi, Georgia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">https://doi.org/10.1007/978-3-031-17196-3_11</a>","ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2022. Abstract monitors for quantitative specifications. 22nd International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 13498, 200–220.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Abstract monitors for quantitative specifications. In: <i>22nd International Conference on Runtime Verification</i>. Vol 13498. Springer Nature; 2022:200-220. doi:<a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">10.1007/978-3-031-17196-3_11</a>","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Abstract monitors for quantitative specifications,” in <i>22nd International Conference on Runtime Verification</i>, Tbilisi, Georgia, 2022, vol. 13498, pp. 200–220.","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 22nd International Conference on Runtime Verification, Springer Nature, 2022, pp. 200–220."},"_id":"11775","scopus_import":"1","type":"conference","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","oa_version":"Published Version","intvolume":"     13498","publisher":"Springer Nature","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_updated":"2026-07-27T12:48:18Z","month":"09","language":[{"iso":"eng"}],"date_published":"2022-09-23T00:00:00Z","oa":1,"file_date_updated":"2023-01-20T07:34:50Z","isi":1},{"oa":1,"language":[{"iso":"eng"}],"month":"04","date_published":"2022-04-15T00:00:00Z","department":[{"_id":"ToHe"}],"arxiv":1,"date_updated":"2026-08-12T06:40:15Z","oa_version":"Preprint","type":"preprint","acknowledgement":"This work was supported in parts by the ERC-2020-AdG 101020093, National Science Foundation (NSF), and JP\r\nMorgan Graduate Fellowships. We thank Christoph Lampert for inspiring this work.\r\n","_id":"11366","citation":{"mla":"Lechner, Mathias, et al. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” <i>ArXiv</i>, 2204.07373, doi:<a href=\"https://doi.org/10.48550/arXiv.2204.07373\">10.48550/arXiv.2204.07373</a>.","chicago":"Lechner, Mathias, Alexander Amini, Daniela Rus, and Thomas A Henzinger. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2204.07373\">https://doi.org/10.48550/arXiv.2204.07373</a>.","apa":"Lechner, M., Amini, A., Rus, D., &#38; Henzinger, T. A. (n.d.). Revisiting the adversarial robustness-accuracy tradeoff in robot learning. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2204.07373\">https://doi.org/10.48550/arXiv.2204.07373</a>","ista":"Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. arXiv, 2204.07373.","ama":"Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2204.07373\">10.48550/arXiv.2204.07373</a>","short":"M. Lechner, A. Amini, D. Rus, T.A. Henzinger, ArXiv (n.d.).","ieee":"M. Lechner, A. Amini, D. Rus, and T. A. Henzinger, “Revisiting the adversarial robustness-accuracy tradeoff in robot learning,” <i>arXiv</i>. ."},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"ec_funded":1,"day":"15","status":"public","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Adversarial training (i.e., training on adversarially perturbed input data) is a well-studied method for making neural networks robust to potential adversarial attacks during inference. However, the improved robustness does not\r\ncome for free but rather is accompanied by a decrease in overall model accuracy and performance. Recent work has shown that, in practical robot learning applications, the effects of adversarial training do not pose a fair trade-off\r\nbut inflict a net loss when measured in holistic robot performance. This work revisits the robustness-accuracy trade-off in robot learning by systematically analyzing if recent advances in robust training methods and theory in\r\nconjunction with adversarial robot learning can make adversarial training suitable for real-world robot applications. We evaluate a wide variety of robot learning tasks ranging from autonomous driving in a high-fidelity environment\r\namenable to sim-to-real deployment, to mobile robot gesture recognition. Our results demonstrate that, while these techniques make incremental improvements on the trade-off on a relative scale, the negative side-effects caused by\r\nadversarial training still outweigh the improvements by an order of magnitude. We conclude that more substantial advances in robust learning methods are necessary before they can benefit robot learning tasks in practice."}],"publication_status":"draft","external_id":{"arxiv":["2204.07373"]},"title":"Revisiting the adversarial robustness-accuracy tradeoff in robot learning","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","related_material":{"record":[{"relation":"dissertation_contains","id":"11362","status":"public"},{"status":"public","relation":"later_version","id":"12704"}]},"corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2204.07373"}],"year":"2022","date_created":"2022-05-12T13:20:17Z","article_number":"2204.07373","doi":"10.48550/arXiv.2204.07373","publication":"arXiv"},{"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"},{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"citation":{"ama":"Lechner M. Learning verifiable representations. 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.","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.","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>.","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>.","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>"},"day":"12","status":"public","alternative_title":["ISTA Thesis"],"tmp":{"short":"CC BY-ND (4.0)","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)"},"ec_funded":1,"date_updated":"2026-08-19T09:28:05Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"Institute of Science and Technology Austria","date_published":"2022-05-12T00:00:00Z","language":[{"iso":"eng"}],"month":"05","file_date_updated":"2022-05-17T15:19:39Z","oa":1,"_id":"11362","type":"dissertation","oa_version":"Published Version","ddc":["004"],"has_accepted_license":"1","file":[{"relation":"source_file","checksum":"8eefa9c7c10ca7e1a2ccdd731962a645","access_level":"closed","date_updated":"2022-05-13T12:49:00Z","file_size":13210143,"file_id":"11378","creator":"mlechner","date_created":"2022-05-13T12:33:26Z","content_type":"application/zip","file_name":"src.zip"},{"creator":"mlechner","date_created":"2022-05-16T08:02:28Z","content_type":"application/pdf","file_name":"thesis_main-a2.pdf","relation":"main_file","checksum":"1b9e1e5a9a83ed9d89dad2f5133dc026","access_level":"open_access","file_size":2732536,"date_updated":"2022-05-17T15:19:39Z","file_id":"11382"}],"corr_author":"1","publication_identifier":{"isbn":["978-3-99078-017-6"]},"doi":"10.15479/at:ista:11362","date_created":"2022-05-12T07:14:01Z","year":"2022","keyword":["neural networks","verification","machine learning"],"supervisor":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"title":"Learning verifiable representations","degree_awarded":"PhD","publication_status":"published","abstract":[{"lang":"eng","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."}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","article_processing_charge":"No","page":"124","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"11366"},{"status":"public","id":"7808","relation":"part_of_dissertation"},{"id":"10666","relation":"part_of_dissertation","status":"public"},{"id":"10667","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"10665","status":"public"}]},"OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"}]},{"citation":{"ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring. International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 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>","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.","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>.","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>"},"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"alternative_title":["LNCS"],"place":"Cham","day":"06","status":"public","date_published":"2021-10-06T00:00:00Z","language":[{"iso":"eng"}],"month":"10","date_updated":"2025-04-15T06:26:12Z","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","isi":1,"file_date_updated":"2021-10-07T23:32:18Z","oa":1,"scopus_import":"1","_id":"10108","oa_version":"Preprint","intvolume":"     12974","type":"conference","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.","has_accepted_license":"1","ddc":["005"],"conference":{"end_date":"2021-10-14","location":"Virtual","name":"RV: Runtime Verification","start_date":"2021-10-11"},"corr_author":"1","quality_controlled":"1","file":[{"file_size":350632,"date_updated":"2021-10-07T23:32:18Z","access_level":"open_access","relation":"main_file","checksum":"554c7fdb259eda703a8b6328a6dad55a","file_id":"10109","success":1,"creator":"fmuehlbo","file_name":"differentialmonitoring-cameraready-openaccess.pdf","content_type":"application/pdf","date_created":"2021-10-07T23:32:18Z"}],"publication_identifier":{"eissn":["1611-3349"],"isbn":["978-3-030-88493-2"],"issn":["0302-9743"],"eisbn":["978-3-030-88494-9"]},"doi":"10.1007/978-3-030-88494-9_12","publication":"International Conference on Runtime Verification","date_created":"2021-10-07T23:30:10Z","year":"2021","keyword":["run-time verification","software engineering","implicit specification"],"title":"Differential monitoring","article_processing_charge":"No","page":"231-243","publication_status":"published","external_id":{"isi":["000719383800012"]},"abstract":[{"lang":"eng","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."}],"related_material":{"record":[{"status":"public","id":"9946","relation":"extended_version"}]},"author":[{"first_name":"Fabian","last_name":"Mühlböck","orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","full_name":"Mühlböck, Fabian"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":12974},{"publication_identifier":{"eissn":["2475-1421"]},"doi":"10.1145/3485504","publication":"Proceedings of the ACM on Programming Languages","date_created":"2021-10-19T12:48:44Z","year":"2021","article_number":"127","has_accepted_license":"1","ddc":["005"],"conference":{"name":"OOPSLA: Object-Oriented Programming, Systems, Languages, and Applications","start_date":"2021-10-17","end_date":"2021-10-23","location":"Chicago, IL, United States"},"file":[{"file_id":"10154","date_updated":"2021-10-19T12:52:23Z","file_size":770269,"relation":"main_file","checksum":"71011efd2da771cafdec7f0d9693f8c1","access_level":"open_access","content_type":"application/pdf","file_name":"monnom-oopsla21.pdf","date_created":"2021-10-19T12:52:23Z","creator":"fmuehlbo","success":1}],"quality_controlled":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"last_name":"Mühlböck","first_name":"Fabian","orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","full_name":"Mühlböck, Fabian"},{"last_name":"Tate","first_name":"Ross","full_name":"Tate, Ross"}],"volume":5,"keyword":["gradual typing","gradual guarantee","nominal","structural","call tags"],"title":"Transitioning from structural to nominal code with efficient gradual typing","article_processing_charge":"No","publication_status":"published","abstract":[{"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.","lang":"eng"}],"day":"15","status":"public","tmp":{"short":"CC BY-ND (4.0)","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)"},"citation":{"apa":"Mühlböck, F., &#38; Tate, R. (2021). Transitioning from structural to nominal code with efficient gradual typing. <i>Proceedings of the ACM on Programming Languages</i>. Chicago, IL, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485504\">https://doi.org/10.1145/3485504</a>","chicago":"Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485504\">https://doi.org/10.1145/3485504</a>.","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>.","ieee":"F. Mühlböck and R. Tate, “Transitioning from structural to nominal code with efficient gradual typing,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5. Association for Computing Machinery, 2021.","short":"F. Mühlböck, R. Tate, Proceedings of the ACM on Programming Languages 5 (2021).","ista":"Mühlböck F, Tate R. 2021. Transitioning from structural to nominal code with efficient gradual typing. Proceedings of the ACM on Programming Languages. 5, 127.","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>"},"project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","_id":"10153","intvolume":"         5","oa_version":"Published Version","article_type":"original","type":"journal_article","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.","date_published":"2021-10-15T00:00:00Z","language":[{"iso":"eng"}],"month":"10","date_updated":"2025-04-15T06:25:55Z","publisher":"Association for Computing Machinery","department":[{"_id":"ToHe"}],"file_date_updated":"2021-10-19T12:52:23Z","oa":1},{"ec_funded":1,"status":"public","day":"06","place":"Cham","alternative_title":["LNCS"],"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"citation":{"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>.","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.","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>","short":"A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.","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."},"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.","type":"conference","oa_version":"Preprint","_id":"10206","scopus_import":"1","oa":1,"isi":1,"arxiv":1,"department":[{"_id":"ToHe"}],"publisher":"Springer Nature","date_updated":"2025-04-15T06:26:14Z","month":"10","language":[{"iso":"eng"}],"date_published":"2021-10-06T00:00:00Z","year":"2021","date_created":"2021-10-31T23:01:31Z","publication":"21st International Conference on Runtime Verification","publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-030-88494-9"],"isbn":["9-783-0308-8493-2"],"eissn":["1611-3349"]},"doi":"10.1007/978-3-030-88494-9_3","quality_controlled":"1","corr_author":"1","conference":{"end_date":"2021-10-14","location":"Virtual","name":"RV: Runtime Verification","start_date":"2021-10-11"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.06429"}],"volume":"12974 ","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Lukina","first_name":"Anna","full_name":"Lukina, Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425"},{"first_name":"Christian","last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"related_material":{"record":[{"status":"public","id":"13234","relation":"extended_version"}]},"abstract":[{"lang":"eng","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."}],"publication_status":"published","external_id":{"isi":["000719383800003"],"arxiv":["2009.06429"]},"page":"42-61","article_processing_charge":"No","title":"Into the unknown: active monitoring of neural networks","keyword":["monitoring","neural networks","novelty detection"]},{"date_created":"2021-12-05T23:01:40Z","year":"2021","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"doi":"10.1111/cgf.14418","issue":"7","publication":"Computer Graphics Forum","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2110.07667"}],"author":[{"full_name":"Sietzen, Stefan","first_name":"Stefan","last_name":"Sietzen"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"first_name":"Judy","last_name":"Borowski","full_name":"Borowski, Judy"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"full_name":"Waldner, Manuela","last_name":"Waldner","first_name":"Manuela"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":40,"article_processing_charge":"No","page":"253-264","external_id":{"arxiv":["2110.07667"],"isi":["000722952000024"]},"publication_status":"published","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."}],"title":"Interactive analysis of CNN robustness","day":"27","status":"public","citation":{"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>","ista":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. 2021. Interactive analysis of CNN robustness. Computer Graphics Forum. 40(7), 253–264.","short":"S. Sietzen, M. Lechner, J. Borowski, R. Hasani, M. Waldner, Computer Graphics Forum 40 (2021) 253–264.","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.","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>.","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>","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>."},"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"oa_version":"Preprint","intvolume":"        40","article_type":"original","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","type":"journal_article","scopus_import":"1","_id":"10404","isi":1,"oa":1,"date_published":"2021-11-27T00:00:00Z","language":[{"iso":"eng"}],"month":"11","date_updated":"2025-04-15T06:25:55Z","department":[{"_id":"ToHe"}],"arxiv":1,"publisher":"Wiley"},{"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"citation":{"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.","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.","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.","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.","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.","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."},"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"},"day":"01","status":"public","alternative_title":["PMLR"],"oa":1,"file_date_updated":"2022-01-26T07:38:32Z","arxiv":1,"publisher":"ML Research Press","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_updated":"2025-05-19T11:28:08Z","language":[{"iso":"eng"}],"month":"07","date_published":"2021-07-01T00:00:00Z","type":"conference","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).","intvolume":"       139","oa_version":"Published Version","_id":"10668","quality_controlled":"1","file":[{"file_size":4246561,"date_updated":"2022-01-26T07:38:32Z","access_level":"open_access","relation":"main_file","checksum":"d30eae62561bb517d9f978437d7677db","file_id":"10681","success":1,"creator":"mlechner","file_name":"babaiee21a.pdf","content_type":"application/pdf","date_created":"2022-01-26T07:38:32Z"}],"ddc":["000"],"conference":{"name":"ML: Machine Learning","start_date":"2021-07-18","end_date":"2021-07-24","location":"Virtual"},"has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v139/babaiee21a"}],"year":"2021","date_created":"2022-01-25T15:46:33Z","publication":"Proceedings of the 38th International Conference on Machine Learning","publication_identifier":{"issn":["2640-3498"]},"abstract":[{"lang":"eng","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."}],"external_id":{"arxiv":["2106.07091"]},"publication_status":"published","page":"478-489","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","article_processing_charge":"No","title":"On-off center-surround receptive fields for accurate and robust image classification","volume":139,"author":[{"first_name":"Zahra","last_name":"Babaiee","full_name":"Babaiee, Zahra"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"citation":{"ista":"Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>. Vol 2. TU Wien Academic Press; 2021:143–152. doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>","short":"B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2021, pp. 143–152.","ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, Virtual, 2021, vol. 2, pp. 143–152.","mla":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>.","apa":"Kragl, B., &#38; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &#38; M. W. Whalen (Eds.), <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i> (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>","chicago":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"01","status":"public","alternative_title":["Conference Series"],"file_date_updated":"2022-01-26T08:04:29Z","oa":1,"date_updated":"2025-04-15T06:25:56Z","department":[{"_id":"ToHe"}],"publisher":"TU Wien Academic Press","date_published":"2021-10-01T00:00:00Z","month":"10","language":[{"iso":"eng"}],"type":"conference","acknowledgement":"This research was performed while Bernhard Kragl was at IST Austria, supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","intvolume":"         2","oa_version":"Published Version","scopus_import":"1","_id":"10688","quality_controlled":"1","file":[{"file_size":390555,"date_updated":"2022-01-26T08:04:29Z","access_level":"open_access","relation":"main_file","checksum":"35438ac9f9750340b7f8ae4ae3220d9f","file_id":"10689","success":1,"creator":"cchlebak","content_type":"application/pdf","file_name":"2021_FCAD2021_Kragl.pdf","date_created":"2022-01-26T08:04:29Z"}],"corr_author":"1","ddc":["000"],"conference":{"end_date":"2021-10-22","location":"Virtual","name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2021-10-20"},"has_accepted_license":"1","date_created":"2022-01-26T08:01:30Z","year":"2021","publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","publication_identifier":{"isbn":["978-3-85448-046-4"]},"doi":"10.34727/2021/isbn.978-3-85448-046-4_23","publication_status":"published","abstract":[{"text":"Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement,\r\nwhich views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier.","lang":"eng"}],"article_processing_charge":"No","page":"143–152","title":"The Civl verifier","volume":2,"editor":[{"last_name":"Ruzica","first_name":"Piskac","full_name":"Ruzica, Piskac"},{"full_name":"Whalen, Michael W.","first_name":"Michael W.","last_name":"Whalen"}],"author":[{"full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","last_name":"Kragl","first_name":"Bernhard"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"citation":{"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>.","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>.","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>","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.","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>","short":"N.E. Sarac, Ö.F. Altun, K.T. Atam, S. Karahoda, K. Kaya, H. Yenigün, Expert Systems with Applications 167 (2021).","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."},"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"status":"public","day":"01","date_published":"2021-04-01T00:00:00Z","month":"04","language":[{"iso":"eng"}],"date_updated":"2026-04-16T09:15:47Z","department":[{"_id":"ToHe"}],"publisher":"Elsevier","isi":1,"file_date_updated":"2020-12-02T13:33:51Z","oa":1,"scopus_import":"1","_id":"8912","intvolume":"       167","oa_version":"Submitted Version","article_type":"original","type":"journal_article","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.","has_accepted_license":"1","ddc":["000"],"corr_author":"1","quality_controlled":"1","file":[{"file_id":"8913","checksum":"600c2f81bc898a725bcfa7cf26ff4fed","relation":"main_file","access_level":"open_access","date_updated":"2020-12-02T13:33:51Z","file_size":634967,"date_created":"2020-12-02T13:33:51Z","content_type":"application/pdf","file_name":"synchroPaperRevised.pdf","creator":"esarac"}],"doi":"10.1016/j.eswa.2020.114203","publication_identifier":{"eissn":["1873-6793"],"issn":["0957-4174"]},"issue":"4","publication":"Expert Systems with Applications","date_created":"2020-12-02T13:34:25Z","year":"2021","article_number":"114203","title":"Boosting expensive synchronizing heuristics","article_processing_charge":"No","publication_status":"published","external_id":{"isi":["000640531100038"]},"abstract":[{"lang":"eng","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."}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"first_name":"Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E"},{"full_name":"Altun, Ömer Faruk","first_name":"Ömer Faruk","last_name":"Altun"},{"full_name":"Atam, Kamil Tolga","first_name":"Kamil Tolga","last_name":"Atam"},{"first_name":"Sertac","last_name":"Karahoda","full_name":"Karahoda, Sertac"},{"full_name":"Kaya, Kamer","last_name":"Kaya","first_name":"Kamer"},{"full_name":"Yenigün, Hüsnü","last_name":"Yenigün","first_name":"Hüsnü"}],"volume":167},{"date_published":"2021-05-01T00:00:00Z","language":[{"iso":"eng"}],"month":"05","date_updated":"2025-07-10T12:01:40Z","department":[{"_id":"ToHe"}],"publisher":"Association for Computing Machinery","arxiv":1,"isi":1,"file_date_updated":"2021-05-25T13:53:22Z","oa":1,"scopus_import":"1","_id":"9200","oa_version":"Published Version","type":"conference","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.","citation":{"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>","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>.","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>.","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>","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: Hybrid Systems - Computation and Control, 2102.12734."},"project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"status":"public","day":"01","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"keyword":["hybrid automaton","membership","system identification"],"title":"Synthesis of hybrid automata with affine dynamics from time-series data","article_processing_charge":"No","page":"2102.12734","publication_status":"published","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"}],"author":[{"first_name":"Miriam","last_name":"Garcia Soto","orcid":"0000-0003-2936-5719","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","full_name":"Garcia Soto, Miriam"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","ddc":["000"],"conference":{"start_date":"2021-05-19","name":"HSCC: Hybrid Systems - Computation and Control","location":"Nashville, TN, United States","end_date":"2021-05-21"},"corr_author":"1","file":[{"content_type":"application/pdf","file_name":"2021_HSCC_Soto.pdf","date_created":"2021-05-25T13:53:22Z","success":1,"creator":"kschuh","file_id":"9424","date_updated":"2021-05-25T13:53:22Z","file_size":1474786,"access_level":"open_access","checksum":"4c1202c1abf71384c3ee6fea88c2f80e","relation":"main_file"}],"quality_controlled":"1","doi":"10.1145/3447928.3456704","publication_identifier":{"isbn":["9781450383394"]},"publication":"HSCC '21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control","date_created":"2021-02-26T16:30:39Z","year":"2021"},{"volume":119,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"first_name":"Đorđe","last_name":"Žikelić","full_name":"Žikelić, Đorđe"}],"related_material":{"record":[{"relation":"earlier_version","id":"6884","status":"public"}]},"external_id":{"arxiv":["1905.03835"],"isi":["000634149800009"]},"publication_status":"published","abstract":[{"text":"A graph game proceeds as follows: two players move a token through a graph to produce a finite or infinite path, which determines the payoff of the game. We study bidding games in which in each turn, an auction determines which player moves the token. Bidding games were largely studied in combination with two variants of first-price auctions called “Richman” and “poorman” bidding. We study taxman bidding, which span the spectrum between the two. The game is parameterized by a constant : portion τ of the winning bid is paid to the other player, and portion  to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games: we unify, generalize, and simplify previous equivalences between bidding games and a class of stochastic games called random-turn games.","lang":"eng"}],"article_processing_charge":"No","page":"133-144","title":"Bidding mechanisms in graph games","date_created":"2021-03-14T23:01:32Z","year":"2021","publication":"Journal of Computer and System Sciences","doi":"10.1016/j.jcss.2021.02.008","publication_identifier":{"issn":["0022-0000"],"eissn":["1090-2724"]},"issue":"8","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1905.03835"}],"type":"journal_article","oa_version":"Preprint","intvolume":"       119","article_type":"original","scopus_import":"1","_id":"9239","oa":1,"isi":1,"date_updated":"2025-07-10T11:53:57Z","arxiv":1,"publisher":"Elsevier","department":[{"_id":"ToHe"}],"date_published":"2021-03-03T00:00:00Z","language":[{"iso":"eng"}],"month":"03","status":"public","day":"03","citation":{"ama":"Avni G, Henzinger TA, Žikelić Đ. Bidding mechanisms in graph games. <i>Journal of Computer and System Sciences</i>. 2021;119(8):133-144. doi:<a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">10.1016/j.jcss.2021.02.008</a>","ista":"Avni G, Henzinger TA, Žikelić Đ. 2021. Bidding mechanisms in graph games. Journal of Computer and System Sciences. 119(8), 133–144.","short":"G. Avni, T.A. Henzinger, Đ. Žikelić, Journal of Computer and System Sciences 119 (2021) 133–144.","ieee":"G. Avni, T. A. Henzinger, and Đ. Žikelić, “Bidding mechanisms in graph games,” <i>Journal of Computer and System Sciences</i>, vol. 119, no. 8. Elsevier, pp. 133–144, 2021.","mla":"Avni, Guy, et al. “Bidding Mechanisms in Graph Games.” <i>Journal of Computer and System Sciences</i>, vol. 119, no. 8, Elsevier, 2021, pp. 133–44, doi:<a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">10.1016/j.jcss.2021.02.008</a>.","apa":"Avni, G., Henzinger, T. A., &#38; Žikelić, Đ. (2021). Bidding mechanisms in graph games. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">https://doi.org/10.1016/j.jcss.2021.02.008</a>","chicago":"Avni, Guy, Thomas A Henzinger, and Đorđe Žikelić. “Bidding Mechanisms in Graph Games.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">https://doi.org/10.1016/j.jcss.2021.02.008</a>."}},{"main_file_link":[{"url":"https://arxiv.org/abs/2103.11389","open_access":"1"}],"citation":{"ama":"Dubach G, Mühlböck F. Formal verification of Zagier’s one-sentence proof. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2103.11389\">10.48550/arXiv.2103.11389</a>","ista":"Dubach G, Mühlböck F. Formal verification of Zagier’s one-sentence proof. arXiv, 2103.11389.","ieee":"G. Dubach and F. Mühlböck, “Formal verification of Zagier’s one-sentence proof,” <i>arXiv</i>. .","short":"G. Dubach, F. Mühlböck, ArXiv (n.d.).","mla":"Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.” <i>ArXiv</i>, 2103.11389, doi:<a href=\"https://doi.org/10.48550/arXiv.2103.11389\">10.48550/arXiv.2103.11389</a>.","apa":"Dubach, G., &#38; Mühlböck, F. (n.d.). Formal verification of Zagier’s one-sentence proof. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2103.11389\">https://doi.org/10.48550/arXiv.2103.11389</a>","chicago":"Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2103.11389\">https://doi.org/10.48550/arXiv.2103.11389</a>."},"corr_author":"1","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"doi":"10.48550/arXiv.2103.11389","day":"21","status":"public","publication":"arXiv","date_created":"2021-03-23T05:38:48Z","year":"2021","article_number":"2103.11389","ec_funded":1,"date_published":"2021-03-21T00:00:00Z","month":"03","title":"Formal verification of Zagier's one-sentence proof","language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:26:12Z","arxiv":1,"department":[{"_id":"LaEr"},{"_id":"ToHe"}],"article_processing_charge":"No","external_id":{"arxiv":["2103.11389"]},"publication_status":"submitted","oa":1,"abstract":[{"lang":"eng","text":"We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David Christopher's recent new proof relying on partition-theoretic arguments. Both formal proofs rely on a general property of involutions of finite sets, of independent interest. The proof technique consists for the most part of automating recurrent tasks (such as case distinctions and computations on natural numbers) via ad hoc tactics."}],"related_material":{"record":[{"relation":"other","id":"9946","status":"public"}]},"_id":"9281","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","author":[{"first_name":"Guillaume","last_name":"Dubach","full_name":"Dubach, Guillaume","orcid":"0000-0001-6892-8137","id":"D5C6A458-10C4-11EA-ABF4-A4B43DDC885E"},{"id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","orcid":"0000-0003-1548-0177","full_name":"Mühlböck, Fabian","last_name":"Mühlböck","first_name":"Fabian"}],"type":"preprint"},{"day":"04","status":"public","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"citation":{"apa":"Petrov, T., Igler, C., Sezgin, A., Henzinger, T. A., &#38; Guet, C. C. (2021). Long lived transients in gene regulation. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">https://doi.org/10.1016/j.tcs.2021.05.023</a>","chicago":"Petrov, Tatjana, Claudia Igler, Ali Sezgin, Thomas A Henzinger, and Calin C Guet. “Long Lived Transients in Gene Regulation.” <i>Theoretical Computer Science</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">https://doi.org/10.1016/j.tcs.2021.05.023</a>.","mla":"Petrov, Tatjana, et al. “Long Lived Transients in Gene Regulation.” <i>Theoretical Computer Science</i>, vol. 893, Elsevier, 2021, pp. 1–16, doi:<a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">10.1016/j.tcs.2021.05.023</a>.","short":"T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer Science 893 (2021) 1–16.","ieee":"T. Petrov, C. Igler, A. Sezgin, T. A. Henzinger, and C. C. Guet, “Long lived transients in gene regulation,” <i>Theoretical Computer Science</i>, vol. 893. Elsevier, pp. 1–16, 2021.","ista":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. 2021. Long lived transients in gene regulation. Theoretical Computer Science. 893, 1–16.","ama":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. Long lived transients in gene regulation. <i>Theoretical Computer Science</i>. 2021;893:1-16. doi:<a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">10.1016/j.tcs.2021.05.023</a>"},"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"scopus_import":"1","_id":"9647","intvolume":"       893","oa_version":"Published Version","article_type":"original","type":"journal_article","acknowledgement":"Tatjana Petrov’s research was supported in part by SNSF Advanced Postdoctoral Mobility Fellowship grant number P300P2 161067, the Ministry of Science, Research and the Arts of the state of Baden-Wurttemberg, and the DFG Centre of Excellence 2117 ‘Centre for the Advanced Study of Collective Behaviour’ (ID: 422037984). Claudia Igler is the recipient of a DOC Fellowship of the Austrian Academy of Sciences. Thomas A. Henzinger’s research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","date_published":"2021-06-04T00:00:00Z","month":"06","language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:25:56Z","publisher":"Elsevier","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"isi":1,"file_date_updated":"2022-05-12T12:13:27Z","oa":1,"publication_identifier":{"issn":["0304-3975"]},"doi":"10.1016/j.tcs.2021.05.023","publication":"Theoretical Computer Science","date_created":"2021-07-11T22:01:18Z","year":"2021","has_accepted_license":"1","ddc":["004"],"corr_author":"1","quality_controlled":"1","file":[{"file_name":"2021_TheoreticalComputerScience_Petrov.pdf","content_type":"application/pdf","date_created":"2022-05-12T12:13:27Z","creator":"dernst","success":1,"file_id":"11364","date_updated":"2022-05-12T12:13:27Z","file_size":2566504,"relation":"main_file","checksum":"d3aef34cfb13e53bba4cf44d01680793","access_level":"open_access"}],"author":[{"full_name":"Petrov, Tatjana","last_name":"Petrov","first_name":"Tatjana"},{"last_name":"Igler","first_name":"Claudia","full_name":"Igler, Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sezgin","first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C","first_name":"Calin C","last_name":"Guet"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":893,"title":"Long lived transients in gene regulation","article_processing_charge":"No","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","page":"1-16","external_id":{"isi":["000710180500002"]},"publication_status":"published","abstract":[{"lang":"eng","text":"Gene expression is regulated by the set of transcription factors (TFs) that bind to the promoter. The ensuing regulating function is often represented as a combinational logic circuit, where output (gene expression) is determined by current input values (promoter bound TFs) only. However, the simultaneous arrival of TFs is a strong assumption, since transcription and translation of genes introduce intrinsic time delays and there is no global synchronisation among the arrival times of different molecular species at their targets. We present an experimentally implementable genetic circuit with two inputs and one output, which in the presence of small delays in input arrival, exhibits qualitatively distinct population-level phenotypes, over timescales that are longer than typical cell doubling times. From a dynamical systems point of view, these phenotypes represent long-lived transients: although they converge to the same value eventually, they do so after a very long time span. The key feature of this toy model genetic circuit is that, despite having only two inputs and one output, it is regulated by twenty-three distinct DNA-TF configurations, two of which are more stable than others (DNA looped states), one promoting and another blocking the expression of the output gene. Small delays in input arrival time result in a majority of cells in the population quickly reaching the stable state associated with the first input, while exiting of this stable state occurs at a slow timescale. In order to mechanistically model the behaviour of this genetic circuit, we used a rule-based modelling language, and implemented a grid-search to find parameter combinations giving rise to long-lived transients. Our analysis shows that in the absence of feedback, there exist path-dependent gene regulatory mechanisms based on the long timescale of transients. The behaviour of this toy model circuit suggests that gene regulatory networks can exploit event timing to create phenotypes, and it opens the possibility that they could use event timing to memorise events, without regulatory feedback. The model reveals the importance of (i) mechanistically modelling the transitions between the different DNA-TF states, and (ii) employing transient analysis thereof."}]},{"ddc":["005"],"has_accepted_license":"1","file":[{"file_id":"9948","relation":"main_file","checksum":"0f9aafd59444cb6bdca6925d163ab946","access_level":"open_access","file_size":"320453","date_updated":"2021-09-03T12:34:28Z","date_created":"2021-08-20T19:59:44Z","content_type":"application/pdf","file_name":"differentialmonitoring-techreport.pdf","creator":"fmuehlbo"}],"doi":"10.15479/AT:ISTA:9946","publication_identifier":{"issn":["2664-1690"]},"year":"2021","date_created":"2021-08-20T20:00:37Z","title":"Differential monitoring","keyword":["run-time verification","software engineering","implicit specification"],"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"}],"publication_status":"published","page":"17","article_processing_charge":"No","related_material":{"record":[{"relation":"shorter_version","id":"10108","status":"public"},{"id":"9281","relation":"other","status":"public"}]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Fabian","last_name":"Mühlböck","orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","full_name":"Mühlböck, Fabian"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"}],"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"citation":{"apa":"Mühlböck, F., &#38; Henzinger, T. A. (2021). <i>Differential monitoring</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9946\">https://doi.org/10.15479/AT:ISTA:9946</a>","chicago":"Mühlböck, Fabian, and Thomas A Henzinger. <i>Differential Monitoring</i>. IST Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9946\">https://doi.org/10.15479/AT:ISTA:9946</a>.","mla":"Mühlböck, Fabian, and Thomas A. Henzinger. <i>Differential Monitoring</i>. IST Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9946\">10.15479/AT:ISTA:9946</a>.","ieee":"F. Mühlböck and T. A. Henzinger, <i>Differential monitoring</i>. IST Austria, 2021.","short":"F. Mühlböck, T.A. Henzinger, Differential Monitoring, IST Austria, 2021.","ama":"Mühlböck F, Henzinger TA. <i>Differential Monitoring</i>. IST Austria; 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9946\">10.15479/AT:ISTA:9946</a>","ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring, IST Austria, 17p."},"status":"public","day":"01","alternative_title":["IST Austria Technical Report"],"department":[{"_id":"ToHe"}],"publisher":"IST Austria","date_updated":"2025-04-15T06:55:00Z","language":[{"iso":"eng"}],"month":"09","date_published":"2021-09-01T00:00:00Z","oa":1,"file_date_updated":"2021-09-03T12:34:28Z","_id":"9946","type":"technical_report","acknowledgement":"The authors would like to thank Borzoo Bonakdarpour, Derek Dreyer, Adrian Francalanza, Owolabi Legunsen, Matthew 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.","oa_version":"Published Version"}]