Summary of SWFC-ART: a cost-effective approach for fixed-size-candidate-set adaptive random testing through small world graphs

Muhammad Ashfaq; Rubing Huang; Dave Towey; Michael Omari; Dmitry Yashunin; Patrick Kwaku Kudjo; Tao Zhang

doi:10.1109/ICST53961.2022.00053

Summary of SWFC-ART: a cost-effective approach for fixed-size-candidate-set adaptive random testing through small world graphs

Muhammad Ashfaq, Rubing Huang, Dave Towey, Michael Omari, Dmitry Yashunin, Patrick Kwaku Kudjo, Tao Zhang

Research output: Chapter in Book/Conference proceeding › Conference contribution › peer-review

Abstract

This extended abstract presents an approach to enhance the Fixed-Sized-Candidate-Set Adaptive Random Testing (FSCS-ART) sampling strategy. SWFC-ART, the proposed approach, stores the previously-executed, non-failure-causing test cases into a Hierarchical Navigable Small World Graph (HNSWG) data structure and uses an efficient and consistent Nearest Neighbor Search (NNS) mechanism, especially for high-dimensional input domains. Our experiments show that SWFC-ART reduces the computational overhead of FSCS-ART from quadratic to log-linear order while retaining the failure-detection effectiveness of FSCS-ART.

Original language	English
Title of host publication	2022 IEEE Conference on Software Testing, Verification and Validation (ICST)
Publisher	IEEE
Pages	460-460
Number of pages	1
ISBN (Electronic)	9781665466790
DOIs	https://doi.org/10.1109/ICST53961.2022.00053
Publication status	Published - 2022
Event	15th IEEE International Conference on Software Testing, Verification and Validation - Virtual: Appendee Duration: 4 Apr 2022 → 13 Apr 2022 https://icst2022.vrain.upv.es/

Conference

Conference	15th IEEE International Conference on Software Testing, Verification and Validation
Abbreviated title	ICST 2022
Period	4/04/22 → 13/04/22
Internet address	https://icst2022.vrain.upv.es/

Keywords

Software Testing
Random Testing
Adaptive Random Testing
Efficiency
Hierarchical Navigable Small World Graphs

Access to Document

10.1109/ICST53961.2022.00053

Cite this

@inproceedings{8f619ea2f3604eebbf58a13c8c331a99,

title = "Summary of SWFC-ART: a cost-effective approach for fixed-size-candidate-set adaptive random testing through small world graphs",

abstract = "This extended abstract presents an approach to enhance the Fixed-Sized-Candidate-Set Adaptive Random Testing (FSCS-ART) sampling strategy. SWFC-ART, the proposed approach, stores the previously-executed, non-failure-causing test cases into a Hierarchical Navigable Small World Graph (HNSWG) data structure and uses an efficient and consistent Nearest Neighbor Search (NNS) mechanism, especially for high-dimensional input domains. Our experiments show that SWFC-ART reduces the computational overhead of FSCS-ART from quadratic to log-linear order while retaining the failure-detection effectiveness of FSCS-ART.",

keywords = "Software Testing, Random Testing, Adaptive Random Testing, Efficiency, Hierarchical Navigable Small World Graphs",

author = "Muhammad Ashfaq and Rubing Huang and Dave Towey and Michael Omari and Dmitry Yashunin and Kudjo, {Patrick Kwaku} and Tao Zhang",

year = "2022",

doi = "10.1109/ICST53961.2022.00053",

language = "English",

pages = "460--460",

booktitle = "2022 IEEE Conference on Software Testing, Verification and Validation (ICST)",

publisher = "IEEE",

address = "United States",

note = "15th IEEE International Conference on Software Testing, Verification and Validation, ICST 2022 ; Conference date: 04-04-2022 Through 13-04-2022",

url = "https://icst2022.vrain.upv.es/",

}

Ashfaq, M, Huang, R, Towey, D, Omari, M, Yashunin, D, Kudjo, PK & Zhang, T 2022, Summary of SWFC-ART: a cost-effective approach for fixed-size-candidate-set adaptive random testing through small world graphs. in 2022 IEEE Conference on Software Testing, Verification and Validation (ICST). IEEE, pp. 460-460, 15th IEEE International Conference on Software Testing, Verification and Validation, 4/04/22. https://doi.org/10.1109/ICST53961.2022.00053

Summary of SWFC-ART: a cost-effective approach for fixed-size-candidate-set adaptive random testing through small world graphs. / Ashfaq, Muhammad; Huang, Rubing; Towey, Dave; Omari, Michael; Yashunin, Dmitry; Kudjo, Patrick Kwaku; Zhang, Tao.

2022 IEEE Conference on Software Testing, Verification and Validation (ICST). IEEE, 2022. p. 460-460.

Research output: Chapter in Book/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Summary of SWFC-ART: a cost-effective approach for fixed-size-candidate-set adaptive random testing through small world graphs

AU - Ashfaq, Muhammad

AU - Huang, Rubing

AU - Towey, Dave

AU - Omari, Michael

AU - Yashunin, Dmitry

AU - Kudjo, Patrick Kwaku

AU - Zhang, Tao

PY - 2022

Y1 - 2022

N2 - This extended abstract presents an approach to enhance the Fixed-Sized-Candidate-Set Adaptive Random Testing (FSCS-ART) sampling strategy. SWFC-ART, the proposed approach, stores the previously-executed, non-failure-causing test cases into a Hierarchical Navigable Small World Graph (HNSWG) data structure and uses an efficient and consistent Nearest Neighbor Search (NNS) mechanism, especially for high-dimensional input domains. Our experiments show that SWFC-ART reduces the computational overhead of FSCS-ART from quadratic to log-linear order while retaining the failure-detection effectiveness of FSCS-ART.

AB - This extended abstract presents an approach to enhance the Fixed-Sized-Candidate-Set Adaptive Random Testing (FSCS-ART) sampling strategy. SWFC-ART, the proposed approach, stores the previously-executed, non-failure-causing test cases into a Hierarchical Navigable Small World Graph (HNSWG) data structure and uses an efficient and consistent Nearest Neighbor Search (NNS) mechanism, especially for high-dimensional input domains. Our experiments show that SWFC-ART reduces the computational overhead of FSCS-ART from quadratic to log-linear order while retaining the failure-detection effectiveness of FSCS-ART.

KW - Software Testing

KW - Random Testing

KW - Adaptive Random Testing

KW - Efficiency

KW - Hierarchical Navigable Small World Graphs

U2 - 10.1109/ICST53961.2022.00053

DO - 10.1109/ICST53961.2022.00053

M3 - Conference contribution

SP - 460

EP - 460

BT - 2022 IEEE Conference on Software Testing, Verification and Validation (ICST)

PB - IEEE

T2 - 15th IEEE International Conference on Software Testing, Verification and Validation

Y2 - 4 April 2022 through 13 April 2022

ER -

Summary of SWFC-ART: a cost-effective approach for fixed-size-candidate-set adaptive random testing through small world graphs

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this