Skip to content

StevenChiu2018/ACGA

Repository files navigation

Finding Array Coverings using Evolutionary Algorithms

Abstract

In software development, the testing step is essential during the developing circle since it verifies that the application satisfies the requirement. To test an application, every configuration set should be tested one by one to make sure the software can work fine in any circumstances. However, as the software grows bigger and bigger, it is time-consuming to test every configuration one by one. Therefore, testing efficiency and testing coverage are two essential issues of testing. In this report, I will use an evolutionary algorithm to find the smallest configuration table that could cover all configuration sets but fewer test cases.

Note

This is a school assignment. Please reference Assignment_Instruction.pdf for more detailed of the purpose of this project. Futhurmore, The Report.pdf describes the result of this implementation.