JP6135466B2 - Test case extraction program, method and apparatus - Google Patents

Description

  The present invention relates to a regression test.

  A regression test is a test that identifies the effect of a change when the program is changed. When one program is changed, the change may affect other programs. For example, when there is another program that performs processing using the output result of the changed program, the program may be affected by the change.

  The following techniques are known for regression testing. Specifically, by analyzing the program, data items that are affected by the program change are specified from among the data items in the program, and other programs that refer to the data item are extracted.

  Further, a technique is known in which an execution trace is registered when a test case of a program is executed, and an affected test case is extracted based on the registered execution trace.

  However, when the above technique is used, a program or test case that does not affect the operation may be extracted. In such a case, a wasteful man-hour is required in which a test is executed again for a program or test case that normally does not need to be tested.

JP 2007-133800 A

Gary A. Kildall, "A Unified Approach to Global Program Optimization", ACM Symposium on Principles of Programming Languages, 1973, pages 194-206.

  Therefore, the objective of this invention is providing the technique for specifying the test case of the other program affected by the change of a program in one side.

  The test data extraction method according to the present invention performs symbolic execution for each of the first program and the second program, and is a path condition that is a condition for specifying a path in the program and items output by symbolic execution. Test data including the range of the current value is generated, symbolic execution is performed on the first program after the change, the range of items output by the symbolic execution is specified, and output is performed by symbolic execution on the first program before the change An expression representing a portion in which the range has changed using the first range that is the range of the item to be changed and the second range that is the range of the item that is output by symbolic execution of the first program after the change The path condition included in the test data for the second program is a term whose range has changed. And whether the second condition that a solution exists in the logical product of the path condition included in the test data for the second program and the expression representing the part whose range has changed is satisfied. It includes a process for determining.

  In one aspect, it becomes possible to identify test cases for other programs that are affected by program changes.

