Evaluation of the fixed‐point iteration of minimizing delta debugging

The minimizing Delta Debugging (DDMIN) was among the first algorithms designed to automate the task of reducing test cases. Its popularity is based on the characteristics that it works on any kind of input, without knowledge about the input structure. Several studies proved that smaller outputs can...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of software : evolution and process Jg. 36; H. 10
Hauptverfasser: Vince, Dániel, Kiss, Ákos
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Chichester Wiley Subscription Services, Inc 01.10.2024
Schlagworte:
ISSN:2047-7473, 2047-7481
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The minimizing Delta Debugging (DDMIN) was among the first algorithms designed to automate the task of reducing test cases. Its popularity is based on the characteristics that it works on any kind of input, without knowledge about the input structure. Several studies proved that smaller outputs can be produced faster with more advanced techniques (e.g., building a tree representation of the input and reducing that data structure); however, if the structure is unknown or changing frequently, maintaining the descriptors might not be resource‐efficient. Therefore, in this paper, we focus on the evaluation of the novel fixed‐point iteration of minimizing Delta Debugging (DDMIN*) on publicly available test suites related to software engineering. Our experiments show that DDMIN* can help reduce inputs further by 48.08% on average compared to DDMIN (using lines as the units of the reduction). Although the effectiveness of the algorithm improved, it comes with the cost of additional testing steps. This study shows how the characteristics of the input affect the results and when it pays off using DDMIN*. This paper focuses on the evaluation of the fixed‐point iteration of the minimizing Delta Debugging algorithm (DDMIN*). Our experiments show that fixed‐point iteration can help reduce inputs further by 48.08% on average (conducted on publicly available test suites using lines as the units of the reduction). This study also shows how the characteristics of the input affect the results and when it pays off using DDMIN*.
AbstractList The minimizing Delta Debugging (DDMIN) was among the first algorithms designed to automate the task of reducing test cases. Its popularity is based on the characteristics that it works on any kind of input, without knowledge about the input structure. Several studies proved that smaller outputs can be produced faster with more advanced techniques (e.g., building a tree representation of the input and reducing that data structure); however, if the structure is unknown or changing frequently, maintaining the descriptors might not be resource‐efficient. Therefore, in this paper, we focus on the evaluation of the novel fixed‐point iteration of minimizing Delta Debugging (DDMIN*) on publicly available test suites related to software engineering. Our experiments show that DDMIN* can help reduce inputs further by 48.08% on average compared to DDMIN (using lines as the units of the reduction). Although the effectiveness of the algorithm improved, it comes with the cost of additional testing steps. This study shows how the characteristics of the input affect the results and when it pays off using DDMIN*. This paper focuses on the evaluation of the fixed‐point iteration of the minimizing Delta Debugging algorithm (DDMIN*). Our experiments show that fixed‐point iteration can help reduce inputs further by 48.08% on average (conducted on publicly available test suites using lines as the units of the reduction). This study also shows how the characteristics of the input affect the results and when it pays off using DDMIN*.
The minimizing Delta Debugging (DDMIN) was among the first algorithms designed to automate the task of reducing test cases. Its popularity is based on the characteristics that it works on any kind of input, without knowledge about the input structure. Several studies proved that smaller outputs can be produced faster with more advanced techniques (e.g., building a tree representation of the input and reducing that data structure); however, if the structure is unknown or changing frequently, maintaining the descriptors might not be resource‐efficient. Therefore, in this paper, we focus on the evaluation of the novel fixed‐point iteration of minimizing Delta Debugging (DDMIN*) on publicly available test suites related to software engineering. Our experiments show that DDMIN* can help reduce inputs further by 48.08% on average compared to DDMIN (using lines as the units of the reduction). Although the effectiveness of the algorithm improved, it comes with the cost of additional testing steps. This study shows how the characteristics of the input affect the results and when it pays off using DDMIN*.
Author Kiss, Ákos
Vince, Dániel
Author_xml – sequence: 1
  givenname: Dániel
  orcidid: 0000-0002-8701-5373
  surname: Vince
  fullname: Vince, Dániel
  email: vinced@inf.u-szeged.hu
  organization: University of Szeged
– sequence: 2
  givenname: Ákos
  surname: Kiss
  fullname: Kiss, Ákos
  organization: University of Szeged
