Event Driven Input Sequence T-Way Test Strategy Using Simulated Annealing

Rahman, Muntasir Raihan; Othman, Rozmie Razif; Ahmad, Robiah; Rahman, Md. Mijanur

doi:10.1109/isms.2014.119

Cited by 16 publications

(9 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These strategies can be either deterministic or non-deterministic , Cohen, et al, 1997;Lei, et al, 2008. Some of the combinatorial strategies adopted metaheuristics algorithms for searching the test space , Ahmed, et al 2012;Alsewari and Zamli, 2012;Hazli, et al, 2012;Rahman, et al, 2014;Yang, et al, 2014;Ahmed, et al, 2015;Prasad, et al, 2015;Zamli, et al, 2016;Rabbi, 2017;Zamli, et al, 2017;Nasser, et al, 2018. Due to the NP-Hard problem, Colburn makes a dedicated website to record minimal upper bound for CA ,Colbourn, 2019. Earlier works also reported that the number of tuples increased significantly when increased the number of parameters and/or the strength of coverage and/or the parameter-values.…”

Section: Research Trends In Combinatorial Testingmentioning

confidence: 99%

MVSCA: Multi-Valued Sequence Covering Array

Younis

2019

jcoeng

View full text Add to dashboard Cite

This paper discusses the limitation of both Sequence Covering Array (SCA) and Covering Array (CA) for testing reactive system when the order of parameter-values is sensitive. In doing so, this paper proposes a new model to take the sequence values into consideration. Accordingly, by superimposing the CA onto SCA yields another type of combinatorial test suite termed Multi-Valued Sequence Covering Array (MVSCA) in a more generalized form. This superimposing is a challenging process due to NP-Hardness for both SCA and CA. Motivated by such a challenge, this paper presents the MVSCA with a working illustrative example to show the similarities and differences among combinatorial testing methods. Consequently, the MVSCA is a new trend that can be a research vehicle for researchers to develop new and/or modify existing combinatorial strategies to deal with the combinatorial explosion problem raised by the MVSCA.

show abstract

Section: Research Trends In Combinatorial Testingmentioning

confidence: 99%

MVSCA: Multi-Valued Sequence Covering Array

Younis

2019

jcoeng

View full text Add to dashboard Cite

show abstract

“…The treatment of SCAs to test actual software systems is considered by Rahman et al who propose an approach to optimize the selection of sequence coverage and tests on a real application called Embedded Network Traffic Monitoring System [29]. This can at best be classed as a soft-real time system not demanding the level of rigor a vehicle control system may demand.…”

Section: B Sequence Testing For Real-time Systemsmentioning

confidence: 99%

The Effect of Time-Between-Events for Sequence Interaction Testing of a Real-Time System

Yang

Dhadyalla

Marco

et al. 2018

2018 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)

View full text Add to dashboard Cite

show abstract

“…This searching process is repeated till t-way sequence combinations are covered. Rahman et al (2015) proposed the event driven input sequence testing (EDIST-SA), by using the SA algorithm. However, EDIST-SA is designed to support only for t = 2 and t = 3.…”

Section: Sequence T-way Test Suite Generation Strategiesmentioning

confidence: 99%

An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite

Nasser

Zamli

Alsewari

et al. 2018

IJBIC

View full text Add to dashboard Cite

In line with the upcoming of a new field called search-based software engineering (SBSE), many newly developed t-way strategies adopting meta-heuristic algorithms can be seen in the literature for constructing interaction test suite (such as simulated annealing (SA), genetic algorithm (GA), ant colony optimisation algorithm (ACO), particle swarm optimisation (PSO), harmony search (HS) and cuckoo search (CS). Although useful, most of the aforementioned t-way strategies have assumed sequence-less interactions amongst input parameters. In the case of reactive system, such an assumption is invalid as some parameter operations (or events) occur in sequence and hence, creating a possibility of bugs triggered by the order (or sequence) of input parameters. If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. In line with such a need, this paper presents a unified strategy based on the new meta-heuristic algorithm, called the elitist flower pollination algorithm (eFPA), for sequence and sequence-less coverage. Experimental results demonstrate the proposed strategy gives sufficiently competitive results as compared with existing works.

show abstract

Event Driven Input Sequence T-Way Test Strategy Using Simulated Annealing

Cited by 16 publications

References 14 publications

MVSCA: Multi-Valued Sequence Covering Array

MVSCA: Multi-Valued Sequence Covering Array

The Effect of Time-Between-Events for Sequence Interaction Testing of a Real-Time System

An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite

Contact Info

Product

Resources

About