FIG. 1 is a diagram for explaining the outline of the present embodiment. FIG. 2 is a diagram for explaining the outline of the present embodiment. FIG. 3 is a diagram for explaining the outline of the present embodiment. FIG. 4 is a diagram for explaining the outline of the present embodiment. FIG. 5 is a diagram for explaining the outline of the present embodiment. FIG. 6 is a functional block diagram of the information processing apparatus. FIG. 7 is a diagram showing items symbolized in symbolic execution. FIG. 8 is a diagram for explaining processing by a program stored in the program storage unit. FIG. 9 is a diagram illustrating a processing flow of processing executed in advance. FIG. 10 is a diagram illustrating an example of a test case stored in the test case storage unit. FIG. 11 is a diagram illustrating an example of a test case stored in the test case storage unit. FIG. 12 is a diagram illustrating an example of a test case stored in the test case storage unit. FIG. 13 is a diagram illustrating a processing flow of processing for obtaining the union of the range of values of each output item. FIG. 14 is a diagram illustrating an example of data stored in the calculation data storage unit. FIG. 15 is a diagram illustrating a processing flow of processing for obtaining the union of the range of values of each output item. FIG. 16 is a diagram illustrating an example of data stored in the calculation data storage unit. FIG. 17 is a diagram illustrating an example of data stored in the range data storage unit. FIG. 18 is a diagram illustrating an example of data stored in the calculation data storage unit. FIG. 19 is a diagram illustrating an example of data stored in the range data storage unit. FIG. 20 is a diagram illustrating an example of data stored in the calculation data storage unit. FIG. 21 is a diagram illustrating an example of data stored in the range data storage unit. FIG. 22 is a diagram showing the program after the change. FIG. 23 is a diagram illustrating an example of a test case stored in the test case storage unit. FIG. 24 is a diagram illustrating an example of data stored in the range data storage unit. FIG. 25 is a diagram illustrating a processing flow of processing executed by the difference calculation unit. FIG. 26 is a diagram for explaining processing executed by the difference calculation unit. FIG. 27 is a diagram for explaining processing executed by the difference calculation unit. FIG. 28 is a diagram illustrating a processing flow of processing executed by the influence test case specifying unit. FIG. 29 is a diagram illustrating an example of data stored in the influence test case storage unit. FIG. 30 is a functional block diagram of a computer.

  The outline of the present embodiment will be described with reference to FIGS. In the present embodiment, when a certain program is changed, the following processing is executed in order to identify the test case that is affected among the test cases of other programs.

  First, the process shown in FIG. 1 is performed as a prior process. Specifically, symbolic execution is performed for each of a plurality of related programs. In FIG. 1, symbolic execution is performed for program 1, program 2, and program 3. Then, a test case is generated for each program. The test case includes a path condition, which is a condition for specifying a path in the program, and a value range of items (hereinafter referred to as output items) output as a result of executing the program. In the example of FIG. 1, two test cases are generated for each program. However, there are cases where the output items included in the test case are empty (that is, there are no output items), such as a test case where the pass condition in the program 3 is “x! = 100”. Then, for each test case of each program, the union of the output item value ranges is obtained. For example, for program 1, the union “a = 1 or 0” of “a = 1” and “a = 0” is obtained for output item a, and “b = 0” and “b = 0” for output item b. The union “b = 0” is obtained.

  Symbolic execution is described in detail in, for example, Tetsuo Tamai, Koichi Fukunaga, “Symbol Execution System”, Information Processing, pp18-28, 1982/01/15, etc., so please refer to them.

  Here, it is assumed that the program 1 is changed. Then, as illustrated in FIG. 2, the process described with reference to FIG. 1 is executed again for the program 1. Then, the union of the range is obtained for the output item a and the output item b of the program 1. In this example, “a = −1 or 0” for a, and “b = 0” for b.

  Then, as shown in FIG. 3, for program 1, the union of the output item value ranges before the change is compared with the union of the output item value ranges after the change. In this example, for each of the output item a and the output item b, the union of the value ranges is compared to obtain a region where there has been a change. For output item b, there is no change in the union of the range before and after the change, but for output item a, there is a change in the union of the range before and after the change. Specifically, “a = 1” was included in the union of the range before the change, but not included after the change, and “a = −1” was included in the union of the range after the change. Included but not included before change. Therefore, the changing part of the value range before and after the change can be expressed as “a = 1 ora = −1”.

  As the program 1 is changed, the related program 2 and program 3 may be affected. Therefore, for the program 2 and the program 3, an affected test case is specified. First, as shown in FIG. 4, path conditions are extracted for programs 2 and 3. In the example of FIG. 4, “a> 1” and “a <= 1” are extracted for the program 2, and “x = 100” and “x! = 100” are extracted for the program 3.

  Then, as shown in FIG. 5, it is determined whether the path condition extracted for the program 2 and the program 3 includes an output item (output item a) whose value range has changed. In this example, “a> 1” and “a <= 1” include the output item a, and “x = 100” and “x! = 100” do not include the output item a. Therefore, a further determination is made for “a> 1” and “a <= 1”. Specifically, the path condition and the expression representing the change in the range of the output item a are combined with and (that is, logical product) to determine whether there is a solution. “A <= 1 and (a = 1 ora = −1)” has a solution of a = 1, and “a> 1 and (a = 1 ora = −1)” has no solution. Therefore, a further determination is made for “a <= 1”. Specifically, it is determined whether the test item (test case 50 in FIG. 5) for the path condition “a <= 1” includes an output item (that is, whether there is any output). In this example, there are output items c and d. Therefore, the test case 50 is a test case that is affected by the change made to the program 1 (hereinafter referred to as an influence test case).

  There may be a plurality of paths in the program, and the effect of the change does not necessarily reach the test cases of all paths. Therefore, as shown in FIGS. 1 to 5, it is possible to specify a test case that is affected by a change made to another program among the test cases of the program. As a result, it is possible to reduce the number of test cases to be re-executed, thereby reducing the number of man-hours when changing the program.

  Below, the detailed content of this Embodiment is demonstrated.

  FIG. 6 shows a functional block diagram of the information processing apparatus 1 in the present embodiment. The information processing apparatus 1 includes a program storage unit 101, a post-change program storage unit 102, a symbolic execution unit 103, an input item storage unit 104, a numbering table storage unit 105, a member table storage unit 106, a test case Storage unit 107, range specification unit 108, calculation data storage unit 109, range data storage unit 110, difference calculation unit 111, difference data storage unit 112, impact test case specification unit 113, and impact test case storage Part 114.

  The program storage unit 101 stores a plurality of related programs to be processed in the present embodiment. The changed program storage unit 102 stores a changed program among the programs stored in the program storage unit 101.

  The symbolic execution unit 103 stores the data stored in the input item storage unit 104, the data stored in the numbering table storage unit 105, and the member table storage unit 106 for the program stored in the program storage unit 101. Perform symbolic execution using the stored data. The symbolic execution unit 103 stores the result of the symbolic execution (in this embodiment, a test case) in the test case storage unit 107. Similarly, the symbolic execution unit 103 stores the changed program stored in the post-change program storage unit 102, the data stored in the input item storage unit 104, and the numbering table storage unit 105. Symbolic execution is performed using the data and data stored in the member table storage unit 106. Then, the symbolic execution unit 103 stores the result of symbolic execution in the test case storage unit 107.

  The range specification unit 108 performs processing using the data stored in the test case storage unit 107 and the data stored in the calculation data storage unit 109, and stores the processing result in the range data storage unit 110. The difference calculation unit 111 performs processing using the data stored in the range data storage unit 110 and stores the processing result in the difference data storage unit 112. The influence test case specifying unit 113 performs processing using the data stored in the difference data storage unit 112 and stores the processing result in the influence test case storage unit 114.

  FIG. 7 shows items symbolized in the symbolic execution. The input item storage unit 104 stores user names (names) and ranks (ranks), which are input items input by the user. These input items are symbolized in symbolic execution. The numbering table stored in the numbering table storage unit 105 stores an item (currentId) called the current number, and this item is also symbolized. In the member table stored in the member table storage unit 106, there are no items to be symbolized.

  The processing by the program stored in the program storage unit 101 will be described with reference to FIG. In the present embodiment, the program “createMember”, the program “calculateDiscount”, and the program “sendMail” shown in FIG. The program “createMember” is a program for adding member information to the member table when “rank” is 1 or 2. The program “calculateDiscount” is a program that refers to the member information stored in the member table and performs calculation based on the discount rate associated with “rank”. The program “sendMail” refers to the member information stored in the member table. If “rank” is 2 or more, the program “sendMail” is a program that transmits mail. As described above, the program “calculateDiscount” and the program “sendMail” perform processing using the output items of the program “createMember”.

  Next, the operation of the information processing apparatus 1 will be described with reference to FIGS.

  First, processing executed in advance will be described with reference to FIGS. At the stage of executing this process, the changed program storage unit 102 does not store the changed program.

  The symbolic execution unit 103 identifies one unprocessed program from among the programs stored in the program storage unit 101 (FIG. 9: Step S1). The symbolic execution unit 103 performs symbolic execution on the identified program (step S3), and stores the result of symbolic execution (in this embodiment, a test case) in the test case storage unit 107.

  The symbolic execution unit 103 determines whether there is an unprocessed program in the program storage unit 101 (step S5). If there is an unprocessed program (step S5: Yes route), the process returns to step S1 to process the unprocessed program. On the other hand, when there is no unprocessed program (step S5: No route), the process is terminated.

  By executing the processing as described above, a test case can be prepared for each program.

  10 to 12 show examples of test cases stored in the test case storage unit 107. FIG. 10 is a test case for the program “createMember”, FIG. 11 is a test case for the program “calculateDiscount”, and FIG. 12 is a test case for the program “sendMail”. Each test case includes a test case number, a program name, a path condition, and an output item value range. In some cases, the range of output items is not included, such as the test case with the number 3 and the test case with the number 22. In addition, like a test case with the number 20, another program or function call may be handled as an output item.

  Next, processing for obtaining the union of the range of each output item will be described with reference to FIGS. This process is performed for each program.

  First, the range specification unit 108 specifies one unprocessed test case from the test case storage unit 107 (FIG. 13: S11). Then, the range specification unit 108 extracts data (in this case, the program name, output item, output item range, and path condition) from the specified test case, and stores it in the operation data storage unit 109 (step S13). .

  FIG. 14 shows an example of data stored in the calculation data storage unit 109. In the example of FIG. 14, a program name, an output item, a value range of the output item, and a path condition are stored. At the time of the process of step S13, nothing is stored in the “value range after substitution of path condition” column.

  Returning to the description of FIG. 13, the range specifying unit 108 determines whether there is an unprocessed test case in the test case storage unit 107 (step S15). If there is an unprocessed test case (step S15: Yes route), the process returns to step S11 to process the unprocessed test case. On the other hand, when there is no unprocessed test case (step S15: No route), the value range specifying unit 108 specifies one unprocessed row from the operation data storage unit 109 (step S17).

  The value range specifying unit 108 assigns the path condition to the value range of the output item for the specified row, and stores the result in the “value range after the pass condition assignment” column in the same row (step S19).

  The range specification unit 108 determines whether there is an unprocessed row (step S21). If there is an unprocessed line (step S21: Yes route), the process returns to step S17 to process the unprocessed line. On the other hand, when there is no unprocessed row (step S21: No route), the processing shifts to the processing of step S23 in FIG.

  FIG. 16 shows an example of data stored in the calculation data storage unit 109 when there is no unprocessed row. In the example of FIG. 16, compared with FIG. 14, data is stored in the “value range after substitution of path condition” column. Data stored in the “Range after Substitution of Path Condition” column in the first, second, third, fourth, seventh, and eighth lines is stored in the “Range of Output Item” column even though the path condition is substituted. There is no difference with the data to be processed. This is because “Sym_rank” is not included in the value range of the output item. On the other hand, since the value range of the output item in the 5th and 6th lines includes “Sym_rank”, the “value range of the output item” is different from the “value range of the output item after the pass condition substitution”. Yes.

  Next, processing after terminal A in FIG. 15 will be described. The value range specifying unit 108 specifies one unprocessed row from the calculation data storage unit 109 (FIG. 15: step S23).

  The range specifying unit 108 searches the range data storage unit 110 for a row including the output item of the specified row (step S25). The range specifying unit 108 determines whether a row is detected (step S27). When a line is not detected (step S27: No route), the range specifying unit 108 uses the range data storage unit 110 to store the data (here, the program name, the output item, and the output item range) specified in step S23. (Step S29).

  FIG. 17 shows an example of data stored in the range data storage unit 110. In the example of FIG. 17, a program name, an output item, and a union of value ranges are stored. In the case of passing through the No route in step S27, the data stored in the union of the range is the range of the output item.

  On the other hand, when a row is detected (step S27: Yes route), the range specifying unit 108 includes the range after the substitution of the path condition in the row specified in step S23, the union of the rows detected in step S27. (Step S31). When the range after the substitution of the path condition in the specified line is included (step S33: Yes route), it is not necessary to add a new range, so the process proceeds to step S37. When the range after the pass condition substitution in the specified row is not included (step S33: No route), the range specification unit 108 determines the union of the detected rows and the range after the path condition substitution in the specified row. Are connected by a logical sum (OR) (step S35). Then, the process proceeds to step S37.

  The value range specifying unit 108 determines whether there is an unprocessed row in the calculation data storage unit 109 (step S37). If there is an unprocessed line (step S37: Yes route), the process returns to step S23 to process the unprocessed line. On the other hand, when there is no unprocessed line (step S37: No route), the process ends.

  By performing the processing as described above, the value range for each test case can be organized for each output item. Then, when the program is changed, processing can be performed using the organized data.

  Similarly, for the test case of the program “createDiscount”, it is assumed that the data shown in FIG. Then, the data shown in FIG. 19 is stored in the range data storage unit 110.

  Further, for the test case of the program “sendMail”, it is assumed that the data shown in FIG. 20 is stored in the operation data storage unit 109 by the processing described above. Then, the data shown in FIG. 21 is stored in the range data storage unit 110.

  Here, it is assumed that a code is added to the second line of the program “createMember” shown in FIG. 8 and changed as shown in FIG. In FIG. 22, the part newly added by the change is underlined. Due to this change, not only when “rank” is not 1 or 2, but also when “rank” is not 0, it is treated as an exception.

  When the program illustrated in FIG. 22 is stored in the changed program storage unit 102, the symbolic execution unit 103 performs symbolic execution again on the changed program “createMember”. Then, a test case as shown in FIG. 23 is generated and stored in the test case storage unit 107. The test case with the number 3 shown in FIG. 23 is a test case that did not exist in FIG. The test case with the number 4 shown in FIG. 23 corresponds to the test case with the number 3 shown in FIG. 10, but “&& Sym_rank! = 0” is newly added to the path condition. 23, when the range specifying unit 108 performs processing, the union of the range is obtained as shown in FIG. 24 and stored in the range data storage unit 110.

  Next, processing for identifying an influence test case will be described with reference to FIGS. First, processing executed by the difference calculation unit 111 will be described with reference to FIGS. 25 to 27.

  First, the difference calculation unit 111 compares the union of the range stored before and after the program change stored in the range data storage unit 110, and identifies an output item in which the union of the range has changed (FIG. 25: Step S41). ). For example, when the union shown in FIG. 17 is compared with the union shown in FIG. 24, the output item “member table.rank” is specified. And the difference calculating part 111 selects one unprocessed output item from the output items specified in step S41 (step S43).

  The difference calculation unit 111 calculates the logical product of the union before change and the negation of the union after change for the output item selected in step S43 (step S45). The process of step S45 will be described with reference to FIG. In FIG. 26, the union 261 of the range of each output item before the change and the union 262 of the range of each output item after the change are shown. When the selected output item is “member table.rank”, “rank = 1 or rank = 2” is extracted as the union 263 before the change (in order to make the figure easier to see, the part of “member table.” Is extracted. “Not (rank = 1 or rank = 2 or rank = 0)” is extracted as the negation 264 of the union after the change. Then, “(rank = 1 or rank = 2) and not (rank = 1 or rank = 2 or rank = 0)”, which is the logical product of the two, is calculated.

  The difference calculation unit 111 calculates the logical product of the negation of the union before change and the union after change for the output item selected in step S43 (step S47). The processing in step S47 will also be described using FIG. In step S47, “not (rank = 1 or rank = 2)” is extracted as the negative 265 of the union before change, and “rank = 1 or rank = 2 or rank = 0” as the union 266 after change. Is extracted. Then, “not (rank = 1 or rank = 2) and (rank = 1 or rank = 2 or rank = 0)”, which is the logical product of the two, is calculated.

  The difference calculation unit 111 calculates an expression representing the changed part of the range of the output item by simplifying the logical sum of the two calculated logical products, and stores it in the difference data storage unit 112 (step S49). In FIG. 26, a logical sum 267 of two calculated logical products is shown. Then, by simplifying the logical sum 267, an expression 268 (member table.rank = 0) representing the change part of the value range of the output item is obtained. Furthermore, the process of step S45 thru | or S49 is demonstrated using FIG. In FIG. 27, an ellipse with hatching represents a range of values. According to the processing in steps S45 to S49, as shown in FIG. 27, a value range that exists only before the change and a value range that exists only after the change (a portion where the two ellipses do not overlap) are specified.

  The difference calculation unit 111 determines whether there is an unprocessed output item (step S51). If there is an unprocessed output item (step S51: Yes route), the process returns to step S43 to process the unprocessed output item. On the other hand, when there is no unprocessed output item (step S51: No route), the process ends.

  In this way, by calculating the expression representing the change part of the value range of the output item due to the program change, it can be used for the processing of the influence test case specifying unit 113.

  Then, the impact test case identification unit 113 executes the following process. The processing executed by the influence test case specifying unit 113 will be described with reference to FIGS.

  First, the influence test case identification unit 113 identifies one unprocessed expression among the expressions representing the changed part of the output item value range stored in the difference data storage unit 112 (FIG. 28: step S61). . Then, the influence test case specifying unit 113 replaces the output item included in the specified expression with a symbol item (step S63). When the expression representing the change part of the range of the output item is, for example, “member table.rank”, the expression “Sym_member.rank = 0” is generated by replacing the output item with a symbol item.

  The influence test case specifying unit 113 selects an unprocessed test case from the test cases stored in the test case storage unit 107 for other programs (here, the program “calculateDiscount” and the program “sendMail”). One is specified (step S65).

  The influence test case specifying unit 113 determines whether there is a symbol item (Sym_member.rank in the above example) that has been replaced in step S63 in the path condition of the specified test case (step S67). When there is no symbol item (step S69: No route), the program “createMember” is not affected by the change, and the process proceeds to step S81.

  When there is a symbol item (step S69: Yes route), the influence test case specifying unit 113 obtains a logical product of the expression specified in step S61 and the pass condition of the test case specified in step S65, and the solution is obtained. It is determined whether it exists (step S71). If no solution exists (step S73: No route), the program “createMember” is not affected by the change, and the process proceeds to step S81.

  When a solution exists (step S73: Yes route), the influence test case specifying unit 113 determines whether the output item of the test case specified in step S65 is empty (that is, there is no output item) (step S75). ). If it is empty (step 77: Yes route), the process proceeds to step S81.

  If not empty (step S77: No route), the impact test case specifying unit 113 stores the test case specified in step S65 in the impact test case storage unit 114 (step S79).

  The influence test case specifying unit 113 determines whether there is an unprocessed test case (step S81). If there is an unprocessed test case (step S81: Yes route), the process returns to step S65 to process the unprocessed test case.

  On the other hand, when there is no unprocessed test case (step S81: No route), the influence test case specifying unit 113 determines whether there is an unprocessed expression (step S83). If there is an unprocessed expression (step S83: Yes route), the process returns to step S61 to process the unprocessed expression. If there is no unprocessed expression (step S83: No route), the process ends. .

  For example, the test case affected by the change of the program “createMember” is specified from the test case for the program “calculateDiscount” shown in FIG. 11 and the test case for the program “sendMail” shown in FIG. Think.

  The path condition of the test case with the number 10 includes “Sym_member.rank”, and there is a logical product solution between the “Sym_member.rank = 0” and the path condition of the test case with the number 10; The output item is not empty. Therefore, the test case with the number 10 is determined to be an affected test case.

  Since there is no “Sym_member.rank” in the path condition of the test case with the number 11, the test case with the number 11 is determined not to be an affected test case.

  The path condition of the test case with the number 12 includes “Sym_member.rank”, and there is a logical product solution between the “Sym_member.rank = 0” and the path condition of the test case with the number 12; The output item is not empty. Therefore, the test case with the number 12 is determined to be an affected test case.

  There is “Sym_member.rank” in the path condition of the test case whose number is 20, but there is no logical product solution between “Sym_member.rank = 0” and the path condition of the test case whose number is 20. Therefore, it is determined that the test case having the number 20 is not an affected test case.

  Since there is no “Sym_member.rank” in the pass condition of the test case with the number 21, the test case with the number 21 is determined not to be an affected test case.

  The path condition of the test case with the number 22 includes “Sym_member.rank”, and there is a logical product solution between “Sym_member.rank = 0” and the path condition of the test case with the number 22. The output item is empty. Therefore, it is determined that the test case with the number 22 is not an affected test case.

  Then, finally, data as shown in FIG. 29 is stored in the influence test case storage unit 114. In the case of the example shown in the present embodiment, two test cases are affected.

  As described above, in the present embodiment, since the change in the value range of the output item is extracted, it is possible to specify the test case affected by the change among the test cases of other programs. As a result, it is possible to reduce the number of test cases to be re-executed, thereby reducing the number of man-hours when changing the program.

  Although one embodiment of the present invention has been described above, the present invention is not limited to this. For example, the functional block configuration of the information processing apparatus 1 described above may not match the actual program module configuration.

  Further, the configuration of each table described above is an example, and the configuration as described above is not necessarily required. Further, in the processing flow, the processing order can be changed if the processing result does not change. Further, it may be executed in parallel.

  The information processing apparatus 1 described above is a computer apparatus, and as shown in FIG. 30, a memory 2501, a CPU (Central Processing Unit) 2503, a hard disk drive (HDD: Hard Disk Drive) 2505, and a display device. A display control unit 2507 connected to 2509, a drive device 2513 for the removable disk 2511, an input device 2515, and a communication control unit 2517 for connecting to a network are connected by a bus 2519. An operating system (OS) and an application program for executing the processing in this embodiment are stored in the HDD 2505, and are read from the HDD 2505 to the memory 2501 when executed by the CPU 2503. The CPU 2503 controls the display control unit 2507, the communication control unit 2517, and the drive device 2513 according to the processing content of the application program, and performs a predetermined operation. Further, data in the middle of processing is mainly stored in the memory 2501, but may be stored in the HDD 2505. In the embodiment of the present invention, an application program for performing the above-described processing is stored in a computer-readable removable disk 2511 and distributed, and installed in the HDD 2505 from the drive device 2513. In some cases, the HDD 2505 may be installed via a network such as the Internet and the communication control unit 2517. Such a computer apparatus realizes various functions as described above by organically cooperating hardware such as the CPU 2503 and the memory 2501 described above and programs such as the OS and application programs. .

  The embodiment of the present invention described above is summarized as follows.

  In the test data extraction method according to the present embodiment, (A) symbolic execution is performed for each of the first program and the second program, and path conditions and symbolic execution are conditions for specifying a path in the program. (B) Perform symbolic execution on the first program after change, specify the range of items output by the symbolic execution, and (C) before change A first value range that is an item value range that is output by symbolic execution of the first program and a second value range that is an item value range that is output by symbolic execution of the changed first program. Use to calculate the formula that represents the part where the range has changed, and (D) is included in the test data for the second program There is a solution in the logical product of the first condition that the pass condition includes an item whose range has changed and the path condition included in the test data for the second program and the expression that represents the part in which the range has changed. Including a process for determining whether the second condition is satisfied.

  There may be a plurality of paths in the program, and the effect of the change does not necessarily affect the test data of all paths. Therefore, as described above, it becomes possible to specify test data affected by changes made to other programs among the test data of the program. As a result, it is possible to reduce the number of test data to be tested again, thereby reducing the man-hour when changing the program.

  Further, in the determination processing described above, (d1) Even if it is determined whether the third condition that the item output by symbolic execution in the test data for the second program is not empty is further satisfied. Good. If there is no item to be output in the first place, there is no processing using the value of the item to be output, so it is not necessary to execute the test again.

  Further, in the processing for calculating the expression representing the portion in which the range is changed as described above, (c1) logical product of the first range and the negation of the second range, the negation of the first range and the second range A logical sum with a logical product with a range may be calculated. In this way, it is possible to calculate an expression representing a range that exists only before the change and a range that exists only after the change.

  Further, the value range of an item output by symbolic execution may be a union of one or a plurality of value ranges obtained for the item in symbolic execution. In this way, the range of items to be output can be appropriately specified.

  A program for causing a computer to perform the processing according to the above method can be created. The program can be a computer-readable storage medium such as a flexible disk, a CD-ROM, a magneto-optical disk, a semiconductor memory, or a hard disk. It is stored in a storage device. The intermediate processing result is temporarily stored in a storage device such as a main memory.

  The following supplementary notes are further disclosed with respect to the embodiments including the above examples.

