[{"file":[{"creator":"esarac","file_id":"9557","success":1,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"qam.pdf","date_updated":"2021-06-16T08:23:54Z","file_size":641990,"checksum":"6e4cba3f72775f479c5b1b75d1a4a0c4","date_created":"2021-06-16T08:23:54Z"}],"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"date_published":"2021-06-29T00:00:00Z","type":"conference","conference":{"start_date":"2021-06-29","name":"LICS: Symposium on Logic in Computer Science","end_date":"2021-07-02","location":"Online"},"language":[{"iso":"eng"}],"oa_version":"Published Version","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"month":"06","article_number":"9470547","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","has_accepted_license":"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).","ddc":["000"],"arxiv":1,"doi":"10.1109/LICS52264.2021.9470547","day":"29","abstract":[{"lang":"eng","text":"In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision."}],"date_updated":"2023-08-08T13:52:56Z","year":"2021","citation":{"mla":"Henzinger, Thomas A., and Naci E. Sarac. “Quantitative and Approximate Monitoring.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 9470547, Institute of Electrical and Electronics Engineers, 2021, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>.","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.","ista":"Henzinger TA, Sarac NE. 2021. Quantitative and approximate monitoring. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 9470547.","apa":"Henzinger, T. A., &#38; Sarac, N. E. (2021). Quantitative and approximate monitoring. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Online: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>","ama":"Henzinger TA, Sarac NE. Quantitative and approximate monitoring. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers; 2021. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>","ieee":"T. A. Henzinger and N. E. Sarac, “Quantitative and approximate monitoring,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Online, 2021.","chicago":"Henzinger, Thomas A, and Naci E Sarac. “Quantitative and Approximate Monitoring.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>."},"isi":1,"external_id":{"isi":["000947350400021"],"arxiv":["2105.08353"]},"publisher":"Institute of Electrical and Electronics Engineers","quality_controlled":"1","file_date_updated":"2021-06-16T08:23:54Z","publication_status":"published","date_created":"2021-04-30T17:30:47Z","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"title":"Quantitative and approximate monitoring","_id":"9356","scopus_import":"1","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E","last_name":"Sarac","first_name":"Naci E"}]},{"ddc":["004"],"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).","volume":893,"isi":1,"external_id":{"isi":["000710180500002"]},"date_updated":"2023-08-10T14:11:19Z","citation":{"ista":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. 2021. Long lived transients in gene regulation. Theoretical Computer Science. 893, 1–16.","mla":"Petrov, Tatjana, et al. “Long Lived Transients in Gene Regulation.” <i>Theoretical Computer Science</i>, vol. 893, Elsevier, 2021, pp. 1–16, doi:<a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">10.1016/j.tcs.2021.05.023</a>.","short":"T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer Science 893 (2021) 1–16.","chicago":"Petrov, Tatjana, Claudia Igler, Ali Sezgin, Thomas A Henzinger, and Calin C Guet. “Long Lived Transients in Gene Regulation.” <i>Theoretical Computer Science</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">https://doi.org/10.1016/j.tcs.2021.05.023</a>.","ieee":"T. Petrov, C. Igler, A. Sezgin, T. A. Henzinger, and C. C. Guet, “Long lived transients in gene regulation,” <i>Theoretical Computer Science</i>, vol. 893. Elsevier, pp. 1–16, 2021.","ama":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. Long lived transients in gene regulation. <i>Theoretical Computer Science</i>. 2021;893:1-16. doi:<a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">10.1016/j.tcs.2021.05.023</a>","apa":"Petrov, T., Igler, C., Sezgin, A., Henzinger, T. A., &#38; Guet, C. C. (2021). Long lived transients in gene regulation. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2021.05.023\">https://doi.org/10.1016/j.tcs.2021.05.023</a>"},"year":"2021","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"}],"doi":"10.1016/j.tcs.2021.05.023","day":"04","file_date_updated":"2022-05-12T12:13:27Z","page":"1-16","quality_controlled":"1","article_type":"original","publisher":"Elsevier","author":[{"full_name":"Petrov, Tatjana","first_name":"Tatjana","last_name":"Petrov"},{"id":"46613666-F248-11E8-B48F-1D18A9856A87","full_name":"Igler, Claudia","first_name":"Claudia","last_name":"Igler"},{"full_name":"Sezgin, Ali","last_name":"Sezgin","first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","first_name":"Calin C","last_name":"Guet"}],"_id":"9647","scopus_import":"1","title":"Long lived transients in gene regulation","intvolume":"       893","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"date_created":"2021-07-11T22:01:18Z","article_processing_charge":"No","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"success":1,"access_level":"open_access","relation":"main_file","file_id":"11364","creator":"dernst","date_created":"2022-05-12T12:13:27Z","file_size":2566504,"checksum":"d3aef34cfb13e53bba4cf44d01680793","date_updated":"2022-05-12T12:13:27Z","content_type":"application/pdf","file_name":"2021_TheoreticalComputerScience_Petrov.pdf"}],"date_published":"2021-06-04T00:00:00Z","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"publication_identifier":{"issn":["0304-3975"]},"language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","has_accepted_license":"1","month":"06","oa_version":"Published Version","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}]},{"place":"Cham","file":[{"relation":"main_file","success":1,"access_level":"open_access","creator":"fmuehlbo","file_id":"10109","file_size":350632,"checksum":"554c7fdb259eda703a8b6328a6dad55a","date_created":"2021-10-07T23:32:18Z","file_name":"differentialmonitoring-cameraready-openaccess.pdf","content_type":"application/pdf","date_updated":"2021-10-07T23:32:18Z"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"status":"public","id":"9946","relation":"extended_version"}]},"status":"public","publication_identifier":{"isbn":["978-3-030-88493-2"],"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["978-3-030-88494-9"]},"oa":1,"type":"conference","date_published":"2021-10-06T00:00:00Z","conference":{"location":"Virtual","end_date":"2021-10-14","start_date":"2021-10-11","name":"RV: Runtime Verification"},"keyword":["run-time verification","software engineering","implicit specification"],"language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"oa_version":"Preprint","month":"10","has_accepted_license":"1","publication":"International Conference on Runtime Verification","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.","volume":12974,"ddc":["005"],"day":"06","doi":"10.1007/978-3-030-88494-9_12","abstract":[{"text":"We argue that the time is ripe to investigate differential monitoring, in which the specification of a program's behavior is implicitly given by a second program implementing the same informal specification. Similar ideas have been proposed before, and are currently implemented in restricted form for testing and specialized run-time analyses, aspects of which we combine. We discuss the challenges of implementing differential monitoring as a general-purpose, black-box run-time monitoring framework, and present promising results of a preliminary implementation, showing low monitoring overheads for diverse programs.","lang":"eng"}],"citation":{"chicago":"Mühlböck, Fabian, and Thomas A Henzinger. “Differential Monitoring.” In <i>International Conference on Runtime Verification</i>, 12974:231–43. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">https://doi.org/10.1007/978-3-030-88494-9_12</a>.","ieee":"F. Mühlböck and T. A. Henzinger, “Differential monitoring,” in <i>International Conference on Runtime Verification</i>, Virtual, 2021, vol. 12974, pp. 231–243.","apa":"Mühlböck, F., &#38; Henzinger, T. A. (2021). Differential monitoring. In <i>International Conference on Runtime Verification</i> (Vol. 12974, pp. 231–243). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">https://doi.org/10.1007/978-3-030-88494-9_12</a>","ama":"Mühlböck F, Henzinger TA. Differential monitoring. In: <i>International Conference on Runtime Verification</i>. Vol 12974. Cham: Springer Nature; 2021:231-243. doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">10.1007/978-3-030-88494-9_12</a>","ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring. International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 231–243.","short":"F. Mühlböck, T.A. Henzinger, in:, International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 231–243.","mla":"Mühlböck, Fabian, and Thomas A. Henzinger. “Differential Monitoring.” <i>International Conference on Runtime Verification</i>, vol. 12974, Springer Nature, 2021, pp. 231–43, doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_12\">10.1007/978-3-030-88494-9_12</a>."},"year":"2021","date_updated":"2023-08-14T07:20:30Z","external_id":{"isi":["000719383800012"]},"isi":1,"publisher":"Springer Nature","quality_controlled":"1","page":"231-243","file_date_updated":"2021-10-07T23:32:18Z","date_created":"2021-10-07T23:30:10Z","article_processing_charge":"No","department":[{"_id":"ToHe"}],"publication_status":"published","intvolume":"     12974","alternative_title":["LNCS"],"title":"Differential monitoring","scopus_import":"1","_id":"10108","author":[{"id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","last_name":"Mühlböck","first_name":"Fabian","full_name":"Mühlböck, Fabian","orcid":"0000-0003-1548-0177"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"}]},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"date_published":"2021-10-15T00:00:00Z","type":"journal_article","publication_identifier":{"eissn":["2475-1421"]},"oa":1,"file":[{"date_created":"2021-10-19T12:52:23Z","checksum":"71011efd2da771cafdec7f0d9693f8c1","file_size":770269,"date_updated":"2021-10-19T12:52:23Z","file_name":"monnom-oopsla21.pdf","content_type":"application/pdf","success":1,"access_level":"open_access","relation":"main_file","file_id":"10154","creator":"fmuehlbo"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","publication":"Proceedings of the ACM on Programming Languages","has_accepted_license":"1","oa_version":"Published Version","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"month":"10","article_number":"127","language":[{"iso":"eng"}],"keyword":["gradual typing","gradual guarantee","nominal","structural","call tags"],"conference":{"start_date":"2021-10-17","name":"OOPSLA: Object-Oriented Programming, Systems, Languages, and Applications","location":"Chicago, IL, United States","end_date":"2021-10-23"},"date_updated":"2021-11-12T11:30:07Z","year":"2021","citation":{"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.","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.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, 127, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3485504\">10.1145/3485504</a>.","chicago":"Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485504\">https://doi.org/10.1145/3485504</a>.","ieee":"F. Mühlböck and R. Tate, “Transitioning from structural to nominal code with efficient gradual typing,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5. Association for Computing Machinery, 2021.","apa":"Mühlböck, F., &#38; Tate, R. (2021). Transitioning from structural to nominal code with efficient gradual typing. <i>Proceedings of the ACM on Programming Languages</i>. Chicago, IL, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485504\">https://doi.org/10.1145/3485504</a>","ama":"Mühlböck F, Tate R. Transitioning from structural to nominal code with efficient gradual typing. <i>Proceedings of the ACM on Programming Languages</i>. 2021;5. doi:<a href=\"https://doi.org/10.1145/3485504\">10.1145/3485504</a>"},"doi":"10.1145/3485504","day":"15","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."}],"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.","volume":5,"ddc":["005"],"_id":"10153","license":"https://creativecommons.org/licenses/by-nd/4.0/","author":[{"id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","full_name":"Mühlböck, Fabian","orcid":"0000-0003-1548-0177","last_name":"Mühlböck","first_name":"Fabian"},{"last_name":"Tate","first_name":"Ross","full_name":"Tate, Ross"}],"publication_status":"published","date_created":"2021-10-19T12:48:44Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","title":"Transitioning from structural to nominal code with efficient gradual typing","intvolume":"         5","quality_controlled":"1","file_date_updated":"2021-10-19T12:52:23Z","publisher":"Association for Computing Machinery","article_type":"original"},{"month":"10","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"oa_version":"Preprint","publication":"21st International Conference on Runtime Verification","conference":{"name":"RV: Runtime Verification","start_date":"2021-10-11","end_date":"2021-10-14","location":"Virtual"},"keyword":["monitoring","neural networks","novelty detection"],"language":[{"iso":"eng"}],"oa":1,"publication_identifier":{"isbn":["9-783-0308-8493-2"],"eisbn":["978-3-030-88494-9"],"eissn":["1611-3349"],"issn":["0302-9743"]},"type":"conference","date_published":"2021-10-06T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"id":"13234","relation":"extended_version","status":"public"}]},"status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.06429"}],"place":"Cham","alternative_title":["LNCS"],"title":"Into the unknown: active monitoring of neural networks","date_created":"2021-10-31T23:01:31Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","publication_status":"published","author":[{"id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","full_name":"Lukina, Anna","first_name":"Anna","last_name":"Lukina"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","last_name":"Schilling","first_name":"Christian"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"}],"scopus_import":"1","_id":"10206","publisher":"Springer Nature","ec_funded":1,"quality_controlled":"1","page":"42-61","abstract":[{"lang":"eng","text":"Neural-network classifiers achieve high accuracy when predicting the class of an input that they were trained to identify. Maintaining this accuracy in dynamic environments, where inputs frequently fall outside the fixed set of initially known classes, remains a challenge. The typical approach is to detect inputs from novel classes and retrain the classifier on an augmented dataset. However, not only the classifier but also the detection mechanism needs to adapt in order to distinguish between newly learned and yet unknown input classes. To address this challenge, we introduce an algorithmic framework for active monitoring of a neural network. A monitor wrapped in our framework operates in parallel with the neural network and interacts with a human user via a series of interpretable labeling queries for incremental adaptation. In addition, we propose an adaptive quantitative monitor to improve precision. An experimental evaluation on a diverse set of benchmarks with varying numbers of classes confirms the benefits of our active monitoring framework in dynamic scenarios."}],"day":"06","doi":"10.1007/978-3-030-88494-9_3","arxiv":1,"external_id":{"isi":["000719383800003"],"arxiv":["2009.06429"]},"isi":1,"year":"2021","citation":{"ama":"Lukina A, Schilling C, Henzinger TA. Into the unknown: active monitoring of neural networks. In: <i>21st International Conference on Runtime Verification</i>. Vol 12974. Cham: Springer Nature; 2021:42-61. doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>","apa":"Lukina, A., Schilling, C., &#38; Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In <i>21st International Conference on Runtime Verification</i> (Vol. 12974, pp. 42–61). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>","chicago":"Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks.” In <i>21st International Conference on Runtime Verification</i>, 12974:42–61. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>.","ieee":"A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: active monitoring of neural networks,” in <i>21st International Conference on Runtime Verification</i>, Virtual, 2021, vol. 12974, pp. 42–61.","mla":"Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.” <i>21st International Conference on Runtime Verification</i>, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>.","short":"A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.","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."},"date_updated":"2024-01-30T12:06:56Z","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.","volume":"12974 "},{"language":[{"iso":"eng"}],"publication":"Computer Graphics Forum","month":"11","oa_version":"Preprint","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/2110.07667","open_access":"1"}],"date_published":"2021-11-27T00:00:00Z","type":"journal_article","oa":1,"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"page":"253-264","quality_controlled":"1","article_type":"original","publisher":"Wiley","author":[{"full_name":"Sietzen, Stefan","first_name":"Stefan","last_name":"Sietzen"},{"full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Borowski","first_name":"Judy","full_name":"Borowski, Judy"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"full_name":"Waldner, Manuela","first_name":"Manuela","last_name":"Waldner"}],"issue":"7","_id":"10404","scopus_import":"1","title":"Interactive analysis of CNN robustness","intvolume":"        40","publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2021-12-05T23:01:40Z","article_processing_charge":"No","volume":40,"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","isi":1,"external_id":{"isi":["000722952000024"],"arxiv":["2110.07667"]},"date_updated":"2023-08-14T13:11:42Z","year":"2021","citation":{"mla":"Sietzen, Stefan, et al. “Interactive Analysis of CNN Robustness.” <i>Computer Graphics Forum</i>, vol. 40, no. 7, Wiley, 2021, pp. 253–64, doi:<a href=\"https://doi.org/10.1111/cgf.14418\">10.1111/cgf.14418</a>.","short":"S. Sietzen, M. Lechner, J. Borowski, R. Hasani, M. Waldner, Computer Graphics Forum 40 (2021) 253–264.","ista":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. 2021. Interactive analysis of CNN robustness. Computer Graphics Forum. 40(7), 253–264.","apa":"Sietzen, S., Lechner, M., Borowski, J., Hasani, R., &#38; Waldner, M. (2021). Interactive analysis of CNN robustness. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14418\">https://doi.org/10.1111/cgf.14418</a>","ama":"Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. Interactive analysis of CNN robustness. <i>Computer Graphics Forum</i>. 2021;40(7):253-264. doi:<a href=\"https://doi.org/10.1111/cgf.14418\">10.1111/cgf.14418</a>","chicago":"Sietzen, Stefan, Mathias Lechner, Judy Borowski, Ramin Hasani, and Manuela Waldner. “Interactive Analysis of CNN Robustness.” <i>Computer Graphics Forum</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/cgf.14418\">https://doi.org/10.1111/cgf.14418</a>.","ieee":"S. Sietzen, M. Lechner, J. Borowski, R. Hasani, and M. Waldner, “Interactive analysis of CNN robustness,” <i>Computer Graphics Forum</i>, vol. 40, no. 7. Wiley, pp. 253–264, 2021."},"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"}],"arxiv":1,"doi":"10.1111/cgf.14418","day":"27"},{"abstract":[{"text":"We argue that the time is ripe to investigate differential monitoring, in which the specification of a program's behavior is implicitly given by a second program implementing the same informal specification. Similar ideas have been proposed before, and are currently implemented in restricted form for testing and specialized run-time analyses, aspects of which we combine. We discuss the challenges of implementing differential monitoring as a general-purpose, black-box run-time monitoring framework, and present promising results of a preliminary implementation, showing low monitoring overheads for diverse programs.","lang":"eng"}],"day":"01","doi":"10.15479/AT:ISTA:9946","citation":{"short":"F. Mühlböck, T.A. Henzinger, Differential Monitoring, IST Austria, 2021.","mla":"Mühlböck, Fabian, and Thomas A. Henzinger. <i>Differential Monitoring</i>. IST Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9946\">10.15479/AT:ISTA:9946</a>.","ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring, IST Austria, 17p.","ama":"Mühlböck F, Henzinger TA. <i>Differential Monitoring</i>. IST Austria; 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9946\">10.15479/AT:ISTA:9946</a>","apa":"Mühlböck, F., &#38; Henzinger, T. A. (2021). <i>Differential monitoring</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9946\">https://doi.org/10.15479/AT:ISTA:9946</a>","chicago":"Mühlböck, Fabian, and Thomas A Henzinger. <i>Differential Monitoring</i>. IST Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9946\">https://doi.org/10.15479/AT:ISTA:9946</a>.","ieee":"F. Mühlböck and T. A. Henzinger, <i>Differential monitoring</i>. IST Austria, 2021."},"year":"2021","date_updated":"2023-08-14T07:20:29Z","ddc":["005"],"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.","alternative_title":["IST Austria Technical Report"],"title":"Differential monitoring","department":[{"_id":"ToHe"}],"article_processing_charge":"No","date_created":"2021-08-20T20:00:37Z","publication_status":"published","author":[{"id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","orcid":"0000-0003-1548-0177","full_name":"Mühlböck, Fabian","first_name":"Fabian","last_name":"Mühlböck"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"_id":"9946","publisher":"IST Austria","file_date_updated":"2021-09-03T12:34:28Z","page":"17","oa":1,"publication_identifier":{"issn":["2664-1690"]},"type":"technical_report","date_published":"2021-09-01T00:00:00Z","related_material":{"record":[{"relation":"other","id":"9281","status":"public"},{"relation":"shorter_version","id":"10108","status":"public"}]},"status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"file_name":"differentialmonitoring-techreport.pdf","content_type":"application/pdf","date_updated":"2021-09-03T12:34:28Z","checksum":"0f9aafd59444cb6bdca6925d163ab946","file_size":"320453","date_created":"2021-08-20T19:59:44Z","creator":"fmuehlbo","file_id":"9948","access_level":"open_access","relation":"main_file"}],"month":"09","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"oa_version":"Published Version","has_accepted_license":"1","keyword":["run-time verification","software engineering","implicit specification"],"language":[{"iso":"eng"}]},{"ddc":["000"],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n","abstract":[{"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.","lang":"eng"}],"day":"11","citation":{"apa":"Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In <i>8th International Conference on Learning Representations</i>. Virtual ; Addis Ababa, Ethiopia: ICLR.","ama":"Lechner M. Learning representations for binary-classification without backpropagation. In: <i>8th International Conference on Learning Representations</i>. ICLR; 2020.","chicago":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In <i>8th International Conference on Learning Representations</i>. ICLR, 2020.","ieee":"M. Lechner, “Learning representations for binary-classification without backpropagation,” in <i>8th International Conference on Learning Representations</i>, Virtual ; Addis Ababa, Ethiopia, 2020.","mla":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” <i>8th International Conference on Learning Representations</i>, ICLR, 2020.","short":"M. Lechner, 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."},"year":"2020","date_updated":"2023-04-03T07:33:40Z","publisher":"ICLR","file_date_updated":"2022-01-26T07:35:17Z","quality_controlled":"1","title":"Learning representations for binary-classification without backpropagation","date_created":"2022-01-25T15:50:00Z","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_status":"published","author":[{"first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","scopus_import":"1","_id":"10672","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"date_updated":"2022-01-26T07:35:17Z","content_type":"application/pdf","file_name":"iclr_2020.pdf","date_created":"2022-01-26T07:35:17Z","file_size":249431,"checksum":"ea13d42dd4541ddb239b6a75821fd6c9","file_id":"10677","creator":"mlechner","access_level":"open_access","relation":"main_file","success":1}],"main_file_link":[{"url":"https://openreview.net/forum?id=Bke61krFvS","open_access":"1"}],"oa":1,"type":"conference","date_published":"2020-03-11T00:00:00Z","tmp":{"short":"CC BY-NC-ND (3.0)","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"},"conference":{"start_date":"2020-04-26","name":"ICLR: International Conference on Learning Representations","end_date":"2020-05-01","location":"Virtual ; Addis Ababa, Ethiopia"},"language":[{"iso":"eng"}],"month":"03","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"oa_version":"Published Version","has_accepted_license":"1","publication":"8th International Conference on Learning Representations"},{"publication":"Proceedings of the 37th International Conference on Machine Learning","has_accepted_license":"1","oa_version":"Published Version","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"language":[{"iso":"eng"}],"conference":{"start_date":"2020-07-12","name":"ML: Machine Learning","end_date":"2020-07-18","location":"Virtual"},"date_published":"2020-01-01T00:00:00Z","type":"conference","tmp":{"short":"CC BY-NC-ND (3.0)","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"},"oa":1,"publication_identifier":{"issn":["2640-3498"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","file":[{"date_created":"2022-01-26T11:08:51Z","checksum":"c9a4a29161777fc1a89ef451c040e3b1","file_size":2329798,"date_updated":"2022-01-26T11:08:51Z","content_type":"application/pdf","file_name":"2020_PMLR_Hasani.pdf","success":1,"access_level":"open_access","relation":"main_file","file_id":"10691","creator":"cchlebak"}],"main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v119/hasani20a.html"}],"author":[{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"full_name":"Amini, Alexander","last_name":"Amini","first_name":"Alexander"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"_id":"10673","scopus_import":"1","alternative_title":["PMLR"],"title":"A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits","publication_status":"published","date_created":"2022-01-25T15:50:34Z","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file_date_updated":"2022-01-26T11:08:51Z","page":"4082-4093","series_title":"PMLR","quality_controlled":"1","date_updated":"2022-01-26T11:14:27Z","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.","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.” <i>Proceedings of the 37th International Conference on Machine Learning</i>, 2020, pp. 4082–93.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In <i>Proceedings of the 37th International Conference on Machine Learning</i>, 4082–93. PMLR, 2020.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in <i>Proceedings of the 37th International Conference on Machine Learning</i>, Virtual, 2020, pp. 4082–4093.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., &#38; Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In <i>Proceedings of the 37th International Conference on Machine Learning</i> (pp. 4082–4093). Virtual.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In: <i>Proceedings of the 37th International Conference on Machine Learning</i>. PMLR. ; 2020:4082-4093."},"year":"2020","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."}],"ddc":["000"],"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"},{"issue":"6","author":[{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"},{"first_name":"Olivier","last_name":"Lebeltel","full_name":"Lebeltel, Olivier"},{"first_name":"Oded","last_name":"Maler","full_name":"Maler, Oded"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143","last_name":"Ferrere","first_name":"Thomas"},{"first_name":"Dogan","last_name":"Ulus","full_name":"Ulus, Dogan"}],"scopus_import":"1","_id":"10861","intvolume":"        22","title":"AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic","department":[{"_id":"ToHe"}],"article_processing_charge":"No","date_created":"2022-03-18T10:10:53Z","publication_status":"published","quality_controlled":"1","page":"741-758","article_type":"original","publisher":"Springer Nature","external_id":{"isi":["000555398600001"]},"isi":1,"year":"2020","citation":{"ista":"Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. 2020. AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. International Journal on Software Tools for Technology Transfer. 22(6), 741–758.","mla":"Nickovic, Dejan, et al. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic.” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 22, no. 6, Springer Nature, 2020, pp. 741–58, doi:<a href=\"https://doi.org/10.1007/s10009-020-00582-z\">10.1007/s10009-020-00582-z</a>.","short":"D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, D. Ulus, International Journal on Software Tools for Technology Transfer 22 (2020) 741–758.","ieee":"D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, and D. Ulus, “AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic,” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 22, no. 6. Springer Nature, pp. 741–758, 2020.","chicago":"Nickovic, Dejan, Olivier Lebeltel, Oded Maler, Thomas Ferrere, and Dogan Ulus. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic.” <i>International Journal on Software Tools for Technology Transfer</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s10009-020-00582-z\">https://doi.org/10.1007/s10009-020-00582-z</a>.","ama":"Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. <i>International Journal on Software Tools for Technology Transfer</i>. 2020;22(6):741-758. doi:<a href=\"https://doi.org/10.1007/s10009-020-00582-z\">10.1007/s10009-020-00582-z</a>","apa":"Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., &#38; Ulus, D. (2020). AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. <i>International Journal on Software Tools for Technology Transfer</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10009-020-00582-z\">https://doi.org/10.1007/s10009-020-00582-z</a>"},"date_updated":"2023-09-08T11:52:02Z","abstract":[{"text":"We introduce in this paper AMT2.0, a tool for qualitative and quantitative analysis of hybrid continuous and Boolean signals that combine numerical values and discrete events. The evaluation of the signals is based on rich temporal specifications expressed in extended signal temporal logic, which integrates timed regular expressions within signal temporal logic. The tool features qualitative monitoring (property satisfaction checking), trace diagnostics for explaining and justifying property violations and specification-driven measurement of quantitative features of the signal. We demonstrate the tool functionality on several running examples and case studies, and evaluate its performance.","lang":"eng"}],"day":"03","doi":"10.1007/s10009-020-00582-z","volume":22,"publication":"International Journal on Software Tools for Technology Transfer","month":"08","oa_version":"None","keyword":["Information Systems","Software"],"language":[{"iso":"eng"}],"type":"journal_article","date_published":"2020-08-03T00:00:00Z","publication_identifier":{"eissn":["1433-2787"],"issn":["1433-2779"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"status":"public","id":"299","relation":"earlier_version"}]},"status":"public"},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"file":[{"access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"7893","checksum":"f19905a42891fe5ce93d69143fa3f6fb","file_size":2744030,"date_created":"2020-05-26T12:48:15Z","file_name":"2020_TACAS_Giacobbe.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:48:03Z"}],"oa":1,"publication_identifier":{"issn":["03029743"],"eissn":["16113349"],"isbn":["9783030452360"]},"type":"conference","date_published":"2020-04-17T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (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"},"language":[{"iso":"eng"}],"month":"04","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","has_accepted_license":"1","publication":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","ddc":["000"],"volume":12079,"abstract":[{"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.","lang":"eng"}],"day":"17","doi":"10.1007/978-3-030-45237-7_5","citation":{"ama":"Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize your neural network? In: <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 12079. Springer Nature; 2020:79-97. doi:<a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">10.1007/978-3-030-45237-7_5</a>","apa":"Giacobbe, M., Henzinger, T. A., &#38; Lechner, M. (2020). How many bits does it take to quantize your neural network? In <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 12079, pp. 79–97). Dublin, Ireland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">https://doi.org/10.1007/978-3-030-45237-7_5</a>","chicago":"Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits Does It Take to Quantize Your Neural Network?” In <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 12079:79–97. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">https://doi.org/10.1007/978-3-030-45237-7_5</a>.","ieee":"M. Giacobbe, T. A. Henzinger, and M. Lechner, “How many bits does it take to quantize your neural network?,” in <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Dublin, Ireland, 2020, vol. 12079, pp. 79–97.","mla":"Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural Network?” <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:<a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">10.1007/978-3-030-45237-7_5</a>.","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.","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."},"year":"2020","date_updated":"2023-06-23T07:01:11Z","publisher":"Springer Nature","file_date_updated":"2020-07-14T12:48:03Z","quality_controlled":"1","page":"79-97","intvolume":"     12079","alternative_title":["LNCS"],"title":"How many bits does it take to quantize your neural network?","date_created":"2020-05-10T22:00:49Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","publication_status":"published","author":[{"id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","last_name":"Giacobbe","first_name":"Mirco","full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"}],"scopus_import":1,"_id":"7808"},{"conference":{"location":"London, United Kingdom","end_date":"2020-06-20","start_date":"2020-06-15","name":"PLDI: Programming Language Design and Implementation"},"language":[{"iso":"eng"}],"oa_version":"Published Version","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"month":"06","publication":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation","main_file_link":[{"url":"https://doi.org/10.1145/3385412.3385980","open_access":"1"}],"related_material":{"record":[{"id":"8332","relation":"dissertation_contains","status":"public"}]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","publication_identifier":{"isbn":["9781450376136"]},"oa":1,"date_published":"2020-06-01T00:00:00Z","type":"conference","publisher":"Association for Computing Machinery","page":"227-242","quality_controlled":"1","publication_status":"published","date_created":"2020-06-25T11:40:16Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","title":"Inductive sequentialization of asynchronous programs","_id":"8012","scopus_import":"1","author":[{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","last_name":"Kragl","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard"},{"last_name":"Enea","first_name":"Constantin","full_name":"Enea, Constantin"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mutluergil, Suha Orhun","last_name":"Mutluergil","first_name":"Suha Orhun"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"}],"doi":"10.1145/3385412.3385980","day":"01","abstract":[{"lang":"eng","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."}],"date_updated":"2023-09-07T13:18:00Z","citation":{"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.","mla":"Kragl, Bernhard, et al. “Inductive Sequentialization of Asynchronous Programs.” <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2020, pp. 227–42, doi:<a href=\"https://doi.org/10.1145/3385412.3385980\">10.1145/3385412.3385980</a>.","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.","apa":"Kragl, B., Enea, C., Henzinger, T. A., Mutluergil, S. O., &#38; Qadeer, S. (2020). Inductive sequentialization of asynchronous programs. In <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 227–242). London, United Kingdom: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3385412.3385980\">https://doi.org/10.1145/3385412.3385980</a>","ama":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. Inductive sequentialization of asynchronous programs. In: <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2020:227-242. doi:<a href=\"https://doi.org/10.1145/3385412.3385980\">10.1145/3385412.3385980</a>","chicago":"Kragl, Bernhard, Constantin Enea, Thomas A Henzinger, Suha Orhun Mutluergil, and Shaz Qadeer. “Inductive Sequentialization of Asynchronous Programs.” In <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, 227–42. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3385412.3385980\">https://doi.org/10.1145/3385412.3385980</a>.","ieee":"B. Kragl, C. Enea, T. A. Henzinger, S. O. Mutluergil, and S. Qadeer, “Inductive sequentialization of asynchronous programs,” in <i>Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, London, United Kingdom, 2020, pp. 227–242."},"year":"2020","isi":1,"external_id":{"isi":["000614622300016"]}},{"month":"06","oa_version":"Published Version","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"publication":"Automated Reasoning","conference":{"location":"Paris, France","end_date":"2020-07-04","name":"IJCAR: International Joint Conference on Automated Reasoning","start_date":"2020-07-01"},"language":[{"iso":"eng"}],"oa":1,"publication_identifier":{"eissn":["16113349"],"issn":["03029743"],"isbn":["9783030510732"]},"date_published":"2020-06-24T00:00:00Z","type":"conference","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-030-51074-9_2"}],"alternative_title":["LNCS"],"title":"An SMT theory of fixed-point arithmetic","intvolume":"     12166","publication_status":"published","department":[{"_id":"ToHe"}],"article_processing_charge":"No","date_created":"2020-08-02T22:00:59Z","author":[{"last_name":"Baranowski","first_name":"Marek","full_name":"Baranowski, Marek"},{"full_name":"He, Shaobo","last_name":"He","first_name":"Shaobo"},{"first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nguyen, Thanh Son","first_name":"Thanh Son","last_name":"Nguyen"},{"full_name":"Rakamarić, Zvonimir","first_name":"Zvonimir","last_name":"Rakamarić"}],"_id":"8194","scopus_import":"1","publisher":"Springer Nature","page":"13-31","quality_controlled":"1","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."}],"doi":"10.1007/978-3-030-51074-9_2","day":"24","isi":1,"external_id":{"isi":["000884318000002"]},"date_updated":"2023-08-22T08:27:25Z","citation":{"mla":"Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.” <i>Automated Reasoning</i>, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>.","short":"M. Baranowski, S. He, M. Lechner, T.S. Nguyen, Z. Rakamarić, in:, Automated Reasoning, Springer Nature, 2020, pp. 13–31.","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.","ama":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. An SMT theory of fixed-point arithmetic. In: <i>Automated Reasoning</i>. Vol 12166. Springer Nature; 2020:13-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>","apa":"Baranowski, M., He, S., Lechner, M., Nguyen, T. S., &#38; Rakamarić, Z. (2020). An SMT theory of fixed-point arithmetic. In <i>Automated Reasoning</i> (Vol. 12166, pp. 13–31). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>","chicago":"Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir Rakamarić. “An SMT Theory of Fixed-Point Arithmetic.” In <i>Automated Reasoning</i>, 12166:13–31. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>.","ieee":"M. Baranowski, S. He, M. Lechner, T. S. Nguyen, and Z. Rakamarić, “An SMT theory of fixed-point arithmetic,” in <i>Automated Reasoning</i>, Paris, France, 2020, vol. 12166, pp. 13–31."},"year":"2020","volume":12166},{"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."}],"day":"14","doi":"10.1007/978-3-030-53288-8_14","external_id":{"isi":["000695276000014"]},"isi":1,"year":"2020","citation":{"mla":"Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” <i>Computer Aided Verification</i>, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298.","ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.","apa":"Kragl, B., Qadeer, S., &#38; Henzinger, T. A. (2020). Refinement for structured concurrent programs. In <i>Computer Aided Verification</i> (Vol. 12224, pp. 275–298). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>","ama":"Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs. In: <i>Computer Aided Verification</i>. Vol 12224. Springer Nature; 2020:275-298. doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in <i>Computer Aided Verification</i>, 2020, vol. 12224, pp. 275–298.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.” In <i>Computer Aided Verification</i>, 12224:275–98. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>."},"date_updated":"2023-09-07T13:18:00Z","ddc":["000"],"volume":12224,"acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","intvolume":"     12224","title":"Refinement for structured concurrent programs","alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"date_created":"2020-08-03T11:45:35Z","article_processing_charge":"No","publication_status":"published","author":[{"last_name":"Kragl","first_name":"Bernhard","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","_id":"8195","publisher":"Springer Nature","file_date_updated":"2020-08-06T08:14:54Z","quality_controlled":"1","page":"275-298","oa":1,"publication_identifier":{"eisbn":["9783030532888"],"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030532871"]},"type":"conference","date_published":"2020-07-14T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8332"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"access_level":"open_access","success":1,"relation":"main_file","creator":"dernst","file_id":"8201","file_size":804237,"date_created":"2020-08-06T08:14:54Z","content_type":"application/pdf","file_name":"2020_LNCS_Kragl.pdf","date_updated":"2020-08-06T08:14:54Z"}],"month":"07","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"oa_version":"Published Version","has_accepted_license":"1","publication":"Computer Aided Verification","language":[{"iso":"eng"}]},{"author":[{"full_name":"Bogomolov, Sergiy","first_name":"Sergiy","last_name":"Bogomolov"},{"last_name":"Forets","first_name":"Marcelo","full_name":"Forets, Marcelo"},{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"full_name":"Potomkin, Kostiantyn","first_name":"Kostiantyn","last_name":"Potomkin"},{"full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","last_name":"Schilling","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"_id":"8287","title":"Reachability analysis of linear hybrid systems via block decomposition","department":[{"_id":"ToHe"}],"article_processing_charge":"No","date_created":"2020-08-24T12:56:20Z","publication_status":"published","file_date_updated":"2020-08-24T12:53:15Z","quality_controlled":"1","ec_funded":1,"external_id":{"arxiv":["1905.02458"]},"citation":{"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.","mla":"Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” <i>Proceedings of the International Conference on Embedded Software</i>, 2020.","short":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, 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 <i>Proceedings of the International Conference on Embedded Software</i>, 2020.","ieee":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “Reachability analysis of linear hybrid systems via block decomposition,” in <i>Proceedings of the International Conference on Embedded Software</i>, Virtual , 2020.","apa":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &#38; Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. In <i>Proceedings of the International Conference on Embedded Software</i>. Virtual .","ama":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. Reachability analysis of linear hybrid systems via block decomposition. In: <i>Proceedings of the International Conference on Embedded Software</i>. ; 2020."},"year":"2020","date_updated":"2023-08-22T13:27:32Z","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 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."}],"arxiv":1,"ddc":["000"],"has_accepted_license":"1","publication":"Proceedings of the International Conference on Embedded Software","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"Z00312","name":"The Wittgenstein Prize","_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"oa_version":"Preprint","keyword":["reachability","hybrid systems","decomposition"],"language":[{"iso":"eng"}],"conference":{"name":"EMSOFT: International Conference on Embedded Software","start_date":"2020-09-20","location":"Virtual ","end_date":"2020-09-25"},"type":"conference","date_published":"2020-01-01T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","related_material":{"record":[{"status":"public","relation":"later_version","id":"8790"}]},"file":[{"date_updated":"2020-08-24T12:53:15Z","file_name":"2020EMSOFT.pdf","content_type":"application/pdf","date_created":"2020-08-24T12:53:15Z","checksum":"d19e97d0f8a3a441dc078ec812297d75","file_size":696384,"file_id":"8288","creator":"cschilli","success":1,"relation":"main_file","access_level":"open_access"}]},{"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"133"},{"id":"8012","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"8195","status":"public"},{"status":"public","id":"160","relation":"part_of_dissertation"}]},"file":[{"file_id":"8333","creator":"bkragl","relation":"main_file","access_level":"open_access","date_updated":"2020-09-04T12:17:47Z","content_type":"application/pdf","file_name":"kragl-thesis.pdf","date_created":"2020-09-04T12:17:47Z","checksum":"26fe261550f691280bda4c454bf015c7","file_size":1348815},{"relation":"source_file","access_level":"closed","file_id":"8335","creator":"bkragl","date_created":"2020-09-04T13:00:17Z","file_size":372312,"checksum":"b9694ce092b7c55557122adba8337ebc","date_updated":"2020-09-04T13:00:17Z","content_type":"application/zip","file_name":"kragl-thesis.zip"}],"date_published":"2020-09-03T00:00:00Z","type":"dissertation","supervisor":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"oa":1,"publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"has_accepted_license":"1","month":"09","oa_version":"Published Version","ddc":["000"],"date_updated":"2023-09-13T08:45:08Z","year":"2020","citation":{"ista":"Kragl B. 2020. Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria.","mla":"Kragl, Bernhard. <i>Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8332\">10.15479/AT:ISTA:8332</a>.","short":"B. Kragl, Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization, Institute of Science and Technology Austria, 2020.","ieee":"B. Kragl, “Verifying concurrent programs: Refinement, synchronization, sequentialization,” Institute of Science and Technology Austria, 2020.","chicago":"Kragl, Bernhard. “Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8332\">https://doi.org/10.15479/AT:ISTA:8332</a>.","ama":"Kragl B. Verifying concurrent programs: Refinement, synchronization, sequentialization. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8332\">10.15479/AT:ISTA:8332</a>","apa":"Kragl, B. (2020). <i>Verifying concurrent programs: Refinement, synchronization, sequentialization</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8332\">https://doi.org/10.15479/AT:ISTA:8332</a>"},"abstract":[{"text":"Designing and verifying concurrent programs is a notoriously challenging, time consuming, and error prone task, even for experts. This is due to the sheer number of possible interleavings of a concurrent program, all of which have to be tracked and accounted for in a formal proof. Inventing an inductive invariant that captures all interleavings of a low-level implementation is theoretically possible, but practically intractable. We develop a refinement-based verification framework that provides mechanisms to simplify proof construction by decomposing the verification task into smaller subtasks.\r\n\r\nIn a first line of work, we present a foundation for refinement reasoning over structured concurrent programs. We introduce layered concurrent programs as a compact notation to represent multi-layer refinement proofs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. Each program in this sequence is expressed as structured concurrent program, i.e., a program over (potentially recursive) procedures, imperative control flow, gated atomic actions, structured parallelism, and asynchronous concurrency. This is in contrast to existing refinement-based verifiers, which represent concurrent systems as flat transition relations. We present a powerful refinement proof rule that decomposes refinement checking over structured programs into modular verification conditions. Refinement checking is supported by a new form of modular, parameterized invariants, called yield invariants, and a linear permission system to enhance local reasoning.\r\n\r\nIn a second line of work, we present two new reduction-based program transformations that target asynchronous programs. These transformations reduce the number of interleavings that need to be considered, thus reducing the complexity of invariants. Synchronization simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Inductive sequentialization establishes sequential reductions 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.\r\n\r\nOur approach is implemented the CIVL verifier, which has been successfully used for the verification of several complex concurrent programs. In our methodology, the overall correctness of a program is established piecemeal by focusing on the invariant required for each refinement step separately. While the programmer does the creative work of specifying the chain of programs and the inductive invariant justifying each link in the chain, the tool automatically constructs the verification conditions underlying each refinement step.","lang":"eng"}],"degree_awarded":"PhD","doi":"10.15479/AT:ISTA:8332","day":"03","file_date_updated":"2020-09-04T13:00:17Z","page":"120","publisher":"Institute of Science and Technology Austria","author":[{"orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","first_name":"Bernhard","last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87"}],"_id":"8332","title":"Verifying concurrent programs: Refinement, synchronization, sequentialization","alternative_title":["ISTA Thesis"],"publication_status":"published","date_created":"2020-09-04T12:24:12Z","article_processing_charge":"No","department":[{"_id":"ToHe"}]},{"_id":"8571","author":[{"full_name":"Geretti, Luca","first_name":"Luca","last_name":"Geretti"},{"full_name":"Alexandre Dit Sandretto, Julien","first_name":"Julien","last_name":"Alexandre Dit Sandretto"},{"full_name":"Althoff, Matthias","first_name":"Matthias","last_name":"Althoff"},{"full_name":"Benet, Luis","first_name":"Luis","last_name":"Benet"},{"full_name":"Chapoutot, Alexandre","last_name":"Chapoutot","first_name":"Alexandre"},{"full_name":"Chen, Xin","first_name":"Xin","last_name":"Chen"},{"full_name":"Collins, Pieter","first_name":"Pieter","last_name":"Collins"},{"last_name":"Forets","first_name":"Marcelo","full_name":"Forets, Marcelo"},{"full_name":"Freire, Daniel","last_name":"Freire","first_name":"Daniel"},{"last_name":"Immler","first_name":"Fabian","full_name":"Immler, Fabian"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"full_name":"Sanders, David","first_name":"David","last_name":"Sanders"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Schilling","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian"}],"publication_status":"published","department":[{"_id":"ToHe"}],"article_processing_charge":"No","date_created":"2020-09-26T14:41:29Z","title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics","intvolume":"        74","page":"49-75","ec_funded":1,"quality_controlled":"1","publisher":"EasyChair","date_updated":"2021-01-12T08:20:06Z","year":"2020","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.","mla":"Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” <i>EPiC Series in Computing</i>, vol. 74, EasyChair, 2020, pp. 49–75, doi:<a href=\"https://doi.org/10.29007/zkf6\">10.29007/zkf6</a>.","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.","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 <i>EPiC Series in Computing</i>, 74:49–75. EasyChair, 2020. <a href=\"https://doi.org/10.29007/zkf6\">https://doi.org/10.29007/zkf6</a>.","ieee":"L. Geretti <i>et al.</i>, “ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in <i>EPiC Series in Computing</i>, 2020, vol. 74, pp. 49–75.","ama":"Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: <i>EPiC Series in Computing</i>. Vol 74. EasyChair; 2020:49-75. doi:<a href=\"https://doi.org/10.29007/zkf6\">10.29007/zkf6</a>","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 <i>EPiC Series in Computing</i> (Vol. 74, pp. 49–75). EasyChair. <a href=\"https://doi.org/10.29007/zkf6\">https://doi.org/10.29007/zkf6</a>"},"doi":"10.29007/zkf6","day":"25","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."}],"volume":74,"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.","publication":"EPiC Series in Computing","oa_version":"Published Version","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"month":"09","language":[{"iso":"eng"}],"conference":{"end_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2020-07-12"},"date_published":"2020-09-25T00:00:00Z","type":"conference","oa":1,"main_file_link":[{"url":"https://easychair.org/publications/download/nrdD","open_access":"1"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"month":"09","project":[{"name":"The Wittgenstein Prize","grant_number":"Z00312","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"oa_version":"Published Version","publication":"EPiC Series in Computing","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2020-07-12","end_date":"2020-07-12"},"language":[{"iso":"eng"}],"oa":1,"type":"conference","date_published":"2020-09-25T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://easychair.org/publications/download/DRpS","open_access":"1"}],"intvolume":"        74","title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics","department":[{"_id":"ToHe"}],"article_processing_charge":"No","date_created":"2020-09-26T14:49:43Z","publication_status":"published","author":[{"last_name":"Althoff","first_name":"Matthias","full_name":"Althoff, 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"},{"last_name":"Frehse","first_name":"Goran","full_name":"Frehse, Goran"},{"full_name":"Freire, Daniel","first_name":"Daniel","last_name":"Freire"},{"first_name":"Niklas","last_name":"Kochdumper","full_name":"Kochdumper, Niklas"},{"full_name":"Li, Yangge","last_name":"Li","first_name":"Yangge"},{"full_name":"Mitra, Sayan","first_name":"Sayan","last_name":"Mitra"},{"full_name":"Ray, Rajarshi","last_name":"Ray","first_name":"Rajarshi"},{"full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","last_name":"Schilling","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schupp, Stefan","last_name":"Schupp","first_name":"Stefan"},{"full_name":"Wetzlinger, Mark","first_name":"Mark","last_name":"Wetzlinger"}],"_id":"8572","publisher":"EasyChair","ec_funded":1,"quality_controlled":"1","page":"16-48","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"}],"day":"25","doi":"10.29007/7dt2","citation":{"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.","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.","mla":"Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” <i>EPiC Series in Computing</i>, vol. 74, EasyChair, 2020, pp. 16–48, doi:<a href=\"https://doi.org/10.29007/7dt2\">10.29007/7dt2</a>.","ieee":"M. Althoff <i>et al.</i>, “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in <i>EPiC Series in Computing</i>, 2020, vol. 74, pp. 16–48.","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 <i>EPiC Series in Computing</i>, 74:16–48. EasyChair, 2020. <a href=\"https://doi.org/10.29007/7dt2\">https://doi.org/10.29007/7dt2</a>.","ama":"Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: <i>EPiC Series in Computing</i>. Vol 74. EasyChair; 2020:16-48. doi:<a href=\"https://doi.org/10.29007/7dt2\">10.29007/7dt2</a>","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 <i>EPiC Series in Computing</i> (Vol. 74, pp. 16–48). EasyChair. <a href=\"https://doi.org/10.29007/7dt2\">https://doi.org/10.29007/7dt2</a>"},"year":"2020","date_updated":"2021-01-12T08:20:06Z","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.","volume":74},{"abstract":[{"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.","lang":"eng"}],"doi":"10.4230/LIPIcs.CONCUR.2020.2","day":"06","date_updated":"2021-01-12T08:20:13Z","year":"2020","citation":{"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.","short":"G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.” <i>31st International Conference on Concurrency Theory</i>, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">10.4230/LIPIcs.CONCUR.2020.2</a>.","ieee":"G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in <i>31st International Conference on Concurrency Theory</i>, Virtual, 2020, vol. 171.","chicago":"Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.” In <i>31st International Conference on Concurrency Theory</i>, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.2</a>.","apa":"Avni, G., &#38; Henzinger, T. A. (2020). A survey of bidding games on graphs. In <i>31st International Conference on Concurrency Theory</i> (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.2</a>","ama":"Avni G, Henzinger TA. A survey of bidding games on graphs. In: <i>31st International Conference on Concurrency Theory</i>. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.2\">10.4230/LIPIcs.CONCUR.2020.2</a>"},"ddc":["000"],"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.","volume":171,"alternative_title":["LIPIcs"],"title":"A survey of bidding games on graphs","intvolume":"       171","publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2020-10-04T22:01:36Z","article_processing_charge":"No","author":[{"last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"_id":"8599","license":"https://creativecommons.org/licenses/by/3.0/","scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-10-05T14:13:19Z","quality_controlled":"1","oa":1,"publication_identifier":{"isbn":["9783959771603"],"issn":["18688969"]},"date_published":"2020-08-06T00:00:00Z","type":"conference","tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2020-10-05T14:13:19Z","checksum":"8f33b098e73724e0ac817f764d8e1a2d","file_size":868510,"date_updated":"2020-10-05T14:13:19Z","content_type":"application/pdf","file_name":"2020_LIPIcsCONCUR_Avni.pdf","success":1,"relation":"main_file","access_level":"open_access","file_id":"8611","creator":"dernst"}],"month":"08","article_number":"2","oa_version":"Published Version","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publication":"31st International Conference on Concurrency Theory","has_accepted_license":"1","conference":{"start_date":"2020-09-01","name":"CONCUR: Conference on Concurrency Theory","location":"Virtual","end_date":"2020-09-04"},"language":[{"iso":"eng"}]},{"external_id":{"arxiv":["2007.08917"]},"date_updated":"2021-01-12T08:20:15Z","year":"2020","citation":{"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.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” <i>31st International Conference on Concurrency Theory</i>, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">10.4230/LIPIcs.CONCUR.2020.23</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in <i>31st International Conference on Concurrency Theory</i>, Virtual, 2020, vol. 171.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” In <i>31st International Conference on Concurrency Theory</i>, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.23</a>.","ama":"Chatterjee K, Henzinger TA, Otop J. Multi-dimensional long-run average problems for vector addition systems with states. In: <i>31st International Conference on Concurrency Theory</i>. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">10.4230/LIPIcs.CONCUR.2020.23</a>","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In <i>31st International Conference on Concurrency Theory</i> (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2020.23\">https://doi.org/10.4230/LIPIcs.CONCUR.2020.23</a>"},"abstract":[{"lang":"eng","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."}],"doi":"10.4230/LIPIcs.CONCUR.2020.23","arxiv":1,"day":"06","ddc":["000"],"volume":171,"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan"}],"_id":"8600","scopus_import":"1","title":"Multi-dimensional long-run average problems for vector addition systems with states","alternative_title":["LIPIcs"],"intvolume":"       171","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"article_processing_charge":"No","date_created":"2020-10-04T22:01:36Z","file_date_updated":"2020-10-05T14:04:25Z","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2020-08-06T00:00:00Z","type":"conference","tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"oa":1,"publication_identifier":{"issn":["18688969"],"isbn":["9783959771603"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":601231,"checksum":"5039752f644c4b72b9361d21a5e31baf","date_created":"2020-10-05T14:04:25Z","file_name":"2020_LIPIcsCONCUR_Chatterjee.pdf","content_type":"application/pdf","date_updated":"2020-10-05T14:04:25Z","access_level":"open_access","success":1,"relation":"main_file","creator":"dernst","file_id":"8610"}],"publication":"31st International Conference on Concurrency Theory","has_accepted_license":"1","month":"08","article_number":"23","oa_version":"Published Version","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2020-09-01","location":"Virtual","end_date":"2020-09-04"}}]