BookMark eNp1kMtKAzEUhoNUsNaCjzDgxs3UJJPLZCmlVqEieFmHzDRTU2aSMZlR68pH8Bl9ElMr3XkW58L_8R_4j8HAOqsBOEVwgiDEF6HxE8whPgBDDAlPOcnRYL_z7AiMQ1jDWAxDSugQzGevqu5VZ5xNXJV0zzqpzLtefn9-tc7YLjGd9nu5MdY05sPYVbLUdadiL_rVKt4n4LBSddDjvzkCT1ezx-l1urib30wvF2mJKcFpQUTJFGes0pQJTqDOEdZqqTPGEEWFyJnKVEZVAcs8MirKnFYCMUpKgXU2Amc739a7l16HTq5d7218KTMUHYQgkETqfEeV3oXgdSVbbxrlNxJBuU1KxqTkNqmIpjv0zdR68y8nH27vf_kf5Oxrow
Cites_doi 10.1002/smr.2483
10.1145/3548659.3561314
10.1145/2950290.2950342
10.1109/ICSME.2017.26
10.1109/SCAM.2015.7335396
10.1145/3180155.3180236
10.1007/978-3-642-01702-5_13
10.1007/s10664-018-9675-9
10.1145/1134285.1134307
10.1145/2635868.2635893
10.1145/1670412.1670413
10.1145/347324.348938
10.1007/978-3-030-81688-9_11
10.5220/0005988602410248
10.1145/3278186.3278189
10.1007/3-540-48166-4_16
10.1145/3586049
10.5220/0010560501960206
10.1109/SCAM.2014.26
10.1109/QRS57517.2022.00052
10.1109/AST52587.2021.00015
10.1109/QRS.2018.00056
10.1007/978-3-030-16722-6_24
10.1145/3338906.3338956
10.1145/3453483.3454091
10.1109/ASE.2019.00038
10.1109/AST.2017.4
10.1145/3106237.3106304
10.1109/ACCESS.2020.3043027
10.1145/3548659.3561308
10.1109/SCAM.2017.11
10.1109/32.988498
ContentType Journal Article
Copyright 2024 John Wiley & Sons, Ltd.
Copyright_xml – notice: 2024 John Wiley & Sons, Ltd.
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1002/smr.2702
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
CrossRef
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2047-7481
EndPage n/a
ExternalDocumentID 10_1002_smr_2702
SMR2702
Genre article
GrantInformation_xml – fundername: National Research, Development and Innovation Fund
  funderid: TKP2021‐NVA‐09; ÚNKP‐22‐3‐SZTE‐469; ÚNKP‐23‐3‐SZTE‐536
GroupedDBID .3N
.4S
.GA
.Y3
05W
0R~
10A
1OC
31~
33P
3SF
50Z
52O
52U
8-0
8-1
8-3
8-4
8-5
930
A03
AAESR
AAEVG
AAHQN
AAMNL
AANHP
AANLZ
AAONW
AASGY
AAXRX
AAYCA
AAZKR
ABCUV
ABPVW
ACAHQ
ACBWZ
ACCZN
ACPOU
ACRPL
ACXBN
ACXQS
ACYXJ
ADBBV
ADEOM
ADIZJ
ADKYN
ADMGS
ADMLS
ADNMO
ADOZA
ADXAS
ADZMN
AEIGN
AEIMD
AEUYR
AEYWJ
AFBPY
AFFPM
AFGKR
AFWVQ
AFZJQ
AGHNM
AGQPQ
AGYGG
AHBTC
AITYG
AIURR
AJXKR
ALMA_UNASSIGNED_HOLDINGS
ALUQN
ALVPJ
AMBMR
AMYDB
ARCSS
ATUGU
AUFTA
AZBYB
AZFZN
BAFTC
BDRZF
BHBCM
BMNLL
BMXJE
BRXPI
BY8
D-E
D-F
DCZOG
DPXWK
DR2
DRFUL
DRSTM
EBS
EDO
EJD
F00
F01
F04
G-S
G.N
GODZA
HGLYW
HZ~
I-F
LATKE
LEEKS
LH4
LITHE
LOXES
LUTES
LW6
LYRES
MEWTI
MRFUL
MRSTM
MSFUL
MSSTM
MXFUL
MXSTM
N04
N05
O66
O9-
P2W
P2X
PQQKQ
Q.N
Q11
QB0
R.K
ROL
SUPJJ
TUS
W8V
W99
WBKPD
WIH
WIK
WOHZO
WXSBR
WYISQ
WZISG
~WT
AAYXX
CITATION
O8X
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c2542-b49c6a766fe569740e812eade366151b986a3a35ab0c8fe5a81275f91654c92e3
IEDL.DBID DRFUL
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001252167400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2047-7473
IngestDate Sat Jul 26 00:55:32 EDT 2025
Sat Nov 29 03:00:26 EST 2025
Sun Jul 06 04:45:30 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 10
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2542-b49c6a766fe569740e812eade366151b986a3a35ab0c8fe5a81275f91654c92e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-8701-5373
PQID 3115199404
PQPubID 2034650
PageCount 16
ParticipantIDs proquest_journals_3115199404
crossref_primary_10_1002_smr_2702
wiley_primary_10_1002_smr_2702_SMR2702
PublicationCentury 2000
PublicationDate October 2024
2024-10-00
20241001
PublicationDateYYYYMMDD 2024-10-01
PublicationDate_xml – month: 10
  year: 2024
  text: October 2024
