On the basis of this approach, the authors propose an algorithm for solving the problem of testing software and hardware data security tools using a number of well-known algorithms on graphs. The graph vertices correspond to the states of the software or hardware component, and the directed edges correspond to the transitions of the data security tool from one state to another when performing non-target functions or security functions. In accordance with this approach, the software and hardware data security tool is represented as a directed graph without loops or multiple edges. It describes the approach proposed earlier by the authors, which ensures both completeness and optimality of testing using the graph theory. The paper describes some testing approaches based on the development of mathematical models using the automata theory and ensuring completeness of testing, but leaving the question of its optimality open. It demonstrates the necessity of ensuring completeness and optimality of testing. The paper considers the disadvantages of existing approaches to testing software and hardware data security tools in order to confirm compliance of the implemented functionality with the declared characteristics.
0 Comments
Leave a Reply. |