{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T04:22:27Z","timestamp":1769746947109,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Education, Singapore under its Academic Research Fund Tier 1","award":["21-SIS-SMU-033, T1-251RES1901"],"award-info":[{"award-number":["21-SIS-SMU-033, T1-251RES1901"]}]},{"name":"Ministry of Education, Singapore under its Academic Research Fund Tier 2","award":["MOE2019-T2-1-040, T2EP20120-0019"],"award-info":[{"award-number":["MOE2019-T2-1-040, T2EP20120-0019"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872262"],"award-info":[{"award-number":["61872262"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Education, Singapore under its Academic Research Fund Tier 3","award":["MOET32020-0004"],"award-info":[{"award-number":["MOET32020-0004"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3540250.3549129","type":"proceedings-article","created":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T20:46:22Z","timestamp":1668026782000},"page":"256-268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Large-scale analysis of non-termination bugs in real-world OSS projects"],"prefix":"10.1145","author":[{"given":"Xiuhan","family":"Shi","sequence":"first","affiliation":[{"name":"Tianjin University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofei","family":"Xie","sequence":"additional","affiliation":[{"name":"Singapore Management University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Li","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tianjin University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sen","family":"Chen","sequence":"additional","affiliation":[{"name":"Tianjin University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Li","sequence":"additional","affiliation":[{"name":"Tianjin University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.34740\/kaggle\/ds\/2440949"},{"key":"e_1_3_2_1_2_1","unstructured":"2022. Data for Large-Scale Analysis of Non-Termination Bugs in Real-World OSS Projects. https:\/\/zenodo.org\/record\/6548310##.Yn-DBOhByUk \t\t\t\t  2022. Data for Large-Scale Analysis of Non-Termination Bugs in Real-World OSS Projects. https:\/\/zenodo.org\/record\/6548310##.Yn-DBOhByUk"},{"key":"e_1_3_2_1_3_1","unstructured":"2022. Large-Scale Analysis of Non-Termination Bugs in Real-World OSS Projects. https:\/\/sites.google.com\/view\/non-termbug\/home \t\t\t\t  2022. Large-Scale Analysis of Non-Termination Bugs in Real-World OSS Projects. https:\/\/sites.google.com\/view\/non-termbug\/home"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158122"},{"key":"e_1_3_2_1_5_1","volume-title":"Static Analysis","author":"Alias Christophe","unstructured":"Christophe Alias , Alain Darte , Paul Feautrier , and Laure Gonnord . 2010. Multi-dimensional Rankings, Program Termination , and Complexity Bounds of Flowchart Programs . In Static Analysis , Radhia Cousot and Matthieu Martel (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 117\u2013133. isbn:978-3-642-15769-1 Christophe Alias, Alain Darte, Paul Feautrier, and Laure Gonnord. 2010. Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs. In Static Analysis, Radhia Cousot and Matthieu Martel (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 117\u2013133. isbn:978-3-642-15769-1"},{"key":"e_1_3_2_1_6_1","volume-title":"Detecting Fair Non-termination in Multithreaded Programs","author":"Atig Mohamed Faouzi","unstructured":"Mohamed Faouzi Atig , Ahmed Bouajjani , Michael Emmi , and Akash Lal . 2012. Detecting Fair Non-termination in Multithreaded Programs . In Computer Aided Verification, P. Madhusudan and Sanjit A. Seshia (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 210\u2013226. isbn:978-3-642-31424-7 Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi, and Akash Lal. 2012. Detecting Fair Non-termination in Multithreaded Programs. In Computer Aided Verification, P. Madhusudan and Sanjit A. Seshia (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 210\u2013226. isbn:978-3-642-31424-7"},{"key":"e_1_3_2_1_7_1","volume-title":"Ben-Amram and Samir Genaim","author":"Amir","year":"2015","unstructured":"Amir M. Ben-Amram and Samir Genaim . 2015 . Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions. In Computer Aided Verification, Daniel Kroening and Corina S. P\u0103s\u0103reanu (Eds.). Springer International Publishing , Cham. 304\u2013321. isbn:978-3-319-21668-3 Amir M. Ben-Amram and Samir Genaim. 2015. Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions. In Computer Aided Verification, Daniel Kroening and Corina S. P\u0103s\u0103reanu (Eds.). Springer International Publishing, Cham. 304\u2013321. isbn:978-3-319-21668-3"},{"key":"e_1_3_2_1_8_1","volume-title":"Software Verification: 10th Comparative Evaluation (SV-COMP","author":"Beyer Dirk","year":"2021","unstructured":"Dirk Beyer . 2021. Software Verification: 10th Comparative Evaluation (SV-COMP 2021 ). In Tools and Algorithms for the Construction and Analysis of Systems, Jan Friso Groote and Kim Guldstrand Larsen (Eds.). Springer International Publishing , Cham. 401\u2013422. isbn:978-3-030-72013-1 Dirk Beyer. 2021. Software Verification: 10th Comparative Evaluation (SV-COMP 2021). In Tools and Algorithms for the Construction and Analysis of Systems, Jan Friso Groote and Kim Guldstrand Larsen (Eds.). Springer International Publishing, Cham. 401\u2013422. isbn:978-3-030-72013-1"},{"key":"e_1_3_2_1_9_1","volume-title":"CPAchecker: A Tool for Configurable Software Verification","author":"Beyer Dirk","unstructured":"Dirk Beyer and M. Erkan Keremoglu . 2011. CPAchecker: A Tool for Configurable Software Verification . In Computer Aided Verification, Ganesh Gopalakrishnan and Shaz Qadeer (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 184\u2013190. isbn:978-3-642-22110-1 Dirk Beyer and M. Erkan Keremoglu. 2011. CPAchecker: A Tool for Configurable Software Verification. In Computer Aided Verification, Ganesh Gopalakrishnan and Shaz Qadeer (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 184\u2013190. isbn:978-3-642-22110-1"},{"key":"e_1_3_2_1_10_1","volume-title":"Sipma","author":"Bradley Aaron R.","year":"2005","unstructured":"Aaron R. Bradley , Zohar Manna , and Henny B . Sipma . 2005 . Linear Ranking with Reachability. In Computer Aided Verification, Kousha Etessami and Sriram K. Rajamani (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg. 491\u2013504. isbn:978-3-540-31686-2 Aaron R. Bradley, Zohar Manna, and Henny B. Sipma. 2005. Linear Ranking with Reachability. In Computer Aided Verification, Kousha Etessami and Sriram K. Rajamani (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 491\u2013504. isbn:978-3-540-31686-2"},{"key":"e_1_3_2_1_11_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems, Marsha Chechik and Jean-Fran\u00e7ois Raskin (Eds.)","author":"Brockschmidt Marc","unstructured":"Marc Brockschmidt , Byron Cook , Samin Ishtiaq , Heidy Khlaaf , and Nir Piterman . 2016. T2: Temporal Property Verification . In Tools and Algorithms for the Construction and Analysis of Systems, Marsha Chechik and Jean-Fran\u00e7ois Raskin (Eds.) . Springer Berlin Heidelberg, Berlin , Heidelberg . 387\u2013393. isbn:978-3-662-49674-9 Marc Brockschmidt, Byron Cook, Samin Ishtiaq, Heidy Khlaaf, and Nir Piterman. 2016. T2: Temporal Property Verification. In Tools and Algorithms for the Construction and Analysis of Systems, Marsha Chechik and Jean-Fran\u00e7ois Raskin (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 387\u2013393. isbn:978-3-662-49674-9"},{"key":"e_1_3_2_1_12_1","volume-title":"Detecting and Escaping Infinite Loops with Jolt. In ECOOP 2011 \u2013 Object-Oriented Programming, Mira Mezini (Ed.). Springer Berlin Heidelberg","author":"Carbin Michael","unstructured":"Michael Carbin , Sasa Misailovic , Michael Kling , and Martin C. Rinard . 2011 . Detecting and Escaping Infinite Loops with Jolt. In ECOOP 2011 \u2013 Object-Oriented Programming, Mira Mezini (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg. 609\u2013633. isbn:978-3-642-22655-7 Michael Carbin, Sasa Misailovic, Michael Kling, and Martin C. Rinard. 2011. Detecting and Escaping Infinite Loops with Jolt. In ECOOP 2011 \u2013 Object-Oriented Programming, Mira Mezini (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 609\u2013633. isbn:978-3-642-22655-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454093"},{"key":"e_1_3_2_1_14_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems, Erika \u00c1brah\u00e1m and Klaus Havelund (Eds.)","author":"Chen Hong-Yi","unstructured":"Hong-Yi Chen , Byron Cook , Carsten Fuhs , Kaustubh Nimkar , and Peter O\u2019Hearn . 2014. Proving Nontermination via Safety . In Tools and Algorithms for the Construction and Analysis of Systems, Erika \u00c1brah\u00e1m and Klaus Havelund (Eds.) . Springer Berlin Heidelberg , Berlin, Heidelberg . 156\u2013171. isbn:978-3-642-54862-8 Hong-Yi Chen, Byron Cook, Carsten Fuhs, Kaustubh Nimkar, and Peter O\u2019Hearn. 2014. Proving Nontermination via Safety. In Tools and Algorithms for the Construction and Analysis of Systems, Erika \u00c1brah\u00e1m and Klaus Havelund (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 156\u2013171. isbn:978-3-642-54862-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.10"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3324884.3418929"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380417"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3275523"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3551349.3559524"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75292-9_3"},{"key":"e_1_3_2_1_21_1","unstructured":"2021. Collection of Verification Tasks. https:\/\/github.com\/sosy-lab\/sv-benchmarks\/ \t\t\t\t  2021. Collection of Verification Tasks. https:\/\/github.com\/sosy-lab\/sv-benchmarks\/"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2682923.2682941"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941487.1941509"},{"key":"e_1_3_2_1_24_1","volume-title":"Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming","author":"Cousot Patrick","unstructured":"Patrick Cousot . 2005. Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming . In Verification, Model Checking, and Abstract Interpretation, Radhia Cousot (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg . 1\u201324. isbn:978-3-540-30579-8 Patrick Cousot. 2005. Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming. In Verification, Model Checking, and Abstract Interpretation, Radhia Cousot (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 1\u201324. isbn:978-3-540-30579-8"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2743019"},{"key":"e_1_3_2_1_26_1","volume-title":"An Empirical Study of OSS-Fuzz Bugs. In 2021 IEEE\/ACM 18th International Conference on Mining Software Repositories (MSR). 131\u2013142","author":"Ding Zhen Yu","year":"2021","unstructured":"Zhen Yu Ding and Claire Le Goues . 2021 . An Empirical Study of OSS-Fuzz Bugs. In 2021 IEEE\/ACM 18th International Conference on Mining Software Repositories (MSR). 131\u2013142 . Zhen Yu Ding and Claire Le Goues. 2021. An Empirical Study of OSS-Fuzz Bugs. In 2021 IEEE\/ACM 18th International Conference on Mining Software Repositories (MSR). 131\u2013142."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3238147.3238170"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180222"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0394.2005.00299.x"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380397"},{"key":"e_1_3_2_1_31_1","volume-title":"Proving Termination of Programs Automatically with AProVE","author":"Giesl J\u00fcrgen","unstructured":"J\u00fcrgen Giesl , Marc Brockschmidt , Fabian Emmes , Florian Frohn , Carsten Fuhs , Carsten Otto , Martin Pl\u00fccker , Peter Schneider-Kamp , Thomas Str\u00f6der , Stephanie Swiderski , and Ren\u00e9 Thiemann . 2014. Proving Termination of Programs Automatically with AProVE . In Automated Reasoning, St\u00e9phane Demri, Deepak Kapur, and Christoph Weidenbach (Eds.). Springer International Publishing , Cham . 184\u2013191. isbn:978-3-319-08587-6 J\u00fcrgen Giesl, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Carsten Otto, Martin Pl\u00fccker, Peter Schneider-Kamp, Thomas Str\u00f6der, Stephanie Swiderski, and Ren\u00e9 Thiemann. 2014. Proving Termination of Programs Automatically with AProVE. In Automated Reasoning, St\u00e9phane Demri, Deepak Kapur, and Christoph Weidenbach (Eds.). Springer International Publishing, Cham. 184\u2013191. isbn:978-3-319-08587-6"},{"key":"e_1_3_2_1_32_1","unstructured":"2022. GitHub Docs. https:\/\/docs.github.com\/cn \t\t\t\t  2022. GitHub Docs. https:\/\/docs.github.com\/cn"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328897.1328459"},{"key":"e_1_3_2_1_34_1","volume-title":"Termination Analysis by Learning Terminating Programs","author":"Heizmann Matthias","unstructured":"Matthias Heizmann , Jochen Hoenicke , and Andreas Podelski . 2014. Termination Analysis by Learning Terminating Programs . In Computer Aided Verification, Armin Biere and Roderick Bloem (Eds.). Springer International Publishing , Cham . 797\u2013813. isbn:978-3-319-08867-9 Matthias Heizmann, Jochen Hoenicke, and Andreas Podelski. 2014. Termination Analysis by Learning Terminating Programs. In Computer Aided Verification, Armin Biere and Roderick Bloem (Eds.). Springer International Publishing, Cham. 797\u2013813. isbn:978-3-319-08867-9"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3238147.3238181"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338906.3338955"},{"key":"e_1_3_2_1_37_1","unstructured":"1999. ISO\/IEC 9899:1999 Programming languages \u2014 C. https:\/\/www.iso.org\/standard\/29237.html \t\t\t\t  1999. ISO\/IEC 9899:1999 Programming languages \u2014 C. https:\/\/www.iso.org\/standard\/29237.html"},{"key":"e_1_3_2_1_38_1","volume-title":"Proving Non-termination Using Max-SMT","author":"Larraz Daniel","unstructured":"Daniel Larraz , Kaustubh Nimkar , Albert Oliveras , Enric Rodr\u00edguez-Carbonell , and Albert Rubio . 2014. Proving Non-termination Using Max-SMT . In Computer Aided Verification, Armin Biere and Roderick Bloem (Eds.). Springer International Publishing , Cham . 779\u2013796. isbn:978-3-319-08867-9 Daniel Larraz, Kaustubh Nimkar, Albert Oliveras, Enric Rodr\u00edguez-Carbonell, and Albert Rubio. 2014. Proving Non-termination Using Max-SMT. In Computer Aided Verification, Armin Biere and Roderick Bloem (Eds.). Springer International Publishing, Cham. 779\u2013796. isbn:978-3-319-08867-9"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428257"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE52547.2021.00030"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568229"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346281.1346323"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851613.2851834"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2013.18"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884809"},{"key":"e_1_3_2_1_46_1","volume-title":"A Complete Method for the Synthesis of Linear Ranking Functions","author":"Podelski Andreas","unstructured":"Andreas Podelski and Andrey Rybalchenko . 2004. A Complete Method for the Synthesis of Linear Ranking Functions . In Verification, Model Checking, and Abstract Interpretation, Bernhard Steffen and Giorgio Levi (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 239\u2013251. isbn:978-3-540-24622-0 Andreas Podelski and Andrey Rybalchenko. 2004. A Complete Method for the Synthesis of Linear Ranking Functions. In Verification, Model Checking, and Abstract Interpretation, Bernhard Steffen and Giorgio Levi (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 239\u2013251. isbn:978-3-540-24622-0"},{"key":"e_1_3_2_1_47_1","volume-title":"Towards Understanding the Faults of JavaScript-Based Deep Learning Systems. In 37th IEEE\/ACM International Conference on Automated Software Engineering (ASE \u201922)","author":"Quan Lili","year":"2022","unstructured":"Lili Quan , Qianyu Guo , Xiaofei Xie , Sen Chen , Xiaohong Li , and Yang. Liu. 2022 . Towards Understanding the Faults of JavaScript-Based Deep Learning Systems. In 37th IEEE\/ACM International Conference on Automated Software Engineering (ASE \u201922) . Lili Quan, Qianyu Guo, Xiaofei Xie, Sen Chen, Xiaohong Li, and Yang. Liu. 2022. Towards Understanding the Faults of JavaScript-Based Deep Learning Systems. In 37th IEEE\/ACM International Conference on Automated Software Engineering (ASE \u201922)."},{"key":"e_1_3_2_1_48_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems, Marsha Chechik and Jean-Fran\u00e7ois Raskin (Eds.)","author":"Schrammel Peter","unstructured":"Peter Schrammel and Daniel Kroening . 2016. 2LS for Program Analysis . In Tools and Algorithms for the Construction and Analysis of Systems, Marsha Chechik and Jean-Fran\u00e7ois Raskin (Eds.) . Springer Berlin Heidelberg , Berlin, Heidelberg . 905\u2013907. isbn:978-3-662-49674-9 Peter Schrammel and Daniel Kroening. 2016. 2LS for Program Analysis. In Tools and Algorithms for the Construction and Analysis of Systems, Marsha Chechik and Jean-Fran\u00e7ois Raskin (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 905\u2013907. isbn:978-3-662-49674-9"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1709093.1709095"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2733306"},{"key":"e_1_3_2_1_51_1","volume-title":"Result of 10th Competition on Software Verification (SV-COMP","year":"2021","unstructured":"2021. Result of 10th Competition on Software Verification (SV-COMP 2021 ). https:\/\/sv-comp.sosy-lab.org\/2021\/results\/results-verified\/ 2021. Result of 10th Competition on Software Verification (SV-COMP 2021). https:\/\/sv-comp.sosy-lab.org\/2021\/results\/results-verified\/"},{"key":"e_1_3_2_1_52_1","unstructured":"2021. The Termination Problem Database. https:\/\/github.com\/TermCOMP\/TPDB \t\t\t\t  2021. The Termination Problem Database. https:\/\/github.com\/TermCOMP\/TPDB"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380386"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2018.2876439"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950340"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106260"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2017.2788018"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2771783.2771815"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2016.21"}],"event":{"name":"ESEC\/FSE '22: 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","location":"Singapore Singapore","acronym":"ESEC\/FSE '22","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","NUS NUS"]},"container-title":["Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3540250.3549129","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3540250.3549129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:02Z","timestamp":1750182662000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3540250.3549129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":59,"alternative-id":["10.1145\/3540250.3549129","10.1145\/3540250"],"URL":"https:\/\/doi.org\/10.1145\/3540250.3549129","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}