{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T06:34:46Z","timestamp":1785825286994,"version":"3.56.0"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T00:00:00Z","timestamp":1700784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Natural Sciences and Engineering Research Council of Canada (NSERC) through the Discovery Grant, a project under Waterloo-Huawei Joint Innovation Lab, and CFI-JELF Project","award":["40736"],"award-info":[{"award-number":["40736"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2024,1,31]]},"abstract":"<jats:p>\n            Program reduction is a highly practical, widely demanded technique to help debug language tools, such as compilers, interpreters and debuggers. Given a program\n            <jats:italic>P<\/jats:italic>\n            that exhibits a property \u03c8, conceptually, program reduction iteratively applies various program transformations to generate a vast number of variants from\n            <jats:italic>P<\/jats:italic>\n            by deleting certain tokens and returns the minimal variant preserving \u03c8 as the result.\n          <\/jats:p>\n          <jats:p>A program reduction process inevitably generates duplicate variants, and the number of them can be significant. Our study reveals that on average 61.8% and 24.3% of the generated variants in two representative program reducers HDD and Perses, respectively, are duplicates. Checking them against \u03c8 is thus redundant and unnecessary, which wastes time and computation resources. Although it seems that simply caching the generated variants can avoid redundant property tests, such a trivial method is impractical in the real world due to the significant memory footprint. Therefore, a memory-efficient caching scheme for program reduction is in great demand.<\/jats:p>\n          <jats:p>\n            This study is the first effort to conduct a systematic, extensive analysis of memory-efficient caching schemes for program reduction. We first propose to use two well-known compression methods,\n            <jats:sans-serif>ZIP<\/jats:sans-serif>\n            and\n            <jats:sans-serif>SHA<\/jats:sans-serif>\n            , to compress the generated variants before they are stored in the cache. Furthermore, our keen understanding on the program reduction process motivates us to propose a novel, domain-specific, both memory and computation-efficient caching scheme,\n            <jats:italic>\n              <jats:underline>R<\/jats:underline>\n              efreshable\n              <jats:underline>C<\/jats:underline>\n              ompact\n              <jats:underline>C<\/jats:underline>\n              aching\n            <\/jats:italic>\n            (\n            <jats:sans-serif>RCC<\/jats:sans-serif>\n            ). Our key insight is two-fold: \u2460 by leveraging the correlation between variants and the original program\n            <jats:italic>P<\/jats:italic>\n            , we losslessly encode each variant into an\n            <jats:italic>equivalent<\/jats:italic>\n            ,\n            <jats:italic>compact<\/jats:italic>\n            ,\n            <jats:italic>canonical<\/jats:italic>\n            representation; \u2461 periodically, stale cache entries, which will never be accessed, are timely removed to minimize the memory footprint over time.\n          <\/jats:p>\n          <jats:p>\n            Our extensive evaluation on 31 real-world C compiler bugs demonstrates that caching schemes help avoid issuing redundant queries by 61.8% and 24.3% in HDD and Perses, respectively; correspondingly, the runtime performance is notably boosted by 22.8% and 18.2%. With regard to the memory efficiency, all three methods use less memory than the state-of-the-art string-based scheme\n            <jats:sans-serif>STR<\/jats:sans-serif>\n            . Specifically,\n            <jats:sans-serif>ZIP<\/jats:sans-serif>\n            and\n            <jats:sans-serif>SHA<\/jats:sans-serif>\n            cut down the memory footprint by more than 80% and 90% in both Perses and HDD compared to\n            <jats:sans-serif>STR<\/jats:sans-serif>\n            ; moreover, the highly-scalable, domain-specific\n            <jats:sans-serif>RCC<\/jats:sans-serif>\n            dominates peer schemes, and outperforms the\n            <jats:sans-serif>SHA<\/jats:sans-serif>\n            by 96.4% and 91.74% in HDD and Perses, respectively.\n          <\/jats:p>","DOI":"10.1145\/3617172","type":"journal-article","created":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T12:20:07Z","timestamp":1693916407000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["On the Caching Schemes to Speed Up Program Reduction"],"prefix":"10.1145","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1644-2965","authenticated-orcid":false,"given":"Yongqiang","family":"Tian","sequence":"first","affiliation":[{"name":"University of Waterloo, Canada and The Hong Kong University of Science and Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0474-0028","authenticated-orcid":false,"given":"Xueyan","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3205-9010","authenticated-orcid":false,"given":"Yiwen","family":"Dong","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9451-4031","authenticated-orcid":false,"given":"Zhenyang","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3463-2802","authenticated-orcid":false,"given":"Mengxiao","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0955-503X","authenticated-orcid":false,"given":"Yu","family":"Jiang","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3508-7172","authenticated-orcid":false,"given":"Shing-Chi","family":"Cheung","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0862-2491","authenticated-orcid":false,"given":"Chengnian","family":"Sun","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,24]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"Dimitris Andreour. 2015. ObjectExplorer. Retrieved May 29 2023 from https:\/\/github.com\/DimitrisAndreou\/memory-measurer"},{"key":"e_1_3_2_3_2","unstructured":"Antoine Balestrat. 2012. CCG: A Random C Code Generator. Retrieved May 29 2023 from https:\/\/github.com\/Merkil\/ccg\/"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/2635868.2635893","volume-title":"Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering, (FSE-22)","author":"Binkley David W.","year":"2014","unstructured":"David W. Binkley, Nicolas Gold, Mark Harman, Syed S. Islam, Jens Krinke, and Shin Yoo. 2014. ORBS: Language-independent program slicing. In Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering, (FSE-22). Shing-Chi Cheung, Alessandro Orso, and Margaret-Anne D. Storey (Eds.), ACM, 109\u2013120. DOI:10.1145\/2635868.2635893"},{"key":"e_1_3_2_5_2","first-page":"135","volume-title":"Proceedings of the ESEC\/FSE\u201920: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, Virtual Event","author":"Bruce Bobby R.","year":"2020","unstructured":"Bobby R. Bruce, Tianyi Zhang, Jaspreet Arora, Guoqing Harry Xu, and Miryung Kim. 2020. JShrink: In-depth investigation into debloating modern Java applications. In Proceedings of the ESEC\/FSE\u201920: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, Virtual Event. Prem Devanbu, Myra B. Cohen, and Thomas Zimmermann (Eds.), ACM, 135\u2013146. DOI:10.1145\/3368089.3409738"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3193723"},{"key":"e_1_3_2_7_2","first-page":"462","volume-title":"Proceedings of the ICPP 2009, International Conference on Parallel Processing","author":"Buntinas Darius","year":"2009","unstructured":"Darius Buntinas, Brice Goglin, David Goodell, Guillaume Mercier, and St\u00e9phanie Moreaud. 2009. Cache-efficient, intranode, large-message MPI communication with MPICH2-Nemesis. In Proceedings of the ICPP 2009, International Conference on Parallel Processing. IEEE Computer Society, 462\u2013469. DOI:10.1109\/ICPP.2009.22"},{"key":"e_1_3_2_8_2","first-page":"197","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI\u201913","author":"Chen Yang","year":"2013","unstructured":"Yang Chen, Alex Groce, Chaoqiang Zhang, Weng-Keen Wong, Xiaoli Z. Fern, Eric Eide, and John Regehr. 2013. Taming compiler fuzzers. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI\u201913. Hans-Juergen Boehm and Cormac Flanagan (Eds.), ACM, 197\u2013208. DOI:10.1145\/2491956.2462173"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840450"},{"key":"e_1_3_2_10_2","first-page":"330","volume-title":"VLDB\u201996, Proceedings of 22th International Conference on Very Large Data Bases","author":"Dar Shaul","year":"1996","unstructured":"Shaul Dar, Michael J. Franklin, Bj\u00f6rn \u00de\u00f3r J\u00f3nsson, Divesh Srivastava, and Michael Tan. 1996. Semantic data caching and replacement. In VLDB\u201996, Proceedings of 22th International Conference on Very Large Data Bases. T. M. Vijayaraman, Alejandro P. Buchmann, C. Mohan, and Nandlal L. Sarda (Eds.), Morgan Kaufmann, 330\u2013341. Retrieved from http:\/\/www.vldb.org\/conf\/1996\/P330.PDF"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","unstructured":"L. Peter Deutsch and Jean-loup Gailly. 1996. ZLIB Compressed Data Format Specification version 3.3 (RFC\u201950) RFC Editor 11 pages. https:\/\/www.rfc-editor.org\/info\/rfc1950","DOI":"10.17487\/rfc1950"},{"key":"e_1_3_2_12_2","volume-title":"Test Case Reduction: Beyond Bugs","author":"Donaldson Alastair","year":"2021","unstructured":"Alastair Donaldson and David MacIver. 2021. Test Case Reduction: Beyond Bugs. Retrieved May 29, 2023 from https:\/\/blog.sigplan.org\/2021\/05\/25\/test-case-reduction-beyond-bugs"},{"key":"e_1_3_2_13_2","volume-title":"A Guide to Testcase Reduction","year":"2017","unstructured":"GCC. 2017. A Guide to Testcase Reduction. Retrieved May 29, 2023 from https:\/\/gcc.gnu.org\/wiki\/A_guide_to_testcase_reduction"},{"key":"e_1_3_2_14_2","volume-title":"A Massively Spiffy Yet Delicately Unobtrusive Compression Library","author":"Roelofs Mark Adler Greg","year":"1996","unstructured":"Mark Adler Greg Roelofs. 1996. A Massively Spiffy Yet Delicately Unobtrusive Compression Library. Retrieved Jul 1, 2023 from https:\/\/zlib.net"},{"key":"e_1_3_2_15_2","first-page":"354","volume-title":"Proceedings of the 8th International Conference on Information Technology: New Generations, ITNG 2011.","author":"Gueron Shay","year":"2011","unstructured":"Shay Gueron, Simon Johnson, and Jesse Walker. 2011. SHA-512\/256. In Proceedings of the 8th International Conference on Information Technology: New Generations, ITNG 2011.Shahram Latifi (Ed.), IEEE Computer Society, 354\u2013358. DOI:10.1109\/ITNG.2011.69"},{"key":"e_1_3_2_16_2","volume-title":"The Cache Memory Book (2nd Ed.): The Authoritative Reference on Cache Design","author":"Handy Jim","year":"1998","unstructured":"Jim Handy. 1998. The Cache Memory Book (2nd Ed.): The Authoritative Reference on Cache Design. Academic Press, Inc."},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243838"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2017.8115697"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2994291.2994296"},{"key":"e_1_3_2_20_2","first-page":"194","volume-title":"Proceedings of the 2017 IEEE International Conference on Software Maintenance and Evolution, ICSME 2017","author":"Hodov\u00e1n Ren\u00e1ta","year":"2017","unstructured":"Ren\u00e1ta Hodov\u00e1n, \u00c1kos Kiss, and Tibor Gyim\u00f3thy. 2017. Coarse hierarchical delta debugging. In Proceedings of the 2017 IEEE International Conference on Software Maintenance and Evolution, ICSME 2017. IEEE Computer Society, 194\u2013203. DOI:10.1109\/ICSME.2017.26"},{"key":"e_1_3_2_21_2","doi-asserted-by":"crossref","unstructured":"Ren\u00e1ta Hodov\u00e1n \u00c1kos Kiss and Tibor Gyim\u00f3thy. 2017. Tree preprocessing and test outcome caching for efficient hierarchical delta debugging. In 12th IEEE\/ACM International Workshop on Automation of Software Testing (AST@ICSE\u201917 Buenos Aires Argentina May 20-21 2017) IEEE Computer Society 23\u201329. DOI:10.1109\/AST.2017.4","DOI":"10.1109\/AST.2017.4"},{"key":"e_1_3_2_22_2","first-page":"439","volume-title":"VLDB\u201994, Proceedings of 20th International Conference on Very Large Data Bases","author":"Johnson Theodore","year":"1994","unstructured":"Theodore Johnson and Dennis E. Shasha. 1994. 2Q: A low overhead high performance buffer management replacement algorithm. In VLDB\u201994, Proceedings of 20th International Conference on Very Large Data Bases. Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo (Eds.), Morgan Kaufmann, 439\u2013450. Retrieved from http:\/\/www.vldb.org\/conf\/1994\/P439.PDF"},{"key":"e_1_3_2_23_2","first-page":"556","volume-title":"Proceedings of the ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/SIGSOFT FSE 2019.","author":"Kalhauge Christian Gram","year":"2019","unstructured":"Christian Gram Kalhauge and Jens Palsberg. 2019. Binary reduction of dependency graphs. In Proceedings of the ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/SIGSOFT FSE 2019.Marlon Dumas, Dietmar Pfahl, Sven Apel, and Alessandra Russo (Eds.), ACM, 556\u2013566. DOI:10.1145\/3338906.3338956"},{"key":"e_1_3_2_24_2","first-page":"1003","volume-title":"Proceedings of the PLDI\u201921: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Virtual Event","author":"Kalhauge Christian Gram","year":"2021","unstructured":"Christian Gram Kalhauge and Jens Palsberg. 2021. Logical bytecode reduction. In Proceedings of the PLDI\u201921: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Virtual Event. Stephen N. Freund and Eran Yahav (Eds.), ACM, 1003\u20131016. DOI:10.1145\/3453483.3454091"},{"key":"e_1_3_2_25_2","doi-asserted-by":"crossref","unstructured":"J. Kelsey S. Change and R. Perlner. 2016. SHA-3 derived functions: CSHAKE KMAC TupleHash and ParallelHash. NIST Special Publication 800 (2016) 185 pages. https:\/\/www.nist.gov\/publications\/sha-3-derived-functions-cshake-kmac-tuplehash-and-parallelhash","DOI":"10.6028\/NIST.SP.800-185"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3278186.3278189"},{"key":"e_1_3_2_27_2","first-page":"216","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI\u201914.","author":"Le Vu","year":"2014","unstructured":"Vu Le, Mehrdad Afshari, and Zhendong Su. 2014. Compiler validation via equivalence modulo inputs. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI\u201914.Michael F. P. O\u2019Boyle and Keshav Pingali (Eds.), ACM, 216\u2013226. DOI:10.1145\/2594291.2594334"},{"key":"e_1_3_2_28_2","first-page":"386","volume-title":"Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015","author":"Le Vu","year":"2015","unstructured":"Vu Le, Chengnian Sun, and Zhendong Su. 2015. Finding deep compiler bugs via guided stochastic program mutation. In Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015. Jonathan Aldrich and Patrick Eugster (Eds.), ACM, 386\u2013399. DOI:10.1145\/2814270.2814319"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3591294"},{"key":"e_1_3_2_30_2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/2737924.2737986","volume-title":"Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation.","author":"Lidbury Christopher","year":"2015","unstructured":"Christopher Lidbury, Andrei Lascu, Nathan Chong, and Alastair F. Donaldson. 2015. Many-core compiler fuzzing. In Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation.David Grove and Stephen M. Blackburn (Eds.), ACM, 65\u201376. DOI:10.1145\/2737924.2737986"},{"key":"e_1_3_2_31_2","first-page":"795","volume-title":"Proceedings of the 22nd International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2017","author":"Liu Ming","year":"2017","unstructured":"Ming Liu, Liang Luo, Jacob Nelson, Luis Ceze, Arvind Krishnamurthy, and Kishore Atreya. 2017. IncBricks: Toward in-network computation with an in-network cache. In Proceedings of the 22nd International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2017. Yunji Chen, Olivier Temam, and John Carter (Eds.), ACM, 795\u2013809. DOI:10.1145\/3037697.3037731"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428264"},{"key":"e_1_3_2_33_2","volume-title":"How to Submit an LLVM Bug Report","year":"2017","unstructured":"LLVM. 2017. How to Submit an LLVM Bug Report. Retrieved Mar 20, 2023 from https:\/\/llvm.org\/docs\/HowToSubmitABug.html"},{"key":"e_1_3_2_34_2","unstructured":"LLVM\/Clang. 2022. Clang Documentation \u2013 LibTooling. Retrieved May 29 2023 from https:\/\/clang.llvm.org\/docs\/LibTooling.html"},{"key":"e_1_3_2_35_2","first-page":"142","volume-title":"Proceedings of the 28th International Conference on Software Engineering (ICSE 2006)","author":"Misherghi Ghassan","year":"2006","unstructured":"Ghassan Misherghi and Zhendong Su. 2006. HDD: Hierarchical delta debugging. In Proceedings of the 28th International Conference on Software Engineering (ICSE 2006). Leon J. Osterweil, H. Dieter Rombach, and Mary Lou Soffa (Eds.), ACM, 142\u2013151. DOI:10.1145\/1134285.1134307"},{"key":"e_1_3_2_36_2","doi-asserted-by":"crossref","unstructured":"Elizabeth J. O\u2019Neil Patrick E. O\u2019Neil and Gerhard Weikum. 1993. The LRU-K page replacement algorithm for database disk buffering. In Proceedings of the ACM International Conference on Management of Data (SIGMOD\u201993 Washington DC USA May 26-28 1993) Peter Buneman and Sushil Jajodia (Eds.). ACM Press 297\u2013306. 10.1145\/170035.170081","DOI":"10.1145\/170036.170081"},{"key":"e_1_3_2_37_2","volume-title":"Reducers are Fuzzers \u2013 EMBEDDED IN ACADEMIA","author":"Regehr John","year":"2015","unstructured":"John Regehr. 2015. Reducers are Fuzzers \u2013 EMBEDDED IN ACADEMIA. Retrieved Jul 1, 2023 from https:\/\/blog.regehr.org\/archives\/1284"},{"key":"e_1_3_2_38_2","unstructured":"John Regehr. 2016. [creduce-dev] cache. Retrieved May 29 2023 from http:\/\/www.flux.utah.edu\/listarchives\/creduce-dev\/msg00284.html"},{"key":"e_1_3_2_39_2","first-page":"335","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI\u201912","author":"Regehr John","year":"2012","unstructured":"John Regehr, Yang Chen, Pascal Cuoq, Eric Eide, Chucky Ellison, and Xuejun Yang. 2012. Test-case reduction for C compiler bugs. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI\u201912. Jan Vitek, Haibo Lin, and Frank Tip (Eds.), ACM, 335\u2013346. DOI:10.1145\/2254064.2254104"},{"key":"e_1_3_2_40_2","first-page":"1","volume-title":"SC\u201913: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis","author":"Rubio-Gonz\u00e1lez Cindy","year":"2013","unstructured":"Cindy Rubio-Gonz\u00e1lez, Cuong Nguyen, Hong Diep Nguyen, James Demmel, William Kahan, Koushik Sen, David H. Bailey, Costin Iancu, and David Hough. 2013. Precimonious: Tuning assistant for floating-point precision. In SC\u201913: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis. IEEE, 1\u201312."},{"key":"e_1_3_2_41_2","unstructured":"Mozilla Security. 2008. Lithium: Line-Based Testcase Reducer. Retrieved May 29 2023 from https:\/\/github.com\/MozillaSecurity\/lithium"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984038"},{"key":"e_1_3_2_43_2","first-page":"294","volume-title":"Proceedings of the 25th International Symposium on Software Testing and Analysis, ISSTA 2016","author":"Sun Chengnian","year":"2016","unstructured":"Chengnian Sun, Vu Le, Qirun Zhang, and Zhendong Su. 2016. Toward understanding compiler bugs in GCC and LLVM. In Proceedings of the 25th International Symposium on Software Testing and Analysis, ISSTA 2016. Andreas Zeller and Abhik Roychoudhury (Eds.), ACM, 294\u2013305. DOI:10.1145\/2931037.2931074"},{"key":"e_1_3_2_44_2","first-page":"361","volume-title":"Proceedings of the 40th International Conference on Software Engineering, ICSE 2018","author":"Sun Chengnian","year":"2018","unstructured":"Chengnian Sun, Yuanbo Li, Qirun Zhang, Tianxiao Gu, and Zhendong Su. 2018. Perses: Syntax-guided program reduction. In Proceedings of the 40th International Conference on Software Engineering, ICSE 2018. Michel Chaudron, Ivica Crnkovic, Marsha Chechik, and Mark Harman (Eds.), ACM, 361\u2013371. DOI:10.1145\/3180155.3180236"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2021.3120213"},{"key":"e_1_3_2_46_2","volume-title":"Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/FSE 2023.","author":"Tian Jia Le","year":"2023","unstructured":"Jia Le Tian, Mengxiao Zhang, Zhenyang Xu, Yongqiang Tian, Yiwen Dong, and Chengnian Sun. 2023. Ad hoc syntax-guided program reduction. In Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/FSE 2023.Satish Chandra, Kelly Blincoe, and Paolo Tonella (Eds.), ACM, New York, NY."},{"key":"e_1_3_2_47_2","volume-title":"Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI 2023","author":"Tian Yongqiang","year":"2023","unstructured":"Yongqiang Tian, Zhenyang Xu, Yiwen Dong, Chengnian Sun, and Shing-Chi Cheung. 2023. Revisiting the evaluation of deep learning-based compiler testing. In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI 2023. Edith Elkind (Ed.), ijcai.org."},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/586088.586090"},{"key":"e_1_3_2_49_2","first-page":"881","volume-title":"Proceedings of the ESEC\/FSE\u201921: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","author":"Wang Guancheng","year":"2021","unstructured":"Guancheng Wang, Ruobing Shen, Junjie Chen, Yingfei Xiong, and Lu Zhang. 2021. Probabilistic delta debugging. In Proceedings of the ESEC\/FSE\u201921: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering. Diomidis Spinellis, Georgios Gousios, Marsha Chechik, and Massimiliano Di Penta (Eds.), ACM, 881\u2013892. DOI:10.1145\/3468264.3468625"},{"key":"e_1_3_2_50_2","first-page":"146","volume-title":"Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2, ASPLOS 2023","author":"Wang Theodore Luo","year":"2023","unstructured":"Theodore Luo Wang, Yongqiang Tian, Yiwen Dong, Zhenyang Xu, and Chengnian Sun. 2023. Compilation consistency modulo debug information. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2, ASPLOS 2023. Tor M. Aamodt, Natalie D. Enright Jerger, and Michael M. Swift (Eds.), ACM, 146\u2013158. DOI:10.1145\/3575693.3575740"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3586049"},{"key":"e_1_3_2_52_2","first-page":"283","volume-title":"Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2011","author":"Yang Xuejun","year":"2011","unstructured":"Xuejun Yang, Yang Chen, Eric Eide, and John Regehr. 2011. Finding and understanding bugs in C compilers. In Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2011. Mary W. Hall and David A. Padua (Eds.), ACM, 283\u2013294. DOI:10.1145\/1993498.1993532"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.988498"},{"key":"e_1_3_2_54_2","volume-title":"Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC\/FSE 2023)","author":"Zhang Mengxiao","year":"2023","unstructured":"Mengxiao Zhang, Zhenyang Xu, Yongqiang Tian, Yu Jiang, and Chengnian Sun. 2023. PPR: Pairwise program reduction. In Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC\/FSE 2023). Satish Chandra, Kelly Blincoe, and Paolo Tonella (Eds.), ACM, New York, NY."}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3617172","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3617172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:07Z","timestamp":1750178167000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3617172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,24]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1,31]]}},"alternative-id":["10.1145\/3617172"],"URL":"https:\/\/doi.org\/10.1145\/3617172","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,24]]},"assertion":[{"value":"2022-10-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-24","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-11-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}