A Probabilistic Delta Debugging Approach for Abstract Syntax Trees

Delta debugging provides an efficient and systematic approach to isolate and identify a minimal subsequence that exhibit a specific property. A notable trend in the development of delta debugging is to address data with domain-specific structures, such as programs. However, the efficiency and effect...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings - International Symposium on Software Reliability Engineering pp. 763 - 773
Main Authors: Wang, Guancheng, Wu, Yiqian, Zhu, Qihao, Xiong, Yingfei, Zhang, Xin, Zhang, Lu
Format: Conference Proceeding
Language:English
Published: IEEE 09.10.2023
Subjects:
Abstract Syntax Tree
Benchmark testing
Debugging
Delta Debugging
Estimation
Probabilistic logic
Probabilistic Model
Refining
Syntactics
Systematics
ISSN:2332-6549
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Delta debugging provides an efficient and systematic approach to isolate and identify a minimal subsequence that exhibit a specific property. A notable trend in the development of delta debugging is to address data with domain-specific structures, such as programs. However, the efficiency and effectiveness of domain-specific delta debugging algorithms still present challenges. Probabilistic delta debugging (ProbDD) enhances the ddmin algorithm, which forms the foundation of most domain-specific delta debugging approaches, by incorporating a probabilistic model. By replacing the ddmin component with ProbDD, algorithms relying on ddmin can achieve superior performance. Meanwhile, domain-specific delta debugging techniques, such as Perses, have been designed to cater to the abstract syntax tree (AST) and follow predefined sequences of attempts to minimize programs. These techniques benefit from the use of AST-based transformations, enabling them to achieve even smaller results efficiently. However, we observe that ProbDD assumes independence between elements, which may limit their performance in capturing syntactic relationships. Additionally, domain-specific approaches such as Perses rely on a predefined sequence of attempts the removal of the element and fail to utilize the information from existing test results.In this paper, we propose T-PDD, a novel approach that addresses these limitations. T-PDD leverages the AST to construct a probabilistic model, both utilizing historical test results and capturing syntactic relationships to estimate the probabilities of elements being retained in the result. It selects a set of elements that maximizes the gain for the next test based on the model and updates the model using the test results.In our evaluation, we assess our approach on 107 real-world subjects. The results demonstrate an average improvement of 26.95% in processing time and a 3.4x reduction in result size compared to Perses in the best-case scenario.
AbstractList Delta debugging provides an efficient and systematic approach to isolate and identify a minimal subsequence that exhibit a specific property. A notable trend in the development of delta debugging is to address data with domain-specific structures, such as programs. However, the efficiency and effectiveness of domain-specific delta debugging algorithms still present challenges. Probabilistic delta debugging (ProbDD) enhances the ddmin algorithm, which forms the foundation of most domain-specific delta debugging approaches, by incorporating a probabilistic model. By replacing the ddmin component with ProbDD, algorithms relying on ddmin can achieve superior performance. Meanwhile, domain-specific delta debugging techniques, such as Perses, have been designed to cater to the abstract syntax tree (AST) and follow predefined sequences of attempts to minimize programs. These techniques benefit from the use of AST-based transformations, enabling them to achieve even smaller results efficiently. However, we observe that ProbDD assumes independence between elements, which may limit their performance in capturing syntactic relationships. Additionally, domain-specific approaches such as Perses rely on a predefined sequence of attempts the removal of the element and fail to utilize the information from existing test results.In this paper, we propose T-PDD, a novel approach that addresses these limitations. T-PDD leverages the AST to construct a probabilistic model, both utilizing historical test results and capturing syntactic relationships to estimate the probabilities of elements being retained in the result. It selects a set of elements that maximizes the gain for the next test based on the model and updates the model using the test results.In our evaluation, we assess our approach on 107 real-world subjects. The results demonstrate an average improvement of 26.95% in processing time and a 3.4x reduction in result size compared to Perses in the best-case scenario.
Author Wang, Guancheng
Zhang, Xin
Zhang, Lu
Wu, Yiqian
Xiong, Yingfei
Zhu, Qihao
Author_xml – sequence: 1
  givenname: Guancheng
  surname: Wang
  fullname: Wang, Guancheng
  email: guancheng.wang@pku.edu.cn
  organization: Ministry of Education (Peking University); School of Computer Science, Peking University,Key Laboratory of High Confidence Software Technologies,P. R. China,100871
– sequence: 2
  givenname: Yiqian
  surname: Wu
  fullname: Wu, Yiqian
  email: wuyiqian@pku.edu.cn
  organization: Ministry of Education (Peking University); School of Computer Science, Peking University,Key Laboratory of High Confidence Software Technologies,P. R. China,100871
– sequence: 3
  givenname: Qihao
  surname: Zhu
  fullname: Zhu, Qihao
  email: zhuqh@pku.edu.cn
  organization: Ministry of Education (Peking University); School of Computer Science, Peking University,Key Laboratory of High Confidence Software Technologies,P. R. China,100871
– sequence: 4
  givenname: Yingfei
  surname: Xiong
  fullname: Xiong, Yingfei
  email: xiongyf@pku.edu.cn
  organization: Ministry of Education (Peking University); School of Computer Science, Peking University,Key Laboratory of High Confidence Software Technologies,P. R. China,100871
– sequence: 5
  givenname: Xin
  surname: Zhang
  fullname: Zhang, Xin
  email: xin@pku.edu.cn
  organization: Ministry of Education (Peking University); School of Computer Science, Peking University,Key Laboratory of High Confidence Software Technologies,P. R. China,100871