PublicationDecade 2020
PublicationPlace Chichester
PublicationPlace_xml – name: Chichester
PublicationTitle Journal of software : evolution and process
PublicationYear 2024
Publisher Wiley Subscription Services, Inc
Publisher_xml – name: Wiley Subscription Services, Inc
References 2020; 8
2002; 28
2000
2022
2021
2023; 7
2019; 24
2022; 34
2009
2019
2018
2007
2006
2017
2016
2015
2014
1995; 3
1999
e_1_2_11_10_1
e_1_2_11_32_1
e_1_2_11_31_1
e_1_2_11_30_1
e_1_2_11_36_1
e_1_2_11_14_1
e_1_2_11_35_1
e_1_2_11_12_1
e_1_2_11_34_1
e_1_2_11_11_1
e_1_2_11_33_1
e_1_2_11_7_1
e_1_2_11_29_1
e_1_2_11_6_1
e_1_2_11_28_1
e_1_2_11_5_1
e_1_2_11_27_1
e_1_2_11_4_1
e_1_2_11_26_1
e_1_2_11_3_1
e_1_2_11_2_1
Tip F (e_1_2_11_13_1) 1995; 3
e_1_2_11_21_1
e_1_2_11_20_1
e_1_2_11_25_1
e_1_2_11_24_1
e_1_2_11_9_1
e_1_2_11_23_1
e_1_2_11_8_1
e_1_2_11_22_1
e_1_2_11_18_1
e_1_2_11_17_1
e_1_2_11_16_1
e_1_2_11_15_1
e_1_2_11_37_1
e_1_2_11_38_1
e_1_2_11_19_1
References_xml – start-page: 547
  year: 2017
  end-page: 558
– start-page: 361
  year: 2018
  end-page: 371
– volume: 8
  start-page: 219837
  year: 2020
  end-page: 219846
  article-title: Generalizing the split factor of the minimizing delta debugging algorithm
  publication-title: IEEE Access
– start-page: 1
  year: 2015
  end-page: 10
– start-page: 175
  year: 2014
  end-page: 184
– start-page: 109
  year: 2014
  end-page: 120
– start-page: 1
  year: 2009
  end-page: 5
– start-page: 194
  year: 2017
  end-page: 203
– start-page: 426
  year: 2018
  end-page: 437
– start-page: 142
  year: 2006
  end-page: 151
– start-page: 135
  year: 2000
  end-page: 145
– start-page: 00
  year: 2022
  end-page: 04
– year: 2007
– volume: 28
  start-page: 183
  issue: 2
  year: 2002
  end-page: 200
  article-title: Simplifying and isolating failure‐inducing input
  publication-title: IEEE Trans Softw Eng
– volume: 7
  start-page: 636
  issue: OOPSLA1
  year: 2023
  end-page: 664
  article-title: Pushing the limit of 1‐minimality of language‐agnostic program reduction
  publication-title: Proc ACM Program Lang
– start-page: 231
  year: 2021
  end-page: 242
– volume: 24
  start-page: 3077
  issue: 5
  year: 2019
  end-page: 3113
  article-title: A comparison of tree‐ and line‐oriented observational slicing
  publication-title: Empir Softw Eng
– start-page: 196
  year: 2021
  end-page: 206
– start-page: 291
  year: 2016
  end-page: 309
– start-page: 556
  year: 2019
  end-page: 566
– volume: 34
  start-page: e2483:1
  issue: 11
  year: 2022
  end-page: e2483:26
  article-title: The effect of hoisting on variants of hierarchical delta debugging
  publication-title: J Softw: Evol Process
– volume: 3
  start-page: 121
  issue: 3
  year: 1995
  end-page: 189
  article-title: A survey of program slicing techniques
  publication-title: J Programm Lang
– start-page: 53
  year: 2022
  end-page: 56
– start-page: 442
  year: 2022
  end-page: 453
– start-page: 60
  year: 2021
  end-page: 69
– start-page: 1003
  year: 2021
  end-page: 1016
– start-page: 241
  year: 2016
  end-page: 248
– start-page: 21
  year: 2017
  end-page: 30
