UniTesK Test Suite Architecture
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case
Programming and Computing Software
The UniTesK Approach to Designing Test Suites
Programming and Computing Software
Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case
Programming and Computing Software
Choosing a test modeling language: a survey
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
| Hi-index | 0.00 |
A method, based on the existing UniTESK test, which finds a bug in a system under test, is proposed to construct the minimal test that finds the same bug. This test can be used to localize this bug in the source code of the system. Two strategies for constructing such a test are considered, a comparative analysis of their advantages and disadvantages is performed, and the optimal strategy is proposed. A mathematical justification of the proposed method is given. An algorithm implementing this method is described, and its correctness is proved. An implementation of the proposed method for the CTESK testing tool is described.