FAST approaches to scalable similarity-based test case prioritization

Many test case prioritization criteria have been proposed for speeding up fault detection. Among them, similarity-based approaches give priority to the test cases that are the most dissimilar from those already selected. However, the proposed criteria do not scale up to handle the many thousands or...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2018 IEEE/ACM 40th International Conference on Software Engineering (ICSE) s. 222 - 232
Hlavní autoři: Miranda, Breno, Cruciani, Emilio, Verdecchia, Roberto, Bertolino, Antonia
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 27.05.2018
Edice:ACM Conferences
Témata:
ISBN:9781450356381, 1450356389
ISSN:1558-1225
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Many test case prioritization criteria have been proposed for speeding up fault detection. Among them, similarity-based approaches give priority to the test cases that are the most dissimilar from those already selected. However, the proposed criteria do not scale up to handle the many thousands or even some millions test suite sizes of modern industrial systems and simple heuristics are used instead. We introduce the FAST family of test case prioritization techniques that radically changes this landscape by borrowing algorithms commonly exploited in the big data domain to find similar items. FAST techniques provide scalable similarity-based test case prioritization in both white-box and black-box fashion. The results from experimentation on real world C and Java subjects show that the fastest members of the family outperform other black-box approaches in efficiency with no significant impact on effectiveness, and also outperform white-box approaches, including greedy ones, if preparation time is not counted. A simulation study of scalability shows that one FAST technique can prioritize a million test cases in less than 20 minutes.
AbstractList Many test case prioritization criteria have been proposed for speeding up fault detection. Among them, similarity-based approaches give priority to the test cases that are the most dissimilar from those already selected. However, the proposed criteria do not scale up to handle the many thousands or even some millions test suite sizes of modern industrial systems and simple heuristics are used instead. We introduce the FAST family of test case prioritization techniques that radically changes this landscape by borrowing algorithms commonly exploited in the big data domain to find similar items. FAST techniques provide scalable similarity-based test case prioritization in both white-box and black-box fashion. The results from experimentation on real world C and Java subjects show that the fastest members of the family outperform other black-box approaches in efficiency with no significant impact on effectiveness, and also outperform white-box approaches, including greedy ones, if preparation time is not counted. A simulation study of scalability shows that one FAST technique can prioritize a million test cases in less than 20 minutes.
Author Verdecchia, Roberto
Bertolino, Antonia
Miranda, Breno
Cruciani, Emilio
Author_xml – sequence: 1
  givenname: Breno
  surname: Miranda
  fullname: Miranda, Breno
  email: bafm@cin.ufpe.br
  organization: Federal University of Pernambuco, Recife, Brazil
– sequence: 2
  givenname: Emilio
  surname: Cruciani
  fullname: Cruciani, Emilio
  email: emilio.cruciani@gssi.it
  organization: Gran Sasso Science Institute, L'Aquila, Italy
– sequence: 3
  givenname: Roberto
  surname: Verdecchia
  fullname: Verdecchia, Roberto
  email: roberto.verdecchia@gssi.it
  organization: Gran Sasso Science Institute, L'Aquila, Italy
– sequence: 4
  givenname: Antonia
  surname: Bertolino
  fullname: Bertolino, Antonia
  email: antonia.bertolino@isti.cnr.it
  organization: ISTI - CNR, Pisa, Italy
BookMark eNqN0D1PwzAQBmDzJQGlMwOLR5YUn7_qjFXVAlIlBspsnR1bGNKmirOUX4-rdmJiupOeV6fTe0sut902EHIPbAIg1ZMAw0CpyWFyYGdkXE9NASaUFgbOyU1RUwHn6uKPXZNxzl-MMa6NNKBvyGI5e19T3O36Dv1nyHToaPbYomsDzWmTWuzTsK8c5tDQIeSB-rLSXZ-6AukHh9Rt78hVxDaH8WmOyMdysZ6_VKu359f5bFUhl9Oh0hzr6P20llwYHY3XkoHzuvEIWikoXAtkRgQFjhtVkq6RojEuqlrFKEbk4Xg3hRBs-WGD_d4aqQQzUPTxqOg31nXdd7bA7KEze-rMnjor0ck_o9b1KUTxC4RHaGE
CODEN IEEPAD
ContentType Conference Proceeding
Copyright 2018 ACM
Copyright_xml – notice: 2018 ACM
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1145/3180155.3180210
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 Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781450356381
1450356389
EISSN 1558-1225
EndPage 232
ExternalDocumentID 8453081
Genre orig-research
GroupedDBID 6IE
6IF
6IG
6IL
6IM
6IN
AAJGR
ABLEC
ABQGA
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
IEGSK
IJVOP
LHSKQ
OCL
RIB
RIC
RIE
RIL
RIO
-~X
.4S
.DC
123
23M
29O
5VS
6IH
6IK
8US
AAWTH
ADZIZ
AFFNX
ARCSS
AVWKF
CHZPO
EDO
FEDTE
I-F
I07
IPLJI
M43
RNS
XOL
ID FETCH-LOGICAL-a247t-62a9fcc7942386f8c6401bc6dca165512a993a083e51b285c79bd43d8bf595ff3
IEDL.DBID RIE
ISBN 9781450356381
1450356389
ISICitedReferencesCount 73
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000454843300027&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:51:12 EDT 2025
Fri Sep 13 11:04:35 EDT 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
License Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org.
LinkModel DirectLink
MeetingName ICSE '18: 40th International Conference on Software Engineering
MergedId FETCHMERGED-LOGICAL-a247t-62a9fcc7942386f8c6401bc6dca165512a993a083e51b285c79bd43d8bf595ff3
PageCount 11
ParticipantIDs acm_books_10_1145_3180155_3180210_brief
acm_books_10_1145_3180155_3180210
ieee_primary_8453081
PublicationCentury 2000
PublicationDate 20180527
2018-May
PublicationDateYYYYMMDD 2018-05-27
2018-05-01
PublicationDate_xml – month: 05
  year: 2018
  text: 20180527
  day: 27
