In the diploma thesis we present the development of java tool that determines the test paths from the control-flow graphs of the program code in order to use them for writing tests.
We define a model for the program code, in our case a control-flow graph, and on this basis we select test requirements.
Test requirements are determined using the selected graph coverage criteria.
The basic graph coverage criterias are node coverage -- NC, edge coverage -- EC, edge pair coverage -- EPC and primitive path coverage -- PPC.
At the beginning, the graph is inserted into our tool by connecting already drawn nodes.
If we already have the test paths and want to check them, our tool checks them to see if they cover the selected coverage criteria.
Otherwise, the tool can also provide correct test path for the coverage criteria.
The correct test paths are printed and saved into a file.
The tool is intuitive and easy to use.
It has been successfully tested on several sorting algorithms.
The analysis showed that the tool saves a lot of time compared to manual determination of test paths.
|
