research-article

Sequence t-way Test Generation using the Barnacles Mating Optimizer Algorithm

Authors:

Kamal Z. Zamli,

Md. Abdul KaderAuthors Info & Claims

ICSCA '21: Proceedings of the 2021 10th International Conference on Software and Computer Applications

Pages 88 - 93

https://doi.org/10.1145/3457784.3457797

Published: 30 July 2021 Publication History

Abstract

Software testing relates to the process of finding errors/defects and/of ensuring that a particular software of interest meets its specification. Although desirable, exhaustive testing is often practically impossible, given many constraints such as time to market deadline as well as unavailability of resources. Many sampling strategies have been designed to ensure sufficient and good enough testing including equivalence partitioning, boundary value analysis, cause and effect graphing, interaction-based sampling and many more. This paper presents a new test generation strategy based on sequence-based t-way testing (where t indicates the interaction strength), called BSS (Barnacle Sequence Strategy). More precisely, we focus on the generation of test cases due to the ordering of inputs (or sequence) using the newly developed Barnacles Mating Optimizer (BMO) Algorithm. Our experience with BSS is encouraging as we manage to match some of existing best test suite size for small interaction strength (t<5) with small number of event sequences (≤10). However, BSS performs poorly with large event sequences owing to the concatenation and scaling problem of its exploitation search operator.

Supplementary Material

p88-zamli-supplement (p88-zamli-supplement.pptx)

Presentation slides

Download
714.26 KB

References

[1]

K. Z. Zamli, M. I. Younis, S. A. C. Abdullah, and Z. H. C. Soh, Software Testing. First ed. KL Malaysia: Open University Malaysia, 2008.

[2]

M. I. Younis, K. Z. Zamli, and N. A. M. Isa, "Algebraic strategy to generate pairwise test set for prime number parameters and variables," in Proceedings of the 2008 International Symposium on Information Technology, 2008, vol. 3, pp. 1-4.

[3]

M. I. Younis, K. Z. Zamli, and N. A. M. Isa, "A strategy for grid based t-way test data generation," in Proceedings of the 2008 First International Conference on Distributed Framework and Applications, 2008, pp. 73-78.

[4]

M. Rahman, "T-way strategy for sequence input interaction test case generation adopting fish swarm algorithm," in Proceedings of the 5th International Conference on Electrical, Control & Computer Engineering 2019, Singapore, A. N. Kasruddin Nasir, Eds., 2020: Springer Singapore, pp. 87-99.

[5]

M. I. Younis, "DEO: A dynamic event order strategy for t-way sequence covering array test data generation," Baghdad Science Journal, vol. 17, no. 2, pp. 0575-0575, 2020.

[6]

A. B. Nasser, K. Z. Zamli, A. A. Alsewari, and B. S. Ahmed, "Hybrid flower pollination algorithm strategies for t-way test suite generation," Plos One, vol. 13, no. 5, pp. 1-24, 2018.

[7]

M. F. J. Klaib, "Development of an automated test data generation and execution strategy using combinatorial approach," PhD. Thesis, School of Electrical And Electronics, Universiti Sains Malaysia, 2009.

[8]

K. Z. Zamli, M. F. J. Klaib, M. I. Younis, N. A. M. Isa, and R. Abdullah, "Design and implementation of a t-way test data generation strategy with automated execution tool support," Information Sciences, vol. 181, no. 9, pp. 1741-1758, 2011.

Digital Library

[9]

Y. Lei, R. Kacker, D. R. Kuhn, V. Okun, and J. Lawrence, "IPOG: A general strategy for t-way software testing," in Proceedings of the 14th Annual IEEE International Conference and Workshops on The Engineering of Computer-Based Systems, Tucson, AZ, 2007, pp. 549-556.

Digital Library

[10]

M. I. Younis and K. Z. Zamli, "MC-MIPOG: A parallel t-way test generation strategy for multicore systems," ETRI Journal, vol. 32, no. 1, pp. 73-83, 2010.

[11]

D. M. Cohen, S. R. Dalal, M. L. Fredman, and G. C. Patton, "The AETG system: An approach to testing based on combinatorial design," IEEE Transactions on Software Engineering, vol. 23, no. 7, pp. 437-444, 1997.

