WDD: Weighted Delta Debugging
Delta Debugging is a widely used family of algorithms (e.g., ddmin and ProbDD) to automatically minimize bug-triggering test inputs, thus to facilitate debugging. It takes a list of elements with each element representing a fragment of the test input, systematically partitions the list at different...
Gespeichert in:
| Veröffentlicht in: | Proceedings / International Conference on Software Engineering S. 1592 - 1603 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
26.04.2025
|
| Schlagworte: | |
| ISSN: | 1558-1225 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Delta Debugging is a widely used family of algorithms (e.g., ddmin and ProbDD) to automatically minimize bug-triggering test inputs, thus to facilitate debugging. It takes a list of elements with each element representing a fragment of the test input, systematically partitions the list at different granularities, identifies and deletes bug-irrelevant partitions. Prior delta debugging algorithms assume there are no differences among the elements in the list, and thus treat them uniformly during partitioning. However, in practice, this assumption usually does not hold, because the size (referred to as weight) of the fragment represented by each element can vary significantly. For example, a single element representing 50% of the test input is much more likely to be bug-relevant than elements representing only 1%. This assumption inevitably impairs the efficiency or even effectiveness of these delta debugging algorithms. This paper proposes Weighted Delta Debugging (WDD), a novel concept to help prior delta debugging algorithms overcome the limitation mentioned above. The key insight of WDD is to assign each element in the list a weight according to its size, and distinguish different elements based on their weights during partitioning. We designed two new minimization algorithms, \mathbf{W}_{\text{ddmin}} and \mathbf{W}_{\text{ProbDD }} , by applying WDD to ddmin and ProbDD respectively. We extensively evaluated \mathbf{W}_{\text{ddmin}} and \mathbf{W}_{\text{ProbDD }} in two representative applications, HDD and Perses, on 62 benchmarks across two languages. On average, with \mathbf{W}_{\text{ddmin }} , HDD and Perses took 51.31% and 7.47% less time to generate 9.12% and 0.96% smaller results than with ddmin, respectively. With \mathbf{W}_{\text{ProbDD }} , HDD and Perses used 11.98% and 9.72% less time to generate 13.40% and 2.20% smaller results than with ProbDD, respectively. The results strongly demonstrate the value of WDD. We firmly believe that WDD opens up a new dimension to improve test input minimization techniques. |
|---|---|
| AbstractList | Delta Debugging is a widely used family of algorithms (e.g., ddmin and ProbDD) to automatically minimize bug-triggering test inputs, thus to facilitate debugging. It takes a list of elements with each element representing a fragment of the test input, systematically partitions the list at different granularities, identifies and deletes bug-irrelevant partitions. Prior delta debugging algorithms assume there are no differences among the elements in the list, and thus treat them uniformly during partitioning. However, in practice, this assumption usually does not hold, because the size (referred to as weight) of the fragment represented by each element can vary significantly. For example, a single element representing 50% of the test input is much more likely to be bug-relevant than elements representing only 1%. This assumption inevitably impairs the efficiency or even effectiveness of these delta debugging algorithms. This paper proposes Weighted Delta Debugging (WDD), a novel concept to help prior delta debugging algorithms overcome the limitation mentioned above. The key insight of WDD is to assign each element in the list a weight according to its size, and distinguish different elements based on their weights during partitioning. We designed two new minimization algorithms, \mathbf{W}_{\text{ddmin}} and \mathbf{W}_{\text{ProbDD }} , by applying WDD to ddmin and ProbDD respectively. We extensively evaluated \mathbf{W}_{\text{ddmin}} and \mathbf{W}_{\text{ProbDD }} in two representative applications, HDD and Perses, on 62 benchmarks across two languages. On average, with \mathbf{W}_{\text{ddmin }} , HDD and Perses took 51.31% and 7.47% less time to generate 9.12% and 0.96% smaller results than with ddmin, respectively. With \mathbf{W}_{\text{ProbDD }} , HDD and Perses used 11.98% and 9.72% less time to generate 13.40% and 2.20% smaller results than with ProbDD, respectively. The results strongly demonstrate the value of WDD. We firmly believe that WDD opens up a new dimension to improve test input minimization techniques. |
| Author | Tian, Yongqiang Sun, Chengnian Zhang, Mengxiao Xu, Zhenyang Zhou, Xintong |
| Author_xml | – sequence: 1 givenname: Xintong surname: Zhou fullname: Zhou, Xintong email: x27zhou@uwaterloo.ca organization: School of Computer Science, University of Waterloo,Waterloo,Canada – sequence: 2 givenname: Zhenyang surname: Xu fullname: Xu, Zhenyang email: zhenyang.xu@uwaterloo.ca organization: School of Computer Science, University of Waterloo,Waterloo,Canada – sequence: 3 givenname: Mengxiao surname: Zhang fullname: Zhang, Mengxiao email: m492zhan@uwaterloo.ca organization: School of Computer Science, University of Waterloo,Waterloo,Canada – sequence: 4 givenname: Yongqiang surname: Tian fullname: Tian, Yongqiang email: yqtian@ust.hk organization: The Hong Kong University of Science and Technology,Department of Computer Science and Engineering,Hong Kong,China – sequence: 5 givenname: Chengnian surname: Sun fullname: Sun, Chengnian email: cnsun@uwaterloo.ca organization: School of Computer Science, University of Waterloo,Waterloo,Canada |
| BookMark | eNotj1FLw0AQhE9RsK39BxX6BxL39m4ve75JUrVQ8EGlj-Vy2cZIjdLEB_99D5SBGRiGD2aqLvqvXpRaaMi1Bn-7Ll9WRMYWOQJSDgCFPlNzX3g2RhOQ8_pcTTQRZxqRrtR0GD7SzFnvJ-pmW1V3y6107fsozbKSwxiS1z9t2_Xttbrch8Mg8_-cqbeH1Wv5lG2eH9fl_SYL6GDMhPc1amQWdgYMO3BUYO20byBatMxNCBw4NVFsIZSEsXYRMYqxZGZq8cftRGT3few-w_F3l_6hT0RzAn4APZA |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/ICSE55347.2025.00071 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9798331505691 |
| EISSN | 1558-1225 |
| EndPage | 1603 |
| ExternalDocumentID | 11029863 |
| Genre | orig-research |
| GroupedDBID | -~X .4S .DC 29O 5VS 6IE 6IF 6IH 6IK 6IL 6IM 6IN 8US AAJGR AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS ARCSS AVWKF BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO EDO FEDTE I-F IEGSK IJVOP IPLJI M43 OCL RIE RIL RIO |
| ID | FETCH-LOGICAL-a260t-e8fb21288e863038606572b619d0c42488daa8a8b61ce47e5e5e2cb6c22ce3453 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001538318100124&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 01:40:27 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a260t-e8fb21288e863038606572b619d0c42488daa8a8b61ce47e5e5e2cb6c22ce3453 |
| PageCount | 12 |
| ParticipantIDs | ieee_primary_11029863 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-April-26 |
| PublicationDateYYYYMMDD | 2025-04-26 |
| PublicationDate_xml | – month: 04 year: 2025 text: 2025-April-26 day: 26 |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings / International Conference on Software Engineering |
| PublicationTitleAbbrev | ICSE |
| PublicationYear | 2025 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0006499 |
| Score | 2.3036482 |
| Snippet | Delta Debugging is a widely used family of algorithms (e.g., ddmin and ProbDD) to automatically minimize bug-triggering test inputs, thus to facilitate... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1592 |
| SubjectTerms | Benchmark testing Debugging Delta Debugging Minimization Partitioning algorithms Program Reduction Software algorithms Software engineering Test Input Minimization |
| Title | WDD: Weighted Delta Debugging |
| URI | https://ieeexplore.ieee.org/document/11029863 |
| WOSCitedRecordID | wos001538318100124&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5s8eCpPiq-KnvwGrtNdpOs1z5QkFJQaW8lj1kRpJW69fc7SbftyYMEQpjLMAnJl5nJlwG403TqO81LltnCscyjYNYZwUIGriD49ujj7_rPajzWs1kxqcnqkQuDiPHxGd6HYczl-6Vbh1BZl6CKF1qKBjSUUhuy1u7YlXR3r7lxvbToPvVfhnkuMkU-IA9xkzSy5PcVVCKAjFr_VH0M7T0VL5nsQOYEDnBxCq1tLYak3ppn0JkOBg_JNAY60ScD_KwM9XYdIsrvbXgbDV_7j6wufcAMORgVQ11aAhWtkXSmQpObkStuydvxqcs47TpvjDaaJA4zhTk17qx0nDsUWS7OoblYLvACEuuEUdb2egI9rYXTRkmUpS1Tm3GVyktoB3PnX5vfLeZbS6_-kF_DUZjRkFHh8gaa1WqNHTh0P9XH9-o2rskv51-LVA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4omugJHxhf6B68ruy23d2uVx6BiIREDNxIH4MxMWBw8fc7LQucPJgmTTOXybRpv85Mvw7Ag6RT30g2C4XOTSgs8lAbxUOXgcsJvi1a_7t-PxsM5GSSD0uyuufCIKJ_fIaPbuhz-XZhVi5U1iCoYrlM-T4cJEKweE3X2h68Kd3eS3ZcHOWNXvO1nSRcZOQFMhc5iTxPfldDxUNIp_pP5SdQ25HxguEWZk5hD-dnUN1UYwjKzXkO9XGr9RSMfagTbdDCz0JRr1cupvxeg7dOe9TshmXxg1CRi1GEKGeaYEVKJJ0Rl-RoJBnT5O_YyAhG-84qJZUkiUGRYUKNGZ0axgxykfALqMwXc7yEQBuuMq3jmKOl1TBSZSmmMz2LtGBZlF5BzZk7_Vr_bzHdWHr9h_wejrqjl_603xs838Cxm12XX2HpLVSK5QrrcGh-io_v5Z1fn19c4Y6b |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+%2F+International+Conference+on+Software+Engineering&rft.atitle=WDD%3A+Weighted+Delta+Debugging&rft.au=Zhou%2C+Xintong&rft.au=Xu%2C+Zhenyang&rft.au=Zhang%2C+Mengxiao&rft.au=Tian%2C+Yongqiang&rft.date=2025-04-26&rft.pub=IEEE&rft.eissn=1558-1225&rft.spage=1592&rft.epage=1603&rft_id=info:doi/10.1109%2FICSE55347.2025.00071&rft.externalDocID=11029863 |