– start-page: 99
  year: 2009
  end-page: 113
– start-page: 317
  year: 2019
  end-page: 326
– start-page: 23
  year: 2017
  end-page: 29
– start-page: 409
  year: 2019
  end-page: 426
– start-page: 253
  year: 1999
  end-page: 267
– start-page: 16
  year: 2018
  end-page: 22
– start-page: 422
  year: 2016
  end-page: 434
– ident: e_1_2_11_24_1
  doi: 10.1002/smr.2483
– ident: e_1_2_11_2_1
– ident: e_1_2_11_11_1
  doi: 10.1145/3548659.3561314
– ident: e_1_2_11_29_1
  doi: 10.1145/2950290.2950342
– ident: e_1_2_11_19_1
  doi: 10.1109/ICSME.2017.26
– ident: e_1_2_11_34_1
  doi: 10.1109/SCAM.2015.7335396
– ident: e_1_2_11_8_1
  doi: 10.1145/3180155.3180236
– ident: e_1_2_11_27_1
  doi: 10.1007/978-3-642-01702-5_13
– ident: e_1_2_11_38_1
  doi: 10.1007/s10664-018-9675-9
– ident: e_1_2_11_7_1
  doi: 10.1145/1134285.1134307
– volume: 3
  start-page: 121
  issue: 3
  year: 1995
  ident: e_1_2_11_13_1
  article-title: A survey of program slicing techniques
  publication-title: J Programm Lang
– ident: e_1_2_11_14_1
  doi: 10.1145/2635868.2635893
– ident: e_1_2_11_12_1
– ident: e_1_2_11_32_1
  doi: 10.1145/1670412.1670413
– ident: e_1_2_11_5_1
  doi: 10.1145/347324.348938
– ident: e_1_2_11_33_1
  doi: 10.1007/978-3-030-81688-9_11
– ident: e_1_2_11_15_1
  doi: 10.5220/0005988602410248
– ident: e_1_2_11_16_1
  doi: 10.1145/3278186.3278189
– ident: e_1_2_11_4_1
  doi: 10.1007/3-540-48166-4_16
– ident: e_1_2_11_9_1
  doi: 10.1145/3586049
– ident: e_1_2_11_23_1
  doi: 10.5220/0010560501960206
– ident: e_1_2_11_35_1
  doi: 10.1109/SCAM.2014.26
– ident: e_1_2_11_18_1
  doi: 10.1109/QRS57517.2022.00052
– ident: e_1_2_11_22_1
  doi: 10.1109/AST52587.2021.00015
– ident: e_1_2_11_26_1
  doi: 10.1109/QRS.2018.00056
– ident: e_1_2_11_20_1
  doi: 10.1007/978-3-030-16722-6_24
– ident: e_1_2_11_28_1
– ident: e_1_2_11_30_1
  doi: 10.1145/3338906.3338956
– ident: e_1_2_11_31_1
  doi: 10.1145/3453483.3454091
– ident: e_1_2_11_10_1
  doi: 10.1109/ASE.2019.00038
– ident: e_1_2_11_17_1
  doi: 10.1109/AST.2017.4
– ident: e_1_2_11_36_1
  doi: 10.1145/3106237.3106304
– ident: e_1_2_11_21_1
  doi: 10.1109/ACCESS.2020.3043027
– ident: e_1_2_11_25_1
  doi: 10.1145/3548659.3561308
– ident: e_1_2_11_3_1
– ident: e_1_2_11_37_1
  doi: 10.1109/SCAM.2017.11
– ident: e_1_2_11_6_1
  doi: 10.1109/32.988498
