{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,3]],"date-time":"2026-11-03T01:55:47Z","timestamp":1793670947317,"version":"4.5.1"},"reference-count":97,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,12,9]],"date-time":"2021-12-09T00:00:00Z","timestamp":1639008000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/M008991\/1 and EP\/P022413\/1"],"award-info":[{"award-number":["EP\/M008991\/1 and EP\/P022413\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007065","name":"Universit\u00e0 degli Studi di Salerno","doi-asserted-by":"crossref","award":["FARB 2019-2020"],"award-info":[{"award-number":["FARB 2019-2020"]}],"id":[{"id":"10.13039\/501100007065","id-type":"DOI","asserted-by":"crossref"}]},{"name":"University of Southampton Scholarship Schemes","award":["INDAM-GNCS 2020-2021 and 2021"],"award-info":[{"award-number":["INDAM-GNCS 2020-2021 and 2021"]}]},{"name":"Amazon Research Awards","award":["AWS 2021"],"award-info":[{"award-number":["AWS 2021"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2022,3,31]]},"abstract":"<jats:p>Bounded verification techniques such as bounded model checking (BMC) have successfully been used for many practical program analysis problems, but concurrency still poses a challenge. Here, we describe a new approach to BMC of sequentially consistent imperative programs that use POSIX threads. We first translate the multi-threaded program into a nondeterministic sequential program that preserves reachability for all round-robin schedules with a given bound on the number of rounds. We then reuse existing high-performance BMC tools as backends for the sequential verification problem. Our translation is carefully designed to introduce very small memory overheads and very few sources of nondeterminism, so it produces tight SAT\/SMT formulae, and is thus very effective in practice: Our Lazy-CSeq tool implementing this translation for the C programming language won several gold and silver medals in the concurrency category of the Software Verification Competitions (SV-COMP) 2014\u20132021 and was able to find errors in programs where all other techniques (including testing) failed. In this article, we give a detailed description of our translation and prove its correctness, sketch its implementation using the CSeq framework, and report on a detailed evaluation and comparison of our approach.<\/jats:p>","DOI":"10.1145\/3478536","type":"journal-article","created":{"date-parts":[[2021,12,9]],"date-time":"2021-12-09T16:36:47Z","timestamp":1639067807000},"page":"1-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Bounded Verification of Multi-threaded Programs via Lazy Sequentialization"],"prefix":"10.1145","volume":"44","author":[{"given":"Omar","family":"Inverso","sequence":"first","affiliation":[{"name":"Gran Sasso Science Institute, L\u2019Aquila (AQ), Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7118-5968","authenticated-orcid":false,"given":"Ermenegildo","family":"Tomasco","sequence":"additional","affiliation":[{"name":"Agenzia delle Entrate, Vallo della Lucania (SA), Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1815-218X","authenticated-orcid":false,"given":"Bernd","family":"Fischer","sequence":"additional","affiliation":[{"name":"Stellenbosch University, Matieland, South Africa"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4978-4307","authenticated-orcid":false,"given":"Salvatore","family":"La Torre","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Salerno, Fisciano (SA), Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8697-2980","authenticated-orcid":false,"given":"Gennaro","family":"Parlato","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi del Molise, Pesche (IS), Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,12,9]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/341800.341817"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.5555\/2958031.2958083"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-7(4:4)2011"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68167-2_14"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.5555\/2958031.2958061"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.5555\/998675.999466"},{"key":"e_1_3_2_8_2","unstructured":"Eli Bendersky. 2015. pycparser v2.11. Retrieved from https:\/\/github.com\/eliben\/pycparser."},{"key":"e_1_3_2_9_2","first-page":"347","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25\u201330, 2020, Proceedings, Part II (Lecture Notes in Computer Science)","volume":"12079","author":"Beyer Dirk","year":"2020","unstructured":"Dirk Beyer. 2020. Advances in automatic software verification: SV-COMP 2020. In Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25\u201330, 2020, Proceedings, Part II (Lecture Notes in Computer Science), Armin Biere and David Parker (Eds.), Vol. 12079. Springer, 347\u2013367. DOI:DOI:https:\/\/doi:\/\/doi.org\/10.1007\/978-3-030-45237-7_21"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/2032305.2032321"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.5555\/1550723"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.5555\/646483.691738"},{"key":"e_1_3_2_13_2","first-page":"51","volume-title":"Proc. of SAT Competition 2020\u2014Solver and Benchmark Descriptions (Department of Computer Science Report Series B)","author":"Biere Armin","year":"2020","unstructured":"Armin Biere, Katalin Fazekas, Mathias Fleury, and Maximillian Heisinger. 2020. CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling Entering the SAT Competition 2020. In Proc. of SAT Competition 2020\u2014Solver and Benchmark Descriptions (Department of Computer Science Report Series B), Tomas Balyo, Nils Froleyks, Marijn Heule, Markus Iser, Matti J\u00e4rvisalo, and Martin Suda (Eds.), Vol. B-2020-1. University of Helsinki, 51\u201353."},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/2775051.2677002"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.5555\/2041552.2041565"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.5555\/1855741.1855756"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/2157654.2157669"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10515-013-0127-x"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2013.6693074"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31759-0_19"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.5555\/2032305.2032329"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_7"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.5555\/1998496.1998510"},{"key":"e_1_3_2_24_2","first-page":"168","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29\u2013April 2, 2004, Proceedings (Lecture Notes in Computer Science)","volume":"2988","author":"Clarke Edmund M.","year":"2004","unstructured":"Edmund M. Clarke, Daniel Kroening, and Flavio Lerda. 2004. A tool for checking ANSI-C Programs. In Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29\u2013April 2, 2004, Proceedings (Lecture Notes in Computer Science), Kurt Jensen and Andreas Podelski (Eds.), Vol. 2988. Springer, 168\u2013176. DOI:DOI:https:\/\/doi:\/\/doi.org\/10.1007\/978-3-540-24730-2_15"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_40"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985839"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2011.59"},{"key":"e_1_3_2_28_2","unstructured":"Omar Inverso Ermenegildo Tomasco Bernd Fischer Salvatore La Torre and Gennaro Parlato CSeq framework. 2015. Retrieved from https:\/\/github.com\/CSeq\/Overview."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/337292.337339"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.30"},{"key":"e_1_3_2_31_2","first-page":"502","volume-title":"Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5\u20138, 2003 Selected Revised Papers (Lecture Notes in Computer Science)","volume":"2919","author":"E\u00e9n Niklas","year":"2003","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson. 2003. An extensible SAT-solver. In Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5\u20138, 2003 Selected Revised Papers (Lecture Notes in Computer Science), Enrico Giunchiglia and Armando Tacchella (Eds.), Vol. 2919. Springer, 502\u2013518. DOI:DOI:https:\/\/doi:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926432"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491453"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-25540-4_14"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2013.6693139"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_46"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00124"},{"key":"e_1_3_2_38_2","unstructured":"Message Passing Interface Forum. 2012. MPI: A Message-passing interface standard version 3.0. (09 2012). Collective Communication Process Topologies and One Sided Communications.https:\/\/www.mpi-forum.org\/docs\/mpi-3.0\/mpi30-report.pdf."},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85114-1_10"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.5555\/1770351.1770421"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_5"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.5555\/1987389.1987394"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.5555\/1928137.1928160"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970332"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21690-4_20"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(87)90035-9"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.5555\/2958031.2958034"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007944"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24953-7_18"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/2560217.2560218"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49122-5_15"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.108"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_39"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374529"},{"key":"e_1_3_2_55_2","volume-title":"Information technology\u2014Portable Operating System Interface (POSIX) Base Specifications, Issue 7, ISO\/IEC\/IEEE 9945:2009.","year":"2009","unstructured":"ISO\/IEC. 2009. Information technology\u2014Portable Operating System Interface (POSIX) Base Specifications, Issue 7, ISO\/IEC\/IEEE 9945:2009."},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_28"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.5555\/1928137.1928161"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/1543135.1542500"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_36"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_54"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.87.4"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_38"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_32"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-009-0078-9"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/357062.357068"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27705-4_12"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.5555\/1196408"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/1273442.1250785"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.5555\/1855741.1855760"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_45"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46520-3_12"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59647-1_20"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54580-5_26"},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.5555\/3155562.3155656"},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190101"},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.5555\/647762.735490"},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.1145\/356698.356702"},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.5555\/2075089.2075093"},{"key":"e_1_3_2_79_2","first-page":"93","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems, 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4\u20138, 2005, Proceedings (Lecture Notes in Computer Science)","volume":"3440","author":"Qadeer Shaz","year":"2005","unstructured":"Shaz Qadeer and Jakob Rehof. 2005. Context-bounded model checking of concurrent software. In Tools and Algorithms for the Construction and Analysis of Systems, 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4\u20138, 2005, Proceedings (Lecture Notes in Computer Science), Nicolas Halbwachs and Lenore D. Zuck (Eds.), Vol. 3440. Springer, 93\u2013107. DOI:DOI:https:\/\/doi:\/\/doi.org\/10.1007\/978-3-540-31980-1_7"},{"key":"e_1_3_2_80_2","doi-asserted-by":"publisher","DOI":"10.1145\/996893.996845"},{"key":"e_1_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_9"},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_7"},{"key":"e_1_3_2_83_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34026-0_28"},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38088-4_1"},{"key":"e_1_3_2_85_2","doi-asserted-by":"publisher","DOI":"10.1145\/1882291.1882301"},{"key":"e_1_3_2_86_2","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926433"},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1145\/2692916.2555260"},{"key":"e_1_3_2_88_2","first-page":"402","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5\u201313, 2014. Proceedings (Lecture Notes in Computer Science)","volume":"8413","author":"Tomasco Ermenegildo","year":"2014","unstructured":"Ermenegildo Tomasco, Omar Inverso, Bernd Fischer, Salvatore La Torre, and Gennaro Parlato. 2014. MU-CSeq: Sequentialization of C programs by shared memory unwindings - (competition contribution). In Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5\u201313, 2014. Proceedings (Lecture Notes in Computer Science), Erika \u00c1brah\u00e1m and Klaus Havelund (Eds.), Vol. 8413. Springer, 402\u2013404. DOI:DOI:https:\/\/doi:\/\/doi.org\/10.1007\/978-3-642-54862-8_30"},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_38"},{"key":"e_1_3_2_90_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_52"},{"key":"e_1_3_2_91_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66197-1_12"},{"key":"e_1_3_2_92_2","doi-asserted-by":"publisher","DOI":"10.5555\/3077629.3077662"},{"key":"e_1_3_2_93_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_65"},{"key":"e_1_3_2_94_2","doi-asserted-by":"publisher","DOI":"10.1145\/1595696.1595702"},{"key":"e_1_3_2_95_2","first-page":"48","volume-title":"Proceedings of the MoDELS 2016 Demo and Poster Sessions co-located with ACM\/IEEE 19th International Conference on Model Driven Engineering Languages and Systems (MoDELS 2016), Saint-Malo, France, October 2\u20137, 2016 (CEUR Workshop Proceedings)","volume":"1725","author":"Wang Dexi","year":"2016","unstructured":"Dexi Wang, Chao Zhang, Guang Chen, Ming Gu, and Jiaguang Sun. 2016. C code verification based on the extended labeled transition system model. In Proceedings of the MoDELS 2016 Demo and Poster Sessions co-located with ACM\/IEEE 19th International Conference on Model Driven Engineering Languages and Systems (MoDELS 2016), Saint-Malo, France, October 2\u20137, 2016 (CEUR Workshop Proceedings), Juan de Lara, Peter J. Clarke, and Mehrdad Sabetzadeh (Eds.), Vol. 1725. CEUR-WS.org, 48\u201355. Retrieved from http:\/\/ceur-ws.org\/Vol-1725\/demo7.pdf."},{"key":"e_1_3_2_96_2","first-page":"422","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems - 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14\u201320, 2018, Proceedings, Part II (Lecture Notes in Computer Science)","volume":"10806","author":"Yin Liangze","year":"2018","unstructured":"Liangze Yin, Wei Dong, Wanwei Liu, Yunchou Li, and Ji Wang. 2018. YOGAR-CBMC: CBMC with scheduling constraint based abstraction refinement - (competition contribution). In Tools and Algorithms for the Construction and Analysis of Systems - 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14\u201320, 2018, Proceedings, Part II (Lecture Notes in Computer Science), Dirk Beyer and Marieke Huisman (Eds.), Vol. 10806. Springer, 422\u2013426. DOI:DOI:https:\/\/doi:\/\/doi.org\/10.1007\/978-3-319-89963-3_25"},{"key":"e_1_3_2_97_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2018.2864122"},{"key":"e_1_3_2_98_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_57"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3478536","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3478536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:40Z","timestamp":1750191100000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3478536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,9]]},"references-count":97,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3,31]]}},"alternative-id":["10.1145\/3478536"],"URL":"https:\/\/doi.org\/10.1145\/3478536","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,9]]},"assertion":[{"value":"2020-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}