{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T11:12:05Z","timestamp":1760613125395,"version":"build-2065373602"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:00:00Z","timestamp":1753401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:00:00Z","timestamp":1753401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["2019-05466","2019-05466","2023-05363"],"award-info":[{"award-number":["2019-05466","2019-05466","2023-05363"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001729","name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","doi-asserted-by":"publisher","award":["aSSIsT","aSSIsT"],"award-info":[{"award-number":["aSSIsT","aSSIsT"]}],"id":[{"id":"10.13039\/501100001729","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007051","name":"Uppsala University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007051","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Stateless Model Checking (SMC) is a verification technique for concurrent programs that checks for safety violations by exploring all possible thread schedulings. It is highly effective when coupled with Dynamic Partial Order Reduction (DPOR), which introduces an equivalence on schedulings and allows SMC to explore only one execution per equivalence class. Even with DPOR, SMC often spends unnecessary effort in exploring loop iterations that are <jats:italic>pure<\/jats:italic>, i.e., have no effect on the program state. In this article, we present techniques for making SMC with DPOR more effective on programs with pure loop iterations. The first technique is a static program analysis to detect loop purity and an associated program transformation, called <jats:italic>Partial Loop Purity Elimination<\/jats:italic>, that inserts <jats:bold>assume<\/jats:bold> statements to block pure loop iterations. Subsequently, some of these <jats:bold>assume<\/jats:bold> statements are turned into <jats:bold>await<\/jats:bold> statements that completely remove many <jats:bold>assume<\/jats:bold>-blocked executions. Finally, we present an extension of the standard DPOR equivalence, obtained by weakening the conflict relation between events. All these techniques are incorporated into a new DPOR algorithm, <jats:sc>Optimal-DPOR-Await<\/jats:sc>, which can handle both <jats:bold>await<\/jats:bold>\u00a0statements and the weaker conflict relation, is optimal in the sense that it explores exactly one execution in each equivalence class, and can also diagnose livelocks. Our implementation in <jats:sc>Nidhugg<\/jats:sc> shows that these techniques can significantly speed up the analysis of concurrent programs that are currently challenging for SMC tools, both for exploring their complete set of interleavings, but even for detecting concurrency errors in them.<\/jats:p>","DOI":"10.1007\/s10703-025-00479-0","type":"journal-article","created":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T15:44:54Z","timestamp":1753458294000},"page":"71-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Awaiting for Godot: stateless model checking that avoids executions where nothing happens"],"prefix":"10.1007","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7897-601X","authenticated-orcid":false,"given":"Bengt","family":"Jonsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0984-4229","authenticated-orcid":false,"given":"Magnus","family":"L\u00e5ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9657-0179","authenticated-orcid":false,"given":"Konstantinos","family":"Sagonas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,25]]},"reference":[{"key":"479_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla P, Aronis S, Jonsson B, Sagonas K (2014) Optimal dynamic partial order reduction. In: Symposium on Principles of Programming Languages, ser. POPL 2014. New York, NY, USA: ACM, pp 373\u2013384. [Online]. Available: https:\/\/doi.org\/10.1145\/2535838.2535845","DOI":"10.1145\/2535838.2535845"},{"key":"479_CR2","doi-asserted-by":"publisher","unstructured":"Abdulla PA, Aronis S, Atig MF, Jonsson B, Leonardsson C, Sagonas K (2015) Stateless model checking for TSO and PSO. In: Tools and Algorithms for the Construction and Analysis of Systems, ser. LNCS, vol. 9035. Berlin, Heidelberg: Springer, pp. 353\u2013367. [Online]. Available: https:\/\/doi.org\/10.1007\/978-3-662-46681-0_28","DOI":"10.1007\/978-3-662-46681-0_28"},{"issue":"4","key":"479_CR3","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/3073408","volume":"64","author":"PA Abdulla","year":"2017","unstructured":"Abdulla PA, Aronis S, Jonsson B, Sagonas K (2017) Source sets: a foundation for optimal dynamic partial order reduction. J ACM 64(4):25:1-25:49. https:\/\/doi.org\/10.1145\/3073408","journal-title":"J ACM"},{"key":"479_CR4","doi-asserted-by":"publisher","unstructured":"Abdulla PA, Atig MF, Jonsson B, L\u00e5ng M, Ngo TP, Sagonas K (2019) Optimal stateless model checking for reads-from equivalence under sequential consistency. Proc. ACM Program. Lang., vol.\u00a03, no. OOPSLA, pp. 150:1\u2013150:29, [Online]. Available: https:\/\/doi.org\/10.1145\/3360576","DOI":"10.1145\/3360576"},{"issue":"5","key":"479_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10009-016-0415-4","volume":"19","author":"PA Abdulla","year":"2017","unstructured":"Abdulla PA, Haziza F, Hol\u00edk L, Jonsson B, Rezine A (2017) An integrated specification and verification technique for highly concurrent data structures. Softw Tools Technol Transf 19(5):549\u2013563. https:\/\/doi.org\/10.1007\/s10009-016-0415-4","journal-title":"Softw Tools Technol Transf"},{"key":"479_CR6","doi-asserted-by":"publisher","first-page":"111730","DOI":"10.1016\/j.jss.2023.111730","volume":"202","author":"E Albert","year":"2023","unstructured":"Albert E, de la Banda MG, G\u00f3mez-Zamalloa M, Isabel M, Stuckey PJ (2023) Optimal dynamic partial order reduction with context-sensitive independence and observers. J Syst Softw 202:111730. https:\/\/doi.org\/10.1016\/j.jss.2023.111730","journal-title":"J Syst Softw"},{"key":"479_CR7","doi-asserted-by":"publisher","unstructured":"Aronis S, Jonsson B, L\u00e5ng M, Sagonas K (2018) Optimal dynamic partial order reduction with observers. In: Tools and Algorithms for the Construction and Analysis of Systems - 24th International Conference, ser. LNCS, vol. 10806. Cham: Springer, Apr. pp. 229\u2013248. [Online]. Available: https:\/\/doi.org\/10.1007\/978-3-319-89963-3_14","DOI":"10.1007\/978-3-319-89963-3_14"},{"issue":"POPL","key":"479_CR8","doi-asserted-by":"publisher","first-page":"31:1","DOI":"10.1145\/3158119","volume":"2","author":"M Chalupa","year":"2018","unstructured":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K (2018) Data-centric dynamic partial order reduction. Proc ACM Program Lang 2(POPL):31:1-31:30. https:\/\/doi.org\/10.1145\/3158119","journal-title":"Proc ACM Program Lang"},{"key":"479_CR9","doi-asserted-by":"publisher","unstructured":"Christakis M, Gotovos A, Sagonas K (2013) Systematic testing for detecting concurrency errors in Erlang programs. In: Sixth IEEE International Conference on Software Testing, Verification and Validation, ser. ICST 2013. Los Alamitos, CA, USA: IEEE, Mar. pp. 154\u2013163. [Online]. Available: https:\/\/doi.org\/10.1109\/ICST.2013.50","DOI":"10.1109\/ICST.2013.50"},{"issue":"4","key":"479_CR10","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R Cytron","year":"1991","unstructured":"Cytron R, Ferrante J, Rosen BK, Wegman MN, Zadeck FK (1991) Efficiently computing static single assignment form and the control dependence graph. ACM Trans Program Lang Syst 13(4):451\u2013490. https:\/\/doi.org\/10.1145\/115372.115320","journal-title":"ACM Trans Program Lang Syst"},{"issue":"4","key":"479_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1109\/TSE.2005.47","volume":"31","author":"C Flanagan","year":"2005","unstructured":"Flanagan C, Freund S, Qadeer S (2005) Exploiting purity for atomicity. IEEE Trans Softw Eng 31(4):275\u2013291. https:\/\/doi.org\/10.1109\/TSE.2005.47","journal-title":"IEEE Trans Softw Eng"},{"key":"479_CR12","doi-asserted-by":"publisher","unstructured":"Flanagan C, Godefroid P (2005) Dynamic partial-order reduction for model checking software. In: Principles of Programming Languages, (POPL). New York, NY, USA: ACM, Jan. pp. 110\u2013121. [Online]. Available: https:\/\/doi.org\/10.1145\/1040305.1040315","DOI":"10.1145\/1040305.1040315"},{"key":"479_CR13","doi-asserted-by":"publisher","unstructured":"Godefroid P (1997) Model checking for programming languages using VeriSoft. In: Principles of Programming Languages, (POPL). New York, NY, USA: ACM Press, Jan. pp. 174\u2013186. [Online]. Available: https:\/\/doi.org\/10.1145\/263699.263717","DOI":"10.1145\/263699.263717"},{"issue":"2","key":"479_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10703-005-1489-x","volume":"26","author":"P Godefroid","year":"2005","unstructured":"Godefroid P (2005) Software model checking: the VeriSoft approach. Formal Methods Syst Des 26(2):77\u2013101. https:\/\/doi.org\/10.1007\/s10703-005-1489-x","journal-title":"Formal Methods Syst Des"},{"key":"479_CR15","doi-asserted-by":"publisher","unstructured":"Godefroid P, Hanmer RS, Jagadeesan L (1998) Model checking without a model: An analysis of the heart-beat monitor of a telephone switch using VeriSoft. In: Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis, ser. ISSTA. New York, NY, USA: ACM, Mar. pp. 124\u2013133. [Online]. Available: https:\/\/doi.org\/10.1145\/271771.271800","DOI":"10.1145\/271771.271800"},{"issue":"3","key":"479_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF01384077","volume":"7","author":"P Godefroid","year":"1995","unstructured":"Godefroid P, Holzmann GJ, Pirottin D (1995) State-space caching revisited. Formal Methods Syst Des 7(3):227\u2013241. https:\/\/doi.org\/10.1007\/BF01384077","journal-title":"Formal Methods Syst Des"},{"key":"479_CR17","doi-asserted-by":"publisher","unstructured":"Huang J (2015) Stateless model checking concurrent programs with maximal causality reduction. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, ser. PLDI 2015. plus New York, NY, USA: ACM, pp. 165\u2013174. [Online]. Available: https:\/\/doi.org\/10.1145\/2737924.2737975","DOI":"10.1145\/2737924.2737975"},{"key":"479_CR18","doi-asserted-by":"publisher","unstructured":"Jonsson B, L\u00e5ng M, Sagonas K (2022) Awaiting for Godot: Stateless model checking that avoids executions where nothing happens. In: 22nd Formal Methods in Computer-Aided Design, ser. FMCAD 2022, A.\u00a0Griggio and N.\u00a0Rungta, Eds. IEEE, Oct. pp. 284\u2013293. [Online]. Available: https:\/\/doi.org\/10.34727\/2022\/isbn.978-3-85448-053-2_35","DOI":"10.34727\/2022\/isbn.978-3-85448-053-2_35"},{"key":"479_CR19","doi-asserted-by":"publisher","unstructured":"Jonsson B, L\u00e5ng M, Sagonas K (2022) Replication Package for Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens. Aug. artifact for the FMCAD 2022 paper with the same title. [Online]. Available: https:\/\/doi.org\/10.5281\/zenodo.6979939","DOI":"10.5281\/zenodo.6979939"},{"issue":"POPL","key":"479_CR20","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/3158105","volume":"2","author":"M Kokologiannakis","year":"2018","unstructured":"Kokologiannakis M, Lahav O, Sagonas K, Vafeiadis V (2018) Effective stateless model checking for C\/C++ concurrency. Proc ACM Program Lang 2(POPL):17:1-17:32. https:\/\/doi.org\/10.1145\/3158105","journal-title":"Proc ACM Program Lang"},{"issue":"POPL","key":"479_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3498711","volume":"6","author":"M Kokologiannakis","year":"2022","unstructured":"Kokologiannakis M, Marmanis I, Gladstein V, Vafeiadis V (2022) Truly stateless, optimal dynamic partial order reduction. Proc ACM Program Lang 6(POPL):1\u201328. https:\/\/doi.org\/10.1145\/3498711","journal-title":"Proc ACM Program Lang"},{"key":"479_CR22","doi-asserted-by":"publisher","unstructured":"Kokologiannakis M, Marmanis I, Vafeiadis V (2023) Unblocking dynamic partial order reduction. In: Computer Aided Verification, ser. CAV 2023. Springer Nature Switzerland, Jul. pp. 230\u2013250. [Online]. Available: https:\/\/doi.org\/10.1007\/978-3-031-37706-8_12","DOI":"10.1007\/978-3-031-37706-8_12"},{"key":"479_CR23","doi-asserted-by":"publisher","unstructured":"Kokologiannakis M, Ren X, Vafeiadis V (2021) Dynamic partial order reductions for spinloops. In: Formal Methods in Computer Aided Design, ser. FMCAD 2021. IEEE, Oct. pp. 163\u2013172. [Online]. Available: https:\/\/doi.org\/10.34727\/2021\/isbn.978-3-85448-046-4_25","DOI":"10.34727\/2021\/isbn.978-3-85448-046-4_25"},{"issue":"3","key":"479_CR24","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10009-019-00514-6","volume":"21","author":"M Kokologiannakis","year":"2019","unstructured":"Kokologiannakis M, Sagonas K (2019) Stateless model checking of the Linux kernel\u2122s read-copy update (RCU). Softw Tools Technol Transf 21(3):287\u2013306. https:\/\/doi.org\/10.1007\/s10009-019-00514-6","journal-title":"Softw Tools Technol Transf"},{"key":"479_CR25","doi-asserted-by":"publisher","unstructured":"Kokologiannakis M, Vafeiadis V (2021) GenMC: a model checker for weak memory models. In: Computer Aided Verification - 33rd International Conference, CAV 2021, Proceedings, Part I, ser. LNCS, vol. 12759. Springer, Jul. pp. 427\u2013440. [Online]. Available: https:\/\/doi.org\/10.1007\/978-3-030-81685-8_20","DOI":"10.1007\/978-3-030-81685-8_20"},{"issue":"9","key":"479_CR26","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L Lamport","year":"1979","unstructured":"Lamport L (1979) How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans Comp 28(9):690\u2013691. https:\/\/doi.org\/10.1109\/TC.1979.1675439","journal-title":"IEEE Trans Comp"},{"key":"479_CR27","doi-asserted-by":"publisher","unstructured":"Lesani M, Millstein TD, Palsberg J (2014) Automatic atomicity verification for clients of concurrent data structures. In: Computer Aided Verification, CAV 2014, ser. LNCS, A.\u00a0Biere and R.\u00a0Bloem, Eds., vol. 8559. Cham: Springer, Jul. pp. 550\u2013567. [Online]. Available: https:\/\/doi.org\/10.1007\/978-3-319-08867-9_37","DOI":"10.1007\/978-3-319-08867-9_37"},{"key":"479_CR28","doi-asserted-by":"publisher","unstructured":"Mazurkiewicz A (1987) Trace theory. In: Petri Nets: Applications and Relationships to Other Models of Concurrency, ser. LNCS, W.\u00a0Brauer, W.\u00a0Reisig, and G.\u00a0Rozenberg, Eds., vol. 255. Berlin Heidelberg: Springer, pp. 279\u2013324. [Online]. Available: https:\/\/doi.org\/10.1007\/3-540-17906-2_30","DOI":"10.1007\/3-540-17906-2_30"},{"key":"479_CR29","doi-asserted-by":"publisher","DOI":"10.1145\/3428298","author":"S Mukherjee","year":"2020","unstructured":"Mukherjee S, Deligiannis P, Biswas A, Lal A (2020) Learning-based controlled concurrency testing. Proc ACM Program Lang. https:\/\/doi.org\/10.1145\/3428298","journal-title":"Proc ACM Program Lang"},{"key":"479_CR30","unstructured":"Musuvathi M, Qadeer S, Ball T, Basler G, Nainar PA, Neamtiu I (2008) Finding and reproducing heisenbugs in concurrent programs. In: Proceedings of the 8th USENIX Symposium on Operating Systems Design and Implementation, ser. OSDI \u201908. Berkeley, CA, USA: USENIX Association, Dec. pp. 267\u2013280. [Online]. Available: http:\/\/dl.acm.org\/citation.cfm?id=1855741.1855760"},{"key":"479_CR31","doi-asserted-by":"publisher","unstructured":"Nguyen TL, Schrammel P, Fischer B, Torre SL, Parlato G (2017) Parallel bug-finding in concurrent programs via reduced interleaving instances. In: Proceedings of the 32nd IEEE\/ACM International Conference on Automated Software Engineering, ser. ASE 2017, G.\u00a0Rosu, M.\u00a0Di Penta, and T.\u00a0N. Nguyen, Eds. IEEE Computer Society, Oct.-Nov. pp. 753\u2013764. [Online]. Available: https:\/\/doi.org\/10.1109\/ASE.2017.8115686","DOI":"10.1109\/ASE.2017.8115686"},{"issue":"3","key":"479_CR32","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/2806886","volume":"38","author":"B Norris","year":"2016","unstructured":"Norris B, Demsky B (2016) A practical approach for model checking C\/C++11 code. ACM Trans Program Lang Syst 38(3):10:1-10:51. https:\/\/doi.org\/10.1145\/2806886","journal-title":"ACM Trans Program Lang Syst"},{"key":"479_CR33","doi-asserted-by":"publisher","unstructured":"Oberhauser J, Chehab RLdL, Behrens D, Fu M, Paolillo A, Oberhauser L, Bhat K, Wen Y, Chen H, Kim J, Vafeiadis V (2021) VSync: Push-button verification and optimization for synchronization primitives on weak memory models. In: Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, ser. ASPLOS 2021. New York, NY, USA: ACM, pp. 530\u2013545. [Online]. Available: https:\/\/doi.org\/10.1145\/3445814.3446748","DOI":"10.1145\/3445814.3446748"},{"issue":"4","key":"479_CR34","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/2858651","volume":"2","author":"P Thomson","year":"2016","unstructured":"Thomson P, Donaldson AF, Betts A (2016) Concurrency testing using controlled schedulers: an empirical study. ACM Trans Parallel Comput 2(4):23:1-23:37. https:\/\/doi.org\/10.1145\/2858651","journal-title":"ACM Trans Parallel Comput"},{"key":"479_CR35","doi-asserted-by":"publisher","unstructured":"Yuan X, Yang J, Gu R (2018) Partial order aware concurrency sampling. In: Computer Aided Verification, ser. LNCS, vol. 10982. Cham: Springer, pp. 317\u2013335. [Online]. Available: https:\/\/doi.org\/10.1007\/978-3-319-96142-2_20","DOI":"10.1007\/978-3-319-96142-2_20"},{"key":"479_CR36","doi-asserted-by":"publisher","unstructured":"Zhang N, Kusano M, Wang C (2015) Dynamic partial order reduction for relaxed memory models. In: Programming Language Design and Implementation (PLDI). New York, NY, USA: ACM, Jun. pp. 250\u2013259. [Online]. Available: https:\/\/doi.org\/10.1145\/2737924.2737956","DOI":"10.1145\/2737924.2737956"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-025-00479-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10703-025-00479-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-025-00479-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:33:30Z","timestamp":1760610810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10703-025-00479-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,25]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["479"],"URL":"https:\/\/doi.org\/10.1007\/s10703-025-00479-0","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"type":"print","value":"0925-9856"},{"type":"electronic","value":"1572-8102"}],"subject":[],"published":{"date-parts":[[2025,7,25]]},"assertion":[{"value":"19 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"To reproduce our results, we provide a replication package [] for the paper with the code and all benchmarks we use.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}