Research on optimal sorting algorithm of abstract test case set based on repeated one-dimensional combinatorial coverage

Dandan He; Xiaoxia Tao

doi:10.1117/12.2661172

2 February 2023 Research on optimal sorting algorithm of abstract test case set based on repeated one-dimensional combinatorial coverage

Dandan He, Xiaoxia Tao

Author Affiliations +

Proceedings Volume 12462, Third International Symposium on Computer Engineering and Intelligent Communications (ISCEIC 2022); 124622C (2023) https://doi.org/10.1117/12.2661172
Event: International Symposium on Computer Engineering and Intelligent Communications (ISCEIC 2022), 2022, Xi'an, China

Abstract

When testing software functions, it is necessary to adopt scientific and reasonable test cases to ensure the accuracy of test results, so as to lay a good foundation for the operation and use of software. Based on this, this paper designs a new algorithm FICBPR on the basis of the traditional abstract test case set optimization sorting algorithm (FICBP) based on repeated one-dimensional combination coverage and analyzes the application effect of the algorithm through empirical analysis. Through verification, it can be found that the FICBPR algorithm has lower error rate and shorter time overhead, and its performance and efficiency are significantly better than the traditional FICBP algorithm.

Citation Download Citation

Dandan He and Xiaoxia Tao "Research on optimal sorting algorithm of abstract test case set based on repeated one-dimensional combinatorial coverage", Proc. SPIE 12462, Third International Symposium on Computer Engineering and Intelligent Communications (ISCEIC 2022), 124622C (2 February 2023); https://doi.org/10.1117/12.2661172

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
6 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Error analysis

Optimization (mathematics)

Detection and tracking algorithms

Analytical research

Algorithms

Astatine

Binary data

Keywords/Phrases

Search In:

Publication Years