Method for discovering key test function of large object-oriented software system

Abstract

The present invention discloses a method for discovering a key test function of a large object-oriented software system. By using the method, the key test function of the large object-oriented software system can be rapidly and reasonably discovered with relatively high accuracy. The method comprises: firstly, taking a class as a node and a function call between classes as an arc for drawing a class collaborative network diagram, and defining the importance degree of one arc as the quantity of arcs that are taken as initial arcs and can be traversed; then calculating the importance degree of each arc in the class collaborative network diagram, wherein the arc that takes a class node with a larger total amount of reachable arcs as an arc head is a key arc; and finally, positioning arc head and arc tail information of the key arc to two corresponding classes in the software system, wherein a function call relationship that forms a coupling relationship between the two classes is the key test function. The method overcomes two defects in an existing method, and the computing complexity is not increased along with the increase of the complexity of the software system, so that the key test function of the software system can be rapidly and effectively discovered.

Description

technical field [0001] The invention relates to the technical field of software testing, in particular to a method for discovering key testing functions of large-scale object-oriented software systems. Background technique [0002] From the perspective of graph theory, a complex network is a graph with complex topological properties, and its typical characteristics are scale-free distribution with index characteristics and small-world effect. In a complex network system, there are a small number of key nodes that play a key role in controlling the entire system. The damage to these nodes often leads to the impact of large-scale nodes or even the paralysis of the entire system; while most of the nodes in the system are controlled by key nodes. Nodes that themselves have little influence on other parts of the system, and attacks on these nodes will not cause obvious failures in the system. Therefore, compared with random networks and regular networks, systems with complex net...

AI Technical Summary

Problems solved by technology

[0011] Therefore, there is a need for a fast and practical discovery method, especially when the scale of the software network is huge, if the time complexity of the method increases significantly with the number of software nodes, it will be of little practical value; the key test functions discovered by this method should be able to The accuracy truly reflects the functions that need to be maintained in the software system

Moreover, this method should weaken or rectify the deficiencies of the existing methods (using the flow betweenness of the arc as a standard to measure the key functions in the software): 1. Function abnormal information is likely to propagate along multiple paths rather than just the shortest path ;2. The propagation path of the exception is inaccurate (the exception passed into the class node by the arc entrance will not be passed out along some exits of the class)

Images