– sequence: 6
  givenname: Lu
  surname: Zhang
  fullname: Zhang, Lu
  email: zhanglucs@pku.edu.cn
  organization: Ministry of Education (Peking University); School of Computer Science, Peking University,Key Laboratory of High Confidence Software Technologies,P. R. China,100871
BookMark eNotjdFKwzAUQKMouM39gUJ-oPUmuWmSxzqnDgaKnc8jadMaqW1JK2x_70Rfznk7Z04uur7zhNwySBkDc7cpire1NBp1yoGLFAAyOCNLo4wWEgSTBsU5mXEheJJJNFdkPo6fAByQ8Rm5z-lr7J11oQ3jFEr64NvJnui-myZ0Dc2HIfa2_KB1H2nuxinacqLFsZvsge6i9-M1uaxtO_rlvxfk_XG9Wz0n25enzSrfJuH0mpJKaWMQsMRaedA-k545I6xCz9Eqbp0DVE5qzcq6lkpWhjGJFdSq4hZRLMjNXzd47_dDDF82HvcMuPntih9DM0wy
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ISSRE59848.2023.00060
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9798350315943
EISSN 2332-6549
EndPage 773
ExternalDocumentID 10299940
Genre orig-research
GrantInformation_xml – fundername: National Natural Science Foundation of China
  funderid: 10.13039/501100001809
– fundername: Research and Development
  funderid: 10.13039/100006190
GroupedDBID 6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i204t-d7899404c4f7e08e65e1b93a74e24a72abb047b5881cff575d91154d0f7d2a443
IEDL.DBID RIE
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001096886300067&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 02:22:57 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i204t-d7899404c4f7e08e65e1b93a74e24a72abb047b5881cff575d91154d0f7d2a443
PageCount 11
ParticipantIDs ieee_primary_10299940
PublicationCentury 2000
PublicationDate 2023-Oct.-9
PublicationDateYYYYMMDD 2023-10-09
PublicationDate_xml – month: 10
  year: 2023
  text: 2023-Oct.-9
  day: 09
PublicationDecade 2020
PublicationTitle Proceedings - International Symposium on Software Reliability Engineering
PublicationTitleAbbrev ISSRE
PublicationYear 2023
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0020412
Score 2.2489274
Snippet Delta debugging provides an efficient and systematic approach to isolate and identify a minimal subsequence that exhibit a specific property. A notable trend...
SourceID ieee
SourceType Publisher
StartPage 763
SubjectTerms Abstract Syntax Tree
Benchmark testing
Debugging
Delta Debugging
Estimation
Probabilistic logic
Probabilistic Model
Refining
Syntactics
Systematics
Title A Probabilistic Delta Debugging Approach for Abstract Syntax Trees
URI https://ieeexplore.ieee.org/document/10299940
WOSCitedRecordID wos001096886300067&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/eLvHCXMwlZ1LS8NAEMcXLR481UfFN3vwGt0km-7usWqLgpRiq_RW9jGRgqQlTUW_vTvbtHrx4CWEEEgyy2ZmZ-f_G0KuHDNaWwuRMSaJuHcYkcm1H5C2iEF4n88CdvH1SfT7cjxWg1qsHrQwABCKz-AaT8NevpvZJabK_Az3P0_F_Qp9WwixEmttVlcIjqolOjFTN4_D4XM3UzLUbyWIMWWIofzVQiV4kF7zn8_eI60fLR4dbLzMPtmC4oA0180YaD03D8ltB28zAZiL7GV6D--V9kezxKTyG-3U9HDqw1TaMZjisBUdfhWV_qSjEmDRIi-97ujuIaobJERT_7lV5ITEV-KW5wKYhHYGsVGpFhwSrkWijWFcmEzK2Oa5D8ycQvqOY7lwieY8PSKNYlbAMaGpdOBA6yy32scoIFMbdhhBaAtZJk9IC20yma8YGJO1OU7_uH5GdtHsoexNnZNGVS7hguzYj2q6KC_DyH0DNKaaIA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PT8IwFMcbgyZ6wh8Yf9uD12m3tbQ9okIgIiGChhvpjzdDYoaBYfS_ty0DvXjwsizLkm196d7r6_t-HkJXlmiljIFIa51E1DmMSGfKGaTOY-DO55OAXXzp8l5PjEayX4rVgxYGAELxGVz707CXb6dm4VNlboa7n6ekboW-yShN4qVca72-8uioUqQTE3nTGQyemkyKUMGVeJAp8SDKX01Ugg9pVf_59F1U-1Hj4f7az-yhDcj3UXXVjgGXs_MA3Tb8bTogcz19Gd_DW6HcUS98WvkVN0p-OHaBKm5on-QwBR585YX6xMMZwLyGnlvN4V07KlskRBP3uUVkufCvRA3NOBABdQaxlqniFBKqeKK0JpRrJkRsssyFZlZ6_o4lGbeJojQ9RJV8msMRwqmwYEEplhnlohQQqQl7jMCVAcbEMar5MRm_LykY49VwnPxx_RJtt4eP3XG303s4RTveBKEITp6hSjFbwDnaMh_FZD67CFb8Bmo6nWc
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+-+International+Symposium+on+Software+Reliability+Engineering&rft.atitle=A+Probabilistic+Delta+Debugging+Approach+for+Abstract+Syntax+Trees&rft.au=Wang%2C+Guancheng&rft.au=Wu%2C+Yiqian&rft.au=Zhu%2C+Qihao&rft.au=Xiong%2C+Yingfei&rft.date=2023-10-09&rft.pub=IEEE&rft.eissn=2332-6549&rft.spage=763&rft.epage=773&rft_id=info:doi/10.1109%2FISSRE59848.2023.00060&rft.externalDocID=10299940