[{"abstract":[{"text":"Deep learning has enabled breakthroughs in challenging computing problems and has emerged as the standard problem-solving tool for computer vision and natural language processing tasks.\r\nOne exception to this trend is safety-critical tasks where robustness and resilience requirements contradict the black-box nature of neural networks. \r\nTo deploy deep learning methods for these tasks, it is vital to provide guarantees on neural network agents' safety and robustness criteria. \r\nThis can be achieved by developing formal verification methods to verify the safety and robustness properties of neural networks.\r\n\r\nOur goal is to design, develop and assess safety verification methods for neural networks to improve their reliability and trustworthiness in real-world applications.\r\nThis thesis establishes techniques for the verification of compressed and adversarially trained models as well as the design of novel neural networks for verifiably safe decision-making.\r\n\r\nFirst, we establish the problem of verifying quantized neural networks. Quantization is a technique that trades numerical precision for the computational efficiency of running a neural network and is widely adopted in industry.\r\nWe show that neglecting the reduced precision when verifying a neural network can lead to wrong conclusions about the robustness and safety of the network, highlighting that novel techniques for quantized network verification are necessary. We introduce several bit-exact verification methods explicitly designed for quantized neural networks and experimentally confirm on realistic networks that the network's robustness and other formal properties are affected by the quantization.\r\n\r\nFurthermore, we perform a case study providing evidence that adversarial training, a standard technique for making neural networks more robust, has detrimental effects on the network's performance. This robustness-accuracy tradeoff has been studied before regarding the accuracy obtained on classification datasets where each data point is independent of all other data points. On the other hand, we investigate the tradeoff empirically in robot learning settings where a both, a high accuracy and a high robustness, are desirable.\r\nOur results suggest that the negative side-effects of adversarial training outweigh its robustness benefits in practice.\r\n\r\nFinally, we consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with systems over the infinite time horizon. Bayesian neural networks are probabilistic models for learning uncertainties in the data and are therefore often used on robotic and healthcare applications where data is inherently stochastic.\r\nWe introduce a method for recalibrating Bayesian neural networks so that they yield probability distributions over safe decisions only.\r\nOur method learns a safety certificate that guarantees safety over the infinite time horizon to determine which decisions are safe in every possible state of the system.\r\nWe demonstrate the effectiveness of our approach on a series of reinforcement learning benchmarks.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"05","publication_identifier":{"isbn":["978-3-99078-017-6"]},"degree_awarded":"PhD","publication_status":"published","file":[{"checksum":"8eefa9c7c10ca7e1a2ccdd731962a645","file_id":"11378","access_level":"closed","relation":"source_file","content_type":"application/zip","date_created":"2022-05-13T12:33:26Z","file_name":"src.zip","creator":"mlechner","date_updated":"2022-05-13T12:49:00Z","file_size":13210143},{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"1b9e1e5a9a83ed9d89dad2f5133dc026","file_id":"11382","date_updated":"2022-05-17T15:19:39Z","file_size":2732536,"creator":"mlechner","date_created":"2022-05-16T08:02:28Z","file_name":"thesis_main-a2.pdf"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"10665","status":"public","relation":"part_of_dissertation"},{"id":"10667","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"11366","status":"public"},{"relation":"part_of_dissertation","id":"7808","status":"public"},{"id":"10666","status":"public","relation":"part_of_dissertation"}]},"ec_funded":1,"license":"https://creativecommons.org/licenses/by-nd/4.0/","_id":"11362","type":"dissertation","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"status":"public","keyword":["neural networks","verification","machine learning"],"supervisor":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"date_updated":"2023-08-17T06:58:38Z","ddc":["004"],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file_date_updated":"2022-05-17T15:19:39Z","publisher":"Institute of Science and Technology Austria","oa":1,"has_accepted_license":"1","year":"2022","day":"12","page":"124","doi":"10.15479/at:ista:11362","date_published":"2022-05-12T00:00:00Z","date_created":"2022-05-12T07:14:01Z","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"citation":{"short":"M. Lechner, Learning Verifiable Representations, Institute of Science and Technology Austria, 2022.","ieee":"M. Lechner, “Learning verifiable representations,” Institute of Science and Technology Austria, 2022.","apa":"Lechner, M. (2022). Learning verifiable representations. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:11362","ama":"Lechner M. Learning verifiable representations. 2022. doi:10.15479/at:ista:11362","mla":"Lechner, Mathias. Learning Verifiable Representations. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:11362.","ista":"Lechner M. 2022. Learning verifiable representations. Institute of Science and Technology Austria.","chicago":"Lechner, Mathias. “Learning Verifiable Representations.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:11362."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"}],"article_processing_charge":"No","title":"Learning verifiable representations"},{"file_date_updated":"2023-01-30T12:51:02Z","department":[{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2023-09-05T15:13:36Z","status":"public","type":"conference","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)"},"conference":{"start_date":"2022-08-07","end_date":"2022-08-10","location":"Haifa, Israel","name":"CAV: Computer Aided Verification"},"_id":"12302","volume":13372,"license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"file":[{"checksum":"edc363b1be5447a09063e115c247918a","file_id":"12465","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-01-30T12:51:02Z","file_name":"2022_LNCS_Doveri.pdf","date_updated":"2023-01-30T12:51:02Z","file_size":497682,"creator":"dernst"}],"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["9783031131882"],"eissn":["1611-3349"],"isbn":["9783031131875"],"issn":["0302-9743"]},"publication_status":"published","month":"08","intvolume":" 13372","alternative_title":["LNCS"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"We propose a novel algorithm to decide the language inclusion between (nondeterministic) Büchi automata, a PSPACE-complete problem. Our approach, like others before, leverage a notion of quasiorder to prune the search for a counterexample by discarding candidates which are subsumed by others for the quasiorder. Discarded candidates are guaranteed to not compromise the completeness of the algorithm. The novelty of our work lies in the quasiorder used to discard candidates. We introduce FORQs (family of right quasiorders) that we obtain by adapting the notion of family of right congruences put forward by Maler and Staiger in 1993. We define a FORQ-based inclusion algorithm which we prove correct and instantiate it for a specific FORQ, called the structural FORQ, induced by the Büchi automaton to the right of the inclusion sign. The resulting implementation, called FORKLIFT, scales up better than the state-of-the-art on a variety of benchmarks including benchmarks from program verification and theorem proving for word combinatorics. Artifact: https://doi.org/10.5281/zenodo.6552870","lang":"eng"}],"title":"FORQ-based language inclusion formal testing","author":[{"last_name":"Doveri","full_name":"Doveri, Kyveli","first_name":"Kyveli"},{"full_name":"Ganty, Pierre","last_name":"Ganty","first_name":"Pierre"},{"full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi","id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien"}],"article_processing_charge":"No","external_id":{"arxiv":["2207.13549"],"isi":["000870310500006"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Doveri K, Ganty P, Mazzocchi NA. 2022. FORQ-based language inclusion formal testing. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13372, 109–129.","chicago":"Doveri, Kyveli, Pierre Ganty, and Nicolas Adrien Mazzocchi. “FORQ-Based Language Inclusion Formal Testing.” In Computer Aided Verification, 13372:109–29. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-13188-2_6.","short":"K. Doveri, P. Ganty, N.A. Mazzocchi, in:, Computer Aided Verification, Springer Nature, 2022, pp. 109–129.","ieee":"K. Doveri, P. Ganty, and N. A. Mazzocchi, “FORQ-based language inclusion formal testing,” in Computer Aided Verification, Haifa, Israel, 2022, vol. 13372, pp. 109–129.","apa":"Doveri, K., Ganty, P., & Mazzocchi, N. A. (2022). FORQ-based language inclusion formal testing. In Computer Aided Verification (Vol. 13372, pp. 109–129). Haifa, Israel: Springer Nature. https://doi.org/10.1007/978-3-031-13188-2_6","ama":"Doveri K, Ganty P, Mazzocchi NA. FORQ-based language inclusion formal testing. In: Computer Aided Verification. Vol 13372. Springer Nature; 2022:109-129. doi:10.1007/978-3-031-13188-2_6","mla":"Doveri, Kyveli, et al. “FORQ-Based Language Inclusion Formal Testing.” Computer Aided Verification, vol. 13372, Springer Nature, 2022, pp. 109–29, doi:10.1007/978-3-031-13188-2_6."},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"date_published":"2022-08-06T00:00:00Z","doi":"10.1007/978-3-031-13188-2_6","date_created":"2023-01-16T10:06:31Z","page":"109-129","day":"06","publication":"Computer Aided Verification","isi":1,"has_accepted_license":"1","year":"2022","quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"This work was partially funded by the ESF Investing in your future, the Madrid regional project S2018/TCS-4339 BLOQUES, the Spanish project PGC2018-102210-B-I00 BOSCO, the Ramón y Cajal fellowship RYC-2016-20281, and the ERC grant PR1001ERC02."},{"page":"67-76","date_created":"2023-01-12T12:11:57Z","date_published":"2022-10-12T00:00:00Z","doi":"10.1007/978-3-031-19135-0_5","year":"2022","publication":"16th International Conference on Reachability Problems","day":"12","oa":1,"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, the EPSRC project EP/V025848/1, and the EPSRC project EP/X017796/1.","article_processing_charge":"No","author":[{"first_name":"Sougata","last_name":"Bose","full_name":"Bose, Sougata"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Karoliina","full_name":"Lehtinen, Karoliina","last_name":"Lehtinen"},{"full_name":"Schewe, Sven","last_name":"Schewe","first_name":"Sven"},{"first_name":"Patrick","full_name":"Totzke, Patrick","last_name":"Totzke"}],"title":"History-deterministic timed automata are not determinizable","citation":{"ista":"Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. 2022. History-deterministic timed automata are not determinizable. 16th International Conference on Reachability Problems. RC: Reachability Problems, LNCS, vol. 13608, 67–76.","chicago":"Bose, Sougata, Thomas A Henzinger, Karoliina Lehtinen, Sven Schewe, and Patrick Totzke. “History-Deterministic Timed Automata Are Not Determinizable.” In 16th International Conference on Reachability Problems, 13608:67–76. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-19135-0_5.","apa":"Bose, S., Henzinger, T. A., Lehtinen, K., Schewe, S., & Totzke, P. (2022). History-deterministic timed automata are not determinizable. In 16th International Conference on Reachability Problems (Vol. 13608, pp. 67–76). Kaiserslautern, Germany: Springer Nature. https://doi.org/10.1007/978-3-031-19135-0_5","ama":"Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. History-deterministic timed automata are not determinizable. In: 16th International Conference on Reachability Problems. Vol 13608. Springer Nature; 2022:67-76. doi:10.1007/978-3-031-19135-0_5","ieee":"S. Bose, T. A. Henzinger, K. Lehtinen, S. Schewe, and P. Totzke, “History-deterministic timed automata are not determinizable,” in 16th International Conference on Reachability Problems, Kaiserslautern, Germany, 2022, vol. 13608, pp. 67–76.","short":"S. Bose, T.A. Henzinger, K. Lehtinen, S. Schewe, P. Totzke, in:, 16th International Conference on Reachability Problems, Springer Nature, 2022, pp. 67–76.","mla":"Bose, Sougata, et al. “History-Deterministic Timed Automata Are Not Determinizable.” 16th International Conference on Reachability Problems, vol. 13608, Springer Nature, 2022, pp. 67–76, doi:10.1007/978-3-031-19135-0_5."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"ec_funded":1,"volume":13608,"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031191343"],"eissn":["1611-3349"],"eisbn":["9783031191350"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://hal.science/hal-03849398/"}],"scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 13608","month":"10","abstract":[{"text":"An automaton is history-deterministic (HD) if one can safely resolve its non-deterministic choices on the fly. In a recent paper, Henzinger, Lehtinen and Totzke studied this in the context of Timed Automata [9], where it was conjectured that the class of timed ω-languages recognised by HD-timed automata strictly extends that of deterministic ones. We provide a proof for this fact.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"ToHe"}],"date_updated":"2023-09-05T15:12:08Z","conference":{"name":"RC: Reachability Problems","location":"Kaiserslautern, Germany","end_date":"2022-10-21","start_date":"2022-10-17"},"type":"conference","status":"public","_id":"12175"},{"volume":36,"issue":"6","ec_funded":1,"publication_identifier":{"issn":["2159-5399"],"isbn":["978577358350"],"eissn":["2374-3468"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2107.08467","open_access":"1"}],"month":"06","intvolume":" 36","abstract":[{"lang":"eng","text":"We introduce a new statistical verification algorithm that formally quantifies the behavioral robustness of any time-continuous process formulated as a continuous-depth model. Our algorithm solves a set of global optimization (Go) problems over a given time horizon to construct a tight enclosure (Tube) of the set of all process executions starting from a ball of initial states. We call our algorithm GoTube. Through its construction, GoTube ensures that the bounding tube is conservative up to a desired probability and up to a desired tightness.\r\n GoTube is implemented in JAX and optimized to scale to complex continuous-depth neural network models. Compared to advanced reachability analysis tools for time-continuous neural networks, GoTube does not accumulate overapproximation errors between time steps and avoids the infamous wrapping effect inherent in symbolic techniques. We show that GoTube substantially outperforms state-of-the-art verification tools in terms of the size of the initial ball, speed, time-horizon, task completion, and scalability on a large set of experiments.\r\n GoTube is stable and sets the state-of-the-art in terms of its ability to scale to time horizons well beyond what has been previously possible."}],"oa_version":"Preprint","department":[{"_id":"ToHe"}],"date_updated":"2023-09-26T10:46:59Z","article_type":"original","type":"journal_article","status":"public","keyword":["General Medicine"],"_id":"12510","page":"6755-6764","date_published":"2022-06-28T00:00:00Z","doi":"10.1609/aaai.v36i6.20631","date_created":"2023-02-05T17:27:42Z","year":"2022","day":"28","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","quality_controlled":"1","publisher":"Association for the Advancement of Artificial Intelligence","oa":1,"acknowledgement":"SG is funded by the Austrian Science Fund (FWF) project number W1255-N23. ML and TH are supported in part by FWF under grant Z211-N23 (Wittgenstein Award) and the ERC-2020-AdG 101020093. SS is supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832. RH and DR are partially supported by Boeing. RG is partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40).","author":[{"last_name":"Gruenbacher","full_name":"Gruenbacher, Sophie A.","first_name":"Sophie A."},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"full_name":"Smolka, Scott A.","last_name":"Smolka","first_name":"Scott A."},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"external_id":{"arxiv":["2107.08467"]},"article_processing_charge":"No","title":"GoTube: Scalable statistical verification of continuous-depth models","citation":{"ista":"Gruenbacher SA, Lechner M, Hasani R, Rus D, Henzinger TA, Smolka SA, Grosu R. 2022. GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. 36(6), 6755–6764.","chicago":"Gruenbacher, Sophie A., Mathias Lechner, Ramin Hasani, Daniela Rus, Thomas A Henzinger, Scott A. Smolka, and Radu Grosu. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i6.20631.","ieee":"S. A. Gruenbacher et al., “GoTube: Scalable statistical verification of continuous-depth models,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6. Association for the Advancement of Artificial Intelligence, pp. 6755–6764, 2022.","short":"S.A. Gruenbacher, M. Lechner, R. Hasani, D. Rus, T.A. Henzinger, S.A. Smolka, R. Grosu, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 6755–6764.","apa":"Gruenbacher, S. A., Lechner, M., Hasani, R., Rus, D., Henzinger, T. A., Smolka, S. A., & Grosu, R. (2022). GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i6.20631","ama":"Gruenbacher SA, Lechner M, Hasani R, et al. GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. 2022;36(6):6755-6764. doi:10.1609/aaai.v36i6.20631","mla":"Gruenbacher, Sophie A., et al. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6, Association for the Advancement of Artificial Intelligence, 2022, pp. 6755–64, doi:10.1609/aaai.v36i6.20631."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}]},{"date_updated":"2023-11-30T10:55:37Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"12511","type":"journal_article","article_type":"original","keyword":["General Medicine"],"status":"public","publication_status":"published","publication_identifier":{"eissn":["2374-3468"],"isbn":["9781577358350"],"issn":["2159-5399"]},"language":[{"iso":"eng"}],"ec_funded":1,"issue":"7","volume":36,"related_material":{"record":[{"relation":"dissertation_contains","id":"14539","status":"public"}]},"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."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2112.09495"}],"scopus_import":"1","intvolume":" 36","month":"06","citation":{"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.","chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i7.20695.","ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 2022;36(7):7326-7336. doi:10.1609/aaai.v36i7.20695","apa":"Lechner, M., Zikelic, D., Chatterjee, K., & Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i7.20695","short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 7326–7336.","ieee":"M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.","mla":"Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:10.1609/aaai.v36i7.20695."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["2112.09495"]},"author":[{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"title":"Stability verification in stochastic control systems via neural network supermartingales","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"year":"2022","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","day":"28","page":"7326-7336","date_created":"2023-02-05T17:29:50Z","doi":"10.1609/aaai.v36i7.20695","date_published":"2022-06-28T00:00:00Z","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.","oa":1,"quality_controlled":"1","publisher":"Association for the Advancement of Artificial Intelligence"},{"type":"preprint","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"status":"public","_id":"14601","author":[{"last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"}],"external_id":{"arxiv":["2205.11991"]},"article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Learning stabilizing policies in stochastic control systems","citation":{"chicago":"Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger. “Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2205.11991.","ista":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv, 10.48550/arXiv.2205.11991.","mla":"Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, doi:10.48550/arXiv.2205.11991.","ama":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv. doi:10.48550/arXiv.2205.11991","apa":"Zikelic, D., Lechner, M., Chatterjee, K., & Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. arXiv. https://doi.org/10.48550/arXiv.2205.11991","ieee":"D. Zikelic, M. Lechner, K. Chatterjee, and T. A. Henzinger, “Learning stabilizing policies in stochastic control systems,” arXiv. .","short":"D. Zikelic, M. Lechner, K. Chatterjee, T.A. Henzinger, ArXiv (n.d.)."},"date_updated":"2023-11-30T10:55:37Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2205.11991"}],"month":"05","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"}],"oa_version":"Preprint","related_material":{"record":[{"relation":"dissertation_contains","id":"14539","status":"public"}]},"date_published":"2022-05-24T00:00:00Z","doi":"10.48550/arXiv.2205.11991","date_created":"2023-11-24T13:22:30Z","ec_funded":1,"publication_status":"submitted","year":"2022","day":"24","publication":"arXiv","language":[{"iso":"eng"}]},{"date_published":"2022-11-29T00:00:00Z","related_material":{"record":[{"id":"14539","status":"public","relation":"dissertation_contains"},{"relation":"later_version","status":"public","id":"14830"}]},"doi":"10.48550/ARXIV.2210.05308","date_created":"2023-11-24T13:10:09Z","license":"https://creativecommons.org/licenses/by-sa/4.0/","ec_funded":1,"day":"29","publication":"arXiv","language":[{"iso":"eng"}],"year":"2022","publication_status":"submitted","month":"11","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2210.05308","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","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."}],"title":"Learning control policies for stochastic systems with reach-avoid guarantees","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"last_name":"Zikelic","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"external_id":{"arxiv":["2210.05308"]},"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv, 10.48550/ARXIV.2210.05308.","chicago":"Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2210.05308.","ama":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. doi:10.48550/ARXIV.2210.05308","apa":"Zikelic, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. https://doi.org/10.48550/ARXIV.2210.05308","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,” arXiv. .","mla":"Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” ArXiv, doi:10.48550/ARXIV.2210.05308."},"date_updated":"2024-01-22T14:08:29Z","status":"public","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"type":"preprint","tmp":{"short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"_id":"14600"},{"article_number":"127","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"apa":"Mühlböck, F., & Tate, R. (2021). Transitioning from structural to nominal code with efficient gradual typing. Proceedings of the ACM on Programming Languages. Chicago, IL, United States: Association for Computing Machinery. https://doi.org/10.1145/3485504","ama":"Mühlböck F, Tate R. Transitioning from structural to nominal code with efficient gradual typing. Proceedings of the ACM on Programming Languages. 2021;5. doi:10.1145/3485504","ieee":"F. Mühlböck and R. Tate, “Transitioning from structural to nominal code with efficient gradual typing,” Proceedings of the ACM on Programming Languages, vol. 5. Association for Computing Machinery, 2021.","short":"F. Mühlböck, R. Tate, Proceedings of the ACM on Programming Languages 5 (2021).","mla":"Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.” Proceedings of the ACM on Programming Languages, vol. 5, 127, Association for Computing Machinery, 2021, doi:10.1145/3485504.","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.","chicago":"Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021. https://doi.org/10.1145/3485504."},"title":"Transitioning from structural to nominal code with efficient gradual typing","article_processing_charge":"No","author":[{"id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian","full_name":"Mühlböck, Fabian","orcid":"0000-0003-1548-0177","last_name":"Mühlböck"},{"last_name":"Tate","full_name":"Tate, Ross","first_name":"Ross"}],"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.","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","publication":"Proceedings of the ACM on Programming Languages","day":"15","year":"2021","has_accepted_license":"1","date_created":"2021-10-19T12:48:44Z","doi":"10.1145/3485504","date_published":"2021-10-15T00:00:00Z","_id":"10153","keyword":["gradual typing","gradual guarantee","nominal","structural","call tags"],"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"conference":{"start_date":"2021-10-17","end_date":"2021-10-23","location":"Chicago, IL, United States","name":"OOPSLA: Object-Oriented Programming, Systems, Languages, and Applications"},"article_type":"original","type":"journal_article","ddc":["005"],"date_updated":"2021-11-12T11:30:07Z","file_date_updated":"2021-10-19T12:52:23Z","department":[{"_id":"ToHe"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Gradual typing is a principled means for mixing typed and untyped code. But typed and untyped code often exhibit different programming patterns. There is already substantial research investigating gradually giving types to code exhibiting typical untyped patterns, and some research investigating gradually removing types from code exhibiting typical typed patterns. This paper investigates how to extend these established gradual-typing concepts to give formal guarantees not only about how to change types as code evolves but also about how to change such programming patterns as well.\r\n\r\nIn particular, we explore mixing untyped \"structural\" code with typed \"nominal\" code in an object-oriented language. But whereas previous work only allowed \"nominal\" objects to be treated as \"structural\" objects, we also allow \"structural\" objects to dynamically acquire certain nominal types, namely interfaces. We present a calculus that supports such \"cross-paradigm\" code migration and interoperation in a manner satisfying both the static and dynamic gradual guarantees, and demonstrate that the calculus can be implemented efficiently."}],"intvolume":" 5","month":"10","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"10154","checksum":"71011efd2da771cafdec7f0d9693f8c1","file_size":770269,"date_updated":"2021-10-19T12:52:23Z","creator":"fmuehlbo","file_name":"monnom-oopsla21.pdf","date_created":"2021-10-19T12:52:23Z"}],"publication_status":"published","publication_identifier":{"eissn":["2475-1421"]},"volume":5},{"page":"11525-11535","date_published":"2021-05-28T00:00:00Z","date_created":"2022-01-25T15:47:20Z","has_accepted_license":"1","year":"2021","day":"28","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","publisher":"AAAI Press","quality_controlled":"1","oa":1,"acknowledgement":"The authors would like to thank the reviewers for their insightful comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832.\r\n","author":[{"full_name":"Grunbacher, Sophie","last_name":"Grunbacher","first_name":"Sophie"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"last_name":"Cyranka","full_name":"Cyranka, Jacek","first_name":"Jacek"},{"last_name":"Smolka","full_name":"Smolka, Scott A","first_name":"Scott A"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"external_id":{"arxiv":["2012.08863"]},"article_processing_charge":"No","title":"On the verification of neural ODEs with stochastic guarantees","citation":{"ista":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On the verification of neural ODEs with stochastic guarantees. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535.","chicago":"Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic Guarantees.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:11525–35. AAAI Press, 2021.","apa":"Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., & Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 11525–11535). Virtual: AAAI Press.","ama":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification of neural ODEs with stochastic guarantees. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. AAAI Press; 2021:11525-11535.","ieee":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu, “On the verification of neural ODEs with stochastic guarantees,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 13, pp. 11525–11535.","short":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 11525–11535.","mla":"Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic Guarantees.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"volume":35,"issue":"13","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"]},"publication_status":"published","file":[{"date_updated":"2022-01-26T07:38:08Z","file_size":286906,"creator":"mlechner","date_created":"2022-01-26T07:38:08Z","file_name":"17372-Article Text-20866-1-2-20210518.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"468d07041e282a1d46ffdae92f709630","file_id":"10680","success":1}],"language":[{"iso":"eng"}],"alternative_title":["Technical Tracks"],"main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372","open_access":"1"}],"month":"05","intvolume":" 35","abstract":[{"lang":"eng","text":"We show that Neural ODEs, an emerging class of timecontinuous neural networks, can be verified by solving a set of global-optimization problems. For this purpose, we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based technique for constructing a tight Reachtube (an over-approximation of the set of reachable states\r\nover a given time-horizon), and provide stochastic guarantees in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids the infamous wrapping effect (accumulation of over-approximation errors) by performing local optimization steps to expand safe regions instead of repeatedly forward-propagating them as is done by deterministic reachability methods. To enable fast local optimizations, we introduce a novel forward-mode adjoint sensitivity method to compute gradients without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic convergence rates for SLR."}],"oa_version":"Published Version","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file_date_updated":"2022-01-26T07:38:08Z","date_updated":"2022-05-24T06:33:14Z","ddc":["000"],"type":"conference","conference":{"location":"Virtual","end_date":"2021-02-09","start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"status":"public","_id":"10669"},{"project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"title":"Liquid time-constant networks","author":[{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"full_name":"Amini, Alexander","last_name":"Amini","first_name":"Alexander"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"article_processing_charge":"No","external_id":{"arxiv":["2006.04439"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 7657–7666.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “Liquid Time-Constant Networks.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:7657–66. AAAI Press, 2021.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant networks,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 9, pp. 7657–7666.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2021). Liquid time-constant networks. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 7657–7666). Virtual: AAAI Press.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. AAAI Press; 2021:7657-7666.","mla":"Hasani, Ramin, et al. “Liquid Time-Constant Networks.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 9, AAAI Press, 2021, pp. 7657–66."},"publisher":"AAAI Press","quality_controlled":"1","oa":1,"acknowledgement":"R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40). M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. This research work is partially drawn from the PhD dissertation of R.H.","date_published":"2021-05-28T00:00:00Z","date_created":"2022-01-25T15:48:36Z","page":"7657-7666","day":"28","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","has_accepted_license":"1","year":"2021","status":"public","type":"conference","conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","location":"Virtual","start_date":"2021-02-02"},"_id":"10671","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file_date_updated":"2022-01-26T07:36:03Z","ddc":["000"],"date_updated":"2022-05-24T06:36:54Z","month":"05","intvolume":" 35","alternative_title":["Technical Tracks"],"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936"}],"oa_version":"Published Version","abstract":[{"text":"We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system’s dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems modulated via nonlinear interlinked gates. The resulting models represent dynamical systems with varying (i.e., liquid) time-constants coupled to their hidden state, with outputs being computed by numerical differential equation solvers. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations, and give rise to improved performance on time-series prediction tasks. To demonstrate these properties, we first take a theoretical approach to find bounds over their dynamics, and compute their expressive power by the trajectory length measure in a latent trajectory space. We then conduct a series of time-series prediction experiments to manifest the approximation capability of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs.","lang":"eng"}],"issue":"9","volume":35,"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"0f06995fba06dbcfa7ed965fc66027ff","file_id":"10678","success":1,"date_updated":"2022-01-26T07:36:03Z","file_size":4302669,"creator":"mlechner","date_created":"2022-01-26T07:36:03Z","file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"],"issn":["2159-5399"]},"publication_status":"published"},{"oa":1,"quality_controlled":"1","publisher":"ML Research Press","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).","page":"478-489","date_created":"2022-01-25T15:46:33Z","date_published":"2021-07-01T00:00:00Z","year":"2021","has_accepted_license":"1","publication":"Proceedings of the 38th International Conference on Machine Learning","day":"01","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","author":[{"first_name":"Zahra","last_name":"Babaiee","full_name":"Babaiee, Zahra"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"title":"On-off center-surround receptive fields for accurate and robust image classification","citation":{"mla":"Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” Proceedings of the 38th International Conference on Machine Learning, vol. 139, ML Research Press, 2021, pp. 478–89.","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 Proceedings of the 38th International Conference on Machine Learning, Virtual, 2021, vol. 139, pp. 478–489.","short":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, R. Grosu, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 478–489.","apa":"Babaiee, Z., Hasani, R., Lechner, M., Rus, D., & Grosu, R. (2021). On-off center-surround receptive fields for accurate and robust image classification. In Proceedings of the 38th International Conference on Machine Learning (Vol. 139, pp. 478–489). Virtual: ML Research Press.","ama":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. On-off center-surround receptive fields for accurate and robust image classification. In: Proceedings of the 38th International Conference on Machine Learning. Vol 139. ML Research Press; 2021: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 Proceedings of the 38th International Conference on Machine Learning, 139:478–89. ML Research Press, 2021.","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."},"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v139/babaiee21a"}],"alternative_title":["PMLR"],"intvolume":" 139","month":"07","abstract":[{"text":"Robustness to variations in lighting conditions is a key objective for any deep vision system. To this end, our paper extends the receptive field of convolutional neural networks with two residual components, ubiquitous in the visual processing system of vertebrates: On-center and off-center pathways, with an excitatory center and inhibitory surround; OOCS for short. The On-center pathway is excited by the presence of a light stimulus in its center, but not in its surround, whereas the Off-center pathway is excited by the absence of a light stimulus in its center, but not in its surround. We design OOCS pathways via a difference of Gaussians, with their variance computed analytically from the size of the receptive fields. OOCS pathways complement each other in their response to light stimuli, ensuring this way a strong edge-detection capability, and as a result an accurate and robust inference under challenging lighting conditions. We provide extensive empirical evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness from the novel edge representation, compared to other baselines.","lang":"eng"}],"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","volume":139,"publication_status":"published","publication_identifier":{"issn":["2640-3498"]},"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"10681","checksum":"d30eae62561bb517d9f978437d7677db","creator":"mlechner","file_size":4246561,"date_updated":"2022-01-26T07:38:32Z","file_name":"babaiee21a.pdf","date_created":"2022-01-26T07:38:32Z"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"conference":{"end_date":"2021-07-24","location":"Virtual","start_date":"2021-07-18","name":"ML: Machine Learning"},"type":"conference","status":"public","_id":"10668","file_date_updated":"2022-01-26T07:38:32Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_updated":"2022-05-04T15:02:27Z","ddc":["000"]},{"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html"}],"alternative_title":[" Advances in Neural Information Processing Systems"],"month":"12","abstract":[{"lang":"eng","text":"Imitation learning enables high-fidelity, vision-based learning of policies within rich, photorealistic environments. However, such techniques often rely on traditional discrete-time neural models and face difficulties in generalizing to domain shifts by failing to account for the causal relationships between the agent and the environment. In this paper, we propose a theoretical and experimental framework for learning causal representations using continuous-time neural networks, specifically over their discrete-time counterparts. We evaluate our method in the context of visual-control learning of drones over a series of complex tasks, ranging from short- and long-term navigation, to chasing static and dynamic objects through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep models can perform robust navigation tasks, where advanced recurrent models fail. These models learn complex causal control representations directly from raw visual inputs and scale to solve a variety of tasks using imitation learning."}],"oa_version":"Published Version","publication_status":"published","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"10679","checksum":"be81f0ade174a8c9b2d4fe09590b2021","creator":"mlechner","file_size":6841228,"date_updated":"2022-01-26T07:37:24Z","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","date_created":"2022-01-26T07:37:24Z"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"conference":{"start_date":"2021-12-06","location":"Virtual","end_date":"2021-12-10","name":"NeurIPS: Neural Information Processing Systems"},"type":"conference","status":"public","_id":"10670","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file_date_updated":"2022-01-26T07:37:24Z","date_updated":"2022-01-26T14:33:31Z","ddc":["000"],"oa":1,"quality_controlled":"1","acknowledgement":"C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT. A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors\r\nand should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.\r\n","date_created":"2022-01-25T15:47:50Z","date_published":"2021-12-01T00:00:00Z","year":"2021","has_accepted_license":"1","publication":"35th Conference on Neural Information Processing Systems","day":"01","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"external_id":{"arxiv":["2106.08314"]},"article_processing_charge":"No","author":[{"first_name":"Charles J","last_name":"Vorbach","full_name":"Vorbach, Charles J"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"last_name":"Amini","full_name":"Amini, Alexander","first_name":"Alexander"},{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"}],"title":"Causal navigation by continuous-time neural networks","citation":{"mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” 35th Conference on Neural Information Processing Systems, 2021.","ama":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time neural networks. In: 35th Conference on Neural Information Processing Systems. ; 2021.","apa":"Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., & Rus, D. (2021). Causal navigation by continuous-time neural networks. In 35th Conference on Neural Information Processing Systems. Virtual.","ieee":"C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation by continuous-time neural networks,” in 35th Conference on Neural Information Processing Systems, Virtual, 2021.","short":"C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference on Neural Information Processing Systems, 2021.","chicago":"Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In 35th Conference on Neural Information Processing Systems, 2021.","ista":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation by continuous-time neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, ."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"date_created":"2022-01-26T08:01:30Z","date_published":"2021-10-01T00:00:00Z","doi":"10.34727/2021/isbn.978-3-85448-046-4_23","page":"143–152","publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","day":"01","year":"2021","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"TU Wien Academic Press","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).","editor":[{"first_name":"Piskac","last_name":"Ruzica","full_name":"Ruzica, Piskac"},{"last_name":"Whalen","full_name":"Whalen, Michael W.","first_name":"Michael W."}],"title":"The Civl verifier","article_processing_charge":"No","author":[{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","last_name":"Kragl","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","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.","chicago":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021. https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23.","apa":"Kragl, B., & Qadeer, S. (2021). The Civl verifier. In P. Ruzica & M. W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. Vol 2. TU Wien Academic Press; 2021:143–152. doi:10.34727/2021/isbn.978-3-85448-046-4_23","ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, Virtual, 2021, vol. 2, pp. 143–152.","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.","mla":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:10.34727/2021/isbn.978-3-85448-046-4_23."},"project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"volume":2,"language":[{"iso":"eng"}],"file":[{"file_id":"10689","checksum":"35438ac9f9750340b7f8ae4ae3220d9f","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2022-01-26T08:04:29Z","file_name":"2021_FCAD2021_Kragl.pdf","date_updated":"2022-01-26T08:04:29Z","file_size":390555,"creator":"cchlebak"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-85448-046-4"]},"intvolume":" 2","month":"10","alternative_title":["Conference Series"],"oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"department":[{"_id":"ToHe"}],"file_date_updated":"2022-01-26T08:04:29Z","ddc":["000"],"date_updated":"2022-01-26T08:20:41Z","status":"public","conference":{"name":"FMCAD: Formal Methods in Computer-Aided Design","end_date":"2021-10-22","location":"Virtual","start_date":"2021-10-20"},"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)"},"type":"conference","_id":"10688"},{"abstract":[{"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.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2103.11389","open_access":"1"}],"oa":1,"month":"03","publication_status":"submitted","year":"2021","day":"21","publication":"arXiv","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"9946","status":"public","relation":"other"}]},"doi":"10.48550/arXiv.2103.11389","date_published":"2021-03-21T00:00:00Z","ec_funded":1,"date_created":"2021-03-23T05:38:48Z","_id":"9281","article_number":"2103.11389","type":"preprint","status":"public","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"citation":{"ista":"Dubach G, Mühlböck F. Formal verification of Zagier’s one-sentence proof. arXiv, 2103.11389.","chicago":"Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2103.11389.","apa":"Dubach, G., & Mühlböck, F. (n.d.). Formal verification of Zagier’s one-sentence proof. arXiv. https://doi.org/10.48550/arXiv.2103.11389","ama":"Dubach G, Mühlböck F. Formal verification of Zagier’s one-sentence proof. arXiv. doi:10.48550/arXiv.2103.11389","short":"G. Dubach, F. Mühlböck, ArXiv (n.d.).","ieee":"G. Dubach and F. Mühlböck, “Formal verification of Zagier’s one-sentence proof,” arXiv. .","mla":"Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.” ArXiv, 2103.11389, doi:10.48550/arXiv.2103.11389."},"date_updated":"2023-05-03T10:26:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"D5C6A458-10C4-11EA-ABF4-A4B43DDC885E","first_name":"Guillaume","full_name":"Dubach, Guillaume","orcid":"0000-0001-6892-8137","last_name":"Dubach"},{"id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian","orcid":"0000-0003-1548-0177","full_name":"Mühlböck, Fabian","last_name":"Mühlböck"}],"article_processing_charge":"No","external_id":{"arxiv":["2103.11389"]},"department":[{"_id":"LaEr"},{"_id":"ToHe"}],"title":"Formal verification of Zagier's one-sentence proof"},{"oa_version":"Published Version","abstract":[{"text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches.","lang":"eng"}],"month":"05","intvolume":" 35","scopus_import":"1","alternative_title":["Technical Tracks"],"main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496","open_access":"1"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"10684","checksum":"2bc8155b2526a70fba5b7301bc89dbd1","file_size":137235,"date_updated":"2022-01-26T07:41:16Z","creator":"mlechner","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","date_created":"2022-01-26T07:41:16Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"]},"publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","id":"11362","status":"public"}]},"volume":35,"issue":"5A","ec_funded":1,"_id":"10665","status":"public","type":"conference","conference":{"start_date":"2021-02-02","location":"Virtual","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"ddc":["000"],"date_updated":"2023-06-23T07:01:11Z","file_date_updated":"2022-01-26T07:41:16Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","quality_controlled":"1","publisher":"AAAI Press","oa":1,"day":"28","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","has_accepted_license":"1","year":"2021","date_published":"2021-05-28T00:00:00Z","date_created":"2022-01-25T15:15:02Z","page":"3787-3795","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:3787–95. AAAI Press, 2021.","ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795.","mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95.","apa":"Henzinger, T. A., Lechner, M., & Zikelic, D. (2021). Scalable verification of quantized neural networks. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.","ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. AAAI Press; 2021:3787-3795.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.","ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795."},"title":"Scalable verification of quantized neural networks","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"full_name":"Zikelic, Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"}],"article_processing_charge":"No","external_id":{"arxiv":["2012.08185"]}},{"project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, .","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In 35th Conference on Neural Information Processing Systems, 2021. https://doi.org/10.48550/arXiv.2111.03165.","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in 35th Conference on Neural Information Processing Systems, Virtual, 2021.","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., & Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In 35th Conference on Neural Information Processing Systems. Virtual. https://doi.org/10.48550/arXiv.2111.03165","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: 35th Conference on Neural Information Processing Systems. ; 2021. doi:10.48550/arXiv.2111.03165","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” 35th Conference on Neural Information Processing Systems, 2021, doi:10.48550/arXiv.2111.03165."},"title":"Infinite time horizon safety of Bayesian neural networks","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Ðorđe","last_name":"Žikelić","full_name":"Žikelić, Ðorđe"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"external_id":{"arxiv":["2111.03165"]},"article_processing_charge":"No","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","quality_controlled":"1","oa":1,"day":"01","publication":"35th Conference on Neural Information Processing Systems","has_accepted_license":"1","year":"2021","date_published":"2021-12-01T00:00:00Z","doi":"10.48550/arXiv.2111.03165","date_created":"2022-01-25T15:45:58Z","_id":"10667","status":"public","type":"conference","conference":{"location":"Virtual","end_date":"2021-12-10","start_date":"2021-12-06","name":"NeurIPS: Neural Information Processing Systems"},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"ddc":["000"],"date_updated":"2023-06-23T07:01:11Z","file_date_updated":"2022-01-26T07:39:59Z","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications."}],"month":"12","alternative_title":[" Advances in Neural Information Processing Systems"],"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html"}],"file":[{"file_id":"10682","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2022-01-26T07:39:59Z","file_name":"infinite_time_horizon_safety_o.pdf","creator":"mlechner","date_updated":"2022-01-26T07:39:59Z","file_size":452492}],"language":[{"iso":"eng"}],"publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","id":"11362","status":"public"}]},"ec_funded":1},{"_id":"8912","status":"public","type":"journal_article","article_type":"original","ddc":["000"],"date_updated":"2023-08-04T11:19:00Z","file_date_updated":"2020-12-02T13:33:51Z","department":[{"_id":"ToHe"}],"oa_version":"Submitted Version","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."}],"month":"04","intvolume":" 167","scopus_import":"1","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"600c2f81bc898a725bcfa7cf26ff4fed","file_id":"8913","creator":"esarac","file_size":634967,"date_updated":"2020-12-02T13:33:51Z","file_name":"synchroPaperRevised.pdf","date_created":"2020-12-02T13:33:51Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["09574174"]},"publication_status":"published","volume":167,"issue":"4","article_number":"114203","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"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.","chicago":"Sarac, Naci E, Ömer Faruk Altun, Kamil Tolga Atam, Sertac Karahoda, Kamer Kaya, and Hüsnü Yenigün. “Boosting Expensive Synchronizing Heuristics.” Expert Systems with Applications. Elsevier, 2021. https://doi.org/10.1016/j.eswa.2020.114203.","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,” Expert Systems with Applications, vol. 167, no. 4. Elsevier, 2021.","apa":"Sarac, N. E., Altun, Ö. F., Atam, K. T., Karahoda, S., Kaya, K., & Yenigün, H. (2021). Boosting expensive synchronizing heuristics. Expert Systems with Applications. Elsevier. https://doi.org/10.1016/j.eswa.2020.114203","ama":"Sarac NE, Altun ÖF, Atam KT, Karahoda S, Kaya K, Yenigün H. Boosting expensive synchronizing heuristics. Expert Systems with Applications. 2021;167(4). doi:10.1016/j.eswa.2020.114203","mla":"Sarac, Naci E., et al. “Boosting Expensive Synchronizing Heuristics.” Expert Systems with Applications, vol. 167, no. 4, 114203, Elsevier, 2021, doi:10.1016/j.eswa.2020.114203."},"title":"Boosting expensive synchronizing heuristics","author":[{"first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E","last_name":"Sarac"},{"first_name":"Ömer Faruk","last_name":"Altun","full_name":"Altun, Ömer Faruk"},{"first_name":"Kamil Tolga","full_name":"Atam, Kamil Tolga","last_name":"Atam"},{"first_name":"Sertac","last_name":"Karahoda","full_name":"Karahoda, Sertac"},{"first_name":"Kamer","last_name":"Kaya","full_name":"Kaya, Kamer"},{"first_name":"Hüsnü","full_name":"Yenigün, Hüsnü","last_name":"Yenigün"}],"external_id":{"isi":["000640531100038"]},"article_processing_charge":"No","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.","quality_controlled":"1","publisher":"Elsevier","oa":1,"day":"01","publication":"Expert Systems with Applications","has_accepted_license":"1","isi":1,"year":"2021","date_published":"2021-04-01T00:00:00Z","doi":"10.1016/j.eswa.2020.114203","date_created":"2020-12-02T13:34:25Z"},{"page":"2102.12734","doi":"10.1145/3447928.3456704","date_published":"2021-05-01T00:00:00Z","date_created":"2021-02-26T16:30:39Z","isi":1,"has_accepted_license":"1","year":"2021","day":"01","publication":"HSCC '21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control","publisher":"Association for Computing Machinery","quality_controlled":"1","oa":1,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411.","author":[{"first_name":"Miriam","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2936-5719","full_name":"Garcia Soto, Miriam","last_name":"Garcia Soto"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Schilling","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000932821700028"],"arxiv":["2102.12734"]},"article_processing_charge":"No","title":"Synthesis of hybrid automata with affine dynamics from time-series data","citation":{"ama":"Garcia Soto M, Henzinger TA, Schilling C. Synthesis of hybrid automata with affine dynamics from time-series data. In: HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control. Association for Computing Machinery; 2021:2102.12734. doi:10.1145/3447928.3456704","apa":"Garcia Soto, M., Henzinger, T. A., & Schilling, C. (2021). Synthesis of hybrid automata with affine dynamics from time-series data. In HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control (p. 2102.12734). Nashville, TN, United States: Association for Computing Machinery. https://doi.org/10.1145/3447928.3456704","ieee":"M. Garcia Soto, T. A. Henzinger, and C. Schilling, “Synthesis of hybrid automata with affine dynamics from time-series data,” in HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control, Nashville, TN, United States, 2021, p. 2102.12734.","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.","mla":"Garcia Soto, Miriam, et al. “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, Association for Computing Machinery, 2021, p. 2102.12734, doi:10.1145/3447928.3456704.","ista":"Garcia Soto M, Henzinger TA, Schilling C. 2021. Synthesis of hybrid automata with affine dynamics from time-series data. HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control. HSCC: International Conference on Hybrid Systems Computation and Control, 2102.12734.","chicago":"Garcia Soto, Miriam, Thomas A Henzinger, and Christian Schilling. “Synthesis of Hybrid Automata with Affine Dynamics from Time-Series Data.” In HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control, 2102.12734. Association for Computing Machinery, 2021. https://doi.org/10.1145/3447928.3456704."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"ec_funded":1,"publication_identifier":{"isbn":["9781450383394"]},"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"4c1202c1abf71384c3ee6fea88c2f80e","file_id":"9424","success":1,"creator":"kschuh","date_updated":"2021-05-25T13:53:22Z","file_size":1474786,"date_created":"2021-05-25T13:53:22Z","file_name":"2021_HSCC_Soto.pdf"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"05","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"}],"oa_version":"Published Version","department":[{"_id":"ToHe"}],"file_date_updated":"2021-05-25T13:53:22Z","date_updated":"2023-08-07T13:49:33Z","ddc":["000"],"type":"conference","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)"},"conference":{"start_date":"2021-05-19","location":"Nashville, TN, United States","end_date":"2021-05-21","name":"HSCC: International Conference on Hybrid Systems Computation and Control"},"status":"public","keyword":["hybrid automaton","membership","system identification"],"_id":"9200"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1905.03835"}],"scopus_import":"1","intvolume":" 119","month":"03","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"}],"oa_version":"Preprint","issue":"8","related_material":{"record":[{"id":"6884","status":"public","relation":"earlier_version"}]},"volume":119,"publication_status":"published","publication_identifier":{"eissn":["1090-2724"],"issn":["0022-0000"]},"language":[{"iso":"eng"}],"type":"journal_article","article_type":"original","status":"public","_id":"9239","department":[{"_id":"ToHe"}],"date_updated":"2023-08-07T14:08:34Z","oa":1,"quality_controlled":"1","publisher":"Elsevier","page":"133-144","date_created":"2021-03-14T23:01:32Z","doi":"10.1016/j.jcss.2021.02.008","date_published":"2021-03-03T00:00:00Z","year":"2021","isi":1,"publication":"Journal of Computer and System Sciences","day":"03","external_id":{"isi":["000634149800009"],"arxiv":["1905.03835"]},"article_processing_charge":"No","author":[{"last_name":"Avni","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Žikelić, Đorđe","last_name":"Žikelić","first_name":"Đorđe"}],"title":"Bidding mechanisms in graph games","citation":{"ista":"Avni G, Henzinger TA, Žikelić Đ. 2021. Bidding mechanisms in graph games. Journal of Computer and System Sciences. 119(8), 133–144.","chicago":"Avni, Guy, Thomas A Henzinger, and Đorđe Žikelić. “Bidding Mechanisms in Graph Games.” Journal of Computer and System Sciences. Elsevier, 2021. https://doi.org/10.1016/j.jcss.2021.02.008.","ama":"Avni G, Henzinger TA, Žikelić Đ. Bidding mechanisms in graph games. Journal of Computer and System Sciences. 2021;119(8):133-144. doi:10.1016/j.jcss.2021.02.008","apa":"Avni, G., Henzinger, T. A., & Žikelić, Đ. (2021). Bidding mechanisms in graph games. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2021.02.008","ieee":"G. Avni, T. A. Henzinger, and Đ. Žikelić, “Bidding mechanisms in graph games,” Journal of Computer and System Sciences, vol. 119, no. 8. Elsevier, pp. 133–144, 2021.","short":"G. Avni, T.A. Henzinger, Đ. Žikelić, Journal of Computer and System Sciences 119 (2021) 133–144.","mla":"Avni, Guy, et al. “Bidding Mechanisms in Graph Games.” Journal of Computer and System Sciences, vol. 119, no. 8, Elsevier, 2021, pp. 133–44, doi:10.1016/j.jcss.2021.02.008."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"file_date_updated":"2021-06-16T08:23:54Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2023-08-08T13:52:56Z","status":"public","conference":{"name":"LICS: Symposium on Logic in Computer Science","start_date":"2021-06-29","end_date":"2021-07-02","location":"Online"},"type":"conference","_id":"9356","language":[{"iso":"eng"}],"file":[{"file_id":"9557","checksum":"6e4cba3f72775f479c5b1b75d1a4a0c4","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2021-06-16T08:23:54Z","file_name":"qam.pdf","date_updated":"2021-06-16T08:23:54Z","file_size":641990,"creator":"esarac"}],"publication_status":"published","month":"06","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision.","lang":"eng"}],"title":"Quantitative and approximate monitoring","article_processing_charge":"No","external_id":{"isi":["000947350400021"],"arxiv":["2105.08353"]},"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E","last_name":"Sarac"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Henzinger, Thomas A., and Naci E. Sarac. “Quantitative and Approximate Monitoring.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 9470547, Institute of Electrical and Electronics Engineers, 2021, doi:10.1109/LICS52264.2021.9470547.","apa":"Henzinger, T. A., & Sarac, N. E. (2021). Quantitative and approximate monitoring. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Online: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470547","ama":"Henzinger TA, Sarac NE. Quantitative and approximate monitoring. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021. doi:10.1109/LICS52264.2021.9470547","short":"T.A. Henzinger, N.E. Sarac, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021.","ieee":"T. A. Henzinger and N. E. Sarac, “Quantitative and approximate monitoring,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Online, 2021.","chicago":"Henzinger, Thomas A, and Naci E Sarac. “Quantitative and Approximate Monitoring.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470547.","ista":"Henzinger TA, Sarac NE. 2021. Quantitative and approximate monitoring. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 9470547."},"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"article_number":"9470547","date_created":"2021-04-30T17:30:47Z","doi":"10.1109/LICS52264.2021.9470547","date_published":"2021-06-29T00:00:00Z","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","day":"29","year":"2021","isi":1,"has_accepted_license":"1","oa":1,"publisher":"Institute of Electrical and Electronics Engineers","quality_controlled":"1","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award)."},{"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","file":[{"file_id":"11364","checksum":"d3aef34cfb13e53bba4cf44d01680793","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2022-05-12T12:13:27Z","file_name":"2021_TheoreticalComputerScience_Petrov.pdf","creator":"dernst","date_updated":"2022-05-12T12:13:27Z","file_size":2566504}],"language":[{"iso":"eng"}],"volume":893,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":[{"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.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","month":"06","intvolume":" 893","date_updated":"2023-08-10T14:11:19Z","ddc":["004"],"department":[{"_id":"ToHe"},{"_id":"CaGu"}],"file_date_updated":"2022-05-12T12:13:27Z","_id":"9647","type":"journal_article","article_type":"original","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"},"status":"public","has_accepted_license":"1","isi":1,"year":"2021","day":"04","publication":"Theoretical Computer Science","page":"1-16","date_published":"2021-06-04T00:00:00Z","doi":"10.1016/j.tcs.2021.05.023","date_created":"2021-07-11T22:01:18Z","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).","publisher":"Elsevier","quality_controlled":"1","oa":1,"citation":{"apa":"Petrov, T., Igler, C., Sezgin, A., Henzinger, T. A., & Guet, C. C. (2021). Long lived transients in gene regulation. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2021.05.023","ama":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. Long lived transients in gene regulation. Theoretical Computer Science. 2021;893:1-16. doi:10.1016/j.tcs.2021.05.023","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,” Theoretical Computer Science, vol. 893. Elsevier, pp. 1–16, 2021.","mla":"Petrov, Tatjana, et al. “Long Lived Transients in Gene Regulation.” Theoretical Computer Science, vol. 893, Elsevier, 2021, pp. 1–16, doi:10.1016/j.tcs.2021.05.023.","ista":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. 2021. Long lived transients in gene regulation. Theoretical Computer Science. 893, 1–16.","chicago":"Petrov, Tatjana, Claudia Igler, Ali Sezgin, Thomas A Henzinger, and Calin C Guet. “Long Lived Transients in Gene Regulation.” Theoretical Computer Science. Elsevier, 2021. https://doi.org/10.1016/j.tcs.2021.05.023."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Petrov","full_name":"Petrov, Tatjana","first_name":"Tatjana"},{"full_name":"Igler, Claudia","last_name":"Igler","first_name":"Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sezgin","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","last_name":"Guet","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000710180500002"]},"article_processing_charge":"No","title":"Long lived transients in gene regulation","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}]},{"date_updated":"2023-08-14T07:20:30Z","ddc":["005"],"department":[{"_id":"ToHe"}],"file_date_updated":"2021-10-07T23:32:18Z","_id":"10108","conference":{"name":"RV: Runtime Verification","start_date":"2021-10-11","end_date":"2021-10-14","location":"Virtual"},"type":"conference","keyword":["run-time verification","software engineering","implicit specification"],"status":"public","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["978-3-030-88493-2"],"eisbn":["978-3-030-88494-9"]},"language":[{"iso":"eng"}],"file":[{"file_name":"differentialmonitoring-cameraready-openaccess.pdf","date_created":"2021-10-07T23:32:18Z","file_size":350632,"date_updated":"2021-10-07T23:32:18Z","creator":"fmuehlbo","success":1,"checksum":"554c7fdb259eda703a8b6328a6dad55a","file_id":"10109","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"volume":12974,"related_material":{"record":[{"relation":"extended_version","id":"9946","status":"public"}]},"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."}],"oa_version":"Preprint","scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 12974","place":"Cham","month":"10","citation":{"apa":"Mühlböck, F., & Henzinger, T. A. (2021). Differential monitoring. In International Conference on Runtime Verification (Vol. 12974, pp. 231–243). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-88494-9_12","ama":"Mühlböck F, Henzinger TA. Differential monitoring. In: International Conference on Runtime Verification. Vol 12974. Cham: Springer Nature; 2021:231-243. doi:10.1007/978-3-030-88494-9_12","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 International Conference on Runtime Verification, Virtual, 2021, vol. 12974, pp. 231–243.","mla":"Mühlböck, Fabian, and Thomas A. Henzinger. “Differential Monitoring.” International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 231–43, doi:10.1007/978-3-030-88494-9_12.","ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring. International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 231–243.","chicago":"Mühlböck, Fabian, and Thomas A Henzinger. “Differential Monitoring.” In International Conference on Runtime Verification, 12974:231–43. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-88494-9_12."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","external_id":{"isi":["000719383800012"]},"author":[{"id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian","last_name":"Mühlböck","orcid":"0000-0003-1548-0177","full_name":"Mühlböck, Fabian"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"title":"Differential monitoring","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"year":"2021","has_accepted_license":"1","isi":1,"publication":"International Conference on Runtime Verification","day":"06","page":"231-243","date_created":"2021-10-07T23:30:10Z","date_published":"2021-10-06T00:00:00Z","doi":"10.1007/978-3-030-88494-9_12","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.","oa":1,"publisher":"Springer Nature","quality_controlled":"1"},{"related_material":{"record":[{"status":"public","id":"9281","relation":"other"},{"relation":"shorter_version","id":"10108","status":"public"}]},"file":[{"creator":"fmuehlbo","file_size":"320453","date_updated":"2021-09-03T12:34:28Z","file_name":"differentialmonitoring-techreport.pdf","date_created":"2021-08-20T19:59:44Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"0f9aafd59444cb6bdca6925d163ab946","file_id":"9948"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","month":"09","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","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."}],"department":[{"_id":"ToHe"}],"file_date_updated":"2021-09-03T12:34:28Z","ddc":["005"],"date_updated":"2023-08-14T07:20:29Z","status":"public","keyword":["run-time verification","software engineering","implicit specification"],"type":"technical_report","_id":"9946","date_published":"2021-09-01T00:00:00Z","doi":"10.15479/AT:ISTA:9946","date_created":"2021-08-20T20:00:37Z","page":"17","day":"01","has_accepted_license":"1","year":"2021","publisher":"IST Austria","oa":1,"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.","title":"Differential monitoring","author":[{"first_name":"Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","last_name":"Mühlböck","full_name":"Mühlböck, Fabian","orcid":"0000-0003-1548-0177"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Mühlböck, Fabian, and Thomas A Henzinger. Differential Monitoring. IST Austria, 2021. https://doi.org/10.15479/AT:ISTA:9946.","ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring, IST Austria, 17p.","mla":"Mühlböck, Fabian, and Thomas A. Henzinger. Differential Monitoring. IST Austria, 2021, doi:10.15479/AT:ISTA:9946.","ama":"Mühlböck F, Henzinger TA. Differential Monitoring. IST Austria; 2021. doi:10.15479/AT:ISTA:9946","apa":"Mühlböck, F., & Henzinger, T. A. (2021). Differential monitoring. IST Austria. https://doi.org/10.15479/AT:ISTA:9946","ieee":"F. Mühlböck and T. A. Henzinger, Differential monitoring. IST Austria, 2021.","short":"F. Mühlböck, T.A. Henzinger, Differential Monitoring, IST Austria, 2021."},"project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}]},{"abstract":[{"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.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2110.07667","open_access":"1"}],"scopus_import":"1","intvolume":" 40","month":"11","publication_status":"published","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"language":[{"iso":"eng"}],"issue":"7","volume":40,"_id":"10404","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-08-14T13:11:42Z","department":[{"_id":"ToHe"}],"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","oa":1,"quality_controlled":"1","publisher":"Wiley","year":"2021","isi":1,"publication":"Computer Graphics Forum","day":"27","page":"253-264","date_created":"2021-12-05T23:01:40Z","date_published":"2021-11-27T00:00:00Z","doi":"10.1111/cgf.14418","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"citation":{"mla":"Sietzen, Stefan, et al. “Interactive Analysis of CNN Robustness.” Computer Graphics Forum, vol. 40, no. 7, Wiley, 2021, pp. 253–64, doi:10.1111/cgf.14418.","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,” Computer Graphics Forum, vol. 40, no. 7. Wiley, pp. 253–264, 2021.","ama":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. Interactive analysis of CNN robustness. Computer Graphics Forum. 2021;40(7):253-264. doi:10.1111/cgf.14418","apa":"Sietzen, S., Lechner, M., Borowski, J., Hasani, R., & Waldner, M. (2021). Interactive analysis of CNN robustness. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.14418","chicago":"Sietzen, Stefan, Mathias Lechner, Judy Borowski, Ramin Hasani, and Manuela Waldner. “Interactive Analysis of CNN Robustness.” Computer Graphics Forum. Wiley, 2021. https://doi.org/10.1111/cgf.14418.","ista":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. 2021. Interactive analysis of CNN robustness. Computer Graphics Forum. 40(7), 253–264."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000722952000024"],"arxiv":["2110.07667"]},"article_processing_charge":"No","author":[{"last_name":"Sietzen","full_name":"Sietzen, Stefan","first_name":"Stefan"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner"},{"full_name":"Borowski, Judy","last_name":"Borowski","first_name":"Judy"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"last_name":"Waldner","full_name":"Waldner, Manuela","first_name":"Manuela"}],"title":"Interactive analysis of CNN robustness"},{"month":"02","intvolume":" 17","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets."}],"volume":17,"issue":"1","file":[{"date_updated":"2022-01-26T08:04:50Z","file_size":819878,"creator":"alisjak","date_created":"2022-01-26T08:04:50Z","file_name":"2021_LMCS_AGHAJOHAR.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"b35586a50ed1ca8f44767de116d18d81","file_id":"10690","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1860-5974"]},"publication_status":"published","status":"public","keyword":["computer science","computer science and game theory","logic in computer science"],"type":"journal_article","article_type":"original","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)"},"_id":"10674","file_date_updated":"2022-01-26T08:04:50Z","department":[{"_id":"ToHe"}],"ddc":["510"],"date_updated":"2023-08-17T06:56:42Z","publisher":"International Federation for Computational Logic","quality_controlled":"1","oa":1,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).\r\n","date_published":"2021-02-03T00:00:00Z","doi":"10.23638/LMCS-17(1:10)2021","date_created":"2022-01-25T16:32:13Z","page":"10:1-10:23","day":"03","publication":"Logical Methods in Computer Science","isi":1,"has_accepted_license":"1","year":"2021","project":[{"_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"title":"Determinacy in discrete-bidding infinite-duration games","author":[{"first_name":"Milad","full_name":"Aghajohari, Milad","last_name":"Aghajohari"},{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"}],"external_id":{"arxiv":["1905.03588"],"isi":["000658724600010"]},"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration Games.” Logical Methods in Computer Science, vol. 17, no. 1, International Federation for Computational Logic, 2021, p. 10:1-10:23, doi:10.23638/LMCS-17(1:10)2021.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” Logical Methods in Computer Science, vol. 17, no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.","apa":"Aghajohari, M., Avni, G., & Henzinger, T. A. (2021). Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. International Federation for Computational Logic. https://doi.org/10.23638/LMCS-17(1:10)2021","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 2021;17(1):10:1-10:23. doi:10.23638/LMCS-17(1:10)2021","chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games.” Logical Methods in Computer Science. International Federation for Computational Logic, 2021. https://doi.org/10.23638/LMCS-17(1:10)2021.","ista":"Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23."}},{"status":"public","conference":{"name":"ICRA: International Conference on Robotics and Automation","location":"Xi'an, China","end_date":"2021-06-05","start_date":"2021-05-30"},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"type":"conference","_id":"10666","series_title":"ICRA","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2023-08-17T06:58:38Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08187"}],"oa_version":"None","abstract":[{"lang":"eng","text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning."}],"related_material":{"record":[{"id":"11362","status":"public","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eisbn":["978-1-7281-9077-8"],"isbn":["978-1-7281-9078-5"],"eissn":["2577-087X"],"issn":["1050-4729"]},"project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"title":"Adversarial training is not ready for robot learning","external_id":{"arxiv":["2103.08187"],"isi":["000765738803040"]},"article_processing_charge":"No","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In 2021 IEEE International Conference on Robotics and Automation, 4140–47. ICRA, 2021. https://doi.org/10.1109/ICRA48506.2021.9561036.","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and AutomationICRA, 4140–4147.","mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” 2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–47, doi:10.1109/ICRA48506.2021.9561036.","short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–4147.","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in 2021 IEEE International Conference on Robotics and Automation, Xi’an, China, 2021, pp. 4140–4147.","apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., & Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In 2021 IEEE International Conference on Robotics and Automation (pp. 4140–4147). Xi’an, China. https://doi.org/10.1109/ICRA48506.2021.9561036","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: 2021 IEEE International Conference on Robotics and Automation. ICRA. ; 2021:4140-4147. doi:10.1109/ICRA48506.2021.9561036"},"oa":1,"quality_controlled":"1","acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).","date_created":"2022-01-25T15:44:54Z","doi":"10.1109/ICRA48506.2021.9561036","date_published":"2021-01-01T00:00:00Z","page":"4140-4147","publication":"2021 IEEE International Conference on Robotics and Automation","year":"2021","has_accepted_license":"1","isi":1},{"keyword":["monitoring","neural networks","novelty detection"],"status":"public","conference":{"start_date":"2021-10-11","location":"Virtual","end_date":"2021-10-14","name":"RV: Runtime Verification"},"type":"conference","_id":"10206","department":[{"_id":"ToHe"}],"date_updated":"2024-01-30T12:06:56Z","place":"Cham","month":"10","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.06429"}],"alternative_title":["LNCS"],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"Neural-network classifiers achieve high accuracy when predicting the class of an input that they were trained to identify. Maintaining this accuracy in dynamic environments, where inputs frequently fall outside the fixed set of initially known classes, remains a challenge. The typical approach is to detect inputs from novel classes and retrain the classifier on an augmented dataset. However, not only the classifier but also the detection mechanism needs to adapt in order to distinguish between newly learned and yet unknown input classes. To address this challenge, we introduce an algorithmic framework for active monitoring of a neural network. A monitor wrapped in our framework operates in parallel with the neural network and interacts with a human user via a series of interpretable labeling queries for incremental adaptation. In addition, we propose an adaptive quantitative monitor to improve precision. An experimental evaluation on a diverse set of benchmarks with varying numbers of classes confirms the benefits of our active monitoring framework in dynamic scenarios.","lang":"eng"}],"ec_funded":1,"related_material":{"record":[{"status":"public","id":"13234","relation":"extended_version"}]},"volume":"12974 ","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9-783-0308-8493-2"],"eissn":["1611-3349"],"eisbn":["978-3-030-88494-9"]},"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"title":"Into the unknown: active monitoring of neural networks","article_processing_charge":"No","external_id":{"arxiv":["2009.06429"],"isi":["000719383800003"]},"author":[{"full_name":"Lukina, Anna","last_name":"Lukina","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","first_name":"Anna"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Schilling","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"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.","chicago":"Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks.” In 21st International Conference on Runtime Verification, 12974:42–61. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-88494-9_3.","ama":"Lukina A, Schilling C, Henzinger TA. Into the unknown: active monitoring of neural networks. In: 21st International Conference on Runtime Verification. Vol 12974. Cham: Springer Nature; 2021:42-61. doi:10.1007/978-3-030-88494-9_3","apa":"Lukina, A., Schilling, C., & Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In 21st International Conference on Runtime Verification (Vol. 12974, pp. 42–61). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-88494-9_3","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 21st International Conference on Runtime Verification, Virtual, 2021, vol. 12974, pp. 42–61.","mla":"Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.” 21st International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:10.1007/978-3-030-88494-9_3."},"oa":1,"publisher":"Springer Nature","quality_controlled":"1","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.","date_created":"2021-10-31T23:01:31Z","doi":"10.1007/978-3-030-88494-9_3","date_published":"2021-10-06T00:00:00Z","page":"42-61","publication":"21st International Conference on Runtime Verification","day":"06","year":"2021","isi":1},{"title":"A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits","article_processing_charge":"No","author":[{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"full_name":"Amini, Alexander","last_name":"Amini","first_name":"Alexander"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. Proceedings of the 37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR, , 4082–4093.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In Proceedings of the 37th International Conference on Machine Learning, 4082–93. PMLR, 2020.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In: Proceedings of the 37th International Conference on Machine Learning. PMLR. ; 2020:4082-4093.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (pp. 4082–4093). Virtual.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, pp. 4082–4093.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–4093.","mla":"Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–93."},"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"date_created":"2022-01-25T15:50:34Z","date_published":"2020-01-01T00:00:00Z","page":"4082-4093","publication":"Proceedings of the 37th International Conference on Machine Learning","year":"2020","has_accepted_license":"1","oa":1,"quality_controlled":"1","acknowledgement":"RH and RG are partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award). AA is supported by the National Science Foundation (NSF) Graduate Research Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation of RH.\r\n","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file_date_updated":"2022-01-26T11:08:51Z","ddc":["000"],"date_updated":"2022-01-26T11:14:27Z","status":"public","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"conference":{"name":"ML: Machine Learning","location":"Virtual","end_date":"2020-07-18","start_date":"2020-07-12"},"type":"conference","series_title":"PMLR","_id":"10673","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"c9a4a29161777fc1a89ef451c040e3b1","file_id":"10691","success":1,"creator":"cchlebak","date_updated":"2022-01-26T11:08:51Z","file_size":2329798,"date_created":"2022-01-26T11:08:51Z","file_name":"2020_PMLR_Hasani.pdf"}],"publication_status":"published","publication_identifier":{"issn":["2640-3498"]},"main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v119/hasani20a.html"}],"alternative_title":["PMLR"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We propose a neural information processing system obtained by re-purposing the function of a biological neural circuit model to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model of biological neural circuits reparameterized for the control of alternative tasks. We first demonstrate that ONCs realize networks with higher maximum flow compared to arbitrary wired networks. We then learn instances of ONCs to control a series of robotic tasks, including the autonomous parking of a real-world rover robot. For reconfiguration of the purpose of the neural circuit, we adopt a search-based optimization algorithm. Ordinary neural circuits perform on par and, in some cases, significantly surpass the performance of contemporary deep learning models. ONC networks are compact, 77% sparser than their counterpart neural controllers, and their neural dynamics are fully interpretable at the cell-level."}]},{"author":[{"last_name":"Ferrere","full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard"}],"article_processing_charge":"No","external_id":{"arxiv":["1910.06097"]},"title":"Monitoring event frequencies","citation":{"mla":"Ferrere, Thomas, et al. “Monitoring Event Frequencies.” 28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20.","short":"T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"T. Ferrere, T. A. Henzinger, and B. Kragl, “Monitoring event frequencies,” in 28th EACSL Annual Conference on Computer Science Logic, Barcelona, Spain, 2020, vol. 152.","apa":"Ferrere, T., Henzinger, T. A., & Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2020.20","ama":"Ferrere T, Henzinger TA, Kragl B. Monitoring event frequencies. In: 28th EACSL Annual Conference on Computer Science Logic. Vol 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CSL.2020.20","chicago":"Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event Frequencies.” In 28th EACSL Annual Conference on Computer Science Logic, Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CSL.2020.20.","ista":"Ferrere T, Henzinger TA, Kragl B. 2020. Monitoring event frequencies. 28th EACSL Annual Conference on Computer Science Logic. CSL: Computer Science Logic, LIPIcs, vol. 152, 20."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"article_number":"20","date_published":"2020-01-15T00:00:00Z","doi":"10.4230/LIPIcs.CSL.2020.20","date_created":"2020-01-21T11:22:21Z","has_accepted_license":"1","year":"2020","day":"15","publication":"28th EACSL Annual Conference on Computer Science Logic","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:56Z","date_updated":"2021-01-12T08:13:12Z","ddc":["000"],"type":"conference","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)"},"conference":{"start_date":"2020-01-13","end_date":"2020-01-16","location":"Barcelona, Spain","name":"CSL: Computer Science Logic"},"status":"public","_id":"7348","volume":152,"publication_identifier":{"isbn":["9783959771320"],"issn":["1868-8969"]},"publication_status":"published","file":[{"file_name":"main.pdf","date_created":"2020-01-21T11:21:04Z","file_size":617206,"date_updated":"2020-07-14T12:47:56Z","creator":"bkragl","file_id":"7349","checksum":"b9a691d658d075c6369d3304d17fb818","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"alternative_title":["LIPIcs"],"scopus_import":1,"month":"01","intvolume":" 152","abstract":[{"lang":"eng","text":"The monitoring of event frequencies can be used to recognize behavioral anomalies, to identify trends, and to deduce or discard hypotheses about the underlying system. For example, the performance of a web server may be monitored based on the ratio of the total count of requests from the least and most active clients. Exact frequency monitoring, however, can be prohibitively expensive; in the above example it would require as many counters as there are clients. In this paper, we propose the efficient probabilistic monitoring of common frequency properties, including the mode (i.e., the most common event) and the median of an event sequence. We define a logic to express composite frequency properties as a combination of atomic frequency properties. Our main contribution is an algorithm that, under suitable probabilistic assumptions, can be used to monitor these important frequency properties with four counters, independent of the number of different events. Our algorithm samples longer and longer subwords of an infinite event sequence. We prove the almost-sure convergence of our algorithm by generalizing ergodic theory from increasing-length prefixes to increasing-length subwords of an infinite sequence. A similar algorithm could be used to learn a connected Markov chain of a given structure from observing its outputs, to arbitrary precision, for a given confidence. "}],"oa_version":"Published Version"},{"conference":{"end_date":"2020-07-12","start_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"},"type":"conference","status":"public","_id":"8572","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:20:06Z","main_file_link":[{"url":"https://easychair.org/publications/download/DRpS","open_access":"1"}],"intvolume":" 74","month":"09","abstract":[{"text":"We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":74,"publication_status":"published","language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z00312"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"article_processing_charge":"No","author":[{"full_name":"Althoff, Matthias","last_name":"Althoff","first_name":"Matthias"},{"first_name":"Stanley","last_name":"Bak","full_name":"Bak, Stanley"},{"full_name":"Bao, Zongnan","last_name":"Bao","first_name":"Zongnan"},{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"first_name":"Daniel","last_name":"Freire","full_name":"Freire, Daniel"},{"first_name":"Niklas","last_name":"Kochdumper","full_name":"Kochdumper, Niklas"},{"last_name":"Li","full_name":"Li, Yangge","first_name":"Yangge"},{"full_name":"Mitra, Sayan","last_name":"Mitra","first_name":"Sayan"},{"last_name":"Ray","full_name":"Ray, Rajarshi","first_name":"Rajarshi"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Schilling","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065"},{"first_name":"Stefan","last_name":"Schupp","full_name":"Schupp, Stefan"},{"last_name":"Wetzlinger","full_name":"Wetzlinger, Mark","first_name":"Mark"}],"title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics","citation":{"mla":"Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 16–48, doi:10.29007/7dt2.","ieee":"M. Althoff et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 16–48.","short":"M. Althoff, S. Bak, Z. Bao, M. Forets, G. Frehse, D. Freire, N. Kochdumper, Y. Li, S. Mitra, R. Ray, C. Schilling, S. Schupp, M. Wetzlinger, in:, EPiC Series in Computing, EasyChair, 2020, pp. 16–48.","ama":"Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:16-48. doi:10.29007/7dt2","apa":"Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D., … Wetzlinger, M. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair. https://doi.org/10.29007/7dt2","chicago":"Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse, Daniel Freire, Niklas Kochdumper, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” In EPiC Series in Computing, 74:16–48. EasyChair, 2020. https://doi.org/10.29007/7dt2.","ista":"Althoff M, Bak S, Bao Z, Forets M, Frehse G, Freire D, Kochdumper N, Li Y, Mitra S, Ray R, Schilling C, Schupp S, Wetzlinger M. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 16–48."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"EasyChair","quality_controlled":"1","acknowledgement":"The authors gratefully acknowledge financial support by the European Commission project\r\njustITSELF under grant number 817629, by the Austrian Science Fund (FWF) under grant\r\nZ211-N23 (Wittgenstein Award), by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411, and by the\r\nScience and Engineering Research Board (SERB) project with file number IMP/2018/000523.\r\nThis material is based upon work supported by the Air Force Office of Scientific Research under\r\naward number FA9550-19-1-0288. Any opinions, finding, and conclusions or recommendations\r\nexpressed in this material are those of the author(s) and do not necessarily reflect the views of\r\nthe United States Air Force.","page":"16-48","date_created":"2020-09-26T14:49:43Z","doi":"10.29007/7dt2","date_published":"2020-09-25T00:00:00Z","year":"2020","publication":"EPiC Series in Computing","day":"25"},{"_id":"8571","status":"public","conference":{"end_date":"2020-07-12","start_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"},"type":"conference","date_updated":"2021-01-12T08:20:06Z","department":[{"_id":"ToHe"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools."}],"intvolume":" 74","month":"09","main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/nrdD"}],"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"volume":74,"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Geretti L, Alexandre Dit Sandretto J, Althoff M, Benet L, Chapoutot A, Chen X, Collins P, Forets M, Freire D, Immler F, Kochdumper N, Sanders D, Schilling C. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 49–75.","chicago":"Geretti, Luca, Julien Alexandre Dit Sandretto, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Pieter Collins, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series in Computing, 74:49–75. EasyChair, 2020. https://doi.org/10.29007/zkf6.","ama":"Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:49-75. doi:10.29007/zkf6","apa":"Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X., … Schilling, C. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 74, pp. 49–75). EasyChair. https://doi.org/10.29007/zkf6","ieee":"L. Geretti et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 49–75.","short":"L. Geretti, J. Alexandre Dit Sandretto, M. Althoff, L. Benet, A. Chapoutot, X. Chen, P. Collins, M. Forets, D. Freire, F. Immler, N. Kochdumper, D. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2020, pp. 49–75.","mla":"Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 49–75, doi:10.29007/zkf6."},"title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics","article_processing_charge":"No","author":[{"full_name":"Geretti, Luca","last_name":"Geretti","first_name":"Luca"},{"last_name":"Alexandre Dit Sandretto","full_name":"Alexandre Dit Sandretto, Julien","first_name":"Julien"},{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"},{"first_name":"Luis","last_name":"Benet","full_name":"Benet, Luis"},{"last_name":"Chapoutot","full_name":"Chapoutot, Alexandre","first_name":"Alexandre"},{"last_name":"Chen","full_name":"Chen, Xin","first_name":"Xin"},{"last_name":"Collins","full_name":"Collins, Pieter","first_name":"Pieter"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"first_name":"Daniel","full_name":"Freire, Daniel","last_name":"Freire"},{"full_name":"Immler, Fabian","last_name":"Immler","first_name":"Fabian"},{"first_name":"Niklas","full_name":"Kochdumper, Niklas","last_name":"Kochdumper"},{"full_name":"Sanders, David","last_name":"Sanders","first_name":"David"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Schilling","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065"}],"acknowledgement":"Christian Schilling acknowledges support 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 lodowska-Curie grant agreement No. 754411.","oa":1,"quality_controlled":"1","publisher":"EasyChair","publication":"EPiC Series in Computing","day":"25","year":"2020","date_created":"2020-09-26T14:41:29Z","doi":"10.29007/zkf6","date_published":"2020-09-25T00:00:00Z","page":"49-75"},{"date_created":"2020-10-04T22:01:36Z","doi":"10.4230/LIPIcs.CONCUR.2020.23","date_published":"2020-08-06T00:00:00Z","year":"2020","has_accepted_license":"1","publication":"31st International Conference on Concurrency Theory","day":"06","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","article_processing_charge":"No","external_id":{"arxiv":["2007.08917"]},"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","full_name":"Otop, Jan"}],"title":"Multi-dimensional long-run average problems for vector addition systems with states","citation":{"mla":"Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” 31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23","ama":"Chatterjee K, Henzinger TA, Otop J. Multi-dimensional long-run average problems for vector addition systems with states. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.23","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23.","ista":"Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 23."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"article_number":"23","license":"https://creativecommons.org/licenses/by/3.0/","volume":171,"publication_status":"published","publication_identifier":{"issn":["18688969"],"isbn":["9783959771603"]},"language":[{"iso":"eng"}],"file":[{"success":1,"checksum":"5039752f644c4b72b9361d21a5e31baf","file_id":"8610","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2020_LIPIcsCONCUR_Chatterjee.pdf","date_created":"2020-10-05T14:04:25Z","file_size":601231,"date_updated":"2020-10-05T14:04:25Z","creator":"dernst"}],"scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 171","month":"08","abstract":[{"text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A transition changes the current state to the next state, and every counter is either incremented, or decremented, or left unchanged. A state and value for each counter is a configuration; and a computation is an infinite sequence of configurations with transitions between successive configurations. A probabilistic VASS consists of a VASS along with a probability distribution over the transitions for each state. Qualitative properties such as state and configuration reachability have been widely studied for VASS. In this work we consider multi-dimensional long-run average objectives for VASS and probabilistic VASS. For a counter, the cost of a configuration is the value of the counter; and the long-run average value of a computation for the counter is the long-run average of the costs of the configurations in the computation. The multi-dimensional long-run average problem given a VASS and a threshold value for each counter, asks whether there is a computation such that for each counter the long-run average value for the counter does not exceed the respective threshold. For probabilistic VASS, instead of the existence of a computation, we consider whether the expected long-run average value for each counter does not exceed the respective threshold. Our main results are as follows: we show that the multi-dimensional long-run average problem (a) is NP-complete for integer-valued VASS; (b) is undecidable for natural-valued VASS (i.e., nonnegative counters); and (c) can be solved in polynomial time for probabilistic integer-valued VASS, and probabilistic natural-valued VASS when all computations are non-terminating.","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2020-10-05T14:04:25Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2021-01-12T08:20:15Z","ddc":["000"],"conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2020-09-01","location":"Virtual","end_date":"2020-09-04"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference","status":"public","_id":"8600"},{"volume":171,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"8611","checksum":"8f33b098e73724e0ac817f764d8e1a2d","success":1,"date_updated":"2020-10-05T14:13:19Z","file_size":868510,"creator":"dernst","date_created":"2020-10-05T14:13:19Z","file_name":"2020_LIPIcsCONCUR_Avni.pdf"}],"publication_status":"published","publication_identifier":{"issn":["18688969"],"isbn":["9783959771603"]},"intvolume":" 171","month":"08","scopus_import":"1","alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an \"auction\" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and study their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We show how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games."}],"file_date_updated":"2020-10-05T14:13:19Z","department":[{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2021-01-12T08:20:13Z","status":"public","conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2020-09-01","location":"Virtual","end_date":"2020-09-04"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference","_id":"8599","date_created":"2020-10-04T22:01:36Z","doi":"10.4230/LIPIcs.CONCUR.2020.2","date_published":"2020-08-06T00:00:00Z","publication":"31st International Conference on Concurrency Theory","day":"06","year":"2020","has_accepted_license":"1","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","acknowledgement":"We would like to thank all our collaborators Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful for you as it was for us.","title":"A survey of bidding games on graphs","article_processing_charge":"No","author":[{"last_name":"Avni","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.” 31st International Conference on Concurrency Theory, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.2.","ama":"Avni G, Henzinger TA. A survey of bidding games on graphs. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.2","apa":"Avni, G., & Henzinger, T. A. (2020). A survey of bidding games on graphs. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2","short":"G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.","chicago":"Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2.","ista":"Avni G, Henzinger TA. 2020. A survey of bidding games on graphs. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 2."},"project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"article_number":"2"},{"department":[{"_id":"ToHe"}],"file_date_updated":"2021-02-09T09:39:02Z","ddc":["000"],"date_updated":"2021-02-09T09:39:59Z","status":"public","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)"},"conference":{"location":"Online Conference","end_date":"2020-09-24","start_date":"2020-09-21","name":" FMCAD: Formal Methods in Computer-Aided Design"},"type":"conference","_id":"9040","language":[{"iso":"eng"}],"file":[{"file_name":"2020_FMCAD_Alamdari.pdf","date_created":"2021-02-09T09:39:02Z","file_size":990999,"date_updated":"2021-02-09T09:39:02Z","creator":"dernst","success":1,"checksum":"d616d549a0ade78606b16f8a9540820f","file_id":"9109","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"publication_status":"published","publication_identifier":{"isbn":["9783854480426"],"eissn":["2708-7824"]},"month":"09","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reasoning formally about the output of deep RL, which we call the wizard, we extract from it a decision-tree based model, which we refer to as the magic book. Using the extracted model as an intermediary, we are able to handle problems that are infeasible for either deep RL or formal methods by themselves. First, we suggest, for the first time, a synthesis procedure that is based on a magic book. We synthesize a stand-alone correct-by-design controller that enjoys the favorable performance of RL. Second, we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows us to find numerous traces of the plant under the control of the wizard, which a user can use to increase the trustworthiness of the wizard and direct further training."}],"title":"Formal methods with a touch of magic","article_processing_charge":"No","author":[{"first_name":"Par Alizadeh","full_name":"Alamdari, Par Alizadeh","last_name":"Alamdari"},{"first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","full_name":"Lukina, Anna","last_name":"Lukina"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 138–147.","chicago":"Alamdari, Par Alizadeh, Guy Avni, Thomas A Henzinger, and Anna Lukina. “Formal Methods with a Touch of Magic.” In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, 138–47. TU Wien Academic Press, 2020. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21.","ama":"Alamdari PA, Avni G, Henzinger TA, Lukina A. Formal methods with a touch of magic. In: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. TU Wien Academic Press; 2020:138-147. doi:10.34727/2020/isbn.978-3-85448-042-6_21","apa":"Alamdari, P. A., Avni, G., Henzinger, T. A., & Lukina, A. (2020). Formal methods with a touch of magic. In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien Academic Press. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21","ieee":"P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, Online Conference, 2020, pp. 138–147.","short":"P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147.","mla":"Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.” Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–47, doi:10.34727/2020/isbn.978-3-85448-042-6_21."},"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"date_created":"2021-01-24T23:01:10Z","date_published":"2020-09-21T00:00:00Z","doi":"10.34727/2020/isbn.978-3-85448-042-6_21","page":"138-147","publication":"Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design","day":"21","year":"2020","has_accepted_license":"1","oa":1,"publisher":"TU Wien Academic Press","quality_controlled":"1","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award)."},{"abstract":[{"text":"Second-order information, in the form of Hessian- or Inverse-Hessian-vector products, is a fundamental tool for solving optimization problems. Recently, there has been significant interest in utilizing this information in the context of deep\r\nneural networks; however, relatively little is known about the quality of existing approximations in this context. Our work examines this question, identifies issues with existing approaches, and proposes a method called WoodFisher to compute a faithful and efficient estimate of the inverse Hessian. Our main application is to neural network compression, where we build on the classic Optimal Brain Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms popular state-of-the-art methods for oneshot pruning. Further, even when iterative, gradual pruning is allowed, our method results in a gain in test accuracy over the state-of-the-art approaches, for standard image classification datasets such as ImageNet ILSVRC. We examine how our method can be extended to take into account first-order information, as well as\r\nillustrate its ability to automatically set layer-wise pruning thresholds and perform compression in the limited-data regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher.","lang":"eng"}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html"}],"scopus_import":"1","intvolume":" 33","month":"12","publication_status":"published","publication_identifier":{"issn":["10495258"],"isbn":["9781713829546"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":33,"_id":"9632","conference":{"start_date":"2020-12-06","location":"Vancouver, Canada","end_date":"2020-12-12","name":"NeurIPS: Conference on Neural Information Processing Systems"},"type":"conference","status":"public","date_updated":"2023-02-23T14:03:06Z","department":[{"_id":"DaAl"},{"_id":"ToHe"}],"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Also, we would like to thank Alexander Shevchenko, Alexandra Peste, and other members of the group for fruitful discussions.","oa":1,"publisher":"Curran Associates","quality_controlled":"1","year":"2020","publication":"Advances in Neural Information Processing Systems","day":"06","page":"18098-18109","date_created":"2021-07-04T22:01:26Z","date_published":"2020-12-06T00:00:00Z","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"citation":{"chicago":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” In Advances in Neural Information Processing Systems, 33:18098–109. Curran Associates, 2020.","ista":"Singh SP, Alistarh D-A. 2020. WoodFisher: Efficient second-order approximation for neural network compression. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 18098–18109.","mla":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109.","ieee":"S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation for neural network compression,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.","short":"S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 18098–18109.","apa":"Singh, S. P., & Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression. In Advances in Neural Information Processing Systems (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.","ama":"Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for neural network compression. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:18098-18109."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","article_processing_charge":"No","external_id":{"arxiv":["2004.14340"]},"author":[{"id":"DD138E24-D89D-11E9-9DC0-DEF6E5697425","first_name":"Sidak Pal","full_name":"Singh, Sidak Pal","last_name":"Singh"},{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"title":"WoodFisher: Efficient second-order approximation for neural network compression"},{"year":"2020","day":"14","publication":"Proceedings of the 59th IEEE Conference on Decision and Control","page":"1556-1563","doi":"10.1109/CDC42340.2020.9304042","date_published":"2020-12-14T00:00:00Z","date_created":"2021-02-07T23:01:14Z","acknowledgement":"The authors would like to thank Ramin Hasani and Guillaume Berger for intellectual discussions about the research which lead to the generation of new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832 and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n","publisher":"IEEE","quality_controlled":"1","oa":1,"citation":{"mla":"Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.” Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020, IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042.","ama":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian reachtubes: The next generation. In: Proceedings of the 59th IEEE Conference on Decision and Control. Vol 2020. IEEE; 2020:1556-1563. doi:10.1109/CDC42340.2020.9304042","apa":"Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., & Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE. https://doi.org/10.1109/CDC42340.2020.9304042","ieee":"S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R. Grosu, “Lagrangian reachtubes: The next generation,” in Proceedings of the 59th IEEE Conference on Decision and Control, Jeju Islang, Korea (South), 2020, vol. 2020, pp. 1556–1563.","short":"S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu, in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020, pp. 1556–1563.","chicago":"Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam, Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.” In Proceedings of the 59th IEEE Conference on Decision and Control, 2020:1556–63. IEEE, 2020. https://doi.org/10.1109/CDC42340.2020.9304042.","ista":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020. Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Gruenbacher","full_name":"Gruenbacher, Sophie","first_name":"Sophie"},{"first_name":"Jacek","full_name":"Cyranka, Jacek","last_name":"Cyranka"},{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"last_name":"Islam","full_name":"Islam, Md Ariful","first_name":"Md Ariful"},{"first_name":"Scott A.","full_name":"Smolka, Scott A.","last_name":"Smolka"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"external_id":{"arxiv":["2012.07458"]},"article_processing_charge":"No","title":"Lagrangian reachtubes: The next generation","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication_identifier":{"isbn":["9781728174471"],"issn":["07431546"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":2020,"abstract":[{"lang":"eng","text":"We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the \"wrapping effect\" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2012.07458"}],"month":"12","intvolume":" 2020","date_updated":"2021-02-09T09:20:58Z","department":[{"_id":"ToHe"}],"_id":"9103","type":"conference","conference":{"location":"Jeju Islang, Korea (South)","end_date":"2020-12-18","start_date":"2020-12-14","name":"CDC: Conference on Decision and Control"},"status":"public"},{"ddc":["000"],"date_updated":"2023-04-03T07:33:40Z","file_date_updated":"2022-01-26T07:35:17Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"_id":"10672","status":"public","conference":{"name":"ICLR: International Conference on Learning Representations","end_date":"2020-05-01","location":"Virtual ; Addis Ababa, Ethiopia","start_date":"2020-04-26"},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"type":"conference","language":[{"iso":"eng"}],"file":[{"creator":"mlechner","date_updated":"2022-01-26T07:35:17Z","file_size":249431,"date_created":"2022-01-26T07:35:17Z","file_name":"iclr_2020.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"10677","checksum":"ea13d42dd4541ddb239b6a75821fd6c9","success":1}],"publication_status":"published","oa_version":"Published Version","abstract":[{"lang":"eng","text":"The family of feedback alignment (FA) algorithms aims to provide a more biologically motivated alternative to backpropagation (BP), by substituting the computations that are unrealistic to be implemented in physical brains. While FA algorithms have been shown to work well in practice, there is a lack of rigorous theory proofing their learning capabilities. Here we introduce the first feedback alignment algorithm with provable learning guarantees. In contrast to existing work, we do not require any assumption about the size or depth of the network except that it has a single output neuron, i.e., such as for binary classification tasks. We show that our FA algorithm can deliver its theoretical promises in practice, surpassing the learning performance of existing FA methods and matching backpropagation in binary classification tasks. Finally, we demonstrate the limits of our FA variant when the number of output neurons grows beyond a certain quantity."}],"month":"03","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=Bke61krFvS"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In 8th International Conference on Learning Representations. ICLR, 2020.","ista":"Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","mla":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” 8th International Conference on Learning Representations, ICLR, 2020.","apa":"Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In 8th International Conference on Learning Representations. Virtual ; Addis Ababa, Ethiopia: ICLR.","ama":"Lechner M. Learning representations for binary-classification without backpropagation. In: 8th International Conference on Learning Representations. ICLR; 2020.","short":"M. Lechner, in:, 8th International Conference on Learning Representations, ICLR, 2020.","ieee":"M. Lechner, “Learning representations for binary-classification without backpropagation,” in 8th International Conference on Learning Representations, Virtual ; Addis Ababa, Ethiopia, 2020."},"title":"Learning representations for binary-classification without backpropagation","article_processing_charge":"No","author":[{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"}],"project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publication":"8th International Conference on Learning Representations","day":"11","year":"2020","has_accepted_license":"1","date_created":"2022-01-25T15:50:00Z","date_published":"2020-03-11T00:00:00Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n","oa":1,"quality_controlled":"1","publisher":"ICLR"},{"publisher":"Springer Nature","quality_controlled":"1","oa":1,"date_published":"2020-04-17T00:00:00Z","doi":"10.1007/978-3-030-45237-7_5","date_created":"2020-05-10T22:00:49Z","page":"79-97","day":"17","publication":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","has_accepted_license":"1","year":"2020","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"title":"How many bits does it take to quantize your neural network?","author":[{"last_name":"Giacobbe","orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","first_name":"Mirco"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits Does It Take to Quantize Your Neural Network?” In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12079:79–97. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45237-7_5.","ista":"Giacobbe M, Henzinger TA, Lechner M. 2020. How many bits does it take to quantize your neural network? International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12079, 79–97.","mla":"Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural Network?” International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:10.1007/978-3-030-45237-7_5.","short":"M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2020, pp. 79–97.","ieee":"M. Giacobbe, T. A. Henzinger, and M. Lechner, “How many bits does it take to quantize your neural network?,” in International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Dublin, Ireland, 2020, vol. 12079, pp. 79–97.","ama":"Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize your neural network? In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 12079. Springer Nature; 2020:79-97. doi:10.1007/978-3-030-45237-7_5","apa":"Giacobbe, M., Henzinger, T. A., & Lechner, M. (2020). How many bits does it take to quantize your neural network? In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12079, pp. 79–97). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-45237-7_5"},"month":"04","intvolume":" 12079","scopus_import":1,"alternative_title":["LNCS"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Quantization converts neural networks into low-bit fixed-point computations which can be carried out by efficient integer-only hardware, and is standard practice for the deployment of neural networks on real-time embedded devices. However, like their real-numbered counterpart, quantized networks are not immune to malicious misclassification caused by adversarial attacks. We investigate how quantization affects a network’s robustness to adversarial attacks, which is a formal verification question. We show that neither robustness nor non-robustness are monotonic with changing the number of bits for the representation and, also, neither are preserved by quantization from a real-numbered network. For this reason, we introduce a verification method for quantized neural networks which, using SMT solving over bit-vectors, accounts for their exact, bit-precise semantics. We built a tool and analyzed the effect of quantization on a classifier for the MNIST dataset. We demonstrate that, compared to our method, existing methods for the analysis of real-numbered networks often derive false conclusions about their quantizations, both when determining robustness and when detecting attacks, and that existing methods for quantized networks often miss attacks. Furthermore, we applied our method beyond robustness, showing how the number of bits in quantization enlarges the gender bias of a predictor for students’ grades."}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"11362"}]},"volume":12079,"file":[{"file_size":2744030,"date_updated":"2020-07-14T12:48:03Z","creator":"dernst","file_name":"2020_TACAS_Giacobbe.pdf","date_created":"2020-05-26T12:48:15Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"f19905a42891fe5ce93d69143fa3f6fb","file_id":"7893"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["03029743"],"isbn":["9783030452360"],"eissn":["16113349"]},"publication_status":"published","status":"public","type":"conference","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)"},"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2020-04-25","end_date":"2020-04-30","location":"Dublin, Ireland"},"_id":"7808","file_date_updated":"2020-07-14T12:48:03Z","department":[{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2023-06-23T07:01:11Z"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ista":"Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games. Theoretical Computer Science. 807, 42–55.","chicago":"Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.","ieee":"G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.","short":"G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.","ama":"Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031","apa":"Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031","mla":"Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031."},"title":"Dynamic resource allocation games","external_id":{"isi":["000512219400004"]},"article_processing_charge":"No","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","last_name":"Avni","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"project":[{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication":"Theoretical Computer Science","day":"06","year":"2020","has_accepted_license":"1","isi":1,"date_created":"2019-08-04T21:59:20Z","doi":"10.1016/j.tcs.2019.06.031","date_published":"2020-02-06T00:00:00Z","page":"42-55","oa":1,"publisher":"Elsevier","quality_controlled":"1","ddc":["000"],"date_updated":"2023-08-17T13:52:49Z","file_date_updated":"2020-10-09T06:31:22Z","department":[{"_id":"ToHe"}],"_id":"6761","status":"public","type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"e86635417f45eb2cd75778f91382f737","file_id":"8639","success":1,"creator":"dernst","date_updated":"2020-10-09T06:31:22Z","file_size":1413001,"date_created":"2020-10-09T06:31:22Z","file_name":"2020_TheoreticalCS_Avni.pdf"}],"publication_status":"published","publication_identifier":{"issn":["03043975"]},"related_material":{"record":[{"relation":"earlier_version","id":"1341","status":"public"}]},"volume":807,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability."}],"intvolume":" 807","month":"02","scopus_import":"1"},{"oa":1,"quality_controlled":"1","publisher":"IOS Press","acknowledgement":"We thank Christoph Lampert and Nikolaus Mayer for fruitful discussions. This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie SkłodowskaCurie grant agreement No. 754411.","page":"2433-2440","date_created":"2020-02-21T16:44:03Z","date_published":"2020-02-24T00:00:00Z","doi":"10.3233/FAIA200375","year":"2020","has_accepted_license":"1","isi":1,"publication":"24th European Conference on Artificial Intelligence","day":"24","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"external_id":{"arxiv":["1911.09032"],"isi":["000650971303002"]},"article_processing_charge":"No","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","last_name":"Lukina","full_name":"Lukina, Anna"},{"last_name":"Schilling","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"title":"Outside the box: Abstraction-based monitoring of neural networks","citation":{"mla":"Henzinger, Thomas A., et al. “Outside the Box: Abstraction-Based Monitoring of Neural Networks.” 24th European Conference on Artificial Intelligence, vol. 325, IOS Press, 2020, pp. 2433–40, doi:10.3233/FAIA200375.","ieee":"T. A. Henzinger, A. Lukina, and C. Schilling, “Outside the box: Abstraction-based monitoring of neural networks,” in 24th European Conference on Artificial Intelligence, Santiago de Compostela, Spain, 2020, vol. 325, pp. 2433–2440.","short":"T.A. Henzinger, A. Lukina, C. Schilling, in:, 24th European Conference on Artificial Intelligence, IOS Press, 2020, pp. 2433–2440.","ama":"Henzinger TA, Lukina A, Schilling C. Outside the box: Abstraction-based monitoring of neural networks. In: 24th European Conference on Artificial Intelligence. Vol 325. IOS Press; 2020:2433-2440. doi:10.3233/FAIA200375","apa":"Henzinger, T. A., Lukina, A., & Schilling, C. (2020). Outside the box: Abstraction-based monitoring of neural networks. In 24th European Conference on Artificial Intelligence (Vol. 325, pp. 2433–2440). Santiago de Compostela, Spain: IOS Press. https://doi.org/10.3233/FAIA200375","chicago":"Henzinger, Thomas A, Anna Lukina, and Christian Schilling. “Outside the Box: Abstraction-Based Monitoring of Neural Networks.” In 24th European Conference on Artificial Intelligence, 325:2433–40. IOS Press, 2020. https://doi.org/10.3233/FAIA200375.","ista":"Henzinger TA, Lukina A, Schilling C. 2020. Outside the box: Abstraction-based monitoring of neural networks. 24th European Conference on Artificial Intelligence. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 325, 2433–2440."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","alternative_title":["Frontiers in Artificial Intelligence and Applications"],"intvolume":" 325","month":"02","abstract":[{"text":"Neural networks have demonstrated unmatched performance in a range of classification tasks. Despite numerous efforts of the research community, novelty detection remains one of the significant limitations of neural networks. The ability to identify previously unseen inputs as novel is crucial for our understanding of the decisions made by neural networks. At runtime, inputs not falling into any of the categories learned during training cannot be classified correctly by the neural network. Existing approaches treat the neural network as a black box and try to detect novel inputs based on the confidence of the output predictions. However, neural networks are not trained to reduce their confidence for novel inputs, which limits the effectiveness of these approaches. We propose a framework to monitor a neural network by observing the hidden layers. We employ a common abstraction from program analysis - boxes - to identify novel behaviors in the monitored layers, i.e., inputs that cause behaviors outside the box. For each neuron, the boxes range over the values seen in training. The framework is efficient and flexible to achieve a desired trade-off between raising false warnings and detecting novel inputs. We illustrate the performance and the robustness to variability in the unknown classes on popular image-classification benchmarks.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc/4.0/","volume":325,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2020-09-21T07:12:32Z","file_name":"2020_ECAI_Henzinger.pdf","creator":"dernst","date_updated":"2020-09-21T07:12:32Z","file_size":1692214,"file_id":"8540","checksum":"80642fa0b6cd7da95dcd87d63789ad5e","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"conference":{"end_date":"2020-09-08","location":"Santiago de Compostela, Spain","start_date":"2020-08-29","name":"ECAI: European Conference on Artificial Intelligence"},"type":"conference","status":"public","_id":"7505","department":[{"_id":"ToHe"}],"file_date_updated":"2020-09-21T07:12:32Z","date_updated":"2023-08-18T06:38:16Z","ddc":["000"]},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Fixed-point arithmetic is a popular alternative to floating-point arithmetic on embedded systems. Existing work on the verification of fixed-point programs relies on custom formalizations of fixed-point arithmetic, which makes it hard to compare the described techniques or reuse the implementations. In this paper, we address this issue by proposing and formalizing an SMT theory of fixed-point arithmetic. We present an intuitive yet comprehensive syntax of the fixed-point theory, and provide formal semantics for it based on rational arithmetic. We also describe two decision procedures for this theory: one based on the theory of bit-vectors and the other on the theory of reals. We implement the two decision procedures, and evaluate our implementations using existing mature SMT solvers on a benchmark suite we created. Finally, we perform a case study of using the theory we propose to verify properties of quantized neural networks."}],"month":"06","intvolume":" 12166","alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1007/978-3-030-51074-9_2","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["03029743"],"eissn":["16113349"],"isbn":["9783030510732"]},"publication_status":"published","volume":12166,"_id":"8194","status":"public","type":"conference","conference":{"start_date":"2020-07-01","location":"Paris, France","end_date":"2020-07-04","name":"IJCAR: International Joint Conference on Automated Reasoning"},"date_updated":"2023-08-22T08:27:25Z","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","quality_controlled":"1","oa":1,"day":"24","publication":"Automated Reasoning","isi":1,"year":"2020","date_published":"2020-06-24T00:00:00Z","doi":"10.1007/978-3-030-51074-9_2","date_created":"2020-08-02T22:00:59Z","page":"13-31","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ama":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. An SMT theory of fixed-point arithmetic. In: Automated Reasoning. Vol 12166. Springer Nature; 2020:13-31. doi:10.1007/978-3-030-51074-9_2","apa":"Baranowski, M., He, S., Lechner, M., Nguyen, T. S., & Rakamarić, Z. (2020). An SMT theory of fixed-point arithmetic. In Automated Reasoning (Vol. 12166, pp. 13–31). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-030-51074-9_2","ieee":"M. Baranowski, S. He, M. Lechner, T. S. Nguyen, and Z. Rakamarić, “An SMT theory of fixed-point arithmetic,” in Automated Reasoning, Paris, France, 2020, vol. 12166, pp. 13–31.","short":"M. Baranowski, S. He, M. Lechner, T.S. Nguyen, Z. Rakamarić, in:, Automated Reasoning, Springer Nature, 2020, pp. 13–31.","mla":"Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.” Automated Reasoning, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:10.1007/978-3-030-51074-9_2.","ista":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. 2020. An SMT theory of fixed-point arithmetic. Automated Reasoning. IJCAR: International Joint Conference on Automated Reasoning, LNCS, vol. 12166, 13–31.","chicago":"Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir Rakamarić. “An SMT Theory of Fixed-Point Arithmetic.” In Automated Reasoning, 12166:13–31. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-51074-9_2."},"title":"An SMT theory of fixed-point arithmetic","author":[{"first_name":"Marek","last_name":"Baranowski","full_name":"Baranowski, Marek"},{"first_name":"Shaobo","full_name":"He, Shaobo","last_name":"He"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Nguyen, Thanh Son","last_name":"Nguyen","first_name":"Thanh Son"},{"first_name":"Zvonimir","last_name":"Rakamarić","full_name":"Rakamarić, Zvonimir"}],"external_id":{"isi":["000884318000002"]},"article_processing_charge":"No"},{"related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/new-deep-learning-models/","relation":"press_release"}]},"volume":2,"publication_status":"published","publication_identifier":{"eissn":["2522-5839"]},"language":[{"iso":"eng"}],"scopus_import":"1","intvolume":" 2","month":"10","abstract":[{"text":"A central goal of artificial intelligence in high-stakes decision-making applications is to design a single algorithm that simultaneously expresses generalizability by learning coherent representations of their world and interpretable explanations of its dynamics. Here, we combine brain-inspired neural computation principles and scalable deep learning architectures to design compact neural controllers for task-specific compartments of a full-stack autonomous vehicle control system. We discover that a single algorithm with 19 control neurons, connecting 32 encapsulated input features to outputs by 253 synapses, learns to map high-dimensional inputs into steering commands. This system shows superior generalizability, interpretability and robustness compared with orders-of-magnitude larger black-box learning systems. The obtained neural agents enable high-fidelity autonomy for task-specific parts of a complex autonomous system.","lang":"eng"}],"oa_version":"None","department":[{"_id":"ToHe"}],"date_updated":"2023-08-22T10:36:06Z","article_type":"original","type":"journal_article","status":"public","_id":"8679","page":"642-652","date_created":"2020-10-19T13:46:06Z","doi":"10.1038/s42256-020-00237-3","date_published":"2020-10-01T00:00:00Z","year":"2020","isi":1,"publication":"Nature Machine Intelligence","day":"01","quality_controlled":"1","publisher":"Springer Nature","external_id":{"isi":["000583337200011"]},"article_processing_charge":"No","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"first_name":"Alexander","full_name":"Amini, Alexander","last_name":"Amini"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"title":"Neural circuit policies enabling auditable autonomy","citation":{"ista":"Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. 2020. Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. 2, 642–652.","chicago":"Lechner, Mathias, Ramin Hasani, Alexander Amini, Thomas A Henzinger, Daniela Rus, and Radu Grosu. “Neural Circuit Policies Enabling Auditable Autonomy.” Nature Machine Intelligence. Springer Nature, 2020. https://doi.org/10.1038/s42256-020-00237-3.","ieee":"M. Lechner, R. Hasani, A. Amini, T. A. Henzinger, D. Rus, and R. Grosu, “Neural circuit policies enabling auditable autonomy,” Nature Machine Intelligence, vol. 2. Springer Nature, pp. 642–652, 2020.","short":"M. Lechner, R. Hasani, A. Amini, T.A. Henzinger, D. Rus, R. Grosu, Nature Machine Intelligence 2 (2020) 642–652.","ama":"Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. 2020;2:642-652. doi:10.1038/s42256-020-00237-3","apa":"Lechner, M., Hasani, R., Amini, A., Henzinger, T. A., Rus, D., & Grosu, R. (2020). Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. Springer Nature. https://doi.org/10.1038/s42256-020-00237-3","mla":"Lechner, Mathias, et al. “Neural Circuit Policies Enabling Auditable Autonomy.” Nature Machine Intelligence, vol. 2, Springer Nature, 2020, pp. 642–52, doi:10.1038/s42256-020-00237-3."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}]},{"oa":1,"quality_controlled":"1","publisher":"IEEE","acknowledgement":"M.L. is supported in parts by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H., and R.G. are partially supported by the Horizon-2020 ECSELProject grant No. 783163 (iDev40), and the Austrian Research Promotion Agency (FFG), Project No. 860424. R.H. and D.R. is partially supported by the Boeing Company.","page":"5446-5452","date_created":"2020-10-25T23:01:19Z","doi":"10.1109/ICRA40945.2020.9196608","date_published":"2020-05-01T00:00:00Z","year":"2020","has_accepted_license":"1","isi":1,"publication":"Proceedings - IEEE International Conference on Robotics and Automation","day":"01","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"external_id":{"isi":["000712319503110"]},"article_processing_charge":"No","author":[{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"title":"Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme","citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Daniela Rus, and Radu Grosu. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” In Proceedings - IEEE International Conference on Robotics and Automation, 5446–52. IEEE, 2020. https://doi.org/10.1109/ICRA40945.2020.9196608.","ista":"Lechner M, Hasani R, Rus D, Grosu R. 2020. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, , 5446–5452.","mla":"Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–52, doi:10.1109/ICRA40945.2020.9196608.","ama":"Lechner M, Hasani R, Rus D, Grosu R. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In: Proceedings - IEEE International Conference on Robotics and Automation. IEEE; 2020:5446-5452. doi:10.1109/ICRA40945.2020.9196608","apa":"Lechner, M., Hasani, R., Rus, D., & Grosu, R. (2020). Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In Proceedings - IEEE International Conference on Robotics and Automation (pp. 5446–5452). Paris, France: IEEE. https://doi.org/10.1109/ICRA40945.2020.9196608","short":"M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–5452.","ieee":"M. Lechner, R. Hasani, D. Rus, and R. Grosu, “Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme,” in Proceedings - IEEE International Conference on Robotics and Automation, Paris, France, 2020, pp. 5446–5452."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","scopus_import":"1","alternative_title":["ICRA"],"month":"05","abstract":[{"lang":"eng","text":"Traditional robotic control suits require profound task-specific knowledge for designing, building and testing control software. The rise of Deep Learning has enabled end-to-end solutions to be learned entirely from data, requiring minimal knowledge about the application area. We design a learning scheme to train end-to-end linear dynamical systems (LDS)s by gradient descent in imitation learning robotic domains. We introduce a new regularization loss component together with a learning algorithm that improves the stability of the learned autonomous system, by forcing the eigenvalues of the internal state updates of an LDS to be negative reals. We evaluate our approach on a series of real-life and simulated robotic experiments, in comparison to linear and nonlinear Recurrent Neural Network (RNN) architectures. Our results show that our stabilizing method significantly improves test performance of LDS, enabling such linear models to match the performance of contemporary nonlinear RNN architectures. A video of the obstacle avoidance performance of our method on a mobile robot, in unseen environments, compared to other methods can be viewed at https://youtu.be/mhEsCoNao5E."}],"oa_version":"Submitted Version","publication_status":"published","publication_identifier":{"issn":["10504729"],"isbn":["9781728173955"]},"language":[{"iso":"eng"}],"file":[{"file_size":1070010,"date_updated":"2020-11-06T10:58:49Z","creator":"dernst","file_name":"2020_ICRA_Lechner.pdf","date_created":"2020-11-06T10:58:49Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"8733","checksum":"fccf7b986ac78046918a298cc6849a50"}],"conference":{"start_date":"2020-05-31","location":"Paris, France","end_date":"2020-08-31","name":"ICRA: International Conference on Robotics and Automation"},"type":"conference","status":"public","_id":"8704","department":[{"_id":"ToHe"}],"file_date_updated":"2020-11-06T10:58:49Z","date_updated":"2023-08-22T10:40:15Z","ddc":["000"]},{"department":[{"_id":"ToHe"}],"date_updated":"2023-08-22T12:48:18Z","status":"public","conference":{"start_date":"2020-12-02","location":"Virtual Conference","end_date":"2020-12-04","name":"MEMOCODE: Conference on Formal Methods and Models for System Design"},"type":"conference","_id":"8750","ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781728191485"]},"month":"12","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.12325"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"Efficiently handling time-triggered and possibly nondeterministic switches\r\nfor hybrid systems reachability is a challenging task. In this paper we present\r\nan approach based on conservative set-based enclosure of the dynamics that can\r\nhandle systems with uncertain parameters and inputs, where the uncertainties\r\nare bound to given intervals. The method is evaluated on the plant model of an\r\nexperimental electro-mechanical braking system with periodic controller. In\r\nthis model, the fast-switching controller dynamics requires simulation time\r\nscales of the order of nanoseconds. Accurate set-based computations for\r\nrelatively large time horizons are known to be expensive. However, by\r\nappropriately decoupling the time variable with respect to the spatial\r\nvariables, and enclosing the uncertain parameters using interval matrix maps\r\nacting on zonotopes, we show that the computation time can be lowered to 5000\r\ntimes faster with respect to previous works. This is a step forward in formal\r\nverification of hybrid systems because reduced run-times allow engineers to\r\nintroduce more expressiveness in their models with a relatively inexpensive\r\ncomputational cost.","lang":"eng"}],"title":"Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions","external_id":{"arxiv":["2006.12325"],"isi":["000661920400013"]},"article_processing_charge":"No","author":[{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"first_name":"Daniel","full_name":"Freire, Daniel","last_name":"Freire"},{"last_name":"Schilling","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Forets, Marcelo, et al. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with Time-Triggered Transitions.” 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, 9314994, IEEE, 2020, doi:10.1109/MEMOCODE51338.2020.9314994.","ama":"Forets M, Freire D, Schilling C. Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions. In: 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. IEEE; 2020. doi:10.1109/MEMOCODE51338.2020.9314994","apa":"Forets, M., Freire, D., & Schilling, C. (2020). Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions. In 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. Virtual Conference: IEEE. https://doi.org/10.1109/MEMOCODE51338.2020.9314994","ieee":"M. Forets, D. Freire, and C. Schilling, “Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions,” in 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, Virtual Conference, 2020.","short":"M. Forets, D. Freire, C. Schilling, in:, 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, IEEE, 2020.","chicago":"Forets, Marcelo, Daniel Freire, and Christian Schilling. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with Time-Triggered Transitions.” In 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. IEEE, 2020. https://doi.org/10.1109/MEMOCODE51338.2020.9314994.","ista":"Forets M, Freire D, Schilling C. 2020. Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions. 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. MEMOCODE: Conference on Formal Methods and Models for System Design, 9314994."},"project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_number":"9314994","date_created":"2020-11-10T07:04:57Z","doi":"10.1109/MEMOCODE51338.2020.9314994","date_published":"2020-12-04T00:00:00Z","publication":"18th ACM-IEEE International Conference on Formal Methods and Models for System Design","day":"04","year":"2020","isi":1,"oa":1,"publisher":"IEEE","quality_controlled":"1"},{"year":"2020","has_accepted_license":"1","publication":"Proceedings of the International Conference on Embedded Software","date_created":"2020-08-24T12:56:20Z","date_published":"2020-01-01T00:00:00Z","oa":1,"quality_controlled":"1","citation":{"mla":"Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” Proceedings of the International Conference on Embedded Software, 2020.","ieee":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “Reachability analysis of linear hybrid systems via block decomposition,” in Proceedings of the International Conference on Embedded Software, Virtual , 2020.","short":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, in:, Proceedings of the International Conference on Embedded Software, 2020.","apa":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., & Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. In Proceedings of the International Conference on Embedded Software. Virtual .","ama":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. Reachability analysis of linear hybrid systems via block decomposition. In: Proceedings of the International Conference on Embedded Software. ; 2020.","chicago":"Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” In Proceedings of the International Conference on Embedded Software, 2020.","ista":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2020. Reachability analysis of linear hybrid systems via block decomposition. Proceedings of the International Conference on Embedded Software. EMSOFT: International Conference on Embedded Software."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","external_id":{"arxiv":["1905.02458"]},"author":[{"first_name":"Sergiy","last_name":"Bogomolov","full_name":"Bogomolov, Sergiy"},{"first_name":"Marcelo","full_name":"Forets, Marcelo","last_name":"Forets"},{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"last_name":"Potomkin","full_name":"Potomkin, Kostiantyn","first_name":"Kostiantyn"},{"first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian"}],"title":"Reachability analysis of linear hybrid systems via block decomposition","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z00312"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_name":"2020EMSOFT.pdf","date_created":"2020-08-24T12:53:15Z","creator":"cschilli","file_size":696384,"date_updated":"2020-08-24T12:53:15Z","success":1,"file_id":"8288","checksum":"d19e97d0f8a3a441dc078ec812297d75","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"ec_funded":1,"related_material":{"record":[{"status":"public","id":"8790","relation":"later_version"}]},"abstract":[{"text":"Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous and discrete post operators to compute states reachable according to continuous and discrete dynamics, respectively. In this paper, we enhance both of these operators and make sure that most of the involved computations are performed in low-dimensional state space. In particular, we improve the continuous-post operator by performing computations in high-dimensional state space only for time intervals relevant for the subsequent application of the discrete-post operator. Furthermore, the new discrete-post operator performs low-dimensional computations by leveraging the structure of the guard and assignment of a considered transition. We illustrate the potential of our approach on a number of challenging benchmarks.","lang":"eng"}],"oa_version":"Preprint","date_updated":"2023-08-22T13:27:32Z","ddc":["000"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-08-24T12:53:15Z","_id":"8287","conference":{"start_date":"2020-09-20","location":"Virtual ","end_date":"2020-09-25","name":"EMSOFT: International Conference on Embedded Software"},"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)"},"type":"conference","keyword":["reachability","hybrid systems","decomposition"],"status":"public"},{"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["19374151"],"issn":["02780070"]},"ec_funded":1,"volume":39,"issue":"11","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"8287"}]},"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous and discrete post operators to compute states reachable according to continuous and discrete dynamics, respectively. In this article, we enhance both of these operators and make sure that most of the involved computations are performed in low-dimensional state space. In particular, we improve the continuous-post operator by performing computations in high-dimensional state space only for time intervals relevant for the subsequent application of the discrete-post operator. Furthermore, the new discrete-post operator performs low-dimensional computations by leveraging the structure of the guard and assignment of a considered transition. We illustrate the potential of our approach on a number of challenging benchmarks."}],"intvolume":" 39","month":"11","main_file_link":[{"url":"https://arxiv.org/abs/1905.02458","open_access":"1"}],"scopus_import":"1","date_updated":"2023-08-22T13:27:33Z","department":[{"_id":"ToHe"}],"_id":"8790","status":"public","type":"journal_article","article_type":"original","publication":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","day":"01","year":"2020","isi":1,"date_created":"2020-11-22T23:01:25Z","doi":"10.1109/TCAD.2020.3012859","date_published":"2020-11-01T00:00:00Z","page":"4018-4029","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, and the Air Force Office of Scientific Research under award number FA2386-17-1-4065. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the United States Air Force. ","oa":1,"quality_controlled":"1","publisher":"IEEE","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 4018–29, doi:10.1109/TCAD.2020.3012859.","ama":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2020;39(11):4018-4029. doi:10.1109/TCAD.2020.3012859","apa":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., & Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE. https://doi.org/10.1109/TCAD.2020.3012859","ieee":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “Reachability analysis of linear hybrid systems via block decomposition,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11. IEEE, pp. 4018–4029, 2020.","short":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39 (2020) 4018–4029.","chicago":"Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE, 2020. https://doi.org/10.1109/TCAD.2020.3012859.","ista":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2020. Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39(11), 4018–4029."},"title":"Reachability analysis of linear hybrid systems via block decomposition","external_id":{"arxiv":["1905.02458"],"isi":["000587712700072"]},"article_processing_charge":"No","author":[{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","last_name":"Bogomolov"},{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"last_name":"Potomkin","full_name":"Potomkin, Kostiantyn","first_name":"Kostiantyn"},{"last_name":"Schilling","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}]},{"year":"2020","day":"03","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","page":"1798-1805","doi":"10.1609/aaai.v34i02.5546","date_published":"2020-04-03T00:00:00Z","date_created":"2021-02-25T09:05:18Z","acknowledgement":"This research was supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).","quality_controlled":"1","publisher":"Association for the Advancement of Artificial Intelligence","citation":{"chicago":"Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546.","ista":"Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.","mla":"Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.","short":"G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.","ieee":"G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.","apa":"Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i02.5546","ama":"Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805. doi:10.1609/aaai.v34i02.5546"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec"}],"external_id":{"arxiv":["1911.08360"]},"article_processing_charge":"No","title":"All-pay bidding games on graphs","project":[{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369"}],"publication_identifier":{"issn":["2159-5399"],"isbn":["9781577358350"],"eissn":["2374-3468"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"02","volume":34,"abstract":[{"text":"In this paper we introduce and study all-pay bidding games, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn, each player submits a sealed legal bid (non-negative and below their remaining budget), which is deducted from their budget and the highest bidder moves the token onto an adjacent vertex. The game ends once a sink is reached, and Player 1 pays Player 2 the outcome that is associated with the sink. The players attempt to maximize their expected outcome. Our games model settings where effort (of no inherent value) needs to be invested in an ongoing and stateful manner. On the negative side, we show that even in simple games on DAGs, optimal strategies may require a distribution over bids with infinite support. A central quantity in bidding games is the ratio of the players budgets. On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio. We also implement it, show that it performs well, and suggests interesting properties of these games. Then, given an outcome c, we show an algorithm for finding the necessary and sufficient initial ratio for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally, while the general case has not previously been studied, solving the specific game in which Player 1 wins iff he wins the first two auctions, has been long stated as an open question, which we solve.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","month":"04","intvolume":" 34","date_updated":"2023-09-05T12:40:00Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"9197","article_type":"original","type":"journal_article","conference":{"location":"New York, NY, United States","end_date":"2020-02-12","start_date":"2020-02-07","name":"AAAI: Conference on Artificial Intelligence"},"status":"public"},{"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Henzinger TA, Sarac NE. Monitorability under assumptions. In: Runtime Verification. Vol 12399. Springer Nature; 2020:3-18. doi:10.1007/978-3-030-60508-7_1","apa":"Henzinger, T. A., & Sarac, N. E. (2020). Monitorability under assumptions. In Runtime Verification (Vol. 12399, pp. 3–18). Los Angeles, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-030-60508-7_1","short":"T.A. Henzinger, N.E. Sarac, in:, Runtime Verification, Springer Nature, 2020, pp. 3–18.","ieee":"T. A. Henzinger and N. E. Sarac, “Monitorability under assumptions,” in Runtime Verification, Los Angeles, CA, United States, 2020, vol. 12399, pp. 3–18.","mla":"Henzinger, Thomas A., and Naci E. Sarac. “Monitorability under Assumptions.” Runtime Verification, vol. 12399, Springer Nature, 2020, pp. 3–18, doi:10.1007/978-3-030-60508-7_1.","ista":"Henzinger TA, Sarac NE. 2020. Monitorability under assumptions. Runtime Verification. RV: Runtime Verification, LNCS, vol. 12399, 3–18.","chicago":"Henzinger, Thomas A, and Naci E Sarac. “Monitorability under Assumptions.” In Runtime Verification, 12399:3–18. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-60508-7_1."},"title":"Monitorability under assumptions","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"last_name":"Sarac","full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E"}],"article_processing_charge":"No","external_id":{"isi":["000728160600001"]},"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","quality_controlled":"1","publisher":"Springer Nature","oa":1,"day":"02","publication":"Runtime Verification","isi":1,"has_accepted_license":"1","year":"2020","doi":"10.1007/978-3-030-60508-7_1","date_published":"2020-10-02T00:00:00Z","date_created":"2020-10-07T15:05:37Z","page":"3-18","_id":"8623","status":"public","type":"conference","conference":{"start_date":"2020-10-06","end_date":"2020-10-09","location":"Los Angeles, CA, United States","name":"RV: Runtime Verification"},"ddc":["000"],"date_updated":"2023-09-05T15:08:26Z","file_date_updated":"2020-10-15T14:28:06Z","department":[{"_id":"ToHe"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We introduce the monitoring of trace properties under assumptions. An assumption limits the space of possible traces that the monitor may encounter. An assumption may result from knowledge about the system that is being monitored, about the environment, or about another, connected monitor. We define monitorability under assumptions and study its theoretical properties. In particular, we show that for every assumption A, the boolean combinations of properties that are safe or co-safe relative to A are monitorable under A. We give several examples and constructions on how an assumption can make a non-monitorable property monitorable, and how an assumption can make a monitorable property monitorable with fewer resources, such as integer registers."}],"month":"10","intvolume":" 12399","scopus_import":"1","alternative_title":["LNCS"],"file":[{"checksum":"00661f9b7034f52e18bf24fa552b8194","file_id":"8665","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-10-15T14:28:06Z","file_name":"monitorability.pdf","creator":"esarac","date_updated":"2020-10-15T14:28:06Z","file_size":478148}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030605070","9783030605087"]},"publication_status":"published","volume":12399},{"day":"14","publication":"Computer Aided Verification","isi":1,"has_accepted_license":"1","year":"2020","doi":"10.1007/978-3-030-53288-8_14","date_published":"2020-07-14T00:00:00Z","date_created":"2020-08-03T11:45:35Z","page":"275-298","acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","quality_controlled":"1","publisher":"Springer Nature","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.” In Computer Aided Verification, 12224:275–98. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-53288-8_14.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298.","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in Computer Aided Verification, 2020, vol. 12224, pp. 275–298.","apa":"Kragl, B., Qadeer, S., & Henzinger, T. A. (2020). Refinement for structured concurrent programs. In Computer Aided Verification (Vol. 12224, pp. 275–298). Springer Nature. https://doi.org/10.1007/978-3-030-53288-8_14","ama":"Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs. In: Computer Aided Verification. Vol 12224. Springer Nature; 2020:275-298. doi:10.1007/978-3-030-53288-8_14","mla":"Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” Computer Aided Verification, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:10.1007/978-3-030-53288-8_14."},"title":"Refinement for structured concurrent programs","author":[{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","last_name":"Kragl"},{"last_name":"Qadeer","full_name":"Qadeer, Shaz","first_name":"Shaz"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"article_processing_charge":"No","external_id":{"isi":["000695276000014"]},"project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"file":[{"date_updated":"2020-08-06T08:14:54Z","file_size":804237,"creator":"dernst","date_created":"2020-08-06T08:14:54Z","file_name":"2020_LNCS_Kragl.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"8201","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["9783030532888"],"issn":["0302-9743"],"isbn":["9783030532871"],"eissn":["1611-3349"]},"publication_status":"published","related_material":{"record":[{"id":"8332","status":"public","relation":"dissertation_contains"}]},"volume":12224,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"This paper presents a foundation for refining concurrent programs with structured control flow. The verification problem is decomposed into subproblems that aid interactive program development, proof reuse, and automation. The formalization in this paper is the basis of a new design and implementation of the Civl verifier."}],"month":"07","intvolume":" 12224","scopus_import":"1","alternative_title":["LNCS"],"ddc":["000"],"date_updated":"2023-09-07T13:18:00Z","file_date_updated":"2020-08-06T08:14:54Z","department":[{"_id":"ToHe"}],"_id":"8195","status":"public","type":"conference","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)"}},{"_id":"8012","status":"public","conference":{"start_date":"2020-06-15","end_date":"2020-06-20","location":"London, United Kingdom","name":"PLDI: Programming Language Design and Implementation"},"type":"conference","date_updated":"2023-09-07T13:18:00Z","department":[{"_id":"ToHe"}],"oa_version":"Published Version","abstract":[{"text":"Asynchronous programs are notoriously difficult to reason about because they spawn computation tasks which take effect asynchronously in a nondeterministic way. Devising inductive invariants for such programs requires understanding and stating complex relationships between an unbounded number of computation tasks in arbitrarily long executions. In this paper, we introduce inductive sequentialization, a new proof rule that sidesteps this complexity via a sequential reduction, a sequential program that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed. We have implemented and integrated our proof rule in the CIVL verifier, allowing us to provably derive fine-grained implementations of asynchronous programs. We have successfully applied our proof rule to a diverse set of message-passing protocols, including leader election protocols, two-phase commit, and Paxos.","lang":"eng"}],"month":"06","main_file_link":[{"url":"https://doi.org/10.1145/3385412.3385980","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781450376136"]},"related_material":{"record":[{"status":"public","id":"8332","relation":"dissertation_contains"}]},"project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ieee":"B. Kragl, C. Enea, T. A. Henzinger, S. O. Mutluergil, and S. Qadeer, “Inductive sequentialization of asynchronous programs,” in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 2020, pp. 227–242.","short":"B. Kragl, C. Enea, T.A. Henzinger, S.O. Mutluergil, S. Qadeer, in:, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–242.","apa":"Kragl, B., Enea, C., Henzinger, T. A., Mutluergil, S. O., & Qadeer, S. (2020). Inductive sequentialization of asynchronous programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 227–242). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385980","ama":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. Inductive sequentialization of asynchronous programs. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2020:227-242. doi:10.1145/3385412.3385980","mla":"Kragl, Bernhard, et al. “Inductive Sequentialization of Asynchronous Programs.” Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–42, doi:10.1145/3385412.3385980.","ista":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. 2020. Inductive sequentialization of asynchronous programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 227–242.","chicago":"Kragl, Bernhard, Constantin Enea, Thomas A Henzinger, Suha Orhun Mutluergil, and Shaz Qadeer. “Inductive Sequentialization of Asynchronous Programs.” In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 227–42. Association for Computing Machinery, 2020. https://doi.org/10.1145/3385412.3385980."},"title":"Inductive sequentialization of asynchronous programs","external_id":{"isi":["000614622300016"]},"article_processing_charge":"No","author":[{"last_name":"Kragl","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard"},{"full_name":"Enea, Constantin","last_name":"Enea","first_name":"Constantin"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mutluergil, Suha Orhun","last_name":"Mutluergil","first_name":"Suha Orhun"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","publication":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation","day":"01","year":"2020","isi":1,"date_created":"2020-06-25T11:40:16Z","doi":"10.1145/3385412.3385980","date_published":"2020-06-01T00:00:00Z","page":"227-242"}]