[{"department":[{"_id":"ToHe"}],"date_created":"2023-10-08T22:01:15Z","date_published":"2023-09-27T00:00:00Z","article_type":"original","month":"09","language":[{"iso":"eng"}],"publisher":"Elsevier","scopus_import":"1","publication":"Nonlinear Analysis: Hybrid Systems","type":"journal_article","day":"27","status":"public","intvolume":"        51","article_number":"101430","isi":1,"main_file_link":[{"url":"https://doi.org/10.1016/j.nahs.2023.101430","open_access":"1"}],"ec_funded":1,"year":"2023","doi":"10.1016/j.nahs.2023.101430","external_id":{"isi":["001093188100001"],"arxiv":["2101.00834"]},"title":"Symbolic control for stochastic systems via finite parity games","volume":51,"date_updated":"2023-12-13T12:58:56Z","oa":1,"article_processing_charge":"No","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We thank Daniel Hausmann and Nir Piterman for their valuable comments on an earlier version of the manuscript of our other paper [22] where we present, among other things, the parity fixpoint for 2 1/2-player games (for a slightly more general class of games) with a different and indirect proof of correctness. Based on their comments we observed that, unlike the other fixpoints that we present in [22], the parity fixpoint does not follow the exact same structure as its counterpart for 2-player games, which we also use int his paper.\r\nWe also thank Thejaswini Raghavan for observing that our symbolic parity fixpoint algorithm can be solved in quasi-polynomial time using recent improved algorithms for solving \r\n-calculus expressions. This significantly improved the complexity bounds of our algorithm in this paper.\r\nThe work of R. Majumdar and A.-K. Schmuck are partially supported by DFG, Germany project 389792660 TRR 248–CPEC. A.-K. Schmuck is additionally funded through DFG, Germany project (SCHM 3541/1-1). K. Mallik is supported by the ERC project ERC-2020-AdG 101020093. S. Soudjani is supported by the following projects: EPSRC EP/V043676/1, EIC 101070802, and ERC 101089047.","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"quality_controlled":"1","oa_version":"Published Version","_id":"14400","publication_identifier":{"issn":["1751-570X"]},"publication_status":"epub_ahead","citation":{"apa":"Majumdar, R., Mallik, K., Schmuck, A. K., &#38; Soudjani, S. (2023). Symbolic control for stochastic systems via finite parity games. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">https://doi.org/10.1016/j.nahs.2023.101430</a>","ieee":"R. Majumdar, K. Mallik, A. K. Schmuck, and S. Soudjani, “Symbolic control for stochastic systems via finite parity games,” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 51. Elsevier, 2023.","chicago":"Majumdar, Rupak, Kaushik Mallik, Anne Kathrin Schmuck, and Sadegh Soudjani. “Symbolic Control for Stochastic Systems via Finite Parity Games.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">https://doi.org/10.1016/j.nahs.2023.101430</a>.","mla":"Majumdar, Rupak, et al. “Symbolic Control for Stochastic Systems via Finite Parity Games.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 51, 101430, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">10.1016/j.nahs.2023.101430</a>.","ama":"Majumdar R, Mallik K, Schmuck AK, Soudjani S. Symbolic control for stochastic systems via finite parity games. <i>Nonlinear Analysis: Hybrid Systems</i>. 2023;51. doi:<a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">10.1016/j.nahs.2023.101430</a>","ista":"Majumdar R, Mallik K, Schmuck AK, Soudjani S. 2023. Symbolic control for stochastic systems via finite parity games. Nonlinear Analysis: Hybrid Systems. 51, 101430.","short":"R. Majumdar, K. Mallik, A.K. Schmuck, S. Soudjani, Nonlinear Analysis: Hybrid Systems 51 (2023)."},"author":[{"first_name":"Rupak","full_name":"Majumdar, Rupak","last_name":"Majumdar"},{"first_name":"Kaushik","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"first_name":"Anne Kathrin","last_name":"Schmuck","full_name":"Schmuck, Anne Kathrin"},{"first_name":"Sadegh","last_name":"Soudjani","full_name":"Soudjani, Sadegh"}],"abstract":[{"lang":"eng","text":"We consider the problem of computing the maximal probability of satisfying an \r\n-regular specification for stochastic, continuous-state, nonlinear systems evolving in discrete time. The problem reduces, after automata-theoretic constructions, to finding the maximal probability of satisfying a parity condition on a (possibly hybrid) state space. While characterizing the exact satisfaction probability is open, we show that a lower bound on this probability can be obtained by (I) computing an under-approximation of the qualitative winning region, i.e., states from which the parity condition can be enforced almost surely, and (II) computing the maximal probability of reaching this qualitative winning region.\r\nThe heart of our approach is a technique to symbolically compute the under-approximation of the qualitative winning region in step (I) via a finite-state abstraction of the original system as a \r\n-player parity game. Our abstraction procedure uses only the support of the probabilistic evolution; it does not use precise numerical transition probabilities. We prove that the winning set in the abstract -player game induces an under-approximation of the qualitative winning region in the original synthesis problem, along with a policy to solve it. By combining these contributions with (a) a symbolic fixpoint algorithm to solve \r\n-player games and (b) existing techniques for reachability policy synthesis in stochastic nonlinear systems, we get an abstraction-based algorithm for finding a lower bound on the maximal satisfaction probability.\r\nWe have implemented the abstraction-based algorithm in Mascot-SDS, where we combined the outlined abstraction step with our tool Genie (Majumdar et al., 2023) that solves \r\n-player parity games (through a reduction to Rabin games) more efficiently than existing algorithms. We evaluated our implementation on the nonlinear model of a perturbed bistable switch from the literature. We show empirically that the lower bound on the winning region computed by our approach is precise, by comparing against an over-approximation of the qualitative winning region. Moreover, our implementation outperforms a recently proposed tool for solving this problem by a large margin."}]},{"author":[{"first_name":"Ezio","last_name":"Bartocci","full_name":"Bartocci, Ezio"},{"first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic"},{"last_name":"Oliveira da Costa","full_name":"Oliveira da Costa, Ana","orcid":"0000-0002-8741-5799","first_name":"Ana","id":"f347ec37-6676-11ee-b395-a888cb7b4fb4"}],"abstract":[{"text":"We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic formula specifies relations between sequences of variable values in different system executions. Unlike HyperLTL, hypernode logic takes an asynchronous view on execution traces by constraining the values and the order of value changes of each variable without correlating the timing of the changes. Different execution traces are synchronized solely through the transitions of hypernode automata. Hypernode automata naturally combine asynchronicity at the node level with synchronicity at the transition level. We show that the model-checking problem for hypernode automata is decidable over action-labeled Kripke structures, whose actions induce transitions of the specification automata. For this reason, hypernode automaton is a suitable formalism for specifying and verifying asynchronous hyperproperties, such as declassifying observational determinism in multi-threaded programs.","lang":"eng"}],"citation":{"chicago":"Bartocci, Ezio, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Hypernode Automata.” In <i>34th International Conference on Concurrency Theory</i>, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2023.21</a>.","ieee":"E. Bartocci, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Hypernode automata,” in <i>34th International Conference on Concurrency Theory</i>, Antwerp, Belgium, 2023, vol. 279.","apa":"Bartocci, E., Henzinger, T. A., Nickovic, D., &#38; Oliveira da Costa, A. (2023). Hypernode automata. In <i>34th International Conference on Concurrency Theory</i> (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2023.21</a>","ista":"Bartocci E, Henzinger TA, Nickovic D, Oliveira da Costa A. 2023. Hypernode automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 21.","short":"E. Bartocci, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ama":"Bartocci E, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode automata. In: <i>34th International Conference on Concurrency Theory</i>. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.21\">10.4230/LIPIcs.CONCUR.2023.21</a>","mla":"Bartocci, Ezio, et al. “Hypernode Automata.” <i>34th International Conference on Concurrency Theory</i>, vol. 279, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.21\">10.4230/LIPIcs.CONCUR.2023.21</a>."},"publication_status":"published","oa_version":"Published Version","quality_controlled":"1","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF) SFB project\r\nSpyCoDe F8502, by the FWF projects ZK-35 and W1255-N23, and by the ERC Advanced Grant\r\nVAMOS 101020093.","publication_identifier":{"issn":["18688969"],"isbn":["9783959772990"]},"_id":"14405","article_processing_charge":"Yes","oa":1,"date_updated":"2023-10-09T07:43:44Z","volume":279,"arxiv":1,"external_id":{"arxiv":["2305.02836"]},"title":"Hypernode automata","ec_funded":1,"year":"2023","doi":"10.4230/LIPIcs.CONCUR.2023.21","ddc":["000"],"article_number":"21","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"alternative_title":["LIPIcs"],"status":"public","intvolume":"       279","type":"conference","day":"01","file_date_updated":"2023-10-09T07:42:45Z","publication":"34th International Conference on Concurrency Theory","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2023-09-01T00:00:00Z","month":"09","file":[{"access_level":"open_access","date_updated":"2023-10-09T07:42:45Z","checksum":"215765e40454d806174ac0a223e8d6fa","date_created":"2023-10-09T07:42:45Z","file_size":795790,"file_name":"2023_LIPcs_Bartocci.pdf","creator":"dernst","file_id":"14413","relation":"main_file","content_type":"application/pdf","success":1}],"date_created":"2023-10-08T22:01:16Z","conference":{"name":"CONCUR: Conference on Concurrency Theory","location":"Antwerp, Belgium","end_date":"2023-09-22","start_date":"2023-09-19"},"department":[{"_id":"ToHe"}],"has_accepted_license":"1"},{"alternative_title":["LNCS"],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2308.00341","open_access":"1"}],"title":"Monitoring algorithmic fairness under partial observations","external_id":{"arxiv":["2308.00341"]},"year":"2023","doi":"10.1007/978-3-031-44267-4_15","ec_funded":1,"_id":"14454","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031442667"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","oa_version":"Preprint","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"quality_controlled":"1","arxiv":1,"volume":14245,"oa":1,"date_updated":"2023-10-31T11:48:20Z","article_processing_charge":"No","abstract":[{"text":"As AI and machine-learned software are used increasingly for making decisions that affect humans, it is imperative that they remain fair and unbiased in their decisions. To complement design-time bias mitigation measures, runtime verification techniques have been introduced recently to monitor the algorithmic fairness of deployed systems. Previous monitoring techniques assume full observability of the states of the (unknown) monitored system. Moreover, they can monitor only fairness properties that are specified as arithmetic expressions over the probabilities of different events. In this work, we extend fairness monitoring to systems modeled as partially observed Markov chains (POMC), and to specifications containing arithmetic expressions over the expected values of numerical functions on event sequences. The only assumptions we make are that the underlying POMC is aperiodic and starts in the stationary distribution, with a bound on its mixing time being known. These assumptions enable us to estimate a given property for the entire distribution of possible executions of the monitored POMC, by observing only a single execution. Our monitors observe a long run of the system and, after each new observation, output updated PAC-estimates of how fair or biased the system is. The monitors are computationally lightweight and, using a prototype implementation, we demonstrate their effectiveness on several real-world examples.","lang":"eng"}],"author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kueffner","full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542","first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515"},{"first_name":"Kaushik","full_name":"Mallik, Kaushik","last_name":"Mallik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"}],"publication_status":"published","citation":{"ista":"Henzinger TA, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness under partial observations. 23rd International Conference on Runtime Verification. RV: Conference on Runtime Verification, LNCS, vol. 14245, 291–311.","short":"T.A. Henzinger, K. Kueffner, K. Mallik, in:, 23rd International Conference on Runtime Verification, Springer Nature, 2023, pp. 291–311.","ama":"Henzinger TA, Kueffner K, Mallik K. Monitoring algorithmic fairness under partial observations. In: <i>23rd International Conference on Runtime Verification</i>. Vol 14245. Springer Nature; 2023:291-311. doi:<a href=\"https://doi.org/10.1007/978-3-031-44267-4_15\">10.1007/978-3-031-44267-4_15</a>","mla":"Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness under Partial Observations.” <i>23rd International Conference on Runtime Verification</i>, vol. 14245, Springer Nature, 2023, pp. 291–311, doi:<a href=\"https://doi.org/10.1007/978-3-031-44267-4_15\">10.1007/978-3-031-44267-4_15</a>.","chicago":"Henzinger, Thomas A, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness under Partial Observations.” In <i>23rd International Conference on Runtime Verification</i>, 14245:291–311. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-44267-4_15\">https://doi.org/10.1007/978-3-031-44267-4_15</a>.","ieee":"T. A. Henzinger, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness under partial observations,” in <i>23rd International Conference on Runtime Verification</i>, Thessaloniki, Greece, 2023, vol. 14245, pp. 291–311.","apa":"Henzinger, T. A., Kueffner, K., &#38; Mallik, K. (2023). Monitoring algorithmic fairness under partial observations. In <i>23rd International Conference on Runtime Verification</i> (Vol. 14245, pp. 291–311). Thessaloniki, Greece: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-44267-4_15\">https://doi.org/10.1007/978-3-031-44267-4_15</a>"},"conference":{"end_date":"2023-10-06","name":"RV: Conference on Runtime Verification","location":"Thessaloniki, Greece","start_date":"2023-10-03"},"date_created":"2023-10-29T23:01:15Z","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","scopus_import":"1","language":[{"iso":"eng"}],"month":"10","date_published":"2023-10-01T00:00:00Z","publication":"23rd International Conference on Runtime Verification","page":"291-311","intvolume":"     14245","status":"public","day":"01","type":"conference"},{"alternative_title":["LNCS"],"ec_funded":1,"doi":"10.1007/978-3-031-45329-8_17","year":"2023","title":"Learning provably stabilizing neural controllers for discrete-time stochastic systems","volume":14215,"date_updated":"2025-07-14T09:09:59Z","article_processing_charge":"No","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","quality_controlled":"1","project":[{"grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385"}],"_id":"14559","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031453281"]},"publication_status":"published","citation":{"chicago":"Ansaripour, Matin, Krishnendu Chatterjee, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” In <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, 14215:357–79. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">https://doi.org/10.1007/978-3-031-45329-8_17</a>.","apa":"Ansaripour, M., Chatterjee, K., Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2023). Learning provably stabilizing neural controllers for discrete-time stochastic systems. In <i>21st International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 14215, pp. 357–379). Singapore, Singapore: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">https://doi.org/10.1007/978-3-031-45329-8_17</a>","ieee":"M. Ansaripour, K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “Learning provably stabilizing neural controllers for discrete-time stochastic systems,” in <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, Singapore, Singapore, 2023, vol. 14215, pp. 357–379.","ista":"Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. Learning provably stabilizing neural controllers for discrete-time stochastic systems. 21st International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 14215, 357–379.","short":"M. Ansaripour, K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, 21st International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2023, pp. 357–379.","ama":"Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. Learning provably stabilizing neural controllers for discrete-time stochastic systems. In: <i>21st International Symposium on Automated Technology for Verification and Analysis</i>. Vol 14215. Springer Nature; 2023:357-379. doi:<a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">10.1007/978-3-031-45329-8_17</a>","mla":"Ansaripour, Matin, et al. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.” <i>21st International Symposium on Automated Technology for Verification and Analysis</i>, vol. 14215, Springer Nature, 2023, pp. 357–79, doi:<a href=\"https://doi.org/10.1007/978-3-031-45329-8_17\">10.1007/978-3-031-45329-8_17</a>."},"author":[{"first_name":"Matin","full_name":"Ansaripour, Matin","last_name":"Ansaripour"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias"},{"first_name":"Dorde","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"We consider the problem of learning control policies in discrete-time stochastic systems which guarantee that the system stabilizes within some specified stabilization region with probability 1. Our approach is based on the novel notion of stabilizing ranking supermartingales (sRSMs) that we introduce in this work. Our sRSMs overcome the limitation of methods proposed in previous works whose applicability is restricted to systems in which the stabilizing region cannot be left once entered under any control policy. We present a learning procedure that learns a control policy together with an sRSM that formally certifies probability 1 stability, both learned as neural networks. We show that this procedure can also be adapted to formally verifying that, under a given Lipschitz continuous control policy, the stochastic system stabilizes within some stabilizing region with probability 1. Our experimental evaluation shows that our learning procedure can successfully learn provably stabilizing policies in practice.","lang":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_created":"2023-11-19T23:00:56Z","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2023-10-27","location":"Singapore, Singapore","start_date":"2023-10-24"},"date_published":"2023-10-22T00:00:00Z","month":"10","language":[{"iso":"eng"}],"publisher":"Springer Nature","scopus_import":"1","page":"357-379","publication":"21st International Symposium on Automated Technology for Verification and Analysis","type":"conference","day":"22","status":"public","intvolume":"     14215"},{"_id":"14718","publication_identifier":{"isbn":["9783854480600"]},"acknowledgement":"This work was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413 and the\r\n“VAMOS” grant ERC-2020-AdG 101020093.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"}],"quality_controlled":"1","oa":1,"date_updated":"2024-01-02T08:16:28Z","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Binary decision diagrams (BDDs) are one of the fundamental data structures in formal methods and computer science in general. However, the performance of BDD-based algorithms greatly depends on memory latency due to the reliance on large hash tables and thus, by extension, on the speed of random memory access. This hinders the full utilisation of resources available on modern CPUs, since the absolute memory latency has not improved significantly for at least a decade. In this paper, we explore several implementation techniques that improve the performance of BDD manipulation either through enhanced memory locality or by partially eliminating random memory access. On a benchmark suite of 600+ BDDs derived from real-world applications, we demonstrate runtime that is comparable or better than parallelising the same operations on eight CPU cores. "}],"author":[{"id":"07c5ea74-f61c-11ec-a664-aa7c5d957b2b","first_name":"Samuel","last_name":"Pastva","full_name":"Pastva, Samuel","orcid":"0000-0003-1993-0331"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","citation":{"short":"S. Pastva, T.A. Henzinger, in:, Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, TU Vienna Academic Press, 2023, pp. 122–131.","ista":"Pastva S, Henzinger TA. 2023. Binary decision diagrams on modern hardware. Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design. FMCAD: Conference on Formal Methods in Computer-aided design, 122–131.","mla":"Pastva, Samuel, and Thomas A. Henzinger. “Binary Decision Diagrams on Modern Hardware.” <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, TU Vienna Academic Press, 2023, pp. 122–31, doi:<a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">10.34727/2023/isbn.978-3-85448-060-0_20</a>.","ama":"Pastva S, Henzinger TA. Binary decision diagrams on modern hardware. In: <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>. TU Vienna Academic Press; 2023:122-131. doi:<a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">10.34727/2023/isbn.978-3-85448-060-0_20</a>","chicago":"Pastva, Samuel, and Thomas A Henzinger. “Binary Decision Diagrams on Modern Hardware.” In <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, 122–31. TU Vienna Academic Press, 2023. <a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20</a>.","ieee":"S. Pastva and T. A. Henzinger, “Binary decision diagrams on modern hardware,” in <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, Ames, IA, United States, 2023, pp. 122–131.","apa":"Pastva, S., &#38; Henzinger, T. A. (2023). Binary decision diagrams on modern hardware. In <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i> (pp. 122–131). Ames, IA, United States: TU Vienna Academic Press. <a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20</a>"},"ddc":["000"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"title":"Binary decision diagrams on modern hardware","year":"2023","doi":"10.34727/2023/isbn.978-3-85448-060-0_20","ec_funded":1,"publication":"Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design","page":"122-131","file_date_updated":"2024-01-02T08:14:23Z","status":"public","day":"01","type":"conference","conference":{"start_date":"2023-10-25","location":"Ames, IA, United States","end_date":"2023-10-27","name":"FMCAD: Conference on Formal Methods in Computer-aided design"},"date_created":"2023-12-31T23:01:03Z","file":[{"access_level":"open_access","date_updated":"2024-01-02T08:14:23Z","checksum":"818d6e13dd508f3a04f0941081022e5d","date_created":"2024-01-02T08:14:23Z","file_size":524321,"file_name":"2023_FMCAD_Pastva.pdf","file_id":"14721","creator":"dernst","relation":"main_file","content_type":"application/pdf","success":1}],"has_accepted_license":"1","department":[{"_id":"ToHe"}],"publisher":"TU Vienna Academic Press","scopus_import":"1","language":[{"iso":"eng"}],"month":"10","date_published":"2023-10-01T00:00:00Z"},{"conference":{"end_date":"2023-07-22","location":"Paris, France","name":"CAV: Computer Aided Verification","start_date":"2023-07-17"},"file":[{"success":1,"creator":"dernst","file_id":"14765","relation":"main_file","content_type":"application/pdf","checksum":"1a361d83db0244fd32c03b544c294b5a","date_created":"2024-01-09T10:01:07Z","file_size":405147,"file_name":"2023_LNCSCAV_Majumdar.pdf","access_level":"open_access","date_updated":"2024-01-09T10:01:07Z"}],"date_created":"2024-01-08T13:18:00Z","has_accepted_license":"1","department":[{"_id":"ToHe"}],"scopus_import":"1","publisher":"Springer Nature","language":[{"iso":"eng"}],"month":"07","date_published":"2023-07-16T00:00:00Z","publication":"35th International Conference on Computer Aided Verification","page":"3-15","file_date_updated":"2024-01-09T10:01:07Z","intvolume":"     13966","status":"public","day":"16","type":"conference","related_material":{"record":[{"status":"public","relation":"research_data","id":"14994"}]},"ddc":["000"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"alternative_title":["LNCS"],"title":"A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties","doi":"10.1007/978-3-031-37709-9_1","year":"2023","ec_funded":1,"publication_identifier":{"issn":["0302-9743"],"eisbn":["9783031377099"],"isbn":["9783031377082"],"eissn":["1611-3349"]},"_id":"14758","quality_controlled":"1","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"oa_version":"Published Version","acknowledgement":"Authors ordered alphabetically. R. Majumdar and A.-K. Schmuck are partially supported by DFG project 389792660 TRR 248-CPEC. A.-K. Schmuck is additionally funded through DFG project (SCHM 3541/1-1). K. Mallik is supported by the ERC project ERC-2020-AdG 101020093. M. Rychlicki is supported by the EPSRC project EP/V00252X/1. S. Soudjani is supported by the following projects: EPSRC EP/V043676/1, EIC 101070802, and ERC 101089047.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (in subscription journal)","volume":13966,"date_updated":"2024-02-27T07:39:51Z","oa":1,"abstract":[{"lang":"eng","text":"We present a flexible and efficient toolchain to symbolically solve (standard) Rabin games, fair-adversarial Rabin games, and 2 1/2 license type-player Rabin games. To our best knowledge, our tools are the first ones to be able to solve these problems. Furthermore, using these flexible game solvers as a back-end, we implemented a tool for computing correct-by-construction controllers for stochastic dynamical systems under LTL specifications. Our implementations use the recent theoretical result that all of these games can be solved using the same symbolic fixpoint algorithm but utilizing different, domain specific calculations of the involved predecessor operators. The main feature of our toolchain is the utilization of two programming abstractions: one to separate the symbolic fixpoint computations from the predecessor calculations, and another one to allow the integration of different BDD libraries as back-ends. In particular, we employ a multi-threaded execution of the fixpoint algorithm by using the multi-threaded BDD library Sylvan, which leads to enormous computational savings."}],"author":[{"last_name":"Majumdar","full_name":"Majumdar, Rupak","first_name":"Rupak"},{"last_name":"Mallik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"first_name":"Mateusz","last_name":"Rychlicki","full_name":"Rychlicki, Mateusz"},{"first_name":"Anne-Kathrin","full_name":"Schmuck, Anne-Kathrin","last_name":"Schmuck"},{"full_name":"Soudjani, Sadegh","last_name":"Soudjani","first_name":"Sadegh"}],"citation":{"chicago":"Majumdar, Rupak, Kaushik Mallik, Mateusz Rychlicki, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.” In <i>35th International Conference on Computer Aided Verification</i>, 13966:3–15. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_1\">https://doi.org/10.1007/978-3-031-37709-9_1</a>.","ieee":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, and S. Soudjani, “A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties,” in <i>35th International Conference on Computer Aided Verification</i>, Paris, France, 2023, vol. 13966, pp. 3–15.","apa":"Majumdar, R., Mallik, K., Rychlicki, M., Schmuck, A.-K., &#38; Soudjani, S. (2023). A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. In <i>35th International Conference on Computer Aided Verification</i> (Vol. 13966, pp. 3–15). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_1\">https://doi.org/10.1007/978-3-031-37709-9_1</a>","ista":"Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. 2023. A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. 35th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 3–15.","short":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, S. Soudjani, in:, 35th International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 3–15.","mla":"Majumdar, Rupak, et al. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.” <i>35th International Conference on Computer Aided Verification</i>, vol. 13966, Springer Nature, 2023, pp. 3–15, doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_1\">10.1007/978-3-031-37709-9_1</a>.","ama":"Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. In: <i>35th International Conference on Computer Aided Verification</i>. Vol 13966. Springer Nature; 2023:3-15. doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_1\">10.1007/978-3-031-37709-9_1</a>"},"publication_status":"published"},{"citation":{"short":"D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2023, pp. 11926–11935.","ista":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. 2023. Learning control policies for stochastic systems with reach-avoid guarantees. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 11926–11935.","ama":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. In: <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>. Vol 37. Association for the Advancement of Artificial Intelligence; 2023:11926-11935. doi:<a href=\"https://doi.org/10.1609/aaai.v37i10.26407\">10.1609/aaai.v37i10.26407</a>","mla":"Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, vol. 37, no. 10, Association for the Advancement of Artificial Intelligence, 2023, pp. 11926–35, doi:<a href=\"https://doi.org/10.1609/aaai.v37i10.26407\">10.1609/aaai.v37i10.26407</a>.","chicago":"Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, 37:11926–35. Association for the Advancement of Artificial Intelligence, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i10.26407\">https://doi.org/10.1609/aaai.v37i10.26407</a>.","apa":"Zikelic, D., Lechner, M., Henzinger, T. A., &#38; Chatterjee, K. (2023). Learning control policies for stochastic systems with reach-avoid guarantees. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (Vol. 37, pp. 11926–11935). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v37i10.26407\">https://doi.org/10.1609/aaai.v37i10.26407</a>","ieee":"D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” in <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, Washington, DC, United States, 2023, vol. 37, no. 10, pp. 11926–11935."},"publication_status":"published","keyword":["General Medicine"],"author":[{"first_name":"Dorde","last_name":"Zikelic","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold p in [0,1] over the infinite time horizon. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees by imposing constraints on what can be viewed as a stochastic extension of level sets of Lyapunov functions for deterministic systems. Our approach solves several important problems -- it can be used to learn a control policy from scratch, to verify a reach-avoid specification for a fixed control policy, or to fine-tune a pre-trained policy if it does not satisfy the reach-avoid specification. We validate our approach on 3 stochastic non-linear reinforcement learning tasks.","lang":"eng"}],"article_processing_charge":"No","date_updated":"2025-07-14T09:10:02Z","volume":37,"arxiv":1,"quality_controlled":"1","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"oa_version":"Preprint","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"]},"_id":"14830","ec_funded":1,"year":"2023","doi":"10.1609/aaai.v37i10.26407","title":"Learning control policies for stochastic systems with reach-avoid guarantees","external_id":{"arxiv":["2210.05308"]},"related_material":{"record":[{"id":"14600","relation":"earlier_version","status":"public"}]},"type":"conference","day":"26","status":"public","intvolume":"        37","page":"11926-11935","publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","issue":"10","date_published":"2023-06-26T00:00:00Z","month":"06","language":[{"iso":"eng"}],"publisher":"Association for the Advancement of Artificial Intelligence","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_created":"2024-01-18T07:44:31Z","conference":{"start_date":"2023-02-07","name":"AAAI: Conference on Artificial Intelligence","end_date":"2023-02-14","location":"Washington, DC, United States"}},{"acknowledgement":"A previous version of this paper has appeared in TACAS 2022. Authors ordered alphabetically. T. Banerjee was interning with MPI-SWS when this research was conducted. R. Majumdar and A.-K. Schmuck are partially supported by DFG project 389792660 TRR 248–CPEC. A.-K. Schmuck is additionally funded through DFG project (SCHM 3541/1-1). K. Mallik is supported by the ERC project ERC-2020-AdG 101020093.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"quality_controlled":"1","_id":"14920","publication_identifier":{"issn":["2751-4838"]},"date_updated":"2024-02-05T10:21:51Z","volume":2,"oa":1,"article_processing_charge":"Yes","arxiv":1,"author":[{"first_name":"Tamajit","last_name":"Banerjee","full_name":"Banerjee, Tamajit"},{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","first_name":"Kaushik","last_name":"Mallik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475"},{"first_name":"Anne-Kathrin","full_name":"Schmuck, Anne-Kathrin","last_name":"Schmuck"},{"full_name":"Soudjani, Sadegh","last_name":"Soudjani","first_name":"Sadegh"}],"abstract":[{"lang":"eng","text":"We consider fixpoint algorithms for two-player games on graphs with $\\omega$-regular winning conditions, where the environment is constrained by a strong transition fairness assumption. Strong transition fairness is a widely occurring special case of strong fairness, which requires that any execution is strongly fair with respect to a specified set of live edges: whenever the\r\nsource vertex of a live edge is visited infinitely often along a play, the edge itself is traversed infinitely often along the play as well. We show that, surprisingly, strong transition fairness retains the algorithmic characteristics of the fixpoint algorithms for $\\omega$-regular games -- the new algorithms have the same alternation depth as the classical algorithms but invoke a new type of predecessor operator. For Rabin games with $k$ pairs, the complexity of the new algorithm is $O(n^{k+2}k!)$ symbolic steps, which is independent of the number of live edges in the strong transition fairness assumption. Further, we show that GR(1) specifications with strong transition fairness assumptions can be solved with a 3-nested fixpoint algorithm, same as the usual algorithm. In contrast, strong fairness necessarily requires increasing the alternation depth depending on the number of fairness assumptions. We get symbolic algorithms for (generalized) Rabin, parity and GR(1) objectives under strong transition fairness assumptions as well as a direct symbolic algorithm for qualitative winning in stochastic\r\n$\\omega$-regular games that runs in $O(n^{k+2}k!)$ symbolic steps, improving the state of the art. Finally, we have implemented a BDD-based synthesis engine based on our algorithm. We show on a set of synthetic and real benchmarks that our algorithm is scalable, parallelizable, and outperforms previous algorithms by orders of magnitude."}],"publication_status":"published","citation":{"ama":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. Fast symbolic algorithms for mega-regular games under strong transition fairness. <i>TheoretiCS</i>. 2023;2. doi:<a href=\"https://doi.org/10.46298/theoretics.23.4\">10.46298/theoretics.23.4</a>","mla":"Banerjee, Tamajit, et al. “Fast Symbolic Algorithms for Mega-Regular Games under Strong Transition Fairness.” <i>TheoretiCS</i>, vol. 2, 4, EPI Sciences, 2023, doi:<a href=\"https://doi.org/10.46298/theoretics.23.4\">10.46298/theoretics.23.4</a>.","ista":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. 2023. Fast symbolic algorithms for mega-regular games under strong transition fairness. TheoretiCS. 2, 4.","short":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, S. Soudjani, TheoretiCS 2 (2023).","ieee":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “Fast symbolic algorithms for mega-regular games under strong transition fairness,” <i>TheoretiCS</i>, vol. 2. EPI Sciences, 2023.","apa":"Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., &#38; Soudjani, S. (2023). Fast symbolic algorithms for mega-regular games under strong transition fairness. <i>TheoretiCS</i>. EPI Sciences. <a href=\"https://doi.org/10.46298/theoretics.23.4\">https://doi.org/10.46298/theoretics.23.4</a>","chicago":"Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. “Fast Symbolic Algorithms for Mega-Regular Games under Strong Transition Fairness.” <i>TheoretiCS</i>. EPI Sciences, 2023. <a href=\"https://doi.org/10.46298/theoretics.23.4\">https://doi.org/10.46298/theoretics.23.4</a>."},"ddc":["000"],"article_number":"4","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"external_id":{"arxiv":["2202.07480"]},"title":"Fast symbolic algorithms for mega-regular games under strong transition fairness","ec_funded":1,"year":"2023","doi":"10.46298/theoretics.23.4","file_date_updated":"2024-02-05T10:19:35Z","publication":"TheoretiCS","status":"public","intvolume":"         2","type":"journal_article","day":"24","date_created":"2024-01-31T13:40:49Z","file":[{"date_created":"2024-02-05T10:19:35Z","checksum":"2972d531122a6f15727b396110fb3f5c","file_name":"2023_TheoretiCS_Banerjee.pdf","file_size":917076,"date_updated":"2024-02-05T10:19:35Z","access_level":"open_access","success":1,"creator":"dernst","file_id":"14940","content_type":"application/pdf","relation":"main_file"}],"department":[{"_id":"ToHe"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"publisher":"EPI Sciences","article_type":"original","date_published":"2023-02-24T00:00:00Z","month":"02"},{"abstract":[{"lang":"eng","text":"Reinforcement learning has shown promising results in learning neural network policies for complicated control tasks. However, the lack of formal guarantees about the behavior of such policies remains an impediment to their deployment. We propose a novel method for learning a composition of neural network policies in stochastic environments, along with a formal certificate which guarantees that a specification over the policy's behavior is satisfied with the desired probability. Unlike prior work on verifiable RL, our approach leverages the compositional nature of logical specifications provided in SpectRL, to learn over graphs of probabilistic reach-avoid specifications. The formal guarantees are provided by learning neural network policies together with reach-avoid supermartingales (RASM) for the graph’s sub-tasks and then composing them into a global policy. We also derive a tighter lower bound compared to previous work on the probability of reach-avoidance implied by a RASM, which is required to find a compositional policy with an acceptable probabilistic threshold for complex tasks with multiple edge policies. We implement a prototype of our approach and evaluate it on a Stochastic Nine Rooms environment."}],"author":[{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","full_name":"Zikelic, Dorde"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"},{"last_name":"Verma","full_name":"Verma, Abhinav","first_name":"Abhinav","id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"status":"public","citation":{"ama":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. Compositional policy learning in stochastic control systems with formal guarantees. In: <i>37th Conference on Neural Information Processing Systems</i>. ; 2023.","mla":"Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” <i>37th Conference on Neural Information Processing Systems</i>, 2023.","short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, 2023.","ista":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional policy learning in stochastic control systems with formal guarantees. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.","apa":"Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &#38; Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In <i>37th Conference on Neural Information Processing Systems</i>. New Orleans, LO, United States.","ieee":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LO, United States, 2023.","chicago":"Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In <i>37th Conference on Neural Information Processing Systems</i>, 2023."},"day":"15","publication_status":"epub_ahead","type":"conference","_id":"15023","oa_version":"Preprint","project":[{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","publication":"37th Conference on Neural Information Processing Systems","arxiv":1,"article_processing_charge":"No","oa":1,"date_updated":"2025-07-14T09:10:04Z","title":"Compositional policy learning in stochastic control systems with formal guarantees","external_id":{"arxiv":["2312.01456"]},"language":[{"iso":"eng"}],"year":"2023","month":"12","ec_funded":1,"date_published":"2023-12-15T00:00:00Z","conference":{"start_date":"2023-12-10","end_date":"2023-12-16","location":"New Orleans, LO, United States","name":"NeurIPS: Neural Information Processing Systems"},"date_created":"2024-02-25T09:23:24Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2312.01456","open_access":"1"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}]},{"project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15035","article_processing_charge":"No","oa":1,"date_updated":"2024-02-28T12:33:09Z","author":[{"full_name":"Chalupa, Marek","last_name":"Chalupa","first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"status":"public","abstract":[{"lang":"eng","text":"This artifact aims to reproduce experiments from the paper Monitoring Hyperproperties With Prefix Transducers accepted at RV'23, and give further pointers to implementation of prefix transducers.\r\nIt has two parts: a pre-compiled docker image and sources that one can use to compile (locally or in docker) the software and run the experiments."}],"type":"research_data_reference","day":"28","citation":{"ieee":"M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers.” Zenodo, 2023.","apa":"Chalupa, M., &#38; Henzinger, T. A. (2023). Monitoring hyperproperties with prefix transducers. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.8191723\">https://doi.org/10.5281/ZENODO.8191723</a>","chicago":"Chalupa, Marek, and Thomas A Henzinger. “Monitoring Hyperproperties with Prefix Transducers.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.8191723\">https://doi.org/10.5281/ZENODO.8191723</a>.","mla":"Chalupa, Marek, and Thomas A. Henzinger. <i>Monitoring Hyperproperties with Prefix Transducers</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>.","ama":"Chalupa M, Henzinger TA. Monitoring hyperproperties with prefix transducers. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>","ista":"Chalupa M, Henzinger TA. 2023. Monitoring hyperproperties with prefix transducers, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>.","short":"M. Chalupa, T.A. Henzinger, (2023)."},"ddc":["000"],"date_created":"2024-02-28T07:34:34Z","related_material":{"record":[{"relation":"used_in_publication","id":"14076","status":"public"}]},"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.8191722","open_access":"1"}],"department":[{"_id":"ToHe"}],"has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"title":"Monitoring hyperproperties with prefix transducers","publisher":"Zenodo","ec_funded":1,"date_published":"2023-07-28T00:00:00Z","month":"07","year":"2023","doi":"10.5281/ZENODO.8191723"},{"ec_funded":1,"doi":"10.4230/LIPIcs.CONCUR.2023.17","year":"2023","external_id":{"arxiv":["2307.06016"]},"title":"Safety and liveness of quantitative automata","article_number":"17","alternative_title":["LIPIcs"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"publication_status":"published","citation":{"ama":"Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. Safety and liveness of quantitative automata. In: <i>34th International Conference on Concurrency Theory</i>. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.17\">10.4230/LIPIcs.CONCUR.2023.17</a>","mla":"Boker, Udi, et al. “Safety and Liveness of Quantitative Automata.” <i>34th International Conference on Concurrency Theory</i>, vol. 279, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.17\">10.4230/LIPIcs.CONCUR.2023.17</a>.","short":"U. Boker, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ista":"Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Safety and liveness of quantitative automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 17.","apa":"Boker, U., Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2023). Safety and liveness of quantitative automata. In <i>34th International Conference on Concurrency Theory</i> (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.17\">https://doi.org/10.4230/LIPIcs.CONCUR.2023.17</a>","ieee":"U. Boker, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Safety and liveness of quantitative automata,” in <i>34th International Conference on Concurrency Theory</i>, Antwerp, Belgium, 2023, vol. 279.","chicago":"Boker, Udi, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Safety and Liveness of Quantitative Automata.” In <i>34th International Conference on Concurrency Theory</i>, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.17\">https://doi.org/10.4230/LIPIcs.CONCUR.2023.17</a>."},"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi"},{"first_name":"Naci E","full_name":"Sarac, Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"abstract":[{"lang":"eng","text":"The safety-liveness dichotomy is a fundamental concept in formal languages which plays a key role in verification. Recently, this dichotomy has been lifted to quantitative properties, which are arbitrary functions from infinite words to partially-ordered domains. We look into harnessing the dichotomy for the specific classes of quantitative properties expressed by quantitative automata. These automata contain finitely many states and rational-valued transition weights, and their common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum map infinite words into the totallyordered domain of real numbers. In this automata-theoretic setting, we establish a connection between quantitative safety and topological continuity and provide an alternative characterization of quantitative safety and liveness in terms of their boolean counterparts. For all common value functions, we show how the safety closure of a quantitative automaton can be constructed in PTime, and we provide PSpace-complete checks of whether a given quantitative automaton is safe or live, with the exception of LimInfAvg and LimSupAvg automata, for which the safety check is in ExpSpace. Moreover, for deterministic Sup, LimInf, and LimSup automata, we give PTime decompositions into safe and live automata. These decompositions enable the separation of techniques for safety and liveness verification for quantitative specifications."}],"oa":1,"volume":279,"date_updated":"2023-10-09T07:14:03Z","article_processing_charge":"No","arxiv":1,"acknowledgement":"We thank Christof Löding for pointing us to some results on PSpace-hardess of universality problems and the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093 and the Israel Science Foundation grant 2410/22.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"oa_version":"Published Version","quality_controlled":"1","_id":"13221","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772990"]},"date_published":"2023-09-01T00:00:00Z","month":"09","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"has_accepted_license":"1","file":[{"success":1,"content_type":"application/pdf","relation":"main_file","file_id":"13224","creator":"esarac","file_name":"CONCUR23.pdf","file_size":755529,"date_created":"2023-07-14T12:03:48Z","checksum":"d40e57a04448ea5c77d7e1cfb9590a81","date_updated":"2023-07-14T12:03:48Z","access_level":"open_access"}],"date_created":"2023-07-14T10:00:15Z","conference":{"name":"CONCUR: Conference on Concurrency Theory","end_date":"2023-09-23","location":"Antwerp, Belgium","start_date":"2023-09-18"},"type":"conference","day":"01","status":"public","intvolume":"       279","file_date_updated":"2023-07-14T12:03:48Z","publication":"34th International Conference on Concurrency Theory"},{"external_id":{"arxiv":["2305.04699"],"isi":["001062819300057"]},"title":"Runtime monitoring of dynamic fairness properties","ec_funded":1,"year":"2023","doi":"10.1145/3593013.3594028","ddc":["000"],"isi":1,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"author":[{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mahyar","full_name":"Karimi, Mahyar","last_name":"Karimi"},{"first_name":"Konstantin","last_name":"Kueffner","full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542","id":"8121a2d0-dc85-11ea-9058-af578f3b4515"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","first_name":"Kaushik"}],"abstract":[{"lang":"eng","text":"A machine-learned system that is fair in static decision-making tasks may have biased societal impacts in the long-run. This may happen when the system interacts with humans and feedback patterns emerge, reinforcing old biases in the system and creating new biases. While existing works try to identify and mitigate long-run biases through smart system design, we introduce techniques for monitoring fairness in real time. Our goal is to build and deploy a monitor that will continuously observe a long sequence of events generated by the system in the wild, and will output, with each event, a verdict on how fair the system is at the current point in time. The advantages of monitoring are two-fold. Firstly, fairness is evaluated at run-time, which is important because unfair behaviors may not be eliminated a priori, at design-time, due to partial knowledge about the system and the environment, as well as uncertainties and dynamic changes in the system and the environment, such as the unpredictability of human behavior. Secondly, monitors are by design oblivious to how the monitored system is constructed, which makes them suitable to be used as trusted third-party fairness watchdogs. They function as computationally lightweight statistical estimators, and their correctness proofs rely on the rigorous analysis of the stochastic process that models the assumptions about the underlying dynamics of the system. We show, both in theory and experiments, how monitors can warn us (1) if a bank’s credit policy over time has created an unfair distribution of credit scores among the population, and (2) if a resource allocator’s allocation policy over time has made unfair allocations. Our experiments demonstrate that the monitors introduce very low overhead. We believe that runtime monitoring is an important and mathematically rigorous new addition to the fairness toolbox."}],"publication_status":"published","citation":{"ama":"Henzinger TA, Karimi M, Kueffner K, Mallik K. Runtime monitoring of dynamic fairness properties. In: <i>FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency</i>. Association for Computing Machinery; 2023:604-614. doi:<a href=\"https://doi.org/10.1145/3593013.3594028\">10.1145/3593013.3594028</a>","mla":"Henzinger, Thomas A., et al. “Runtime Monitoring of Dynamic Fairness Properties.” <i>FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency</i>, Association for Computing Machinery, 2023, pp. 604–14, doi:<a href=\"https://doi.org/10.1145/3593013.3594028\">10.1145/3593013.3594028</a>.","short":"T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, Association for Computing Machinery, 2023, pp. 604–614.","ista":"Henzinger TA, Karimi M, Kueffner K, Mallik K. 2023. Runtime monitoring of dynamic fairness properties. FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency. FAccT: Conference on Fairness, Accountability and Transparency, 604–614.","apa":"Henzinger, T. A., Karimi, M., Kueffner, K., &#38; Mallik, K. (2023). Runtime monitoring of dynamic fairness properties. In <i>FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency</i> (pp. 604–614). Chicago, IL, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3593013.3594028\">https://doi.org/10.1145/3593013.3594028</a>","ieee":"T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Runtime monitoring of dynamic fairness properties,” in <i>FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency</i>, Chicago, IL, United States, 2023, pp. 604–614.","chicago":"Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik. “Runtime Monitoring of Dynamic Fairness Properties.” In <i>FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency</i>, 604–14. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3593013.3594028\">https://doi.org/10.1145/3593013.3594028</a>."},"acknowledgement":"The authors would like to thank the anonymous reviewers for their valuable comments and helpful suggestions. This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"oa_version":"Published Version","_id":"13228","publication_identifier":{"isbn":["9781450372527"]},"oa":1,"date_updated":"2023-12-13T11:30:31Z","article_processing_charge":"No","arxiv":1,"language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","scopus_import":"1","date_published":"2023-06-12T00:00:00Z","month":"06","file":[{"creator":"dernst","file_id":"13245","content_type":"application/pdf","relation":"main_file","success":1,"date_updated":"2023-07-18T07:43:10Z","access_level":"open_access","date_created":"2023-07-18T07:43:10Z","checksum":"96c759db9cdf94b81e37871a66a6ff48","file_name":"2023_ACM_HenzingerT.pdf","file_size":4100596}],"date_created":"2023-07-16T22:01:09Z","conference":{"end_date":"2023-06-15","location":"Chicago, IL, United States","name":"FAccT: Conference on Fairness, Accountability and Transparency","start_date":"2023-06-12"},"department":[{"_id":"ToHe"}],"has_accepted_license":"1","status":"public","type":"conference","day":"12","page":"604-614","file_date_updated":"2023-07-18T07:43:10Z","publication":"FAccT '23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency"},{"file_date_updated":"2024-01-30T12:06:07Z","page":"575-592","publication":"International Journal on Software Tools for Technology Transfer","status":"public","intvolume":"        25","type":"journal_article","day":"01","date_created":"2023-07-16T22:01:11Z","file":[{"file_name":"2023_JourSoftwareTools_Kueffner.pdf","file_size":13387667,"date_created":"2024-01-30T12:06:07Z","checksum":"3c4b347f39412a76872f9a6f30101f94","date_updated":"2024-01-30T12:06:07Z","access_level":"open_access","success":1,"content_type":"application/pdf","relation":"main_file","creator":"dernst","file_id":"14903"}],"department":[{"_id":"ToHe"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Springer Nature","article_type":"original","date_published":"2023-08-01T00:00:00Z","month":"08","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093"}],"oa_version":"Published Version","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, by DIREC - Digital Research Centre Denmark, and by the Villum Investigator Grant S4OS.","publication_identifier":{"eissn":["1433-2787"],"issn":["1433-2779"]},"_id":"13234","article_processing_charge":"Yes (in subscription journal)","volume":25,"oa":1,"date_updated":"2024-01-30T12:06:57Z","arxiv":1,"author":[{"id":"8121a2d0-dc85-11ea-9058-af578f3b4515","first_name":"Konstantin","orcid":"0000-0001-8974-2542","full_name":"Kueffner, Konstantin","last_name":"Kueffner"},{"id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","first_name":"Anna","full_name":"Lukina, Anna","last_name":"Lukina"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","last_name":"Schilling","full_name":"Schilling, Christian","first_name":"Christian"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"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. We consider the problem of monitoring the classification decisions of neural networks in the presence of novel classes. For this purpose, we generalize our recently proposed abstraction-based monitor from binary output to real-valued quantitative output. This quantitative output enables new applications, two of which we investigate in the paper. As our first application, we introduce an algorithmic framework for active monitoring of a neural network, which allows us to learn new classes dynamically and yet maintain high monitoring performance. As our second application, we present an offline procedure to retrain the neural network to improve the monitor’s detection performance without deteriorating the network’s classification accuracy. Our experimental evaluation demonstrates both the benefits of our active monitoring framework in dynamic scenarios and the effectiveness of the retraining procedure."}],"citation":{"mla":"Kueffner, Konstantin, et al. “Into the Unknown: Active Monitoring of Neural Networks (Extended Version).” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 25, Springer Nature, 2023, pp. 575–92, doi:<a href=\"https://doi.org/10.1007/s10009-023-00711-4\">10.1007/s10009-023-00711-4</a>.","ama":"Kueffner K, Lukina A, Schilling C, Henzinger TA. Into the unknown: Active monitoring of neural networks (extended version). <i>International Journal on Software Tools for Technology Transfer</i>. 2023;25:575-592. doi:<a href=\"https://doi.org/10.1007/s10009-023-00711-4\">10.1007/s10009-023-00711-4</a>","ista":"Kueffner K, Lukina A, Schilling C, Henzinger TA. 2023. Into the unknown: Active monitoring of neural networks (extended version). International Journal on Software Tools for Technology Transfer. 25, 575–592.","short":"K. Kueffner, A. Lukina, C. Schilling, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 25 (2023) 575–592.","ieee":"K. Kueffner, A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: Active monitoring of neural networks (extended version),” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 25. Springer Nature, pp. 575–592, 2023.","apa":"Kueffner, K., Lukina, A., Schilling, C., &#38; Henzinger, T. A. (2023). Into the unknown: Active monitoring of neural networks (extended version). <i>International Journal on Software Tools for Technology Transfer</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10009-023-00711-4\">https://doi.org/10.1007/s10009-023-00711-4</a>","chicago":"Kueffner, Konstantin, Anna Lukina, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks (Extended Version).” <i>International Journal on Software Tools for Technology Transfer</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s10009-023-00711-4\">https://doi.org/10.1007/s10009-023-00711-4</a>."},"publication_status":"published","ddc":["000"],"related_material":{"record":[{"id":"10206","relation":"shorter_version","status":"public"}]},"isi":1,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"title":"Into the unknown: Active monitoring of neural networks (extended version)","external_id":{"arxiv":["2009.06429"],"isi":["001020160000001"]},"ec_funded":1,"doi":"10.1007/s10009-023-00711-4","year":"2023"},{"author":[{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Pavol","full_name":"Kebis, Pavol","last_name":"Kebis"},{"id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi","first_name":"Nicolas Adrien"},{"full_name":"Sarac, Naci E","last_name":"Sarac","first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"abstract":[{"lang":"eng","text":"The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time."}],"citation":{"mla":"Henzinger, Thomas A., et al. “Regular Methods for Operator Precedence Languages.” <i>50th International Colloquium on Automata, Languages, and Programming</i>, vol. 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">10.4230/LIPIcs.ICALP.2023.129</a>.","ama":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Regular methods for operator precedence languages. In: <i>50th International Colloquium on Automata, Languages, and Programming</i>. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:129:1--129:20. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">10.4230/LIPIcs.ICALP.2023.129</a>","ista":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2023. Regular methods for operator precedence languages. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 129:1--129:20.","short":"T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20.","ieee":"T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Regular methods for operator precedence languages,” in <i>50th International Colloquium on Automata, Languages, and Programming</i>, Paderborn, Germany, 2023, vol. 261, p. 129:1--129:20.","apa":"Henzinger, T. A., Kebis, P., Mazzocchi, N. A., &#38; Sarac, N. E. (2023). Regular methods for operator precedence languages. In <i>50th International Colloquium on Automata, Languages, and Programming</i> (Vol. 261, p. 129:1--129:20). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">https://doi.org/10.4230/LIPIcs.ICALP.2023.129</a>","chicago":"Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Regular Methods for Operator Precedence Languages.” In <i>50th International Colloquium on Automata, Languages, and Programming</i>, 261:129:1--129:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">https://doi.org/10.4230/LIPIcs.ICALP.2023.129</a>."},"publication_status":"published","quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"oa_version":"Published Version","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe thank Pierre Ganty for early discussions and the anonymous reviewers for their helpful comments.\r\n","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772785"]},"_id":"13292","article_processing_charge":"Yes","volume":261,"oa":1,"date_updated":"2023-07-31T08:38:38Z","arxiv":1,"external_id":{"arxiv":["2305.03447"]},"title":"Regular methods for operator precedence languages","ec_funded":1,"doi":"10.4230/LIPIcs.ICALP.2023.129","year":"2023","ddc":["000"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"alternative_title":["LIPIcs"],"status":"public","intvolume":"       261","type":"conference","day":"05","file_date_updated":"2023-07-24T15:11:05Z","page":"129:1--129:20","publication":"50th International Colloquium on Automata, Languages, and Programming","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2023-07-05T00:00:00Z","month":"07","file":[{"date_created":"2023-07-24T15:11:05Z","checksum":"5d4c8932ef3450615a53b9bb15d92eb2","file_name":"icalp23.pdf","file_size":859379,"date_updated":"2023-07-24T15:11:05Z","access_level":"open_access","success":1,"creator":"esarac","file_id":"13293","content_type":"application/pdf","relation":"main_file"}],"date_created":"2023-07-24T15:11:41Z","conference":{"start_date":"2023-07-10","location":"Paderborn, Germany","name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2023-07-14"},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"has_accepted_license":"1"},{"type":"conference","day":"18","status":"public","intvolume":"     13965","file_date_updated":"2023-07-31T08:11:20Z","page":"358–382","publication":"Computer Aided Verification","date_published":"2023-07-18T00:00:00Z","month":"07","language":[{"iso":"eng"}],"publisher":"Springer Nature","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"has_accepted_license":"1","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","creator":"dernst","file_id":"13327","file_size":647760,"file_name":"2023_LNCS_CAV_HenzingerT.pdf","checksum":"ccaf94bf7d658ba012c016e11869b54c","date_created":"2023-07-31T08:11:20Z","access_level":"open_access","date_updated":"2023-07-31T08:11:20Z"}],"date_created":"2023-07-25T18:32:40Z","conference":{"end_date":"2023-07-22","location":"Paris, France","name":"CAV: Computer Aided Verification","start_date":"2023-07-17"},"citation":{"ieee":"T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness,” in <i>Computer Aided Verification</i>, Paris, France, 2023, vol. 13965, pp. 358–382.","apa":"Henzinger, T. A., Karimi, M., Kueffner, K., &#38; Mallik, K. (2023). Monitoring algorithmic fairness. In <i>Computer Aided Verification</i> (Vol. 13965, pp. 358–382). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">https://doi.org/10.1007/978-3-031-37703-7_17</a>","chicago":"Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness.” In <i>Computer Aided Verification</i>, 13965:358–382. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">https://doi.org/10.1007/978-3-031-37703-7_17</a>.","ama":"Henzinger TA, Karimi M, Kueffner K, Mallik K. Monitoring algorithmic fairness. In: <i>Computer Aided Verification</i>. Vol 13965. Springer Nature; 2023:358–382. doi:<a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">10.1007/978-3-031-37703-7_17</a>","mla":"Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness.” <i>Computer Aided Verification</i>, vol. 13965, Springer Nature, 2023, pp. 358–382, doi:<a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">10.1007/978-3-031-37703-7_17</a>.","short":"T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, Computer Aided Verification, Springer Nature, 2023, pp. 358–382.","ista":"Henzinger TA, Karimi M, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13965, 358–382."},"publication_status":"published","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"f1dedef5-2f78-11ee-989a-c4c97bccf506","first_name":"Mahyar","orcid":"0009-0005-0820-1696","last_name":"Karimi","full_name":"Karimi, Mahyar"},{"id":"8121a2d0-dc85-11ea-9058-af578f3b4515","orcid":"0000-0001-8974-2542","last_name":"Kueffner","full_name":"Kueffner, Konstantin","first_name":"Konstantin"},{"last_name":"Mallik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"}],"abstract":[{"lang":"eng","text":"Machine-learned systems are in widespread use for making decisions about humans, and it is important that they are fair, i.e., not biased against individuals based on sensitive attributes. We present runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure. We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden. We build monitors that observe a long sequence of events as generated by a given system, and output, after each observation, a quantitative estimate of how fair or biased the system was on that run until that point in time. The estimate is proven to be correct modulo a variable error bound and a given confidence level, where the error bound gets tighter as the observed sequence gets longer. Our monitors are of two types, and use, respectively, frequentist and Bayesian statistical inference techniques. While the frequentist monitors compute estimates that are objectively correct with respect to the ground truth, the Bayesian monitors compute estimates that are correct subject to a given prior belief about the system’s model. Using a prototype implementation, we show how we can monitor if a bank is fair in giving loans to applicants from different social backgrounds, and if a college is fair in admitting students while maintaining a reasonable financial burden on the society. Although they exhibit different theoretical complexities in certain cases, in our experiments, both frequentist and Bayesian monitors took less than a millisecond to update their verdicts after each observation."}],"article_processing_charge":"Yes (in subscription journal)","date_updated":"2023-09-05T15:14:00Z","volume":13965,"oa":1,"arxiv":1,"oa_version":"Published Version","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093"}],"quality_controlled":"1","acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG101020093.","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031377020"],"eisbn":["9783031377037"],"eissn":["1611-3349"]},"_id":"13310","ec_funded":1,"doi":"10.1007/978-3-031-37703-7_17","year":"2023","external_id":{"arxiv":["2305.15979"]},"title":"Monitoring algorithmic fairness","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"alternative_title":["LNCS"],"ddc":["000"]},{"page":"168-190","file_date_updated":"2023-10-16T07:15:11Z","publication":"23nd International Conference on Runtime Verification","status":"public","intvolume":"     14245","type":"conference","day":"01","date_created":"2023-08-16T20:46:08Z","file":[{"date_updated":"2023-10-16T07:15:11Z","access_level":"open_access","file_name":"2023_LNCS_RV_Chalupa.pdf","file_size":867256,"date_created":"2023-10-16T07:15:11Z","checksum":"ee33bd6f1a26f4dae7a8192584869fd8","content_type":"application/pdf","relation":"main_file","file_id":"14430","creator":"dernst","success":1}],"conference":{"location":"Thessaloniki, Greek","end_date":"2023-10-07","name":"RV: Conference on Runtime Verification","start_date":"2023-10-04"},"department":[{"_id":"ToHe"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"publisher":"Springer Nature","date_published":"2023-10-01T00:00:00Z","month":"10","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. The authors would like to thank Ana Oliveira da Costa for commenting on a draft of the paper.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","project":[{"grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"quality_controlled":"1","_id":"14076","publication_identifier":{"eisbn":["978-3-031-44267-4"],"isbn":["978-3-031-44266-7"]},"volume":14245,"oa":1,"date_updated":"2024-02-28T12:33:08Z","article_processing_charge":"Yes (in subscription journal)","author":[{"last_name":"Chalupa","full_name":"Chalupa, Marek","first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"abstract":[{"text":"Hyperproperties are properties that relate multiple execution traces. Previous work on monitoring hyperproperties focused on synchronous hyperproperties, usually specified in HyperLTL. When monitoring synchronous hyperproperties, all traces are assumed to proceed at the same speed. We introduce (multi-trace) prefix transducers and show how to use them for monitoring synchronous as well as, for the first time, asynchronous hyperproperties. Prefix transducers map multiple input traces into one or more output traces by incrementally matching prefixes of the input traces against expressions similar to regular expressions. The prefixes of different traces which are consumed by a single matching step of the monitor may have different lengths. The deterministic and executable nature of prefix transducers makes them more suitable as an intermediate formalism for runtime verification than logical specifications, which tend to be highly non-deterministic, especially in the case of asynchronous hyperproperties. We report on a set of experiments about monitoring asynchronous version of observational determinism.","lang":"eng"}],"publication_status":"published","citation":{"short":"M. Chalupa, T.A. Henzinger, in:, 23nd International Conference on Runtime Verification, Springer Nature, 2023, pp. 168–190.","ista":"Chalupa M, Henzinger TA. 2023. Monitoring hyperproperties with prefix transducers. 23nd International Conference on Runtime Verification. RV: Conference on Runtime Verification, LNCS, vol. 14245, 168–190.","mla":"Chalupa, Marek, and Thomas A. Henzinger. “Monitoring Hyperproperties with Prefix Transducers.” <i>23nd International Conference on Runtime Verification</i>, vol. 14245, Springer Nature, 2023, pp. 168–90, doi:<a href=\"https://doi.org/10.1007/978-3-031-44267-4_9\">10.1007/978-3-031-44267-4_9</a>.","ama":"Chalupa M, Henzinger TA. Monitoring hyperproperties with prefix transducers. In: <i>23nd International Conference on Runtime Verification</i>. Vol 14245. Springer Nature; 2023:168-190. doi:<a href=\"https://doi.org/10.1007/978-3-031-44267-4_9\">10.1007/978-3-031-44267-4_9</a>","chicago":"Chalupa, Marek, and Thomas A Henzinger. “Monitoring Hyperproperties with Prefix Transducers.” In <i>23nd International Conference on Runtime Verification</i>, 14245:168–90. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-44267-4_9\">https://doi.org/10.1007/978-3-031-44267-4_9</a>.","ieee":"M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers,” in <i>23nd International Conference on Runtime Verification</i>, Thessaloniki, Greek, 2023, vol. 14245, pp. 168–190.","apa":"Chalupa, M., &#38; Henzinger, T. A. (2023). Monitoring hyperproperties with prefix transducers. In <i>23nd International Conference on Runtime Verification</i> (Vol. 14245, pp. 168–190). Thessaloniki, Greek: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-44267-4_9\">https://doi.org/10.1007/978-3-031-44267-4_9</a>"},"ddc":["000"],"related_material":{"record":[{"status":"public","id":"15035","relation":"research_data"}]},"alternative_title":["LNCS"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"title":"Monitoring hyperproperties with prefix transducers","ec_funded":1,"year":"2023","doi":"10.1007/978-3-031-44267-4_9"},{"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"conference":{"start_date":"2023-02-07","location":"Washington, DC, United States","end_date":"2023-02-14","name":"AAAI: Conference on Artificial Intelligence"},"date_created":"2023-08-27T22:01:17Z","month":"06","date_published":"2023-06-26T00:00:00Z","scopus_import":"1","publisher":"Association for the Advancement of Artificial Intelligence","language":[{"iso":"eng"}],"publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","issue":"12","page":"14964-14973","day":"26","type":"conference","intvolume":"        37","status":"public","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2211.16187","open_access":"1"}],"doi":"10.1609/aaai.v37i12.26747","year":"2023","ec_funded":1,"title":"Quantization-aware interval bound propagation for training certifiably robust quantized neural networks","external_id":{"arxiv":["2211.16187"]},"arxiv":1,"article_processing_charge":"No","volume":37,"date_updated":"2025-07-14T09:09:56Z","oa":1,"publication_identifier":{"isbn":["9781577358800"]},"_id":"14242","oa_version":"Preprint","quality_controlled":"1","project":[{"grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. Research was sponsored by the United\r\nStates Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-\r\n1000. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied,\r\nof the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright\r\nnotation herein. The research was also funded in part by the AI2050 program at Schmidt Futures (Grant G-22-63172) and Capgemini SE.","citation":{"chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, Thomas A Henzinger, and Daniela Rus. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, 37:14964–73. Association for the Advancement of Artificial Intelligence, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">https://doi.org/10.1609/aaai.v37i12.26747</a>.","ieee":"M. Lechner, D. Zikelic, K. Chatterjee, T. A. Henzinger, and D. Rus, “Quantization-aware interval bound propagation for training certifiably robust quantized neural networks,” in <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, Washington, DC, United States, 2023, vol. 37, no. 12, pp. 14964–14973.","apa":"Lechner, M., Zikelic, D., Chatterjee, K., Henzinger, T. A., &#38; Rus, D. (2023). Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (Vol. 37, pp. 14964–14973). Washington, DC, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">https://doi.org/10.1609/aaai.v37i12.26747</a>","short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, D. Rus, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–14973.","ista":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA, Rus D. 2023. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 14964–14973.","mla":"Lechner, Mathias, et al. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.” <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, vol. 37, no. 12, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–73, doi:<a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">10.1609/aaai.v37i12.26747</a>.","ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA, Rus D. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In: <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>. Vol 37. Association for the Advancement of Artificial Intelligence; 2023:14964-14973. doi:<a href=\"https://doi.org/10.1609/aaai.v37i12.26747\">10.1609/aaai.v37i12.26747</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"We study the problem of training and certifying adversarially robust quantized neural networks (QNNs). Quantization is a technique for making neural networks more efficient by running them using low-bit integer arithmetic and is therefore commonly adopted in industry. Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization, and certification of the quantized representation is necessary to guarantee robustness. In this work, we present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs. Inspired by advances in robust learning of non-quantized networks, our training algorithm computes the gradient of an abstract representation of the actual network. Unlike existing approaches, our method can handle the discrete semantics of QNNs. Based on QA-IBP, we also develop a complete verification procedure for verifying the adversarial robustness of QNNs, which is guaranteed to terminate and produce a correct answer. Compared to existing approaches, the key advantage of our verification procedure is that it runs entirely on GPU or other accelerator devices. We demonstrate experimentally that our approach significantly outperforms existing methods and establish the new state-of-the-art for training and certifying the robustness of QNNs."}],"author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","full_name":"Zikelic, Dorde"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"}]},{"page":"38","file_date_updated":"2023-01-27T03:18:34Z","status":"public","day":"27","type":"technical_report","file":[{"access_level":"open_access","date_updated":"2023-01-27T03:18:34Z","file_size":662409,"file_name":"main.pdf","checksum":"55426e463fdeafe9777fc3ff635154c7","date_created":"2023-01-27T03:18:34Z","relation":"main_file","content_type":"application/pdf","creator":"fmuehlbo","file_id":"12408","success":1}],"date_created":"2023-01-27T03:18:08Z","has_accepted_license":"1","department":[{"_id":"ToHe"}],"publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"month":"01","date_published":"2023-01-27T00:00:00Z","_id":"12407","publication_identifier":{"eissn":["2664-1690"]},"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. \r\nThe authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"oa_version":"Published Version","oa":1,"date_updated":"2023-04-25T07:19:06Z","article_processing_charge":"No","abstract":[{"text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\n\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch.","lang":"eng"}],"author":[{"last_name":"Chalupa","full_name":"Chalupa, Marek","first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian","orcid":"0000-0003-1548-0177","last_name":"Mühlböck","full_name":"Mühlböck, Fabian"},{"id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","full_name":"Muroya Lei, Stefanie","last_name":"Muroya Lei","first_name":"Stefanie"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"keyword":["runtime monitoring","best effort","third party"],"publication_status":"published","citation":{"short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 2023.","ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 38p.","ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria; 2023. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:12407\">10.15479/AT:ISTA:12407</a>","mla":"Chalupa, Marek, et al. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:12407\">10.15479/AT:ISTA:12407</a>.","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/AT:ISTA:12407\">https://doi.org/10.15479/AT:ISTA:12407</a>.","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., &#38; Henzinger, T. A. (2023). <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:12407\">https://doi.org/10.15479/AT:ISTA:12407</a>","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, <i>VAMOS: Middleware for Best-Effort Third-Party Monitoring</i>. Institute of Science and Technology Austria, 2023."},"related_material":{"record":[{"status":"public","relation":"later_version","id":"12856"}]},"ddc":["005"],"alternative_title":["IST Austria Technical Report"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"title":"VAMOS: Middleware for Best-Effort Third-Party Monitoring","doi":"10.15479/AT:ISTA:12407","year":"2023","ec_funded":1},{"author":[{"first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","last_name":"Sarac","full_name":"Sarac, Naci E","first_name":"Naci E"}],"abstract":[{"lang":"eng","text":"Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In quantitative specification and verification, properties assign not truth values, but quantitative values to infinite traces (e.g., a cost, or the distance to a boolean property). We introduce quantitative safety and liveness, and we prove that our definitions induce conservative quantitative generalizations of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness decomposition of boolean properties. In particular, we show that every quantitative property can be written as the pointwise minimum of a quantitative safety property and a quantitative liveness property. Consequently, like boolean properties, also quantitative properties can be min-decomposed into safety and liveness parts, or alternatively, max-decomposed into co-safety and co-liveness parts. Moreover, quantitative properties can be approximated naturally. We prove that every quantitative property that has both safe and co-safe approximations can be monitored arbitrarily precisely by a monitor that uses only a finite number of states."}],"citation":{"mla":"Henzinger, Thomas A., et al. “Quantitative Safety and Liveness.” <i>26th International Conference Foundations of Software Science and Computation Structures</i>, vol. 13992, Springer Nature, 2023, pp. 349–70, doi:<a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">10.1007/978-3-031-30829-1_17</a>.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Quantitative safety and liveness. In: <i>26th International Conference Foundations of Software Science and Computation Structures</i>. Vol 13992. Springer Nature; 2023:349-370. doi:<a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">10.1007/978-3-031-30829-1_17</a>","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 26th International Conference Foundations of Software Science and Computation Structures, Springer Nature, 2023, pp. 349–370.","ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Quantitative safety and liveness. 26th International Conference Foundations of Software Science and Computation Structures. FOSSACS: Foundations of Software Science and Computation Structures, LNCS, vol. 13992, 349–370.","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Quantitative safety and liveness,” in <i>26th International Conference Foundations of Software Science and Computation Structures</i>, Paris, France, 2023, vol. 13992, pp. 349–370.","apa":"Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2023). Quantitative safety and liveness. In <i>26th International Conference Foundations of Software Science and Computation Structures</i> (Vol. 13992, pp. 349–370). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">https://doi.org/10.1007/978-3-031-30829-1_17</a>","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Safety and Liveness.” In <i>26th International Conference Foundations of Software Science and Computation Structures</i>, 13992:349–70. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30829-1_17\">https://doi.org/10.1007/978-3-031-30829-1_17</a>."},"publication_status":"published","project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"quality_controlled":"1","oa_version":"Published Version","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_identifier":{"isbn":["9783031308284"],"issn":["0302-9743"],"eissn":["1611-3349"]},"_id":"12467","article_processing_charge":"No","date_updated":"2023-07-14T11:20:27Z","volume":13992,"oa":1,"arxiv":1,"external_id":{"arxiv":["2301.11175"]},"title":"Quantitative safety and liveness","ec_funded":1,"doi":"10.1007/978-3-031-30829-1_17","year":"2023","ddc":["000"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"alternative_title":["LNCS"],"status":"public","intvolume":"     13992","type":"conference","day":"21","file_date_updated":"2023-06-19T10:28:09Z","page":"349-370","publication":"26th International Conference Foundations of Software Science and Computation Structures","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Springer Nature","date_published":"2023-04-21T00:00:00Z","month":"04","file":[{"access_level":"open_access","date_updated":"2023-01-31T07:22:21Z","checksum":"981025aed580b6b27c426cb8856cf63e","date_created":"2023-01-31T07:22:21Z","file_size":449027,"file_name":"qsl.pdf","creator":"esarac","file_id":"12468","relation":"main_file","content_type":"application/pdf","success":1},{"creator":"dernst","file_id":"13153","content_type":"application/pdf","relation":"main_file","success":1,"date_updated":"2023-06-19T10:28:09Z","access_level":"open_access","date_created":"2023-06-19T10:28:09Z","checksum":"f16e2af1e0eb243158ab0f0fe74e7d5a","file_name":"2023_LNCS_HenzingerT.pdf","file_size":1048171}],"date_created":"2023-01-31T07:23:56Z","conference":{"start_date":"2023-04-22","name":"FOSSACS: Foundations of Software Science and Computation Structures","end_date":"2023-04-27","location":"Paris, France"},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"has_accepted_license":"1"},{"type":"conference","day":"20","status":"public","intvolume":"     13994","file_date_updated":"2023-04-25T06:58:36Z","page":"535-540","publication":"Tools and Algorithms for the Construction and Analysis of Systems","date_published":"2023-04-20T00:00:00Z","month":"04","language":[{"iso":"eng"}],"publisher":"Springer Nature","department":[{"_id":"ToHe"}],"has_accepted_license":"1","date_created":"2023-04-20T08:22:53Z","file":[{"creator":"dernst","file_id":"12864","relation":"main_file","content_type":"application/pdf","success":1,"access_level":"open_access","date_updated":"2023-04-25T06:58:36Z","checksum":"120d2c2a38384058ad0630fdf8288312","date_created":"2023-04-25T06:58:36Z","file_size":16096413,"file_name":"2023_LNCS_Chalupa.pdf"}],"conference":{"end_date":"2023-04-27","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Paris, France","start_date":"2023-04-22"},"citation":{"chicago":"Chalupa, Marek, and Thomas A Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, 13994:535–40. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-30820-8_32\">https://doi.org/10.1007/978-3-031-30820-8_32</a>.","apa":"Chalupa, M., &#38; Henzinger, T. A. (2023). Bubaak: Runtime monitoring of program verifiers. In <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 13994, pp. 535–540). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-30820-8_32\">https://doi.org/10.1007/978-3-031-30820-8_32</a>","ieee":"M. Chalupa and T. A. Henzinger, “Bubaak: Runtime monitoring of program verifiers,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Paris, France, 2023, vol. 13994, pp. 535–540.","short":"M. Chalupa, T.A. Henzinger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 535–540.","ista":"Chalupa M, Henzinger TA. 2023. Bubaak: Runtime monitoring of program verifiers. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13994, 535–540.","ama":"Chalupa M, Henzinger TA. Bubaak: Runtime monitoring of program verifiers. In: <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 13994. Springer Nature; 2023:535-540. doi:<a href=\"https://doi.org/10.1007/978-3-031-30820-8_32\">10.1007/978-3-031-30820-8_32</a>","mla":"Chalupa, Marek, and Thomas A. Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 13994, Springer Nature, 2023, pp. 535–40, doi:<a href=\"https://doi.org/10.1007/978-3-031-30820-8_32\">10.1007/978-3-031-30820-8_32</a>."},"publication_status":"published","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","full_name":"Chalupa, Marek","first_name":"Marek"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"The main idea behind BUBAAK is to run multiple program analyses in parallel and use runtime monitoring and enforcement to observe and control their progress in real time. The analyses send information about (un)explored states of the program and discovered invariants to a monitor. The monitor processes the received data and can force an analysis to stop the search of certain program parts (which have already been analyzed by other analyses), or to make it utilize a program invariant found by another analysis.\r\nAt SV-COMP  2023, the implementation of data exchange between the monitor and the analyses was not yet completed, which is why BUBAAK only ran several analyses in parallel, without any coordination. Still, BUBAAK won the meta-category FalsificationOverall and placed very well in several other (sub)-categories of the competition."}],"article_processing_charge":"No","oa":1,"volume":13994,"date_updated":"2023-04-25T07:02:43Z","project":[{"grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"quality_controlled":"1","oa_version":"Published Version","acknowledgement":"This work was supported by the ERC-2020-AdG 10102009 grant.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783031308208"],"isbn":["9783031308192"],"issn":["0302-9743"]},"_id":"12854","ec_funded":1,"year":"2023","doi":"10.1007/978-3-031-30820-8_32","title":"Bubaak: Runtime monitoring of program verifiers","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"alternative_title":["LNCS"],"ddc":["000"]}]