(Appendix 1)
For each of the first program and the second program, symbolic execution is performed, and test data including a path condition that is a condition for specifying a path in the program and a range of items output by the symbolic execution is generated. ,
Perform symbolic execution on the first program after the change, identify the range of items output by the symbolic execution,
A first value range that is an item value range that is output by symbolic execution for the first program before the change, and a second value range that is an item value range that is output by symbolic execution for the first program after the change. Using the range of, calculate the formula that represents the part where the range has changed,
The first condition that the path condition included in the test data for the second program includes an item whose range has changed, and the path condition and the range included in the test data for the second program have changed. A test data extraction program for causing a computer to execute a process of determining whether a second condition that a solution exists in a logical product with an expression that represents a part obtained is satisfied.

(Appendix 2)
The process of determining
The test data extraction program according to supplementary note 1, including a process for determining whether or not a third condition that the item output by the symbolic execution in the test data for the second program is not empty is further satisfied.

(Appendix 3)
A process of calculating an expression representing a portion where the range has changed,
(1) or (2) including a process of calculating a logical sum of a logical product of the negative of the first range and the negative of the second range and a logical product of the negative of the first range and the second range The test data extraction program described.

(Appendix 4)
The test data extraction according to any one of appendices 1 to 3, wherein the value range of the item output by the symbolic execution is a union of one or a plurality of value ranges obtained for the item in the symbolic execution. program.