SSID ssj0000620545
Score 2.2996194
Snippet The minimizing Delta Debugging (DDMIN) was among the first algorithms designed to automate the task of reducing test cases. Its popularity is based on the...
SourceID proquest
crossref
wiley
SourceType Aggregation Database
Index Database
Publisher
SubjectTerms Algorithms
Data structures
Debugging
Delta Debugging
evaluation
Software engineering
Software testing
test case minimization
Title Evaluation of the fixed‐point iteration of minimizing delta debugging
URI https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fsmr.2702
https://www.proquest.com/docview/3115199404
Volume 36
WOSCitedRecordID wos001252167400001&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
journalDatabaseRights – providerCode: PRVWIB
  databaseName: Wiley Online Library Full Collection 2020
  customDbUrl:
  eissn: 2047-7481
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000620545
  issn: 2047-7473
  databaseCode: DRFUL
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpZ3PS8MwFMcfunnw4vyJ0ykVxFtdTdq0OYpuephDpoPdSpImUnDdWDsRT_4J_o3-JSb9selBELw0hyZQHnl93zze-wTg1KeeEJJHtogiZLtCEZsF1LGlQtLlnlCI5RDXnt_vB6MRvS-rKk0vTMGHWCTcjGfk_2vj4Iyn7SU0NB3Pzk0z1SrU9YC9GtSvB91hb5FhcQjSesTUMCKDI9C6GVf0WQe1q-U_49FSZH6Xqnms6Tb-85WbsFEqTOuy2BJbsCKTbWhUtzdYpTPvwE1nAfq2JsrSQtBS8auMPt8_ppM4yawCuFy-NgiScfymA50VyeeM6Sefm2z10y4Mu53Hq1u7vFbBFvo0iGzuUkGYT4iSHtHHCUfqIG_qpjEx8obTgDDMsMe4IwI9hwUGAq-o6XsSFEm8B7Vkksh9sAIqPTdizGGSuxhH3A08RqW4IL5UGEVNOKmMG04LekZYcJJRqC0TGss0oVVZPSz9Jw0NA8hQix23CWe5fX9dHz7cDcx48NeJh7COtDIpKvJaUMtmc3kEa-Ili9PZcbmLvgArWM1d
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpZ3PS8MwFMcfcxP04vyJ06kRxFtdTdu0wZPopmI3ZG6wW0nTVAquG1sn4sk_wb_Rv8SkPzY9CIKX9tAEyuO9vG8eeZ8AnNjU4lz4gcaDAGsmD4nGHKprIsTC9C0eYpZCXF2703EGA_pQgouiFybjQ8wLbioy0vVaBbgqSDcW1NDpcHKmuqmWoGJKL5LuXbnutvruvMSiEywFiTrEiBWPQApno8DP6rhRTP-ZkBYq87tWTZNNq_qv31yHtVxjosvMKTagJOJNqBb3N6A8nLfgpjlHfaNRiKQURGH0KoLP94_xKIoTlCGX888KQjKM3mSqQ4F4Tph8-jNVr37ahn6r2bu61fKLFTQu94NY803KCbMJCYVF5IZCFzLNq5PTBlECx6cOYQYzLObr3JFjmKMw8CFVnU-cYmHsQDkexWIXkEOFZQaM6Uz4pmEEvulYjAp-TmwRGjiowXFhXW-c8TO8jJSMPWkZT1mmBvXC7F4eQVNPUYAUt1g3a3CaGvjX-d5ju6vee38deAQrt72267l3nft9WMVSp2Tn8-pQTiYzcQDL_CWJppPD3KW-AHqr0U0
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpZ1LS8NAEMeH2op4sT6xWjWCeIuNu8kmiyexrYq1lGqht7DZhxTsgzYV8eRH8DP6SdxtklYPguAlOWQXwrCz899l5jcAJz71OJeRsLkQyHa5IjYLqGNLhaQbeVwhNoO4NvxmM-h2aSsHF1ktTMKHmF-4Gc-Y7dfGweVIqMqCGjrpj89MNdUSFFzTQyYPhWq73mnMr1gcgrQgMUmMyPAItHDGGX7WQZVs-s-AtFCZ37XqLNjUi__6zXVYSzWmdZksig3IycEmFLP-DVbqzltwXZujvq2hsrQUtFTvVYrP94_RsDeIrQS5nH42EJJ-702HOkvI55jpZzQ199VP29Cp1x6vbuy0sYLN9XkQ2ZFLOWE-IUp6RB8oHKnDvMmcxsQInIgGhGGGPRY5PNBjWGAw8IqayidOkcQ7kB8MB3IXrIBKzxWMOUxGLsYicgOPUcnPiS8VRqIEx5l1w1HCzwgTUjIKtWVCY5kSlDOzh6kHTUJDATLcYsctwenMwL_ODx_u2-a999eBR7DSqtbDxm3zbh9WkZYpSXpeGfLxeCoPYJm_xL3J-DBdUV9MFtDI
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%3Ajournal&rft.genre=article&rft.atitle=Evaluation+of+the+fixed%E2%80%90point+iteration+of+minimizing+delta+debugging&rft.jtitle=Journal+of+software+%3A+evolution+and+process&rft.au=Vince%2C+D%C3%A1niel&rft.au=Kiss%2C+%C3%81kos&rft.date=2024-10-01&rft.issn=2047-7473&rft.eissn=2047-7481&rft.volume=36&rft.issue=10&rft_id=info:doi/10.1002%2Fsmr.2702&rft.externalDBID=n%2Fa&rft.externalDocID=10_1002_smr_2702
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2047-7473&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2047-7473&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2047-7473&client=summon