Digital Library

[12]

M. B. Cohen, P. B. Gibbons, W. B. Mugridge, C. J. Colbourn, and J. S. Collofello, "A variable strength interaction testing of components," in Proceedings of 27th Annual International Computer Software and Applications Conference, Dallas, USA, 2003, pp. 413-418.

[13]

X. Chen, Q. Gu, A. Li, and D. Chen, "Variable strength interaction testing with an ant colony system approach," in Proceedings of the 16th Asia-Pacific Software Engineering Conference, Penang, Malaysia, 2009, pp. 160-167.

Digital Library

[14]

D. R. Kuhn, J. M. Higdon, J. F. Lawrence, R. N. Kacker, and Y. Lei, "Combinatorial methods for event sequence testing," in Proceedings of the 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation, 2012, pp. 601-609.

[15]

M. Barin, "Event-sequence testing using answer-set programming," International Journal on Advances in Software, vol. 5 (3-4), pp. 237-251, 2012.

[16]

M. H. Zabil, "Sequence and sequence-less t-way test case generation strategy baed on bees algorithm," PhD Thesis, School of Electrical and Electronics, Universiti Sains Malaysia, 2015.

[17]

M. Rahman, R. R. Othman, R. B. Ahmad, and M. M. Rahman, "A meta heuristic search based t-way event driven input sequence test case generator," International Journal of Simulation - Systems, Science & Technology, vol. 15, no. 3, pp. 65-71, 2014.

[18]

M. H. Sulaiman, Z. Mustaffa, M. M. Saari, and H. Daniyal, "Barnacles mating optimizer: A new bio-inspired algorithm for solving engineering optimization problems," Engineering Applications of Artificial Intelligence, vol. 87, pp. 1-13, 2020.

Digital Library

[19]

B. H. Abed-alguni and F. Alkhateeb, "Intelligent hybrid cuckoo search and β-hill climbing algorithm," Journal of King Saud University-Computer and Information Sciences, vol. 32, no. 2, pp. 159-173, 2018.

Digital Library

[20]

D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 67-82, 1997.

Digital Library

Cited By

Kuhn DRaunak MKacker R(2023)Ordered t-way Combinations for Testing State-based Systems2023 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)10.1109/ICSTW58534.2023.00050(246-254)Online publication date: Apr-2023
https://doi.org/10.1109/ICSTW58534.2023.00050

Recommendations

T-way Test Suite Generation Based on Hybrid Flower Pollination Algorithm and Hill Climbing
ICSCA '21: Proceedings of the 2021 10th International Conference on Software and Computer Applications

One of the common application of search-based software testing (SBST) is generating test cases for all objectives characterized by a scope model (e.g. articulations, mutants, branches). The application of meta-heuristic algorithms in t-way tests ...
Efficient Algorithms for T-way Test Sequence Generation
ICECCS '12: Proceedings of the 2012 IEEE 17th International Conference on Engineering of Complex Computer Systems

Combinatorial testing has been shown to be a very effective testing strategy. Most work on combinatorial testing focuses on t-way test data generation, where each test is an unordered set of parameter values. In this paper, we study the problem of t-way ...
The Effectiveness of T-Way Test Data Generation
SAFECOMP '08: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security

This paper reports the results of a study comparing the effectiveness of automatically generated tests constructed using random and <em>t</em>-way combinatorial techniques on safety related industrial code using mutation adequacy criteria. A reference ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICSCA '21: Proceedings of the 2021 10th International Conference on Software and Computer Applications

February 2021

325 pages

ISBN:9781450388825

DOI:10.1145/3457784

Copyright © 2021 ACM.

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 ACM 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 [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 July 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ICSCA 2021

ICSCA 2021: 2021 10th International Conference on Software and Computer Applications

February 23 - 26, 2021

Kuala Lumpur, Malaysia

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
23
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)1

Reflects downloads up to 17 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kuhn DRaunak MKacker R(2023)Ordered t-way Combinations for Testing State-based Systems2023 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)10.1109/ICSTW58534.2023.00050(246-254)Online publication date: Apr-2023
https://doi.org/10.1109/ICSTW58534.2023.00050

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Media

Figures

Other

Tables

View Table of Contents