PublicationDecade 2010
PublicationPlace New York, NY, USA
PublicationPlace_xml – name: New York, NY, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle 2018 IEEE/ACM 40th International Conference on Software Engineering (ICSE)
PublicationTitleAbbrev ICSE
PublicationYear 2018
Publisher ACM
Publisher_xml – name: ACM
SSID ssj0002684816
ssj0006499
Score 2.4071288
Snippet Many test case prioritization criteria have been proposed for speeding up fault detection. Among them, similarity-based approaches give priority to the test...
SourceID ieee
acm
SourceType Publisher
StartPage 222
SubjectTerms Big Data
Data mining
Fault detection
General and reference -- Cross-computing tools and techniques -- Metrics
General and reference -- Cross-computing tools and techniques -- Verification
History
Information systems -- Information retrieval -- Retrieval models and ranking -- Similarity measures
locality sensitive hashing
minhashing
Scalability
similarity
Software and its engineering -- Software creation and management -- Software verification and validation -- Software defect analysis -- Software testing and debugging
Software testing
test case prioritization
Title FAST approaches to scalable similarity-based test case prioritization
URI https://ieeexplore.ieee.org/document/8453081
WOSCitedRecordID wos000454843300027&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/eLvHCXMwlV3PS8MwFH5sw4OnqZs4fxFB8GK2tUn64zjHhgcZg03YraRJCgW3ytb59_vSxokgiKeGJoTwSPK-l-T7HsC9jBEnKM6p0MynnPuaplx4NBWBlga3TGMqndmXcDaLVqt43oDHAxfGGFM9PjN9W6zu8nWh9vaobBBxwYaWZ90Mw7Dmah3OU6xqSWShjtuFA4TyTsrH42KAU9eig779-pYu25Rq_SOjSuVQpu3_DeUEut_MPDI_-JxTaJjNGbS_UjMQt1I7MJmOFksycoLhZkfKAivlmyVKkUW-zjGgRfxNn9CJabJE10DGWMS-88LKHNXkzC68TifL8TN1GROo9HlY0sCXcaYUrjH0xEEWqQDDp1QFWkkvQGyE1TGTiLqM8FI_Etgy1ZzpKM1ELLKMnUNrU2zMBRAlAsOGOmRhJnlsEEfGjDGplVAYkchhD-7QgokNBXZJzW4WibNy4qzcg4c_2yTpNjdZDzrWxsl7LbGROPNe_v77Co4Rt0T1u8NraJXbvbmBI_VR5rvtbTUvPgGsurFf
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dS8MwFL3MKejT1E2cnxUEX-xcm6Qfj3NsTJxjsAp7C2mSQsGtsnX-fm_aOhEE8amhCSFcktxzk5xzAW5FiDhBUmozRVybUlfZMWWOHTNPCY1bptaFzuzYn0yC-Tyc1uB-y4XRWhePz3THFIu7fJXJjTkqewgoI13Ds95l2KtTsrW2JypGtyQwYKfahz0E85WYj0PZA05egw865usawuyOkIsfOVUKlzJs_G8wh9D65uZZ063XOYKaXh5D4ys5g1Wt1SYMhr1ZZPUqyXC9tvIMK8WboUpZs3SRYkiLCNx-RDemrAidg9XHIvadZkboqKRntuB1OIj6I7vKmWALl_q57bkiTKTEVYa-2EsC6WEAFUtPSeF4iI6wOiQCcZdmTuwGDFvGihIVxAkLWZKQE6gvs6U-BUsyT5Ou8omfCBpqRJIhIUQoySTGJKLbhhu0IDfBwJqX_GbGKyvzysptuPuzDY9XqU7a0DQ25u-lyAavzHv2--9r2B9FL2M-fpo8n8MBopigfIV4AfV8tdGXsCc_8nS9uirmyCcaErSm
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+of+the+40th+International+Conference+on+Software+Engineering&rft.atitle=FAST+approaches+to+scalable+similarity-based+test+case+prioritization&rft.au=Miranda%2C+Breno&rft.au=Cruciani%2C+Emilio&rft.au=Verdecchia%2C+Roberto&rft.au=Bertolino%2C+Antonia&rft.series=ACM+Conferences&rft.date=2018-05-27&rft.pub=ACM&rft.isbn=9781450356381&rft.spage=222&rft.epage=232&rft_id=info:doi/10.1145%2F3180155.3180210
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450356381/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450356381/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450356381/sc.gif&client=summon&freeimage=true