[{"PlanS_conform":"1","supplementarymaterial":"no","keyword":["Reinforcement learning","Runtime safety assurance","Shield","Safety","Industrial application"],"corr_author":"1","OA_place":"publisher","oa":1,"article_processing_charge":"Yes","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","dataavailabilitystatement":"No data was used for the research described in the article.","publication_status":"epub_ahead","title":"Shielded reinforcement learning for industrial applications: A systematic literature survey","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"fulldoi":"https://doi.org/10.1016/j.iswa.2026.200729","status":"public","ec_funded":1,"ddc":["000"],"type":"journal_article","OA_type":"gold","quality_controlled":"1","article_number":"200729","intvolume":"        32","publication_identifier":{"issn":["2667-3053"]},"article_type":"review","researchdata_availability":"no","volume":32,"publisher":"Elsevier","oa_version":"Published Version","month":"09","acknowledgement":"This work was supported in part by the SAFEXPLAIN project under Grant 101069595.\r\nThis work was supported in part by the ROBOCONS project under Grant 101235566, from the European Union‘s HORIZON-CL5-2024-D4-02 research and innovation programme.\r\nThis work was supported in part by the Austrian Science Fund (FWF) - Reference 10.55776/COE12.\r\nThis work was supported in part by the Intelligent Systems for Industrial Systems research group of Mondragon Unibertsitatea - Reference IT1870-26. Department of Science, Universities and Innovation of the Basque Government.\r\nThis work was supported in part by the European Research Council under Grant No.: ERC-2020-AdG 101020093. This work was also supported by the ISTA Responsible AI Program, made possible through the support of Garrett Camp and the Camp Foundation .","department":[{"_id":"ToHe"}],"_id":"22999","scopus_import":"1","abstract":[{"lang":"eng","text":"The safety of Reinforcement Learning (RL)-based controllers has become a prominent research area in recent years, with various approaches being proposed to address this critical issue. Runtime Safety Assurance (RSA) methods for RL, such as Shielded RL, provide formal safety guarantees by preventing agents from taking unsafe actions and suggesting safe alternatives when necessary. However, previous surveys and reviews on RSA for RL have not thoroughly analysed the challenges and applications within the industrial sector. This study builds on existing state-of-the-art research on Shielded RL methods, emphasising its contributions to industrial applications and offering a domain-specific categorisation. This categorisation highlights the primary industrial domains utilising Shielded RL, detailing the optimised functions achieved by RL and the safety functions ensured by the shield. Additionally, the study presents a categorisation based on environmental features, enabling readers to assess the complexity of the problems addressed by the techniques studied. The shield’s attributes are analysed for each work, identifying key trends in their application, including their adaptability to new scenarios. Finally, a basic categorisation model for Shielded RL approaches, grounded in industrial safety standards, is introduced. This model serves as a baseline for future studies aiming to evaluate the maturity level of the works reviewed."}],"day":"18","DOAJ_listed":"1","date_published":"2026-09-18T00:00:00Z","doi":"10.1016/j.iswa.2026.200729","das_tickbox":"1","author":[{"full_name":"Odriozola-Olalde, Haritz","first_name":"Haritz","last_name":"Odriozola-Olalde"},{"first_name":"Filip","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1","last_name":"Cano Cordoba","full_name":"Cano Cordoba, Filip","orcid":"0000-0002-0783-904X"},{"full_name":"Könighofer, Bettina","first_name":"Bettina","last_name":"Könighofer"},{"full_name":"Arana-Arexolaleiba, Nestor","last_name":"Arana-Arexolaleiba","first_name":"Nestor"},{"full_name":"Zamalloa, Maider","first_name":"Maider","last_name":"Zamalloa"},{"first_name":"Jon","last_name":"Perez-Cerrolaza","full_name":"Perez-Cerrolaza, Jon"}],"date_updated":"2026-10-07T06:25:37Z","citation":{"chicago":"Odriozola-Olalde, Haritz, Filip Cano Cordoba, Bettina Könighofer, Nestor Arana-Arexolaleiba, Maider Zamalloa, and Jon Perez-Cerrolaza. “Shielded Reinforcement Learning for Industrial Applications: A Systematic Literature Survey.” <i>Intelligent Systems with Applications</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.iswa.2026.200729\">https://doi.org/10.1016/j.iswa.2026.200729</a>.","mla":"Odriozola-Olalde, Haritz, et al. “Shielded Reinforcement Learning for Industrial Applications: A Systematic Literature Survey.” <i>Intelligent Systems with Applications</i>, vol. 32, 200729, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.iswa.2026.200729\">10.1016/j.iswa.2026.200729</a>.","short":"H. Odriozola-Olalde, F. Cano Cordoba, B. Könighofer, N. Arana-Arexolaleiba, M. Zamalloa, J. Perez-Cerrolaza, Intelligent Systems with Applications 32 (2026).","ieee":"H. Odriozola-Olalde, F. Cano Cordoba, B. Könighofer, N. Arana-Arexolaleiba, M. Zamalloa, and J. Perez-Cerrolaza, “Shielded reinforcement learning for industrial applications: A systematic literature survey,” <i>Intelligent Systems with Applications</i>, vol. 32. Elsevier, 2026.","ista":"Odriozola-Olalde H, Cano Cordoba F, Könighofer B, Arana-Arexolaleiba N, Zamalloa M, Perez-Cerrolaza J. 2026. Shielded reinforcement learning for industrial applications: A systematic literature survey. Intelligent Systems with Applications. 32, 200729.","ama":"Odriozola-Olalde H, Cano Cordoba F, Könighofer B, Arana-Arexolaleiba N, Zamalloa M, Perez-Cerrolaza J. Shielded reinforcement learning for industrial applications: A systematic literature survey. <i>Intelligent Systems with Applications</i>. 2026;32. doi:<a href=\"https://doi.org/10.1016/j.iswa.2026.200729\">10.1016/j.iswa.2026.200729</a>","apa":"Odriozola-Olalde, H., Cano Cordoba, F., Könighofer, B., Arana-Arexolaleiba, N., Zamalloa, M., &#38; Perez-Cerrolaza, J. (2026). Shielded reinforcement learning for industrial applications: A systematic literature survey. <i>Intelligent Systems with Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.iswa.2026.200729\">https://doi.org/10.1016/j.iswa.2026.200729</a>"},"year":"2026","date_created":"2026-09-27T22:01:51Z","publication":"Intelligent Systems with Applications","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.iswa.2026.200729"}]},{"date_updated":"2025-04-14T13:52:09Z","author":[{"first_name":"Klaus-Tycho","last_name":"Foerster","full_name":"Foerster, Klaus-Tycho"},{"full_name":"Korhonen, Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne","last_name":"Korhonen"},{"full_name":"Paz, Ami","first_name":"Ami","last_name":"Paz"},{"full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"main_file_link":[{"url":"https://arxiv.org/abs/2005.07637","open_access":"1"}],"publication":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","year":"2021","date_created":"2022-03-18T09:10:27Z","citation":{"mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>.","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 5(1), 1–33.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. 2021;5(1):1-33. doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>"},"doi":"10.1145/3447384","date_published":"2021-03-01T00:00:00Z","day":"01","abstract":[{"text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \\congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \\beginitemize \\item how much time as a function of α we need to update an existing solution, and \\item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \\enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques.","lang":"eng"}],"scopus_import":"1","external_id":{"arxiv":["2005.07637"]},"month":"03","oa_version":"Preprint","publisher":"Association for Computing Machinery","_id":"10855","department":[{"_id":"DaAl"}],"acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how to improve the paper. This project\r\nhas received funding from the European Research Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","issue":"1","quality_controlled":"1","volume":5,"article_type":"original","publication_identifier":{"issn":["2476-1249"]},"intvolume":"         5","status":"public","type":"journal_article","ec_funded":1,"title":"Input-dynamic distributed algorithms for communication networks","project":[{"name":"Coordination in constrained and natural distributed systems","_id":"26A5D39A-B435-11E9-9278-68D0E5697425","grant_number":"840605","call_identifier":"H2020"},{"name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020"}],"publication_status":"published","fulldoi":"https://doi.org/10.1145/3447384","arxiv":1,"article_processing_charge":"No","oa":1,"related_material":{"record":[{"relation":"shorter_version","status":"public","id":"10854"}]},"page":"1-33","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"keyword":["Computer Networks and Communications","Hardware and Architecture","Safety","Risk","Reliability and Quality","Computer Science (miscellaneous)"]},{"fulldoi":"https://doi.org/10.1145/3485541","arxiv":1,"file":[{"file_size":2903485,"file_id":"10215","creator":"cchlebak","checksum":"9d6dce7b611853c529bb7b1915ac579e","date_updated":"2021-11-04T07:24:48Z","success":1,"relation":"main_file","date_created":"2021-11-04T07:24:48Z","content_type":"application/pdf","file_name":"2021_ProcACMPL_Bui.pdf","access_level":"open_access"}],"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"title":"The reads-from equivalence for the TSO and PSO memory models","publication_status":"published","type":"journal_article","ec_funded":1,"ddc":["000"],"status":"public","keyword":["safety","risk","reliability and quality","software"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2021-11-04T07:24:48Z","oa":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"10199","status":"public"}]},"doi":"10.1145/3485541","day":"15","date_published":"2021-10-15T00:00:00Z","scopus_import":"1","abstract":[{"text":"In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task.\r\n\r\n","lang":"eng"}],"publication":"Proceedings of the ACM on Programming Languages","year":"2021","date_created":"2021-10-27T15:05:34Z","citation":{"apa":"Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., &#38; Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>","ista":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164.","ama":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. 2021;5(OOPSLA). doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>","mla":"Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>.","short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).","ieee":"T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.","chicago":"Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>."},"date_updated":"2026-04-08T07:00:31Z","author":[{"full_name":"Bui, Truc Lam","first_name":"Truc Lam","last_name":"Bui"},{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Gautam, Tushar","first_name":"Tushar","last_name":"Gautam"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","first_name":"Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman"}],"volume":5,"publication_identifier":{"eissn":["2475-1421"]},"article_type":"original","intvolume":"         5","article_number":"164","issue":"OOPSLA","quality_controlled":"1","_id":"10191","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003.","external_id":{"arxiv":["2011.11763"]},"oa_version":"Published Version","month":"10","publisher":"Association for Computing Machinery"},{"intvolume":"         3","publication_identifier":{"eissn":["2475-1421"]},"volume":3,"quality_controlled":"1","article_number":"124","acknowledgement":"The authors would also like to thank anonymous referees for their valuable comments and helpful suggestions. This work is supported by the Austrian Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE), by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian Science Fund (FWF) Schrodinger grant J-4220.\r\n","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"_id":"10190","publisher":"ACM","oa_version":"Published Version","month":"10","external_id":{"arxiv":["1909.00989"]},"conference":{"name":"OOPSLA: Object-oriented Programming, Systems, Languages and Applications","end_date":"2019-10-25","start_date":"2019-10-23","location":"Athens, Greece"},"abstract":[{"text":"The verification of concurrent programs remains an open challenge, as thread interaction has to be accounted for, which leads to state-space explosion. Stateless model checking battles this problem by exploring traces rather than states of the program. As there are exponentially many traces, dynamic partial-order reduction (DPOR) techniques are used to partition the trace space into equivalence classes, and explore a few representatives from each class. The standard equivalence that underlies most DPOR techniques is the happens-before equivalence, however recent works have spawned a vivid interest towards coarser equivalences. The efficiency of such approaches is a product of two parameters: (i) the size of the partitioning induced by the equivalence, and (ii) the time spent by the exploration algorithm in each class of the partitioning. In this work, we present a new equivalence, called value-happens-before and show that it has two appealing features. First, value-happens-before is always at least as coarse as the happens-before equivalence, and can be even exponentially coarser. Second, the value-happens-before partitioning is efficiently explorable when the number of threads is bounded. We present an algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning using polynomial time per class. Finally, we perform an experimental evaluation of VCDPOR on various benchmarks, and compare it against other state-of-the-art approaches. Our results show that value-happens-before typically induces a significant reduction in the size of the underlying partitioning, which leads to a considerable reduction in the running time for exploring the whole partitioning.","lang":"eng"}],"scopus_import":"1","day":"10","date_published":"2019-10-10T00:00:00Z","doi":"10.1145/3360550","citation":{"short":"K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, ACM, 2019.","ieee":"K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial order reduction,” in <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>, Athens, Greece, 2019, vol. 3.","mla":"Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.” <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>, vol. 3, 124, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3360550\">10.1145/3360550</a>.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.” In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>, Vol. 3. ACM, 2019. <a href=\"https://doi.org/10.1145/3360550\">https://doi.org/10.1145/3360550</a>.","apa":"Chatterjee, K., Pavlogiannis, A., &#38; Toman, V. (2019). Value-centric dynamic partial order reduction. In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i> (Vol. 3). Athens, Greece: ACM. <a href=\"https://doi.org/10.1145/3360550\">https://doi.org/10.1145/3360550</a>","ama":"Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order reduction. In: <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>. Vol 3. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3360550\">10.1145/3360550</a>","ista":"Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 124."},"date_created":"2021-10-27T14:57:06Z","year":"2019","publication":"Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-9036-063X","full_name":"Toman, Viktor","last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","first_name":"Viktor"}],"date_updated":"2026-04-08T07:00:31Z","keyword":["safety","risk","reliability and quality","software"],"corr_author":"1","OA_place":"publisher","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10199"}]},"oa":1,"file_date_updated":"2021-11-12T11:41:56Z","article_processing_charge":"No","has_accepted_license":"1","arxiv":1,"fulldoi":"https://doi.org/10.1145/3360550","publication_status":"published","file":[{"checksum":"2149979c46964c4d117af06ccb6c0834","creator":"cchlebak","file_size":570829,"file_id":"10278","file_name":"2019_ACM_Chatterjee.pdf","access_level":"open_access","date_created":"2021-11-12T11:41:56Z","content_type":"application/pdf","date_updated":"2021-11-12T11:41:56Z","success":1,"relation":"main_file"}],"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"}],"title":"Value-centric dynamic partial order reduction","ddc":["000"],"type":"conference","OA_type":"hybrid","status":"public"}]