Abstract

Unified modelling language (UML) activity diagram (AD) is used to represent system behaviour abstractly and is used by testers to generate test cases and test data. During the design of test cases, AD with concurrent activities may lead to a large number of paths, and it may not always be possible to test all execution paths. Research on deriving test cases from AD having concurrent activities has focused on conventional search techniques such as breadth-first search and depth-first search which has been found to be inefficient in such cases. To overcome this drawback, the authors propose a method using pairwise testing and genetic algorithm to derive a reduced number of test cases in AD with concurrent activities. Experiments conducted on various real-life concurrent systems show that the proposed technique generates a reduced number of test cases compared with existing methods.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call