Judgment method and system for stubborn variant of parallel program

Abstract

The invention discloses a judgment method for stubborn variant of parallel program. The method is characterized by comprising the following steps: performing equivalence class division on an execution sequence of sending nodes of variation statements according to execution conditions of the variation statements; determining intractable factors influencing the variants; calculating intractable composite indexes of the variants according to factors influencing the intractable variants and in combination with the influence of the execution sequence of the sending nodes subjected to equivalence class division on the factors; and setting a threshold value, and comparing the threshold value with the intractable composite index to complete judgment of the intractable variant. The concepts of the parallel programs are combined with the variation test principle, the stubborn variants of the parallel programs are screened out according to the relation between the execution sequence of the sending nodes and the intractable factors influencing the variants, the stubborn variants are emphatically tested, and then the test efficiency is improved.

Description

technical field [0001] The disclosure belongs to the technical field of computer software testing, and in particular relates to a method and system for judging stubborn variants of parallel programs. Background technique [0002] The statements in this section merely provide background information related to the present disclosure and do not necessarily constitute prior art. [0003] Software testing is an important way to improve software quality; in order to test software, it is usually necessary to prepare a certain amount of test data, called test data sets; the adequacy of test data sets is a key prerequisite for improving the credibility of software testing; evaluating a certain The adequacy of the test data set is often achieved by implementing mutation testing on the software under test; the process of implementing mutation testing is as follows: First, the original program is modified slightly according to certain rules and a statement in line with the grammar, and ...

AI Technical Summary

Problems solved by technology

[0004] A parallel program refers to a program that contains two or more parallel execution processes; a distributed storage parallel program means that each process has its own independent memory. During program execution, the interaction between processes is mainly realized by message passing; Processes are executed in parallel and communicate with each other. Parallel programs can achieve high solution speed and accuracy, and have been widely used in scientific research and production and life, such as weather forecasting, email filtering, and virus analysis; specifically, in addition to general serial In addition to the characteristics of programs, parallelism, communication and uncertainty are the main characteristics of distributed storage parallel programs, which also bring challenges to the mutation testing of distributed storage parallel programs; in order to improve the efficiency of mutation testing, the stubborn mutation testing theory of such programs is studied The sum method is very meaningful. At present, there is no method for determining the stubborn variant of distributed storage parallel programs, which seriously affects the application of mutation testing in distributed storage parallel programs.

Images