(Appendix 5)
For each of the first program and the second program, symbolic execution is performed, and test data including a path condition that is a condition for specifying a path in the program and a range of items output by the symbolic execution is generated. ,
Perform symbolic execution on the first program after the change, identify the range of items output by the symbolic execution,
A first value range that is an item value range that is output by symbolic execution for the first program before the change, and a second value range that is an item value range that is output by symbolic execution for the first program after the change. Using the range of, calculate the formula that represents the part where the range has changed,
The first condition that the path condition included in the test data for the second program includes an item whose range has changed, and the path condition and the range included in the test data for the second program have changed. A test data extraction method in which a computer executes a process of determining whether or not a second condition that a solution exists in the logical product with an expression representing a selected part is satisfied.

(Appendix 6)
For each of the first program and the second program, symbolic execution is performed, and test data including a path condition that is a condition for specifying a path in the program and a range of items output by the symbolic execution is generated. A symbolic execution unit that performs symbolic execution on the first program after the change and specifies a range of items output by the symbolic execution;
A first value range that is an item value range that is output by symbolic execution for the first program before the change, and a second value range that is an item value range that is output by symbolic execution for the first program after the change. A calculation unit that calculates an expression representing a portion where the range has changed using the range of
The first condition that the path condition included in the test data for the second program includes an item whose range has changed, and the path condition and the range included in the test data for the second program have changed. A determination unit that determines whether a second condition that a solution exists in a logical product with an expression that represents
A test data extraction device.

