Genetic algorithm application for enhancing state-sensitivity partitioning
Software testing is the most crucial phase in software development life cycle which intends tofind faults as much as possible. Test case generation leads the research in software testing. So, many techniques were proposed for the sake of automating the test case generation process. State sensitivit...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Book Section |
| Language: | English |
| Published: |
Springer International Publishing
2015
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/47161/ http://psasir.upm.edu.my/id/eprint/47161/2/abstract01.pdf |
| Summary: | Software testing is the most crucial phase in software development life cycle which intends tofind faults as much as possible. Test case generation leads the research in software testing. So, many techniques were proposed for
the sake of automating the test case generation process. State sensitivity partitioning is a technique that partitions the entire states of a module. The generated
test cases are composed of sequences of events. However, there is an infinite set of sequences with no upper bound on the length of a sequence. Thus, a lengthy test sequence might be encountered with redundant data states, which will
increase the size of test suite and, consequently, the process of testing will be ineffective. Therefore, there is a need to optimize those test cases generated by SSP. GA has been identified as the most common potential technique amongseveral optimization techniques. Thus, GA is investigated to integrate it with the existing SSP. This paper addresses the issue on deriving the fitness function for optimizing the sequence of events produced by SSP. |
|---|