DESCRIPTION OF SYMBOLS 1 Information processing apparatus 101 Program storage part 102 Changed program storage part 103 Symbolic execution part 104 Input item storage part 105 Numbering table storage part 106 Member table storage part 107 Test case storage part 108 Range specification part 109 Calculation data storage part 110 Range Data storage unit 111 Difference calculation unit 112 Difference data storage unit 113 Influence test case identification unit 114 Influence test case storage unit

Claims (6)

For each of the first program and the second program, symbolic execution is performed, and test data including a path condition that is a condition for specifying a path in the program and a range of items output by the symbolic execution is generated. ,
Perform symbolic execution on the first program after the change, identify the range of items output by the symbolic execution,
A first value range that is an item value range that is output by symbolic execution for the first program before the change, and a second value range that is an item value range that is output by symbolic execution for the first program after the change. Using the range of, calculate the formula that represents the part where the range has changed,
The first condition that the path condition included in the test data for the second program includes an item whose range has changed, and the path condition and the range included in the test data for the second program have changed. A test data extraction program for causing a computer to execute a process of determining whether a second condition that a solution exists in a logical product with an expression that represents a part obtained is satisfied. The process of determining
The test data extraction program according to claim 1, further comprising: determining whether or not a third condition that the item output by the symbolic execution in the test data for the second program is not empty is further satisfied. A process of calculating an expression representing a portion where the range has changed,
The process of calculating the logical sum of the logical product of the negation of the first range and the second range and the logical product of the negation of the first range and the second range. 2. The test data extraction program according to 2. 4. The test data according to claim 1, wherein the value range of the item output by the symbolic execution is a union of one or a plurality of value ranges obtained for the item in the symbolic execution. 5. Extraction program. For each of the first program and the second program, symbolic execution is performed, and test data including a path condition that is a condition for specifying a path in the program and a range of items output by the symbolic execution is generated. ,
Perform symbolic execution on the first program after the change, identify the range of items output by the symbolic execution,
A first value range that is an item value range that is output by symbolic execution for the first program before the change, and a second value range that is an item value range that is output by symbolic execution for the first program after the change. Using the range of, calculate the formula that represents the part where the range has changed,
The first condition that the path condition included in the test data for the second program includes an item whose range has changed, and the path condition and the range included in the test data for the second program have changed. A test data extraction method in which a computer executes a process of determining whether or not a second condition that a solution exists in the logical product with an expression representing a selected part is satisfied. For each of the first program and the second program, symbolic execution is performed, and test data including a path condition that is a condition for specifying a path in the program and a range of items output by the symbolic execution is generated. A symbolic execution unit that performs symbolic execution on the first program after the change and specifies a range of items output by the symbolic execution;
A first value range that is an item value range that is output by symbolic execution for the first program before the change, and a second value range that is an item value range that is output by symbolic execution for the first program after the change. A calculation unit that calculates an expression representing a portion where the range has changed using the range of
The first condition that the path condition included in the test data for the second program includes an item whose range has changed, and the path condition and the range included in the test data for the second program have changed. A determination unit that determines whether a second condition that a solution exists in a logical product with an expression that represents
A test data extraction device.

Images