JP2014191652A - Test case generation method, test case generation device, and test case generation program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To reduce a load of test case generation work accompanied by the change in program.SOLUTION: A test case generation device 100 acquires a symbolic execution result 101-1 and a symbolic execution result 101-2. Next, based on the existence of a value obtained by using a logical product of a path condition formula 102-1 and a path condition formula 102-2 as true out of possible values taken by an input variable "x", the test case generation device 100 determines whether or not a path p2 is related to a path p1. Moreover, the test case generation device 100 compares a path output mathematical expression 103-1 with a path output mathematical expression 103-2. Then, based on a determination result and a comparison result, the test case generation device 100 determines whether or not the test case for testing the action of the path p2 should be generated.

Description

  The present invention relates to a test case generation method, a test case generation device, and a test case generation program.

  Conventionally, in program development, there is a technique for testing a program operation using a test case. The test case has an input value given to the program and an expected value of a value output as a result of giving the input value. Relevant prior art, for example, regression for testing by storing information about test cases that have been performed in the past and combining the information about the test cases with the dependencies obtained by analyzing the target program There is something that builds a system. In addition, symbolic execution is repeatedly performed while changing the variables to be symbolized so as to cover all variables defined in the analysis target program, and if the code coverage rate of the analysis target program satisfies a predetermined standard, the analysis target program There is a technique that the test has been completed. (For example, see Patent Documents 1 and 2 below.)

JP 2008-204405 A JP 2012-068869 A

  However, according to the prior art, when testing a post-change program in which a part of the pre-change program has been changed, the test case used when the pre-change program was tested can be used as is or a new test case can be used. It is difficult to determine whether it should be generated.

  In one aspect, an object of the present invention is to provide a test case generation method, a test case generation device, and a test case generation program that reduce the load of test case generation work associated with a program change.

  According to an aspect of the present invention, by executing the first program symbolically, the first pass included in the first program is executed out of the possible values of the input variable included in the first program. A first conditional expression representing a value of an input variable serving as a condition to be satisfied, and a first mathematical expression representing an output variable included in the first program output when the first pass is executed The second path included in the second program among the possible values of the input variable by acquiring the execution result of 1 and executing symbolically the second program in which a part of the first program is changed A second conditional expression that represents the value of an input variable that is a condition for executing, and a second mathematical expression that represents an output variable included in the second program that is output when the second pass is executed; To get the second execution result containing Of the possible values of the input variable, the second path is changed to the first path based on the presence or absence of a value that is true of the logical product of the acquired first conditional expression and the acquired second conditional expression. It is determined whether or not they are related, and it is determined whether or not the acquired first mathematical expression matches the acquired second mathematical expression. Based on the determination result and the determination result, the operation of the second path A test case generation method, a test case generation device, and a test case generation program for determining whether or not to generate a test case for testing is proposed.

  According to one aspect of the present invention, there is an effect that it is possible to reduce a load of test case generation work associated with a program change.

FIG. 1 is an explanatory diagram illustrating an operation example of the test case generation device according to the first embodiment. FIG. 2 is a block diagram illustrating an example of hardware of the test case generation device. FIG. 3 is an explanatory diagram illustrating an example of a test case execution procedure. FIG. 4 is an explanatory diagram illustrating an example of a relationship between a program and a test case before and after the change. FIG. 5 is an explanatory diagram showing an example of the pre-change program and the post-change program. FIG. 6 is an explanatory diagram of an example of a symbolic execution driver program. FIG. 7 is an explanatory diagram showing an example of the result of symbolic execution of the pre-change program. FIG. 8 is an explanatory diagram illustrating an example of a result of symbolic execution of the changed program. FIG. 9 is a block diagram illustrating an example of functions of the test case generation apparatus. FIG. 10 is an explanatory diagram illustrating an example of a result of associating paths before and after the change in the first embodiment. FIG. 11 is an explanatory diagram of a classification example of the path conditional expression change type. FIG. 12 is an explanatory diagram illustrating an example of the classification result of the path conditional expression change type in the first embodiment. FIG. 13 is an explanatory diagram of an example of a determination rule for the path output formula change type. FIG. 14 is an explanatory diagram showing an example when the determination rule 2 is applied. FIG. 15 is an explanatory diagram illustrating an example when the determination rule 3 is applied. FIG. 16 is an explanatory diagram illustrating an example when the determination rule 4 is applied. FIG. 17 is an explanatory diagram illustrating an example of the classification result of the path output formula change determination. FIG. 18 is an explanatory diagram of an example of the test case classification rule. FIG. 19 is an explanatory diagram illustrating an example of a test case classification result. FIG. 20 is an explanatory diagram illustrating an example of generating an input value of a test case of the changed program. FIG. 21 is a flowchart illustrating an example of a test case generation processing procedure. FIG. 22 is a flowchart illustrating an example of the pre-change path association processing procedure. FIG. 23 is a flowchart illustrating an example of a path conditional expression change type classification processing procedure. FIG. 24 is a flowchart illustrating an example of a path output formula change type classification processing procedure. FIG. 25 is a flowchart illustrating an example of a test case classification processing procedure. FIG. 26 is a flowchart illustrating an example of an input value generation processing procedure for a test case of the changed program. FIG. 27 is a block diagram illustrating a functional example of the test case generation device according to the second embodiment. FIG. 28 is an explanatory diagram illustrating an example of a result of associating paths before and after the change in the second embodiment. FIG. 29 is an explanatory diagram of an example of the classification result of the path conditional expression change type in the second embodiment. FIG. 30 is an explanatory diagram illustrating an example of a procedure for creating a path association before and after an ungenerated change. FIG. 31 is a flowchart (part 1) illustrating an example of a test case generation processing procedure according to the second embodiment. FIG. 32 is a flowchart (part 2) illustrating an example of a test case generation process procedure according to the second embodiment. FIG. 33 is a flowchart illustrating an example of a pre-change path association processing procedure based on a test input value. FIG. 34 is a flowchart illustrating an example of an undetected before / after change path association processing procedure.

  Exemplary embodiments of a disclosed test case generation method, test case generation apparatus, and test case generation program will be described below in detail with reference to the drawings.

(Description of Embodiment 1)
FIG. 1 is an explanatory diagram illustrating an operation example of the test case generation device according to the first embodiment. The test case generation device 100 is a computer that determines whether or not to generate a test case of a second program in which a part of the first program is changed. Here, the program test will be described. Hereinafter, the first program is referred to as a “pre-change program”. Further, the second program is referred to as a “post-change program”.

  After the pre-change program is released, after the pre-change program is started and the use of the pre-change program is started, the function of the pre-change program is changed or added, or a function failure or malfunction is dealt with. A part of the pre-change program is changed. When changing a part of the program before the change, if the program before the change is caused by the change of the program before the change, there is no functional failure outside the specification in the entire program after the change, and the specification It is confirmed whether the partial change is implemented as described above. The dysfunction is called degradation, regression.

  Therefore, after the partial change of the pre-change program is completed, the test is performed again on the post-change program for confirmation. Test cases are used for testing. The test case has a test input value given to the program to be tested and an expected value of a value output from the program when the test input value is given to the program. A test case is prepared for each function of the program.

  In addition, there are the following two specific confirmation contents of the test of the changed program. The first confirmation content is a content for confirming that an unchanged function among the functions of the changed program has not been changed against the intention of the program developer. The test for performing the first confirmation content is referred to as a “regression test”. The second confirmation content is a content for confirming that a change and an additional function among the functions of the changed program are changed and added as intended by the program developer.

  Here, the test cases for each function of the program are classified into test cases related to the first confirmation contents and test cases related to the second confirmation contents, and tests related to the added functions. Generating a case is troublesome. Therefore, these two operations are factors that increase the number of test steps in the program development project.

  As a technology for classifying test cases, the relationship between programs and test cases is built using dynamic analysis of execution traces during test case execution, and test cases corresponding to program changes using the built relationships. There is something to choose. By selecting only test cases corresponding to program changes and re-execution, it is possible to reduce the labor of regression testing.

  Further, as a technique for generating test input values for test cases related to added functions, there is a technique for generating test input values by analyzing a program, a design document, or a design model.

  However, the above-mentioned technology for classifying test cases has been added because the test case for the function added this time does not exist in the existing test cases when the program is partially changed to add a certain function. It is difficult to select test cases related to the function. In addition, the technology for generating test input values for test cases related to the added functions described above is to change the part of a certain version of the program and develop the next version. It is difficult to specify the target test case.

  Accordingly, the test case generation apparatus 100 determines whether or not to generate a test case by comparing output variables between paths that satisfy a conditional expression for executing a path before and after the change when the program is partially changed. To do. As a result, the test case generation device 100 reduces the load of test case generation work associated with a partial change in the program.

  Here, the pre-change program PrePrg and the post-change program PostPrg displayed in FIG. 1 will be described. The post-change program PostPrg is a program in which a part of the pre-change program PrePrg has been changed. The pre-change program PrePrg has two paths: a path p1 that passes through a process that is executed when the condition of the if statement is true, and a path that passes through an else if statement. Here, let p1 be the first pass. Further, the post-change program PostPrg has two paths: a path p2 that passes through a process that is executed when the condition of the if statement is true, and a path that passes through an else if statement. Here, let p2 be the second path. A path is a series of statements included in a program. Some functions may be realized by executing a series of statements.

  The test case generation apparatus 100 according to the present embodiment represents a conditional expression that represents the value of an input variable that is a condition for executing a certain path, and an output variable that is included in a program that is output when the path is executed. The execution result of the symbolic execution including the mathematical expression is acquired. The execution result of symbolic execution is hereinafter referred to as “symbolic execution result”. Note that the device that performs symbolic execution may be the test case generation device 100 or another device.

  A conditional expression representing the value of an input variable that is a condition for executing a pass is hereinafter referred to as a “pass conditional expression”. A mathematical expression representing an output variable included in a program output when a pass is executed is referred to as a “pass output mathematical expression”. An input variable is a variable included in a certain program, and is a variable in which a value given to a program path is stored. The output variable is a variable included in a certain program, and is a variable in which a value output from the program is stored. In the pre-change program PrePrg and the post-change program PostPrg in FIG. 1, the input variable is “x” and the output variable is “rtn”. In the present embodiment, it is assumed that the numbers of input variables and output variables are the same in the pre-change program PrePrg and the post-change program PostPrg.

  In symbolic execution, instead of inputting a specific definite value into a variable of program P, a symbol value called a symbol value is input, the program is simulated and executed as it is, and the execution result of the program is evaluated. Technology. The pre-change program PrePrg and the post-change program PostPrg shown in FIG. 1 are described in Java (registered trademark), but the pre-change program PrePrg and the post-change program PostPrg are described in other languages that can perform symbolic execution. It may be.

  In FIG. 1, the test case generation apparatus 100 determines whether or not a test case should be generated for a test case that tests the path p2. Specifically, the test case generation apparatus 100 can divert the test case for testing the path p1 as it is, and it is not necessary to generate the test case, or the test case generation apparatus 100 generates a test case for testing the path p2. Determine what should be done.

  In the example of FIG. 1, the test case generation device 100 includes a path condition expression 102-1 that is a condition for executing the path p1, and a path output expression 103-1 that is output when the path p1 is executed. The symbolic execution result 101-1 is acquired. Further, the test case generation apparatus 100 includes a symbolic execution result 101-including a path condition expression 102-2 that is a condition for executing the path p2 and a path output expression 103-2 that is output when the path p2 is executed. 2 is acquired.

  Next, the test case generation device 100 determines whether there is a value that makes the logical product of the path condition expression 102-1 and the path condition expression 102-2 true among the possible values of the input variable “x”. , It is determined whether the path p2 is related to the path p1. Here, specifying the presence or absence of a value that makes the logical product of one conditional expression and another conditional expression true is hereinafter referred to as “determination of satisfiability”. If there is a value that is true of the logical product of one conditional expression and another conditional expression, it is considered “satisfiable”, and if there is no value that is true of the logical product of one conditional expression and another conditional expression, Assume that it is “unsatisfiable”. The test case generation device 100 determines that the path p2 is related to the path p1 when the logical product can be satisfied, and determines that the path p2 is not related to the path p1 when the logical product cannot be satisfied.

  The graph 110 shows a range in which the path condition expression 102-1 and the path condition expression 102-2 are true for the input variable “x”. As shown in the graph 110, when a value of x <10 among possible values of the int-type input variable “x” is given, the logical product of the path condition expression of the path p1 and the path condition expression of the path p2 is Become true. Therefore, since there is a value for which the logical product of the path conditional expression 102-1 and the path conditional expression 102-2 is true, it can be satisfied, and the test case generating apparatus 100 determines that the path p2 is related to the path p1.

  Further, the test case generation device 100 compares the path output formula 103-1 with the path output formula 103-2. A specific comparison method will be described later with reference to FIGS. In the example of FIG. 1, it is assumed that the comparison results do not match.

  The test case generation device 100 determines whether or not to generate a test case for testing the operation of the path p2, based on the determination result and the comparison result. Specifically, when the determination result indicates that the path p2 is related to the path p1 and the comparison result matches, the test case generation apparatus 100 uses the test case for testing the operation of the path p1 as it is. Therefore, it is determined that it is not necessary to generate a test case. In addition, when the determination result indicates that the path p2 is related to the path p1 and the comparison result does not match, the test case generation apparatus 100 cannot use the test case for testing the operation of the path p1 as it is. It is determined that a test case should be generated.

  In the example of FIG. 1, the test case generation device 100 determines that a test case for testing the operation of the path p2 should be generated. Hereinafter, the test case generation apparatus 100 according to the first embodiment will be described with reference to FIGS.

(Test case generator hardware)
FIG. 2 is a block diagram illustrating an example of hardware of the test case generation device. 2, the test case generation apparatus 100 includes a CPU (Central Processing Unit) 201, a ROM (Read-Only Memory) 202, and a RAM (Random Access Memory) 203. The test case generation apparatus 100 includes a disk drive 204, a disk 205, and a communication interface 206. The test case generation apparatus 100 includes a display 207, a keyboard 208, and a mouse 209. Further, the CPU 201 to the mouse 209 are connected by a bus 210, respectively.

  The CPU 201 is an arithmetic processing device that controls the entire test case generation device 100. The ROM 202 is a non-volatile memory that stores a program such as a boot program. A RAM 203 is a volatile memory used as a work area for the CPU 201.

  The disk drive 204 is a control device that controls reading and writing of data with respect to the disk 205 in accordance with the control of the CPU 201. As the disk drive 204, for example, a magnetic disk drive, an optical disk drive, a solid state drive, or the like can be adopted. The disk 205 is a non-volatile memory that stores data written under the control of the disk drive 204. For example, when the disk drive 204 is a magnetic disk drive, a magnetic disk can be adopted as the disk 205. Further, when the disk drive 204 is an optical disk drive, an optical disk can be adopted as the disk 205. When the disk drive 204 is a solid state drive, a semiconductor element memory can be adopted for the disk 205.

  The communication interface 206 is a control device that controls an interface between the network 211 and the inside and controls input / output of data from an external device. Specifically, the communication interface 206 is connected to a LAN (Local Area Network), a WAN (Wide Area Network), the Internet, or the like, which becomes the network 211 through a communication line, and is connected to other devices via the network 211. For example, a modem or a LAN adapter may be employed as the communication interface 206.

  The display 207 is a device that displays data such as a document, an image, and function information as well as a mouse cursor, an icon, or a tool box. As the display 207, for example, a cathode ray tube (CRT), a thin film transistor (TFT) liquid crystal display, a plasma display, or the like can be employed.

  The keyboard 208 is a device that has keys for inputting characters, numbers, various instructions, and the like and inputs data. The keyboard 208 may be a touch panel type input pad or a numeric keypad. The mouse 209 is a device for moving a mouse cursor, selecting a range, moving a window, changing a size, and the like. The mouse 209 may be a trackball or a joystick as long as it has the same function as a pointing device. Next, an example of a test case execution procedure will be described with reference to FIG.

  FIG. 3 is an explanatory diagram illustrating an example of a test case execution procedure. Data input when the test case is executed are the test target program Prg, the test input value Inv, and the expected value Epv. The test input value Inv is a value that causes the test target program Prg to perform an operation to be confirmed as being in accordance with the specification among various operations of the test target program Prg. The test case is a matter to confirm whether the operation of the test target program is as expected. Also, a test case for testing various confirmation items and a collection of the test cases are referred to as a “test suite”. The expected value Epv is a desired operation result of the test target program Prg when the test target program Prg operates according to the specification, and is, for example, an output value of a variable of interest.

  The test target program Prg is executed by a device in which a program execution environment is constructed. The apparatus in which the program execution environment is constructed may be the test case generation apparatus 100 or another apparatus. In FIG. 3, it is assumed that the test case generation device 100 executes the test target program Prg for the sake of simplicity.

  The test case generation device 100 gives the test input value Inv to the test target program Prg, and obtains the program execution result Prs. Then, the test case generation apparatus 100 determines the test result by comparing the program execution result Prs and the expected value Epv, and outputs the test result Trs. Specifically, when the program execution result Prs matches the expected value Epv, the test result Trs is successful. Further, when the program execution result Prs and the expected value Epv do not match, the test result Trs fails. Next, the relationship between the program and the test case before and after the program change will be described with reference to FIG.

  FIG. 4 is an explanatory diagram illustrating an example of a relationship between a program and a test case before and after the change. The pre-change program PrePrg includes a function PreF1, a function PreF2, ..., a function PreFM. The post-change program PostPrg in which the pre-change program PrePrg has been changed includes a function PostF1, a function PostF2,..., A function PostFM, and a function PostFX. Among the functions of the post-change program PostPrg, the function PostF1 is not changed, the function PostF2 is changed,..., The function PostFM is not changed, and the function PostFX is an added function.

  Further, the test suite PreTs of the pre-change program PrePrg has a test case 1, a test case 2,. Test case 1 is a test case for testing the function PreF1. Test case 2 is a test case for testing the function PreF2. The test case N is a test case for testing the function PreFM.

  The test case generation apparatus 100 classifies whether the test cases 1 to N, which are existing test cases, need not be changed or should be changed as a result of the change of the pre-change program PrePrg. Further, as a result of the change of the pre-change program PrePrg, the test case generation apparatus 100 determines whether there is no corresponding test case in the existing test case and there is an added function. Furthermore, the test case generation device 100 generates a test case for the added function.

  Specifically, in the example of FIG. 4, for the function PostF1 and the function PostFM, the test case generation device 100 specifies a corresponding test case from the test cases 1 to N. Then, the test case generation device 100 determines that the function PostF1 can be used as a test case for testing the operation of the function PostFM.

  In addition, for the function PostF2, the test case generation device 100 specifies a corresponding test case from the test cases 1 to N. Then, the test case generation device 100 determines that a test case for testing the function PostF2 should be generated using the specified test case. Furthermore, for the function PostFX, the test case generation device 100 determines that a test case should be added. Then, the test case generation device 100 generates an additional test case for the function PostFX.

  When specifying the test cases corresponding to the functions PostF1 to PostFX, the test case generation apparatus 100 specifies the functions PreF1 to PreFM corresponding to the functions PostF1 to PostFX. The function PreF1 to the function PreFM are associated with any one of the test case 1 to the test case N. Therefore, the test cases corresponding to the functions PostF1 to PostFX can be specified by specifying the functions PostF1 to PostFX corresponding to the functions PostF1 to PostFX, respectively. Details of the procedure for specifying the functions PreF1 to PreFM corresponding to the functions PostF1 to PostFX will be described later with reference to FIGS.

  Details of the procedure for determining whether it is necessary to generate a test case for testing the operation of the function PostF1 to the function PostFX after specifying the function PreF1 to the function PreFM corresponding to the function PostF1 to the function PostFX will be described with reference to FIGS. Will be described later.

  Next, an example of the pre-change program PrePrg and an example of the post-change program PostPrg in the present embodiment will be described with reference to FIG.

  FIG. 5 is an explanatory diagram showing an example of the pre-change program and the post-change program. The pre-change source code PrePrgSrc, which is the source code of the pre-change program PrePrg shown in FIG. 5, defines the “targetFunc” method of the “TestTarget” class. As indicated by the pre-change source code PrePrgSrc, the pre-change program PrePrg takes the variable “x” as an input value and the variable “rtn” as an output result.

  The pre-change source code PrePrgSrc includes an if statement 501, an else if statement 502, and an else statement 503. Then, the pre-change source code PrePrgSrc reaches the update statement 504 that is executed when the condition of the if statement 501 is satisfied, the update statement 505 that is executed when the condition of the else if statement 502 is satisfied, and the else statement 503. Update statement 506 to be executed at the time.

  The changed source code PostPrgSrc, which is the source code of the changed program PostPrg, includes an if statement 511, an else if statement 512, an else if statement 513, and an else statement 514. The post-change source code PostPrgSrc includes an update statement 515 executed when the condition of the if statement 511 is satisfied, and an update statement 516 executed when the condition of the else if statement 512 is satisfied. Further, the changed source code PostPrgSrc includes an update statement 517 that is executed when the condition of the else if statement 513 is satisfied, and an update statement 518 that is executed when control reaches the else statement 514.

  The if statement 511 is a statement in which the conditional expression of the if statement 501 is changed. The else if statement 512 is a statement in which the conditional expression of the else if statement 502 is changed. The else if statement 513 is a newly added conditional statement. In the else statement 514, the condition for the control to reach is changed in comparison with the else statement 503 by changing the if statement 511 to the else if statement 513. The update sentence 515 has the same content as the update sentence 504. The update sentence 516 has the same content as the update sentence 505. The update sentence 517 is an added sentence. The output result of the update statement 518 is changed compared to the update statement 506.

  Next, an example of a symbolic execution driver program for executing symbolically the pre-change program PrePrg and the post-change program PostPrg is shown.

  FIG. 6 is an explanatory diagram of an example of a symbolic execution driver program. The source code SymDrvSrc of the symbolic execution driver shown in FIG. 6 defines the “TestDriver” class. The source code SymDrvSrc includes a code group 601 to a code group 603. FIG. 6 shows the source code PrgSrc of the test target program.

  The code group 601 is a code specifying a symbolic variable. Here, the symbolic variable is a variable that handles the variable x as a character x instead of a specific value. A code group 602 is a code specifying an output variable. A code group 603 is a code that designates a recording result of a pass result.

  By executing the “testFunc” method of the “TestDriver” class, the execution object of the source code PrgSrc is executed. Next, the result of symbolic execution of the pre-change program PrePrg and the post-change program PostPrg will be described with reference to FIGS.

  FIG. 7 is an explanatory diagram showing an example of the result of symbolic execution of the pre-change program. The test case generation apparatus 100 obtains the symbolic execution result 701 of the pre-change program by executing the symbolic execution driver for the pre-change program PrePrg.

  A symbolic execution result 701 indicates symbolic execution results for three paths. The symbolic execution result 701 illustrated in FIG. 7 includes records 701-1 to 701-3. The symbolic execution result 701 has three fields: a path ID, a path condition expression, and a path output expression. The path ID is an ID for identifying a path. The path conditional expression is a conditional expression that represents the value of an input variable that is a condition for executing the corresponding path. The path output formula is a formula that represents an output variable that is output when the corresponding path is executed.

  In the present embodiment, the pre-change program PrePrg includes M paths. M is an integer of 1 or more. A symbolic execution result 701 shown in FIG. 7 shows an example in the case of M = 3. Further, the path conditional expression of the path x of the pre-change program PrePrg is referred to as “PrexPC”, where x is an integer between 1 and M. Further, the path output formula of the path x of the pre-change program PrePrg is referred to as “PrexR”.

  FIG. 8 is an explanatory diagram illustrating an example of a result of symbolic execution of the changed program. The test case generation apparatus 100 obtains a symbolic execution result 801 of the changed program by executing a symbolic execution driver for the changed program PostPrg.

  A symbolic execution result 801 indicates symbolic execution results for four paths. The symbolic execution result 801 illustrated in FIG. 8 includes records 801-1 to 801-4.

  In the present embodiment, it is assumed that the post-change program PostPrg includes N paths. N is an integer of 1 or more. A symbolic execution result 801 shown in FIG. 8 shows an example when N = 4. Further, the path condition expression of the path x of the post-change program PostPrg is referred to as “PostxPC”, where x is an integer between 1 and N. Further, the path output formula of the path x of the post-change program PostPrg is referred to as “PostxR”.

(Function of test case generation apparatus 100)
Next, functions of the test case generation device 100 will be described. FIG. 9 is a block diagram illustrating an example of functions of the test case generation apparatus. The test case generation device 100 includes a first acquisition unit 901, a second acquisition unit 902, a path relation determination unit 903, a related information creation unit 904, a specification unit 905, a mathematical expression determination unit 906, and a generation determination unit 907. And a calculation unit 908 and a test case generation unit 909. The first acquisition unit 901 to the test case generation unit 909 serving as the control unit realize the functions of the first acquisition unit 901 to the test case generation unit 909 by causing the CPU 201 to execute a program stored in the storage device. Specifically, the storage device is, for example, the ROM 202, the RAM 203, the disk 205, etc. shown in FIG. Alternatively, the functions of the first acquisition unit 901 to the test case generation unit 909 may be realized by execution by another CPU via the communication interface 206.

  The first acquisition unit 901 performs symbolic execution of the pre-change program PrePrg so that the first path conditional expression of the first path included in the pre-change program PrePrg, the first path output formula of the first path, To obtain a first symbolic execution result.

  Further, the first symbolic execution result may include a path condition expression and a path output expression for each path of the path group included in the pre-change program PrePrg. The obtained first symbolic execution result is stored in a storage area such as the RAM 203 and the disk 205.

  The second acquisition unit 902 performs symbolic execution of the post-change program PostPrg, so that the second pass condition formula of the second pass included in the post-change program PostPrg, the second pass output formula of the second pass, , Including a second symbolic execution result.

  The second symbolic execution result may include a path condition expression and a path output expression for each path in the path group included in the post-change program PostPrg. The acquired second symbolic execution result is stored in a storage area such as the RAM 203 and the disk 205.

  The path-related determining unit 903 includes the first path conditional expression acquired by the first acquiring unit 901 and the second path conditional expression acquired by the second acquiring unit 902 among the possible values of the input variable. Based on the satisfiability, it is determined whether the second path is related to the first path.

  Further, the path relation determination unit 903 is based on the satisfiability of the path condition expression and the second condition expression of the path described above for each pair of the path and the second path included in the first symbolic execution result. Thus, it may be determined whether or not the second path is related to the path included in the first execution result.

  In addition, the path relation determination unit 903 is a value for which the logical product of the conditional expressions of the two paths is true for each pair of the path included in the first symbolic execution result and the path included in the second symbolic execution result. Whether or not two paths are related may be determined based on the presence or absence of. Note that the determination result is stored in a storage area such as the RAM 203 or the disk 205.

  When the path relation determination unit 903 determines that the second path is related to the path included in the first symbolic execution result, the related information creation unit 904 includes the second path in the first symbolic execution result. Create related information indicating that it is related to the path. The creation of related information will be described later with reference to FIG.

  In addition, when it is determined that the following condition is satisfied, the related information creation unit 904 displays related information indicating that the path included in the second symbolic execution result is related to the path included in the first symbolic execution result. You may create it. The next condition is a case where the path relation determination unit 903 determines that the path included in the second symbolic execution result is related to the path included in the first symbolic execution result. The related information is stored in a storage area such as the RAM 203 and the disk 205.

  When the path relevance determining unit 903 determines that the second path is related to the first path, the specifying unit 905 specifies the satisfiability of the first path conditional expression and the negation of the second path conditional expression. At the same time, the satisfaction of the negation of the first pass conditional expression and the second conditional expression is specified. The specification of the two satisfiability possibilities will be specifically described with reference to FIG.

  Further, the specifying unit 905 negates a path conditional expression corresponding to each path included in the first execution result indicated by the related information and a path conditional expression corresponding to each path included in the second execution result indicated by the related information. For each piece of related information. Further, the specifying unit 905 negates the path conditional expression corresponding to each path included in the first execution result indicated by the related information and the conditional expression corresponding to each path included in the first execution result indicated by the related information; May be specified for each related information. The identification result is stored in a storage area such as the RAM 203 and the disk 205.

  The formula determination unit 906 determines whether or not the first path output formula acquired by the first acquisition unit 901 matches the second path output formula acquired by the second acquisition unit 902. A specific determination method will be described later with reference to FIGS. The mathematical expression determination unit 906 may determine whether or not the first path output mathematical expression and the second path output mathematical expression indicated by the related information created by the related information creation unit 904 match.

  In addition, the mathematical expression determination unit 906, for each combination of each path and second path included in the first symbolic execution result, the path output mathematical expression included in the first symbolic execution result and the second path It may be determined whether or not the output formula matches.

  Further, the mathematical expression determination unit 906 may determine whether or not the path output mathematical expression included in the first symbolic execution result matches the path output mathematical expression included in the acquired second symbolic execution result. The mathematical expression determination unit 906 determines whether each combination included in each path included in the first symbolic execution result matches each combination included in the second symbolic execution result. Note that the determination result is stored in a storage area such as the RAM 203 or the disk 205.

  The generation determination unit 907 determines whether or not to generate a test case for testing the operation of the second path, based on the determination result by the path relation determination unit 903 and the determination result by the mathematical expression determination unit 906. Further, the generation determination unit 907 may determine whether or not to generate a test case for testing the operation of the second pass, based on the identification result by the identification unit 905 and the determination result by the mathematical expression determination unit 906. . A specific determination method will be described later with reference to FIG.

  The generation determination unit 907 may determine that a test case for testing the operation of the second pass should be generated when the following condition is satisfied. The following condition is that the specifying unit 905 specifies that the negation of the first pass conditional expression and the second pass conditional expression can be satisfied, and the determination result by the formula determining unit 906 is the first pass. This is a case where the output formula and the second path output formula match.

  The generation determination unit 907 may determine whether or not to generate a test case for testing the operation of the second pass based on the following information. The next information is the related information created by the related information creating unit 904 and the determination result for each pair of the path and the second path included in the first execution result by the mathematical expression determination unit 906.

  Further, the generation determination unit 907 may determine whether to generate a test case for testing the operation of each path included in the second symbolic execution result based on the following information. The following information is provided for each set of the related information created by the related information creation unit 904, the path included in the first symbolic execution result by the formula determination unit 906, and the path included in the second symbolic execution result. It becomes a judgment result.

  Further, the generation determination unit 907 may determine whether to generate a test case for testing the operation of each path included in the second symbolic execution result based on the following information. The following information is determined for each set of the identification result for each piece of related information by the identification unit 905 and the path included in the first symbolic execution result by the formula determination unit 906 and each path included in the second execution result. Result. Note that the determination result is stored in a storage area such as the RAM 203 or the disk 205.

  When the generation determination unit 907 determines that the test case for testing the operation of the second path should be generated, the calculation unit 908 calculates the value of the input variable that makes the second path conditional expression true. . A specific calculation example will be described later with reference to FIG.

  In addition, when the generation determination unit 907 determines that the test case for testing the operation of the second pass should be generated, the calculation unit 908 negates the first pass conditional expression and the second pass conditional expression. You may calculate the value which makes the logical product and true. The calculated value is stored in a storage area such as the RAM 203 and the disk 205.

  The test case generation unit 909 generates a test case that tests the operation of the second pass using the value calculated by the calculation unit 908 as the value of the input variable. The generated test case may be stored in a storage area such as the RAM 203 and the disk 205, displayed on the display 207, or transmitted to an external device via the communication interface 206.

  FIG. 10 is an explanatory diagram illustrating an example of a result of associating paths before and after the change in the first embodiment. The test case generation device 100 receives the symbolic execution result 701 and the symbolic execution result 801 and outputs a path association result 1001. Specifically, the test case generation apparatus 100 creates the following conditional expression (1) and determines the satisfaction of the conditional expression (1) when the path conditional expressions of the pre-change and post-change programs are PrePC and PostPC, respectively. .

  PrePC ∧ PostPC (1)

  The test case generation device 100 determines the satisfaction of the conditional expression (1) for all combinations of Pre1PC to Pre3PC and Post1PC to Post4PC. Then, the test case generation device 100 associates a combination of paths that can be satisfied.

  For example, a constraint solver such as an SMT (Satisfiability Modulus Theory) solver or an SAT (SAT is a fidelity) solver is used to determine whether the conditional expression is satisfiable.

  In the example of FIG. 10, the satisfiability of the conditional expression (1) for four combinations of Pre2PC and Post1PC, Pre2PC and Post2PC, Pre2PC and Post3PC, Pre2PC and Post4PC is illustrated. Since Pre2PC∧Post1PC is true when x satisfies 10 ≦ x <20, conditional expression (1) can be satisfied. Since Pre2PC∧Post2PC is true when x satisfies 20 ≦ x <30, the conditional expression (1) can be satisfied. Since Pre2PC∧Post3PC is true when x satisfies 30 ≦ x <40, conditional expression (1) can be satisfied. Since Pre2PC∧Post4PC does not have true x, conditional expression (1) cannot be satisfied.

  Therefore, the test case generation device 100 associates Pre2PC and Post1PC, which can satisfy the conditional expression (1), associates Pre2PC and Post2PC, and associates Pre2PC and Post3PC. Hereinafter, information including the associated combination is referred to as related information. The related information is information for one record of the path association result 1001.

  The path association result 1001 has three fields: a test case group number, a path ID of the program before change, and a path ID of the program after change. The path association result 1001 includes records 1001-1 to 1001-6. The test case group number field stores a number that uniquely identifies the associated combination. The path ID field of the program before change stores the path ID of the program before change of the related information. The path ID field of the post-change program stores the path ID of the post-change program.

  Hereinafter, the path conditional expression of the pre-change program for related information is referred to as “PrePC_TC”. Similarly, the path conditional expression of the program after the change of the related information is referred to as “PostPC_TC”. Further, the path output formula of the pre-change program of related information is referred to as “PreR_TC”. Similarly, the path output formula of the program after changing the related information is referred to as “PostR_TC”.

  In the present embodiment, L pieces of related information are created. L is an integer of 1 or more. A path association result 1001 shown in FIG. 10 shows an example in the case of L = 6.

  FIG. 11 is an explanatory diagram of a classification example of the path conditional expression change type. The test case generation device 100 classifies each of the related information associated in FIG. 10 into a type indicating how the path conditional expression is changed. Specifically, the test case generation device 100 determines the satisfaction of the conditional expression (2-1) and the conditional expression (2-2) using a constraint solver.

PrePC_TC (i) ∧PostPC_TC (i) (2-1)
¬PrePC_TC (i) ∧PostPC_TC (i) (2-2)

  However, “(i)” indicates the i-th set of related information. The test case generation device 100 classifies the path conditional expression change types into four based on the results of satisfiability of the conditional expressions (2-1) and (2-2).

  As a first classification, when both the conditional expression (2-1) and the conditional expression (2-2) are unsatisfiable, a set that can be taken by an input variable having PrePC_TC (i) as true and PostPC_TC (i) Indicates that the sets that can be taken by the input variable that is true match. In this case, the test case generation device 100 identifies the path conditional expression change type as “invariant”. The identified path conditional expression change type is given to the related information.

  As the second classification, when the conditional expression (2-1) is satisfiable and the conditional expression (2-2) is unsatisfiable, the value of the input variable that PostPC_TC (i) is true can be taken. It indicates that the set is included in the set of possible values for the input variable that is true for PrePC_TC (i). In this case, the test case generation device 100 specifies the path conditional expression change type as “reduced”. The identified path conditional expression change type is given to the related information.

  As a third classification, when conditional expression (2-1) is unsatisfiable and conditional expression (2-2) is satisfiable, an input variable having PostPC_TC (i) as true Indicates that the set includes a set of possible values for an input variable that is true for PrePC_TC (i). In this case, the test case generation apparatus 100 specifies the path conditional expression change type as “enlarged”. The identified path conditional expression change type is given to the related information.

  As a fourth classification, when both the conditional expression (2-1) and the conditional expression (2-2) can be satisfied, a set that can be taken by an input variable having PrePC_TC (i) as true and PostPC_TC (i) Indicates that the set that can be assumed by the input variable that is true partially overlaps. In this case, the test case generation device 100 specifies the path conditional expression change type as “duplicate”. The identified path conditional expression change type is given to the related information.

  FIG. 12 is an explanatory diagram illustrating an example of the classification result of the path conditional expression change type in the first embodiment. FIG. 12 shows a path condition expression change type result 1201 that is a result of the test case generation device 100 classifying the path condition expression change type of the related information according to the classification procedure of the path condition expression change type shown in FIG. .

  The path conditional expression change type result 1201 includes a field included in the path association result 1001 and a path conditional expression change type field. The path condition expression change type field stores the path condition expression change type of the relevant information. The path conditional expression change type result 1201 illustrated in FIG. 12 includes records 1201-1 to 1201-6. For example, the record 1201-1 indicates that the path conditional expression change type of the related information of Pre1 and Post1 is “enlarged”.

  FIG. 13 is an explanatory diagram of an example of a determination rule for the path output formula change type. In FIG. 13, the determination rule of the path output formula change type is shown as a table 1301. Table 1301 has a rule number and a path output formula change type determination rule. The path output formula change type determination rule is hereinafter simply referred to as “determination rule”. The table 1301 includes records 1301-1 to 1301-4. Each of the records 1301-1 to 1301-4 indicates one determination rule. Hereinafter, the determination rules respectively indicated by the records 1301-1 to 1301-4 are referred to as “determination rules 1” to “determination rules 4”.

  When the related information PreR_TC (i) and PostR_TC (i) satisfy the determination rule 1 indicated by the record 1301-1, the test case generation device 100 determines that the path output formula change type is “invariant”. The determined path output formula change type is given to the related information.

  On the other hand, when PreR_TC (i) and PostR_TC (i) do not satisfy the determination rule 1, the test case generation device 100 applies any one of the determination rule 2 to the determination rule 4. As a first example of the application procedure, the test case generation device 100 applies the determination rule 2 and outputs a determination result based on the determination rule 2. As a second example of the application procedure, the test case generation device 100 applies the determination rule 2 according to the first example of the application procedure, and the determination result by the determination rule 2 becomes “determination impossible”. The determination rule 3 may be applied, and the determination result based on the determination rule 3 may be output. Furthermore, as a third example of the application procedure, the test case generation device 100 applies the determination rule 3 according to the second example of the application procedure, and the determination result by the determination rule 3 becomes “determination impossible” The determination rule 4 may be applied, and the determination result according to the determination rule 4 may be output.

  The determination rule 1 is a rule in which PreR_TC (i) and PostR_TC (i) are compared as character strings, and if they match, the path output formula change type is determined to be “invariant”. When comparing as a character string, the test case generation apparatus 100 may compare the character string of PreR_TC (i) and the character string of PostR_TC (i) as they are, or may compare them excluding spaces and tabs. Good.

  The determination rule 2 will be described with reference to FIG. The path output formula change type determination rule of the determination rule 3 will be described with reference to FIG. The path output formula change type determination rule of the determination rule 4 will be described with reference to FIG.

  FIG. 14 is an explanatory diagram showing an example when the determination rule 2 is applied. The determination rule 2 determines the path output expression change type using the result of determining the satisfaction of the following conditional expression (3-1), the following conditional expression (3-2), and the following conditional expression (3-3). It is a rule to do.

(R = PreR_TC (i)) ∧ (R = PostR_TC (i)) (3-1)
¬ (R = PreR_TC (i)) ∧ (R = PostR_TC (i)) (3-2)
(R = PreR_TC (i)) ∧¬ (R = PostR_TC (i)) (3-3)

  Specifically, when the determination rule 2 is applied, the test case generation device 100 can satisfy or fail in the order of the conditional expression (3-1), the conditional expression (3-2), and the conditional expression (3-3). If possible and unsatisfactory, the path output formula change type is determined to be “invariant”. In addition, when the conditional expression (3-1), the conditional expression (3-2), and the conditional expression (3-3) are not in the order of satisfiable, unsatisfiable, and unsatisfiable, the test case generation device 100 The path output formula change type is determined as “change”. Furthermore, when the constraint solver cannot determine the satisfiability, the test case generation device 100 determines that the path output formula change type is “determination impossible”. The determined path output formula change type is given to the related information.

  The table 1401 displays related information TC1 to TC3 to which the determination rule 2 is to be applied. The table 1401 includes records 1401-1 to 1401-3. Table 1402 shows the determination results when the determination rule 2 is applied to the related information TC1 to TC3. The table 1402 includes records 1402-1 to 1402-3. For example, the record 1402-1 is satisfiable, unsatisfiable, and unsatisfiable in order of the conditional expression (3-1), the conditional expression (3-2), and the conditional expression (3-3). Is determined to be “invariant”.

  In addition, in record 1402-2 and record 1402-3, the constraint solver was unable to determine the satisfiability of conditional expression (3-1), conditional expression (3-2), and conditional expression (3-3). , Indicating that the determination result is determined to be “determination impossible”. The case where the constraint solver cannot be determined is, for example, a case where a nonlinear function is included in the conditional expression.

  FIG. 15 is an explanatory diagram illustrating an example when the determination rule 3 is applied. The determination rule 3 is a rule for determining a path output formula change type using an exchange law, a distribution law, or the like. Specifically, when the determination rule 3 is applied, the test case generation device 100 expands PreR_TC (i) and PostR_TC (i), forms an expression in alphabetical order of variables, compares them as character strings, and matches them. In this case, the path output formula change type is determined to be “invariant”. On the other hand, if they do not match, the test case generation device 100 determines that the path output formula change type is “change”. When the exchange law, the distribution law, or the like cannot be used, the test case generation apparatus 100 determines that the path output formula change type is “determination impossible”. In addition to the exchange law and the distribution law, the test case generation apparatus 100 may use a combination law.

  A table 1401 displays related information TC1 to TC3 to which the determination rule 3 is to be applied. Table 1501 shows the determination results when the determination rule 3 is applied to the related information TC1 to TC3. The table 1501 includes records 1501-1 to 1501-3.

  For example, the record 1501-1 indicates that the character strings resulting from applying the exchange rule to PreR_TC and PostR_TC are both “x + 2 * y” and the path output formula change type is determined to be “invariant”. In the record 1501-2, a character string resulting from applying the distribution law and the exchange law to PreR_TC and PostR_TC is “f (x) * z (x, y) + g (y) * z (x, y ) ”, Indicating that the path output formula change type is determined to be“ invariant ”. On the other hand, the record 1501-3 indicates that the distribution law and the exchange law cannot be applied to PreR_TC and PostR_TC, and it is determined that the path output formula change type is “undecidable”.

  FIG. 16 is an explanatory diagram illustrating an example when the determination rule 4 is applied. The determination rule 4 is a rule for determining a path output formula change type using an input value for which the path conditional expression is true. Specifically, when the determination rule 4 is applied, the test case generation device 100 generates a specified number of input values for which PrePC_TC (i) and PostPC_TC (i) are true. In the example of FIG. 16, the designated number is 2. The test case generation apparatus 100 determines that the path output formula change type is “invariant” when the value of PreR_TC (i) matches the value of PostR_TC (i) for all the generated input values. . If they do not match, the test case generation device 100 determines that the path output formula change type is “change”.

  A table 1601 displays related information TC3 and TC4 to which the determination rule 4 is to be applied. The table 1601 has a record 1601-1 and a record 1601-2. Table 1602 shows determination results when the determination rule 4 is applied to the related information TC3 and TC4. The table 1602 includes a record 1602-1 and a record 1602-2.

  For example, in the record 1602-1, the result of inputting the input values x = X1 and y = Y1 to PreR_TC and PostR_TC respectively matches, and the result of inputting the input values x = X2 and y = Y2 matches. Indicates that the result is determined to be “invariant”. The record 1602-2 indicates that the determination result is determined to be “change” because the input values x = X3 and y = Y3 do not match with each of PreR_TC and PostR_TC.

  FIG. 17 is an explanatory diagram illustrating an example of the classification result of the path output formula change determination. In FIG. 17, the test case generation apparatus 100 performs a path output formula change type result that is a result of classifying the path output formula change type of the related information according to the classification procedure of the path output formula change type shown in FIGS. 1701 is shown.

  The path output formula change type result 1701 includes a field included in the path association result 1001 and a path output formula change type field. The path output formula change type field of the relevant information is stored in the path output formula change type field. The path output formula change type result 1701 illustrated in FIG. 17 includes records 1701-1 to 1701-6. For example, the record 1701-1 indicates that the path output formula change type of the related information between Pre1 and Post1 is “invariant”.

  FIG. 18 is an explanatory diagram of an example of the test case classification rule. A test case classification rule table 1801 shown in FIG. 18 shows test rule classification rules according to the path condition formula change type and the path output formula change type. The test case type indicates whether or not a test case should be generated. Furthermore, the test case type indicates whether or not there is a possibility of a test case for a new function when a test case is to be generated. Hereinafter, the test case classification rule is simply referred to as “classification rule”. The test case classification rule table 1801 includes records 1801-1 to 1801-13.

  The test case classification rule table 1801 includes five fields: classification rule, path condition expression change type, path output formula change type, test case path condition expression, and test case type. In the classification rule field, a number for identifying the classification rule is stored. Hereinafter, the classification rules indicated by the records 1801-1 to 1801-13 are referred to as “classification rule 1” to “classification rule 9”, respectively.

  The path condition expression change type field stores a path condition expression change type that is one of the conditions to which the corresponding classification rule is applied. The path output formula change type field stores a path output formula change type that is one of the conditions to which the corresponding classification rule is applied. The test case path conditional expression field stores a conditional expression that satisfies the input value of the test case when the corresponding classification rule is applied. The test case type field stores the type of necessity of changing the test case when the corresponding classification rule is applied. Test case types include “invariant”, “regression”, “change”, “add”, and “confirm”.

  “Invariant” and “Regression” means that the path function of the post-change program PostPrg is not changed from the path function of the pre-change program PrePrg, and does not generate a test case for testing the path of the pre-change program PrePrg. Indicates that it is okay. “Regression” is executed as a test case in which the path condition formula of the post-change program PostPrg is changed from the path condition formula of the pre-change program PrePrg, and the corresponding test case confirms the operation of the post-change program PostPrg. It also shows that it is better to be done.

  “Change” and “add” means that the path function of the post-change program PostPrg is changed from the path function of the pre-change program PrePrg, and a test case for testing the path of the post-change program PostPrg should be generated. It shows that there is. Furthermore, “add” indicates that the path function of the post-change program PostPrg may be a new function.

  “Confirmation” cannot determine whether or not the path function of the post-change program PostPrg has been changed from the pre-change program PrePrg path function, and whether or not to generate a test case for testing the post-change program PostPrg path Indicates that it cannot be determined. The user of the test case generation apparatus 100 confirms, for example, the processing contents of the corresponding path for the test case whose test case type is “confirmed”.

  A record 1801-1 indicates a classification rule 1 that is a classification rule for related information whose path conditional expression change type is “invariant” and whose path output expression change type is “invariant”. The related information that satisfies the condition of the classification rule 1 indicates that the test case type is “invariant” and the test case path conditional expression is PostPC_TC.

  A record 1801-2 indicates a classification rule 2 that is a classification rule for related information whose path conditional expression change type is “invariable” and whose path output expression change type is “change”. The related information that satisfies the condition of the classification rule 2 indicates that the test case type is “changed” and the test case path conditional expression is PostPC_TC.

  A record 1801-3 indicates a classification rule 3 that is a classification rule for related information in which the path conditional expression change type is “reduced” and the path output formula change type is “invariant”. The related information that satisfies the condition of the classification rule 3 indicates that the test case type is “regression” and the test case path conditional expression is PostPC_TC.

  A record 1801-4 indicates a classification rule 4 that is a classification rule for related information whose path condition formula change type is “reduction” and whose path output formula change type is “change”. The related information that satisfies the condition of the classification rule 4 indicates that the test case type is “addition” and the test case path conditional expression is PostPC_TC. As the basis for the test case type as “add”, the path condition expression change type is “reduction” and the function is changed. In order to provide a new function, the path condition expression is subdivided. This is because there is a high possibility that the source code that will be a new function is described.

  Records 1801-5 and 1801-6 indicate classification rule 5, which is a classification rule for related information in which the path conditional expression change type is “expanded” and the path output formula change type is “invariant”. The related information that satisfies the condition of the classification rule 5 is divided into two according to the test case path conditional expression. It shows that the test case type of the related information satisfying the test case path conditional expression PrePC_TC＿PostPC_TC among the related information satisfying the condition of the classification rule 5 is “regression”.

  On the other hand, the test case type of the related information satisfying the test case path conditional expression ¬ PrePC_TC∧PostPC_TC among the related information satisfying the condition of the classification rule 5 is “added”. The reason that the path condition formula change type is “expanded” as the basis for “adding” the test case type is that there is a high possibility that the path condition formula has been expanded in order to correspond to a new input value.

  Records 1801-7 and 1801-8 indicate the classification rule 6 that is a classification rule for related information whose path condition formula change type is “enlarged” and whose path output formula change type is “change”. The related information satisfying the condition of the classification rule 6 is divided into two according to the test case path conditional expression. The test case type of the related information satisfying the test case path conditional expression prePC_TC∧PostPC_TC among the related information satisfying the condition of the classification rule 6 is “change”. On the other hand, the test case type of the related information satisfying the test case path conditional expression ¬PrePC_TC∧PostPC_TC among the related information satisfying the condition of the classification rule 6 is “change”.

  Records 1801-9 and 1801-10 show classification rule 7 which is a classification rule for related information whose path condition formula change type is “duplicate” and whose path output formula change type is “invariant”. The related information satisfying the condition of the classification rule 7 is divided into two according to the test case path conditional expression. Of the related information that satisfies the condition of the classification rule 7, the test case type of the related information that satisfies the test case path conditional expression prePC_TC∧PostPC_TC indicates “regression”.

  On the other hand, the test case type of the related information satisfying the test case path conditional expression ¬ PrePC_TC∧PostPC_TC among the related information satisfying the condition of the classification rule 7 is “added”. The reason for changing the test condition type to “add” is that the path condition formula change type is “duplicate”, which means that the path condition formula is reduced and expanded, and it corresponds to the new input value. Therefore, there is a high possibility that the path conditional expression is expanded.

  A record 1801-11 and a record 1801-12 indicate a classification rule 8 that is a classification rule for related information whose path condition formula change type is “duplicate” and whose path output formula change type is “change”. The related information that satisfies the condition of the classification rule 8 is divided into two according to the test case path conditional expression. The test case type of the related information satisfying the test case path conditional expression prePC_TC∧PostPC_TC among the related information satisfying the condition of the classification rule 8 is “change”. On the other hand, the test case type of the related information satisfying the test case path conditional expression ¬prePC_TC∧PostPC_TC among the related information satisfying the condition of the classification rule 8 is “change”.

  A record 1801-13 indicates a classification rule 9 that is a classification rule for related information whose path output formula change type is “undecidable”. The related information that satisfies the condition of the classification rule 9 indicates that the test case type is “confirmed” and the test case path conditional expression is PostPC_TC.

  FIG. 19 is an explanatory diagram illustrating an example of a test case classification result. FIG. 19 shows a result obtained by classifying the necessity of test case generation according to the test case classification rule shown in FIG.

  A table 1901 illustrated in FIG. 19 includes a field included in the path conditional expression change type result 1201 and a path output formula change type field. The test case generation device 100 outputs a test case generation necessity classification result 1902 from the table 1901. The test case generation necessity classification result 1902 includes records 1902-1 to 1902-10. For example, the record 1902-1 indicates that the test case path conditional expression of the related information between Pre1 and Post1 is PrePC_TC∧PostPC_TC, and the test case type is “regression”.

  FIG. 20 is an explanatory diagram illustrating an example of generating an input value of a test case of the changed program. FIG. 20 shows an example of generating test case input values of the post-change program PostPrg from the test case generation necessity classification result 1902 obtained in FIG. Specifically, in FIG. 20, of the test case generation necessity classification result 1902, the test case of the record 1902-2 and the record 1902-6 in which the test case type designated by the user is “added”. Generate input values.

  The test case generation device 100 calculates a value satisfying the test case path conditional expression using a constraint solver. The calculated results are shown in Table 2001. The table 2001 includes a record 2001-1 and a record 2001-2.

  The table 2001 has five fields: a test case group number, a test case type, a test case pass conditional expression, a test input value conditional expression, and a test input value. The test case group number, the test case type, and the test case pass conditional expression are the same as the field of the same name in the test case generation necessity classification result 1902. The test input value conditional expression field stores a test input value conditional expression obtained from the test case path conditional expression. The calculated value is stored in the test input value field.

  The test case generation device 100 generates a test case in which a value calculated as an input value is set as a test case of the post-change program PostPrg. Note that the expected value of the test case is set by the user of the test case generation apparatus 100 or the like.

  Next, a flowchart executed by the test case generation apparatus 100 will be described with reference to FIGS.

  FIG. 21 is a flowchart illustrating an example of a test case generation processing procedure. The test case generation process is a process for generating a test case for the post-change program PostPrg. The test case generation device 100 acquires symbolic execution results of the pre-change program PrePrg and the post-change program PostPrg (step S2101). Next, the test case generation device 100 executes a before / after change path association process (step S2102). Details of the path association process before and after the change will be described later with reference to FIG. It is assumed that L pieces of related information have been generated by the pre-change path association processing.

  Subsequently, the test case generation device 100 substitutes 1 for i (step S2103). Next, the test case generation device 100 executes a path conditional expression change type classification process for the i-th related information (step S2104). Details of the path conditional expression change type classification processing will be described with reference to FIG. Subsequently, the test case generation device 100 executes a path output formula change type classification process for the i-th related information (step S2105). Details of the path output formula change type classification process will be described with reference to FIG.

  Note that since there is no dependency relationship between the process of step S2104 and the process of step S2105, the test case generation apparatus 100 may execute the process of step S2104 and the process of step S2105 in parallel. Further, the processing in step S2105 may be performed not on the related information but on all combinations of paths before and after the change.

  Next, the test case generation device 100 performs a test case classification process on the i-th related information (step S2106). Details of the test case classification process will be described later with reference to FIG. As for the process of step 2106, when the path output formula change type is “change” in the process of step S2105, referring to FIG. 18, the test case type indicates that a test case should be generated. "Or" Add ".

  Therefore, when the user wants to know whether or not a test case should be generated, the test case generation apparatus 100 may perform the process of step S2105 on the related information without performing the process of step S2104. Then, the test case generation apparatus 100 may perform the process of step S2104 when the path output formula change type becomes “invariant”. When the result of step S2104 is “enlarge” or “duplicate”, the test case generation apparatus 100 determines that the test case type is “changed” or “added” in the test case path conditional expression of ¬PrePC_TC∧PostPC_TC. .

  Subsequently, the test case generation device 100 substitutes i + 1 for i (step S2107). Next, the test case generation device 100 determines whether i is greater than L (step S2108). When i is L or less (step S2108: No), the test case generation device 100 proceeds to the process of step S2104. When i is larger than L (step S2108: Yes), the test case generation device 100 outputs a test case classification result (step S2109). As an output destination, the test case generation apparatus 100 may store the test case classification result in a storage device such as the RAM 203 and the disk 205, or may display the test case classification result on the display 207.

  Next, the test case generation apparatus 100 executes test case input value generation processing of the changed program (step S2110). Details of the test case input value generation processing of the post-change program will be described later with reference to FIG. Subsequently, the test case generation device 100 outputs the test case that generated the test input value (step S2111).

  After the process of step S2111 ends, the test case generation device 100 ends the test case generation process. By executing the test case generation process, the test case generation apparatus 100 can generate a test case for testing the operation of the post-change program PostPrg.

  FIG. 22 is a flowchart illustrating an example of the pre-change path association processing procedure. The pre-change path association process is a process for creating related information by detecting related paths among the paths of the pre-change program PrePrg and the post-change program PostPrg. In FIG. 22, the i-th path of the pre-change program PrePrg is expressed as Pre (i), and the conditional expression of the i-th path is expressed as PrePC (i). Similarly, the jth path of the post-change program PostPrg is expressed as Post (j), and the conditional expression of the jth path is expressed as PostPC (j).

  The test case generation device 100 substitutes 1 for i, and substitutes 1 for j (step S2201). Next, the test case generation device 100 determines whether PrePC (i) ∧PostPC (j) can be satisfied (step S2202). When PrePC (i) ∧PostPC (j) is satisfiable (step S2202: Yes), the test case generation device 100 creates related information using Pre (i) and Post (j) as a test case group. (Step S2203). After the process of step S2203 is completed, or when PrePC (i) ∧PostPC (j) cannot be satisfied (step S2202: No), the test case generation device 100 substitutes j + 1 for j (step S2204).

  Subsequently, the test case generation device 100 determines whether j is greater than N (step S2205). When j is N or less (step S2205: No), the test case generation device 100 proceeds to the process of step S2202. When j is larger than N (step S2205: Yes), the test case generation device 100 substitutes i + 1 for i and substitutes 1 for j (step S2206).

  Subsequently, the test case generation device 100 determines whether i is larger than M (step S2207). When i is M or less (step S2207: No), the test case generation device 100 proceeds to the process of step S2202. When i is larger than M (step S2207: Yes), the test case generation device 100 outputs the created related information (step S2208). After the process of step S2208 ends, the test case generation device 100 ends the pre-change path association process. By executing the pre-change path association process, the test case generation device 100 can detect related paths and create related information.

  FIG. 23 is a flowchart illustrating an example of a path conditional expression change type classification processing procedure. The path condition expression change type classification process is a process of classifying the path condition expression change type of the related information. In FIG. 23, the path conditional expression of the pre-change program PrePrg indicated by the i-th related information is expressed as PrePC_TC (i). Further, the path conditional expression of the post-change program PostPrg indicated by the i-th related information is expressed as PostPC_TC (i).

  The test case generation device 100 determines the satisfaction of the conditional expression (2-1) and the satisfaction of the conditional expression (2-2) (step S2301). Next, the test case generation device 100 determines whether or not both the conditional expression (2-1) and the conditional expression (2-2) are determined to be unsatisfactory (step S2302). When it is determined that both the conditional expression (2-1) and the conditional expression (2-2) are unsatisfiable (step S2302: Yes), the test case generation device 100 sets the path conditional expression change type to “invariant”. (Step S2303).

  When it is determined that at least one of the conditional expression (2-1) and the conditional expression (2-2) is unsatisfiable (step S2302: No), the test case generation device 100 outputs the conditional expression (2 It is determined whether it is determined that -1) is satisfiable and conditional expression (2-2) is unsatisfiable (step S2304). When the conditional expression (2-1) can be satisfied and the conditional expression (2-2) cannot be satisfied (step S2304: Yes), the test case generation apparatus 100 reduces the path conditional expression change type to “reduction”. "(Step S2305).

  When the conditional expression (2-1) is not satisfiable or the conditional expression (2-2) is not satisfiable (step S2304: No), the test case generation apparatus 100 is not satisfied with the conditional expression (2-1). It is determined whether it is possible and it is determined that the conditional expression (2-2) can be satisfied (step S2306). When the conditional expression (2-1) cannot be satisfied and the conditional expression (2-2) can be satisfied (step S2306: Yes), the test case generation device 100 sets the path conditional expression change type to “enlarge” "(Step S2307).

  On the other hand, when both the conditional expression (2-1) and the conditional expression (2-2) can be satisfied (step S2306: No), the test case generation device 100 identifies the path conditional expression change type as “duplicate”. (Step S2308). After completion of any one of step S2303, step S2305, step S2307, and step S2308, the test case generation device 100 outputs the specified path conditional expression change type (step S2309). The output path conditional expression change type is assigned to the i-th related information.

  After the process of step S2309 ends, the test case generation device 100 ends the path conditional expression change type classification process. By executing the path condition expression change type classification process, the test case generation device 100 changes how the path condition expression of the post-change program PostPrg indicated by the i th related information is changed from the path condition expression of the pre-change program PrePrg. You can get what was done.

  FIG. 24 is a flowchart illustrating an example of a path output formula change type classification processing procedure. The path output formula change type classification process is a process of classifying the path output formula change type of the related information. In FIG. 24, the path output formula of the pre-change program PrePrg indicated by the i-th related information is expressed as PreR_TC (i). Further, the path output formula of the post-change program PostPrg indicated by the i-th related information is expressed as PostR_TC (i).

  As the determination rule 1, the test case generation apparatus 100 compares PreR_TC (i) and PostR_TC (i) as character strings and determines whether or not they match (step S2401). When they do not match (step S2401: No), the test case generation device 100 applies the determination rules 2 to 4 (step S2402). Subsequently, the test case generation apparatus 100 determines whether or not it is determined to be “invariant” as a result of applying the determination rules 2 to 4 (step S2403).

  When compared as a character string and matched (step S2401: Yes), or when it is determined to be “invariant” as a result of applying the determination rules 2 to 4 (step S2403: Yes), the test case generation device 100 The path output formula change type is determined to be “invariant” (step S2404).

  As a result of applying the determination rules 2 to 4, when it is determined that it is not “invariant” (step S <b> 2403: No), the test case generation device 100 determines that it is “changed” as a result of applying the determination rules 2 to 4. It is determined whether or not (step S2405). As a result of applying the determination rules 2 to 4, when it is determined as “change” (step S 2405: Yes), the test case generation device 100 determines that the path output formula change type is “change” (step S 2406).

  On the other hand, when it is determined that “determination is impossible” as a result of applying the determination rules 2 to 4 (step S2405: No), the test case generation device 100 determines that the path output formula change type is “determination impossible” (step S2405: No). Step S2407). After the completion of any one of steps S2404, S2406, and S2407, the test case generation device 100 outputs the determined path output formula change type (step S2408). The output path output formula change type is assigned to the i-th related information.

  After the process of step S2408 ends, the test case generation device 100 ends the path output formula change type classification process. By executing the path output formula change type classification process, the test case generation device 100 determines whether the path function of the post-change program PostPrg indicated by the i-th related information has been changed from the path function of the pre-change program PrePrg. Can be identified.

  FIG. 25 is a flowchart illustrating an example of a test case classification processing procedure. The test case classification process is a process for specifying the test case classification of the related information. The test case generation device 100 acquires the path condition formula change type and the path output formula change type of the related information (step S2501). Next, the test case generation device 100 refers to the test case classification rule table 1801 and determines the test case classification corresponding to the acquired path condition expression change type and path output expression change type (step S2502). Subsequently, the test case generation device 100 outputs the determined test case classification (step S2503). After the process of step S2503 is completed, the test case generation device 100 ends the test case classification process. By executing the test case classification process, the test case generation apparatus 100 can specify the test case classification.

  FIG. 26 is a flowchart illustrating an example of an input value generation processing procedure for a test case of the changed program. The test case input value generation process of the post-change program is a process of generating the test case input value of the post-change program PostPrg.

  The test case generation device 100 accepts specification of a test case type (step S2601). Next, the test case generation device 100 selects related information of the designated test case type (step S2602). Subsequently, the test case generation device 100 acquires a test case path conditional expression of the selected related information (step S2603). Next, the test case generation device 100 calculates a value satisfying the acquired test case path conditional expression using a constraint solver (step S2604). Subsequently, the test case generation device 100 generates a test case using the calculated value as a test input value (step S2605).

  In step S2605, for example, the test case generation apparatus 100 copies a test case that tests the path operation of the pre-change program PrePrg of related information, and overwrites the calculated value of the test input value of the copy destination test case. May be. The copy destination test case is generated as a test case for testing the path operation of the post-change program PostPrg. If the test of the pre-change program PrePrg is not to be performed in the future, the test case generating apparatus 100 overwrites the test input value of the test case for testing the path operation of the pre-change program PrePrg of related information with the calculated value. May be. The overwritten test case is generated as a test case for testing the path operation of the post-change program PostPrg.

  After the process of step S2605 ends, the test case generation device 100 ends the test case input value generation process of the changed program. By executing the test case input value generation process of the post-change program, the test case generation apparatus 100 can prepare the test case input value of the post-change program.

  As described above, according to the test case generation apparatus 100, when a part of the program is changed, the test is performed by comparing the output variables of the paths that can satisfy the conditional expression for executing the path before and after the change. Determine whether a case should be generated. Thereby, the user of the test case generation apparatus 100 can know whether or not to generate a test case for testing the operation of the second pass, and the user can determine whether or not to generate a test case. Since it is not necessary, the load of test case generation work can be reduced.

  Also, according to the test case generation apparatus 100, when it is determined that a test case for testing the operation of the second path should be generated, the value of the input variable that makes the second path conditional expression true is calculated. The test case of the second pass may be generated using the calculated value as the value of the input variable. The changed test case becomes a test case for testing the operation of the second path, and the user of the test case generation apparatus 100 does not have to generate the test part of the changed part and the additional part, and the load of the test case generation work Can be reduced.

  Further, according to the test case generation device 100, a test case for testing the operation of the second pass should be generated based on the satisfaction of the conditional expression (2-1) and the conditional expression (2-2). It may be determined whether or not.

  Thus, the user of the test case generation apparatus 100 can know that the test case need not be generated if the test case type is “invariable” or “regression”. If it is “Add”, it is possible to know that a test case should be generated. In addition, when the test case type is “regression”, the output value is the same, but the path conditional expression has changed. For example, among test cases having a test input value that makes the first path conditional expression true There may be a test case in which the second path conditional expression is not true. Since it is not necessary to execute a test case that does not make the second pass conditional expression true, the user of the test case generation apparatus 100 who knows that the test case type is “regression” determines whether or not the test case needs to be executed. Can be considered.

  In addition, when the user of the test case generation device 100 specifies that the conditional expression (2-2) is satisfiable and the first path output formula and the second path output formula match, It is also possible to calculate the value of an input variable that negates the first pass condition expression and makes the second pass condition expression true. The case where the conditional expression (2-2) can be satisfied is a case where the path conditional expression change type is “enlarged” or “duplicate”. The test case generation device 100 calculates the value of an input variable that makes the first pass conditional expression negative and the second pass conditional expression true, and tests the path conditional expression that is not included in the pre-change program. A test input value for the case can be generated.

  Further, according to the test case generation apparatus 100, based on the path condition formula for each path included in the pre-change program PrePrg, the path output formula, the path condition formula for the second path, and the path output formula, It may be determined whether a test case for testing the operation should be generated. Thereby, the user of the test case generation apparatus 100 can use the test case of the path related to the second path among the paths included in the pre-change program PrePrg as it is, or the test case for the second path. Can be generated.

  Further, according to the test case generation apparatus 100, should a test case for each path of the post-change program PostPrg be generated based on the path condition formula and path output formula for each path of the pre-change program PrePrg and the post-change program PostPrg? It may be determined whether or not. Thereby, the user of the test case generation apparatus 100 can know whether or not test cases should be generated for all paths included in the post-change program PostPrg.

  Further, according to the test case generation device 100, the path condition formula change type is specified for each related information, and the test cases of the paths of the post-change program PostPrg based on the path condition formula change type and the path output formula. The type may be determined. For example, the user of the test case generation apparatus 100 designates “invariant” and “regression” among the test case types of each path of the output post-change program PostPrg, thereby executing a regression test. Can be selected. Further, the user of the test case generation apparatus 100 executes the changed part and the added part by specifying “change” and “add” among the test case types of each path of the output post-change program PostPrg. The test case to be selected can be selected.

(Description of Embodiment 2)
The test case generation device 100 according to the first embodiment determines whether or not the conditional expression (1) is satisfiable in the path association before and after the change, and the conditional expression (2-1) and the condition in the classification of the path conditional expression change type. In determining the satisfiability of the expression (2-2), a constraint solver is used. However, the determination of satisfiability by the constraint solver takes time. Thus, the test case generation device according to the second embodiment reduces the number of times of determination of satisfiability by the constraint solver. Hereinafter, the test case generation device 2700 according to the second exemplary embodiment will be described with reference to FIGS. In addition, about the location similar to the location demonstrated in Embodiment 1, the same code | symbol is attached | subjected and illustration and description are abbreviate | omitted.

  FIG. 27 is a block diagram illustrating a functional example of the test case generation device according to the second embodiment. The test case generation device 2700 includes a first acquisition unit 2701, a second acquisition unit 2702, a test input value determination unit 2703, a related information generation unit 2704, a specification unit 2705, a set creation unit 2706, and a path related determination. A section 2707 and a related information creation section 2708. Furthermore, the test case generation device 2700 includes a mathematical expression determination unit 2709, a generation determination unit 2710, a calculation unit 908, and a test case generation unit 909.

  The first acquisition unit 2701 to the generation determination unit 2710, the calculation unit 908, and the test case generation unit 909, which are control units, realize each function by the CPU 201 executing a program stored in the storage device. Specifically, the storage device is, for example, the ROM 202, the RAM 203, the disk 205, etc. shown in FIG. Alternatively, the functions of the first acquisition unit 2701 to the generation determination unit 2710, the calculation unit 908, and the test case generation unit 909 may be realized by another CPU executing via the communication interface 206.

  The first acquisition unit 2701 acquires a first symbolic execution result and a test input value of a test case for testing the operation of each path included in the first symbolic execution result. The acquired information is stored in a storage area such as the RAM 203 and the disk 205.

  The second acquisition unit 2702 acquires a second symbolic execution result and a test input value that satisfies the path condition expression of each path included in the second symbolic execution result. As an example of acquiring a test input value that satisfies the second path conditional expression, the second acquisition unit 2702 acquires a value that satisfies the second path conditional expression using a constraint solver. The acquired information is stored in a storage area such as the RAM 203 and the disk 205.

  The test input value determination unit 2703 determines whether or not the second conditional expression is true when the input value of the test case for testing the operation of the first path is given to the path conditional expression of the second path. to decide. Further, the test input value determination unit 2703 determines whether or not the first conditional expression is true when the test input value acquired by the second acquisition unit 2702 is given to the path conditional expression of the first path. You may judge.

  Also, the test input value determination unit 2703 gives the test input value of the test case to the path condition expression of each path included in the second symbolic execution result for each test case acquired by the first acquisition unit 2701. Then, the test input value determination unit 2703 may determine whether or not the path condition expression of each path included in the second symbolic execution result is true when the test input value is given.

  Also, the test input value determination unit 2703 gives the test input value to the path condition expression of each path included in the first symbolic execution result for each test input value acquired by the second acquisition unit 2702. Then, the test input value determination unit 2703 may determine whether or not the path condition expression of each path included in the first symbolic execution result is true when the test input value is given. A specific determination method will be described later with reference to FIG. Note that the determination result is stored in a storage area such as the RAM 203 or the disk 205.

  In the following case, the related information generation unit 2704 includes each path included in the second symbolic execution result in the first symbolic execution result corresponding to the input value for which the conditional expression of each path is true. First related information indicating that the path is related is generated. The case shown below is a case where the test input value determination unit 2703 determines that the conditional expression of each path included in the second symbolic execution result is true.

  Further, in the following case, the related information generation unit 2704 displays the first relation indicating that the path included in the second symbolic execution result that is true is related to the path included in the first symbolic execution result. Information may be generated. The case shown below is a case where the test input value determination unit 2703 determines that the conditional expression of each path included in the first symbolic execution result is true. A specific generation method will be described later with reference to FIG. The generated related information is stored in a storage area such as the RAM 203 and the disk 205.

  The specifying unit 2705 obtains a path conditional expression corresponding to the path included in the first symbolic execution result indicated by the first related information and a negative of the path conditional expression corresponding to each path included in the second symbolic execution result. Satisfiability is specified for each first related information. Furthermore, the specifying unit 2705 negates the path conditional expression corresponding to the path included in the first symbolic execution result indicated by the first related information and the path conditional expression corresponding to each path included in the second symbolic execution result. Is specified for each first related information.

  In addition, the specifying unit 2705 determines that the conditional expression corresponding to the path included in the first symbolic execution result indicated by the second related information and the negative of the path conditional expression corresponding to the path included in the second symbolic execution result. Satisfiability is specified for each second related information. Further, the specifying unit 2705 negates the conditional expression corresponding to the path included in the first symbolic execution result indicated by the second related information and the path conditional expression corresponding to the path included in the second symbolic execution result. Satisfiability is specified for each second related information. The generated related information is stored in a storage area such as the RAM 203 and the disk 205.

  The set creation unit 2706 excludes a set specified based on the specified result for each first related information from the set of the path included in the first symbolic execution result and the path included in the second symbolic execution result. Create the rest pair. The group identified based on the identification result for each first related information will be described later with reference to FIG. Information indicating the created set is stored in a storage area such as the RAM 203 or the disk 205.

  The path relation determination unit 2707 determines whether the second path is related to the first path based on the determination result by the test input value determination unit 2703. For example, the test input value determination unit 2703 determines that the second conditional expression is true when the input value of the test case for testing the operation of the first path is given to the path conditional expression of the second path. Suppose that At this time, the path relation determination unit 2707 determines that the second path is related to the first path.

  The path relation determination unit 2707 determines that the second path is not related to a path different from the first path in the path group included in the pre-change program PrePrg based on the specification result by the specification unit 2705. May be. For example, the specifying unit 2705 can satisfy the logical product of the negation of the path condition expression of the first path and the path condition expression of the second path, and the path condition expression of the first path and the second path condition expression Suppose that it is specified that the logical product of negating the path conditional expression of the path is not satisfactory. At this time, the path relation determination unit 2707 determines that the second path is not related to a path different from the first path in the path group included in the pre-change program PrePrg. Note that a pair of paths determined to be unrelated is a pair identified based on the identification result for each first related information described in the pair generation unit 2706.

  Further, the path relation determination unit 2707 determines, based on the specification result by the specification unit 2705, that a path different from the second path in the path group included in the post-change program PostPrg is not related to the first path. May be. For example, the specifying unit 2705 cannot satisfy the logical product of the negation of the path condition expression of the first path and the path condition expression of the second path, and the path condition expression of the first path and the second path condition expression Suppose that it is specified that the logical product with the negation of the path condition expression of the path can be satisfied. At this time, the path relation determination unit 2707 determines that the second path is not related to a path different from the first path in the path group included in the pre-change program PrePrg.

  In addition, for each remaining pair created by the pair creation unit 2706, the path relation determination unit 2707 includes each path included in the second execution result based on the following information in the first execution result. It may be determined whether or not each path is related. The following information is the satisfiability of the conditional expression of each path included in the first symbolic execution result and each path included in the second symbolic execution result. Note that the determination result is stored in a storage area such as the RAM 203 or the disk 205.

  In the following case, the related information creation unit 2708 creates second related information indicating that each path included in the second symbolic execution result is related to each path included in the first symbolic execution result. The following cases are cases where the path relation determination unit 2707 determines that each path included in the second symbolic execution result is related to each path included in the first execution result. The created second related information is stored in a storage area such as the RAM 203 or the disk 205.

  The formula determination unit 2709 determines whether the path output formula included in the first symbolic execution result matches the path output formula included in the acquired second symbolic execution result. The formula determination unit 2709 compares each combination included in each path included in the first symbolic execution result and each path included in the second symbolic execution result. The mathematical expression determination unit 2709 also includes a first path output mathematical expression and a second path indicated by the first related information generated by the related information generation unit 2704 and the second related information generated by the related information generation unit 2708. The output formula may be compared. The comparison result is stored in a storage area such as the RAM 203 or the disk 205.

  The generation determination unit 2710 determines whether or not to generate a test case for testing the operation of each path included in the second execution result, based on the following information. The following information includes the identification result for each first related information and the identification result for each second related information by the specifying unit 2705, each path included in the first execution result by the mathematical expression determination unit 2709, and the second It is the determination result for each set of combinations with each path included in the execution result. Note that the determination result is stored in a storage area such as the RAM 203 or the disk 205.

  FIG. 28 is an explanatory diagram illustrating an example of a result of associating paths before and after the change in the second embodiment. Table 2801 shows the path conditional expression and test input value of the pre-change program PrePrg. The table 2801 includes records 2801-1 to 2801-3. Table 2802 shows the path conditional expression and the test input value of the post-change program PostPrg. The table 2802 includes records 2802-1 to 2802-4. Tables 2801 and 2802 have four fields: a path ID, an input variable, a test input value, and a path conditional expression.

  The test case generation device 2700 gives the test input value of each path of the pre-change program PrePrg to the path conditional expression PostPC of the post-change program PostPrg. When the path conditional expression to which the value is given becomes true, the test case generation device 2700 associates the corresponding path Pre with the path Post corresponding to the given path conditional expression PostPC, and sets it as related information. Note that the test input value of each path of the pre-change program PrePrg is generated when the pre-change program is tested, and need not be prepared again in order to execute the present embodiment.

  Further, the test case generation device 2700 gives the test input value of each path of the post-change program PostPrg to the path conditional expression PrePC of the pre-change program PrePrg. When the path conditional expression to which the value is given becomes true, the test case generation device 2700 associates the corresponding path Post with the path Pre corresponding to the given path conditional expression PostPC, and sets it as related information. Note that the test input value of each path of the post-change program PostPrg can be generated by using a constraint solver. Regarding the calculation of the test input value by the constraint solver at this time, since the conditional expression is not a logical product, the processing amount is not large, and the time required for the calculation is short.

  For example, the test case generation device 2700 gives the Pre1 test input value “0” to each of the Post1 path condition expression to the Post4 path condition expression. In the example of FIG. 28, since it becomes true when X = 0 is given to Post1PC, the test case generation device 2700 generates related information having Pre1 and Post1 as the test case group number 1.

  As a result of generating the related information, FIG. 28 shows a path correlation result 2803. The path association result 2803 has the same fields as the path association result 1001. The path association result 2803 includes records 2803-1 to 2803-5. Here, in the association procedure shown in FIG. 28, the association information between Pre3 and Post3 indicated by the record 1001-3 of the path association result 1001 cannot be generated. The procedure for detecting and generating the related information between Pre3 and Post3 will be described later with reference to FIG.

  FIG. 29 is an explanatory diagram of an example of the classification result of the path conditional expression change type in the second embodiment. In FIG. 29, the test condition generation device 2700 shows a path condition expression change type result 2901 that is a result of classifying the path condition expression change type of the related information in accordance with the path condition expression change type classification procedure shown in FIG. . The path conditional expression change type result 2901 has records 2901-1 to 2901-5. Since each field of the path conditional expression change type result 2901 is the same as the path conditional expression change type result 1201, description thereof will be omitted.

  FIG. 30 is an explanatory diagram illustrating an example of a procedure for creating a path association before and after an ungenerated change. In FIG. 30, a procedure for generating related information by detecting path association before and after an ungenerated change using the path conditional expression change type result 2901 obtained from FIG. 29 will be described.

  A table 3001 shows combinations of Pre1PC to Pre3PC and Post1PC to Post4PC. First, Pre1PC to Pre3PC have an exclusive relationship. Similarly, Post1PC to Post4PC also have an exclusive relationship. Further, the test case generation device 2700 determines satisfiability with respect to the remaining group obtained by removing the group specified from the path conditional expression change type result 2901. For example, for the records 2901-2 and 2901-4 whose path conditional expression change type indicates “duplicate”, it is clear that the combinations that have already become test case pairs can be satisfied, so the constraint solver is used. You don't have to.

  For example, from the record 2901-1 in which the path conditional expression change type indicates “expanded”, Post1PC has a relationship of expanding Pre1PC, so Pre1PC is not related to Post2PC to Post4PC. Therefore, it is clear that the satisfiability of Pre1PC∧Post2PC, the satisfiability of Pre1PC∧Post3PC, and the satisfiability of Pre1PC∧Post4PC are all unsatisfiable. Thereby, as indicated by the arrow (1) in the table 3001, it is not necessary to determine the satisfiability by the constraint solver between Pre1PC and Post1PC to Post4PC.

  Further, from the record 2901-3 in which the path conditional expression change type indicates “reduction”, Post2PC has a relationship of reduction of Pre2PC, so that Post2PC is not related to Pre1PC and Pre3PC. Therefore, it is clear that the satisfiability of Pre2PC∧Post1PC and the satisfiability of Pre2PC∧Post3PC are all unsatisfiable. As a result, as indicated by the arrow (2) in the table 3001, it is not necessary to determine the satisfiability by the constraint solver between Post2PC and Pre1PC to Pre3PC.

  Furthermore, from the record 2901-5 in which the path conditional expression change type indicates “reduction”, Post4PC has a relationship of reduction of Pre3PC, so that Post4PC is not related to Pre1PC and Pre2PC. Therefore, it is clear that the satisfiability of Pre1PC∧Post4PC and the satisfiability of Pre2PC∧Post4PC are all unsatisfiable. As a result, as indicated by the arrow (3) in the table 3001, determination of satisfiability by the constraint solver between Post4PC and Pre1PC to Pre3PC does not have to be performed.

  As described above, combinations that have not been determined whether or not they can be satisfied are Pre3PC∧Post1PC and Pre3PC∧Post3PC with hatching in Table 3001. The test case generation apparatus 2700 uses the constraint solver to determine the satisfaction of Pre3PC∧Post1PC and the satisfaction of Pre3PC∧Post3PC. As a result of the determination, Pre3PC∧Post1PC becomes unsatisfiable and Pre3PC 可能 Post3PC becomes unsatisfactory. Therefore, the test case generation device 2700 creates related information between Pre3PC and Post3PC, and classifies the path conditional expression change type.

  Although not shown in FIG. 30, when there is a certain PrePC and a certain PostPC whose path conditional expression change type is “invariant”, there is no relation between a certain PrePC and another PostPC, It is not related to a certain PostPC. Therefore, it is clear that the satisfaction of a certain PrePC∧other PostPC and the other PrePC∧PostPC are all unsatisfiable, and it is not necessary to use a constraint solver. Further, in the above description, the group to be removed is shown when the path conditional expression change type is “invariant”, “enlarge”, “reduce”, and “duplicate”. It may be at least one of “reduction” and “overlap”.

  Here, the number of executions of the constraint solver in the first embodiment is compared with the number of executions of the constraint solver in the second embodiment. The constraint solver in the first embodiment has a possibility of satisfying the conditional expression (1) performed when the paths before and after the change are associated and the conditional expressions (2-1) and (2-2) for the created related information. Used for judgment. Specifically, the test case generation device 2700 uses the constraint solver 3 × 4 = 12 [times] in the determination of the satisfiability of the conditional expression (1), and the conditional expression (2 −1) and 6 × 2 = 12 [times] are used to determine the satisfaction of the conditional expression (2-2). From the above, the total number of times the constraint solver is used in Embodiment 1 is 12 + 12 = 24 [times].

  On the other hand, the constraint solver in the second embodiment is created with the conditional expressions (2-1) and (2-2) for the related information generated using the test input values, and the conditional expression (1) for the remaining set. It is used to determine whether or not the conditional expressions (2-1) and (2-2) for the related information are satisfied. Specifically, the test case generation device 2700 uses the constraint solver 5 × 2 = 10 [times] to determine the satisfaction of the conditional expressions (2-1) and (2-2) for the generated related information. To do. Then, the test case generation device 2700 uses the constraint solver 2 times to determine the satisfaction of the conditional expression (1) for the remaining set, and the conditional expression (2-1) for the created related information, 1 × 2 = 2 [times] is used to determine the sufficiency of (2-2). From the above, the total number of times the constraint solver is used in Embodiment 2 is 10 + 2 + 2 = 14 [times].

  Therefore, the total number of times the constraint solver is used in the second embodiment is 10 times less than the total number of times the constraint solver is used in the first embodiment. Next, a flowchart of the test case generation process according to the second embodiment will be described with reference to FIGS.

  FIG. 31 is a flowchart (part 1) illustrating an example of a test case generation processing procedure according to the second embodiment. FIG. 32 is a flowchart (part 2) illustrating an example of a test case generation processing procedure according to the second embodiment.

  The test case generation device 2700 acquires symbolic execution results of the pre-change program PrePrg and the post-change program PostPrg (step S3101). Next, the test case generation device 2700 acquires a test input value from the test case of the pre-change program PrePrg (step S3102). Subsequently, the test case generation device 2700 generates a test input value by giving the path condition expression of the post-change program PostPrg to the constraint solver (step S3103). Next, the test case generation device 2700 executes a before / after change path association process based on the test input value (step S3104). Details of the path association process before and after the change based on the test input value will be described later with reference to FIG. In addition, it is assumed that L1 pieces of related information are created by the path association process before and after the change based on the test input value.

  Subsequently, the test case generation device 2700 substitutes 1 for i (step S3105). Next, the test case generation device 2700 compares the path condition expressions of the i-th related information as character strings (step S3106). Subsequently, the test case generation device 2700 determines whether or not the comparison result indicates that the character strings match (step S3107).

  If the comparison result indicates that the character strings match (step S3107: YES), the test case generation device 2700 identifies the change type of the path condition expression of the i-th related information as “invariant” (step S3108). When the comparison result indicates that the character strings do not match (step S3107: NO), the test case generation device 2700 executes the path condition expression change type specifying process for the i-th related information (step S3109).

  After the process of step S3108 or step S3109 is completed, the test case generation device 2700 substitutes i + 1 for i (step S3110). Next, the test case generation device 2700 determines whether i is greater than L1 (step S3111). When i is L1 or less (step S3111: No), the test case generation device 2700 proceeds to the process of step S3106.

  When i is larger than L1 (step S3111: Yes), the test case generation device 2700 executes an undetected pre-change path association process (step S3112). Details of the undetected before-and-after-change path association processing will be described later with reference to FIG. In addition, it is assumed that L2 pieces of related information are created by the undetected before and after change path association processing. Also, L1 + L2 is the same value as the number L of related information created in FIG. After the process of step S3112 is completed, the test case generation device 2700 executes the process of step S3201 shown in FIG.

  After the process of step S3112 ends, the test case generation device 2700 substitutes 1 for i (step S3201). Next, the test case generation device 2700 executes a path conditional expression change type classification process on the i-th related information among the newly added L2 related information (step S3202). Subsequently, the test case generation device 2700 substitutes i + 1 for i (step S3203). Next, the test case generation device 2700 determines whether i is greater than L2 (step S3204). When i is L2 or less (step S3204: NO), the test case generation device 2700 proceeds to the process of step S3202. When i is larger than L2 (step S3204: Yes), the test case generation device 2700 substitutes 1 for i (step S3205).

  Next, the test case generation device 2700 executes a path output formula change type classification process for the i-th related information among the L1 + L2 pieces of related information (step S3206). Subsequently, the test case generation device 2700 performs a test case classification process on the i-th related information among the L1 + L2 pieces of related information (step S3207). Next, the test case generation device 2700 substitutes i + 1 for i (step S3208). Subsequently, the test case generation device 2700 determines whether i is larger than L1 + L2 (step S3209). If i is equal to or smaller than L1 + L2 (step S3209: NO), the test case generation device 2700 proceeds to the process of step S3206.

  When i is larger than L1 + L2 (step S3209: Yes), the test case generation device 2700 outputs a test case classification result (step S3210). Next, the test case generation device 2700 executes test case test input value generation processing (step S3211). Subsequently, the test case generation device 2700 outputs the test case that generated the test input value (step S3212).

  After the end of step S3212, the test case generation device 2700 ends the test case generation process in the second embodiment. By executing the test case generation process in the second embodiment, the test case generation apparatus 2700 can generate a test case for testing the operation of the post-change program PostPrg. Furthermore, by executing the test case generation process in the second embodiment, the test case generation apparatus 2700 can reduce the number of executions of the constraint solver compared to the test case generation process in the second embodiment.

  FIG. 33 is a flowchart illustrating an example of a pre-change path association processing procedure based on a test input value. The path association process before and after the change by the test input value is a process for generating related information by detecting related paths using the test input value. In FIG. 33, the i-th path of the pre-change program PrePrg is expressed as Pre (i), the conditional expression of the i-th path is expressed as PrePC (i), and the i-th path is tested. The input value is expressed as PreIn (i). Similarly, the kth path of the post-change program PostPrg is expressed as Post (k), the conditional expression of the kth path is expressed as PostPC (k), and the input value of the test case for testing the kth path Is expressed as PostIn (k).

  The test case generation device 2700 substitutes 1 for i and substitutes 1 for k (step S3301). Next, the test case generation device 2700 determines whether PostPC (k) given PreIn (i) is true (step S3302). When PostPC (k) given PreIn (i) is true (step S3302: Yes), the test case generation device 2700 generates related information using Pre (i) and Post (k) as a test case group. (Step S3303).

  After the processing of step S3303 or when PostPC (k) given PreIn (i) becomes false (step S3302: No), the test case generation device 2700 gives PrePC (i) given PostIn (k). Is determined to be true (step S3304). When PrePC (i) given PostIn (k) is true (step S3304: Yes), the test case generation device 2700 generates related information using Pre (i) and Post (k) as a test case group. (Step S3305).

  After the processing of step S3305 is completed, or when PrePC (i) given PostIn (k) becomes false (step S3304: No), the test case generation device 2700 substitutes k + 1 for k (step S3306). Next, the test case generation device 2700 determines whether k is greater than N (step S3307). When k is N or less (step S3307: No), the test case generation device 2700 proceeds to the process of step S3302. When k is larger than N (step S3307: Yes), the test case generation device 2700 substitutes i + 1 into i and substitutes 1 into k (step S3308). Next, the test case generation device 2700 determines whether i is greater than M (step S3309).

  When i is M or less (step S3309: No), the test case generation device 2700 proceeds to the process of step S3302. When i is larger than M (step S3309: Yes), the test case generation device 2700 outputs related information (step S3310). After the process of step S3310 ends, the test case generation device 2700 ends the pre-change path association process using the test input value. By executing the before-and-after-change path association processing based on the test input value, the test case generation apparatus 2700 can create the related information without using the constraint solver.

  FIG. 34 is a flowchart illustrating an example of an undetected before / after change path association processing procedure. The undetected pre-change path association process is a process of generating related information by detecting related information that has not been detected by the test case association process based on the test input value. In FIG. 34, the i-th path of the pre-change program PrePrg is expressed as Pre (i), and the conditional expression of the i-th path is expressed as PrePC (i). Similarly, the kth path of the post-change program PostPrg is expressed as Post (k), and the conditional expression of the kth path is expressed as PostPC (k).

  The test case generation device 2700 substitutes 1 for i (step S3401). Next, the test case generation apparatus 2700 determines whether PrePC (i) is in the “invariant” or “enlarged” relationship with any of PostPC (k), k = 1,..., N (step S3402). . If PrePC (i) is not “invariant” or “enlarged” with any of PostPC (k), k = 1,..., N (step S3402: No), the test case generation apparatus 2700 sets 1 to k. Substitute (step S3403).

  Next, the test case generation apparatus 2700 uses a variable j for scanning PrePC from the beginning to the end, and any of PrePC (j), j = 1,. It is determined whether the relationship is “reduction” or “reduction” (step S3404). If any of PrePC (j), j = 1,..., M is not in the “invariant” or “reduced” relationship with PostPC (k) (step S3404: No), the test case generation device 2700 uses Pre (i ) And Post (k) are already determined as test case pairs (step S3405). If Pre (i) and Post (k) are not already a test case pair (step S3405: No), the test case generation device 2700 determines whether PrePC (i) ∧PostPC (k) can be satisfied (step). S3406).

  If PrePC (i) ∧PostPC (k) is satisfiable (step S3406: YES), the test case generation device 2700 creates related information that uses Pre (i) and Post (k) as a test case group. (Step S3407).

  After execution of step S3407 or when PrePC (i) ∧PostPC (k) is not satisfiable (step S3406: No), the test case generation device 2700 substitutes k + 1 for k (step S3408). Further, if any of PrePC (j), j = 1,..., M has a relationship of “invariant” or “reduction” with PostPC (k) (step S3404: Yes), Pre (i) and Post ( If k) is already a test case group (step S3405: YES), the test case generation device 2700 executes the process of step S3408.

  After the process of step S3408 is completed, the test case generation device 2700 determines whether k is greater than N (step S3409). When k is N or less (step S3409: No), the test case generation device 2700 proceeds to the process of step S3404.

  When PrePC (i) has a relationship of “invariant” or “enlargement” with any of PostPC (k), k = 1,..., N (step S3402: Yes), or when k is larger than N (step (S3409: Yes), the test case generation device 2700 substitutes i + 1 into i (step S3410). Next, the test case generation device 2700 determines whether i is greater than M (step S3411).

  When i is M or less (step S3411: NO), the test case generation device 2700 proceeds to the process of step S3402. When i is larger than M (step S3411: Yes), the test case generation device 2700 adds the generated related information as new related information (step S3412). After the process of step S3412 is completed, the test case generation device 2700 ends the undetected pre-change path association process. By executing the undetected pre-change path association process, the test case generation device 2700 can detect related information that has not been detected by the pre-change path association process using the test input value.

  As described above, according to the test case generation device 2700, related information may be created using a test input value. Thereby, the test case generation device 2700 can create related information without using the constraint solver, and can reduce the number of times the constraint solver is executed.

  Further, according to the test case generation device 2700, a combination identified from the combination of each path included in the pre-change program PrePrg and each path included in the post-change program PostPrg from the path condition expression change type of the related information. Remove. Subsequently, the test case generation apparatus 2700 may determine whether or not each path included in the pre-change program PrePrg and each path included in the post-change program PostPrg are related to the removed remaining set. . Thereby, the test case generation device 2700 can specify the related information with a number of times smaller than the number of times that the test case generation device 100 uses the constraint solver.

  Note that the test case generation method described in the present embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. The test case generation program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed by being read from the recording medium by the computer. The test case generation program may be distributed via a network such as the Internet.

  The following additional notes are disclosed with respect to the first and second embodiments described above.

(Supplementary note 1)
The input variable which becomes a condition for executing the first pass included in the first program out of the possible values of the input variable included in the first program by performing symbolic execution of the first program A first execution result including a first conditional expression representing the value of the first expression and a first mathematical expression representing an output variable included in the first program that is output when the first pass is executed Get
Conditions for executing a second pass included in the second program among possible values of the input variable by executing symbolically the second program in which a part of the first program is changed A second conditional expression representing the value of the input variable, and a second mathematical expression representing an output variable included in the second program that is output when the second pass is executed. Get the second execution result,
Of the possible values of the input variable, based on the presence or absence of a value that makes the logical product of the acquired first conditional expression and the acquired second conditional expression true, the second path is Determine if it is related to the first pass,
Determining whether the acquired first mathematical formula and the acquired second mathematical formula match,
Determining whether to generate a test case for testing the operation of the second path based on the determination result and the determination result;
A test case generation method characterized by executing processing.

(Appendix 2) The computer
If it is determined that a test case for testing the operation of the second path should be generated, the value of the input variable that makes the second conditional expression true is calculated;
Generating a test case for testing the operation of the second pass using the calculated value as the value of the input variable;
The test case generation method according to attachment 1, wherein the process is executed.

(Supplementary note 3)
When it is determined that the second path is related to the first path, and the first mathematical expression and the second mathematical expression match, the first of the possible values of the input variable The presence or absence of a value that is true of the logical product of the conditional expression 1 and the negation of the second conditional expression, and the negation of the first conditional expression and the first Execute the process of specifying the presence or absence of a value that is the logical product of the conditional expression 2 and
The process of determining whether to generate the test case is as follows:
3. The test case generation method according to appendix 1 or 2, wherein it is determined whether or not a test case for testing the operation of the second path should be generated based on a specific result.

(Appendix 4) The computer
When it is determined that the second path is related to the first path, and the first mathematical expression and the second mathematical expression match, the first of the possible values of the input variable Specifying the presence or absence of a value that is the logical product of the negation of the conditional expression 1 and the second conditional expression,
The process of determining whether to generate the test case is as follows:
When it is specified that there is a value that is the logical product of the negation of the first conditional expression and the second conditional expression, a test case for testing the operation of the second pass should be generated. Judgment,
The calculation process is as follows:
If it is determined that a test case for testing the operation of the second path should be generated, the input variable that is the logical product of the negation of the first conditional expression and the second conditional expression is true. The test case generation method according to appendix 2, wherein a value is calculated.

(Supplementary Note 5)
Based on whether or not the second conditional expression is true when an input value of a test case for testing the operation of the first path is given to the conditional expression of the second path, The test case generation method according to any one of appendices 1 to 4, wherein it is determined whether or not the path is related to the first path.

(Appendix 6) The computer
If it is determined that the second path is related to the first path, the logical product of the first conditional expression and the negation of the second conditional expression among the possible values of the input variable is true. Specifying the presence or absence of a value to be determined, and specifying the presence or absence of a value that makes the logical product of the negation of the first conditional expression and the second conditional expression out of the possible values of the input variable,
Determining that the second path is not related to a path different from the first path in the path group included in the first program based on the specific result;
The test case generation method according to any one of appendices 1 to 5, wherein the process is executed.

(Supplementary note 7)
If it is determined that the second path is related to the first path, the logical product of the first conditional expression and the negation of the second conditional expression among the possible values of the input variable is true. Specifying the presence or absence of a value to be determined, and specifying the presence or absence of a value that makes the logical product of the negation of the first conditional expression and the second conditional expression out of the possible values of the input variable,
Based on the specific result, it is determined that a path different from the second path in the path group included in the second program is not related to the first path.
The test case generation method according to any one of appendices 1 to 6, wherein the process is executed.

(Additional remark 8) The conditional expression showing the value of the said input variable used as the condition for each said path | pass being executed among the values which the said input variable can take, and the said output when each said path | pass is performed A mathematical expression representing an output variable included in the first program,
The computer is
For each pair of the path and the second path included in the first execution result, the logical product of the conditional expression of the path and the second conditional expression among the possible values of the input variable is true. Performing a process of determining whether the second path is related to the path based on the presence of a value of
The process of determining the formula is as follows:
For each set, it is determined whether the mathematical expression included in the acquired first execution result matches the acquired second mathematical expression;
The process of determining whether to generate the test case is as follows:
Any one of appendices 1 to 4, wherein it is determined whether or not a test case for testing the operation of the second path should be generated based on the determination information for each set and the determination result for each set. The test case generation method according to any one of the above.

(Supplementary Note 9) The second execution result is a condition for executing each of the paths that can be taken by the input variable for each path of the path group included in the second program. A conditional expression representing the value of the input variable, and a mathematical expression representing an output variable included in the second program that is output when each of the passes is executed,
The determination process is as follows:
A condition of the path included in the first execution result among the possible values of the input variable for each set of the path included in the first execution result and each path included in the second execution result. The path included in the second execution result is related to the path included in the first execution result based on the presence / absence of a value that makes the logical product of the expression and the path included in the second execution result true. Decide whether or not to
The process of determining the formula is as follows:
For each set of combinations of each path included in the first execution result and each path included in the second execution result, the mathematical expression included in the acquired first execution result, and the acquired second It is determined whether or not the mathematical expression included in the execution result of
The process of determining whether to generate the test case is as follows:
Determining whether to generate a test case for testing the operation of a path included in the second execution result based on the determination result for each set and the determination result for each set; The test case generation method according to appendix 8.

(Supplementary Note 10) Conditions for executing the first pass included in the first program out of the possible values of the input variable included in the first program by executing the first program symbolically. A first conditional expression that represents the value of the input variable and a first mathematical expression that represents the output variable included in the first program that is output when the first pass is executed. A first acquisition unit that acquires an execution result of 1;
Conditions for executing a second pass included in the second program among possible values of the input variable by executing symbolically the second program in which a part of the first program is changed A second conditional expression representing the value of the input variable, and a second mathematical expression representing an output variable included in the second program that is output when the second pass is executed. A second acquisition unit for acquiring a second execution result;
Of the possible values of the input variable, the logical product of the first conditional expression acquired by the first acquisition unit and the second conditional expression acquired by the second acquisition unit is true. A path-related determination unit that determines whether the second path is related to the first path based on the presence or absence of a value;
A formula determination unit that determines whether or not the first formula acquired by the first acquisition unit matches the second formula acquired by the second acquisition unit;
A generation determination unit that determines whether to generate a test case for testing the operation of the second path, based on a determination result by the path relation determination unit and a determination result by the formula determination unit;
A test case generation device characterized by comprising:

(Supplementary Note 11) Conditions for executing the first pass included in the first program among the possible values of the input variable included in the first program by performing symbolic execution of the first program A first conditional expression that represents the value of the input variable and a first mathematical expression that represents the output variable included in the first program that is output when the first pass is executed. A first acquisition unit that acquires an execution result of 1;
Conditions for executing a second pass included in the second program among possible values of the input variable by executing symbolically the second program in which a part of the first program is changed A second conditional expression representing the value of the input variable, and a second mathematical expression representing an output variable included in the second program that is output when the second pass is executed. A second acquisition unit for acquiring a second execution result;
Of the possible values of the input variable, the logical product of the first conditional expression acquired by the first acquisition unit and the second conditional expression acquired by the second acquisition unit is true. A path-related determination unit that determines whether the second path is related to the first path based on the presence or absence of a value;
A formula determination unit that determines whether or not the first formula acquired by the first acquisition unit matches the second formula acquired by the second acquisition unit;
A generation determination unit that determines whether or not to generate a test case for testing the operation of the second path based on a determination result by the path relation determination unit and a determination result by the formula determination unit;
A test case generation apparatus including a computer having

(Supplementary note 12)
The input variable which becomes a condition for executing the first pass included in the first program out of the possible values of the input variable included in the first program by performing symbolic execution of the first program A first execution result including a first conditional expression representing the value of the first expression and a first mathematical expression representing an output variable included in the first program that is output when the first pass is executed Get
Conditions for executing a second pass included in the second program among possible values of the input variable by executing symbolically the second program in which a part of the first program is changed A second conditional expression representing the value of the input variable, and a second mathematical expression representing an output variable included in the second program that is output when the second pass is executed. Get the second execution result,
Of the possible values of the input variable, based on the presence or absence of a value that makes the logical product of the acquired first conditional expression and the acquired second conditional expression true, the second path is Determine if it is related to the first pass,
Determining whether the acquired first mathematical formula and the acquired second mathematical formula match,
Determining whether to generate a test case for testing the operation of the second path based on the determination result and the determination result;
A test case generation program characterized by causing a process to be executed.

(Supplementary note 13) Conditions for executing the first pass included in the first program out of the possible values of the input variables included in the first program by performing symbolic execution of the first program A first conditional expression that represents the value of the input variable and a first mathematical expression that represents the output variable included in the first program that is output when the first pass is executed. Get the execution result of 1,
Conditions for executing a second pass included in the second program among possible values of the input variable by executing symbolically the second program in which a part of the first program is changed A second conditional expression representing the value of the input variable, and a second mathematical expression representing an output variable included in the second program that is output when the second pass is executed. Get the second execution result,
Of the possible values of the input variable, based on the presence or absence of a value that makes the logical product of the acquired first conditional expression and the acquired second conditional expression true, the second path is Determine if it is related to the first pass,
Determining whether the acquired first mathematical formula and the acquired second mathematical formula match,
Determining whether to generate a test case for testing the operation of the second path based on the determination result and the determination result;
A recording medium on which a test case generation program for causing a computer to execute processing is recorded.

100, 2700 Test case generation device 701, 801 Symbolic execution result 901, 2701 First acquisition unit 902, 2702 Second acquisition unit 903, 2707 Path related determination unit 904, 2708 Related information creation unit 905, 2705 Identification unit 906, 2709 Formula Determination unit 907, 2710 Generation determination unit 908 Calculation unit 909 Test case generation unit 2703 Test input value determination unit 2704 Related information generation unit 2706 Set generation unit

Claims (9)

Computer
The input variable which becomes a condition for executing the first pass included in the first program out of the possible values of the input variable included in the first program by performing symbolic execution of the first program A first execution result including a first conditional expression representing the value of the first expression and a first mathematical expression representing an output variable included in the first program that is output when the first pass is executed Get
Conditions for executing a second pass included in the second program among possible values of the input variable by executing symbolically the second program in which a part of the first program is changed A second conditional expression representing the value of the input variable, and a second mathematical expression representing an output variable included in the second program that is output when the second pass is executed. Get the second execution result,
Of the possible values of the input variable, based on the presence or absence of a value that makes the logical product of the acquired first conditional expression and the acquired second conditional expression true, the second path is Determine if it is related to the first pass,
Determining whether the acquired first mathematical formula and the acquired second mathematical formula match,
Determining whether to generate a test case for testing the operation of the second path based on the determination result and the determination result;
A test case generation method characterized by executing processing. The computer is
If it is determined that a test case for testing the operation of the second path should be generated, the value of the input variable that makes the second conditional expression true is calculated;
Generating a test case for testing the operation of the second pass using the calculated value as the value of the input variable;
The test case generation method according to claim 1, wherein the process is executed. The computer is
When it is determined that the second path is related to the first path, and the first mathematical expression and the second mathematical expression match, the first of the possible values of the input variable The presence or absence of a value that is true of the logical product of the conditional expression 1 and the negation of the second conditional expression, and the negation of the first conditional expression and the first Execute the process of specifying the presence or absence of a value that is the logical product of the conditional expression 2 and
The process of determining whether to generate the test case is as follows:
The test case generation method according to claim 1, wherein it is determined whether or not a test case for testing the operation of the second path should be generated based on a specific result. The computer is
When it is determined that the second path is related to the first path, and the first mathematical expression and the second mathematical expression match, the first of the possible values of the input variable Specifying the presence or absence of a value that is the logical product of the negation of the conditional expression 1 and the second conditional expression,
The process of determining whether to generate the test case is as follows:
When it is specified that there is a value that is the logical product of the negation of the first conditional expression and the second conditional expression, a test case for testing the operation of the second pass should be generated. Judgment,
The calculation process is as follows:
If it is determined that a test case for testing the operation of the second path should be generated, the input variable that is the logical product of the negation of the first conditional expression and the second conditional expression is true. The test case generation method according to claim 2, wherein a value is calculated. The determination process is as follows:
Based on whether or not the second conditional expression is true when an input value of a test case for testing the operation of the first path is given to the conditional expression of the second path, 5. The test case generation method according to claim 1, wherein it is determined whether or not the first path is related to the first path. The computer is
If it is determined that the second path is related to the first path, the logical product of the first conditional expression and the negation of the second conditional expression among the possible values of the input variable is true. Specifying the presence or absence of a value to be determined, and specifying the presence or absence of a value that makes the logical product of the negation of the first conditional expression and the second conditional expression out of the possible values of the input variable,
Determining that the second path is not related to a path different from the first path in the path group included in the first program based on the specific result;
6. The test case generation method according to claim 1, wherein the process is executed. The computer is
If it is determined that the second path is related to the first path, the logical product of the first conditional expression and the negation of the second conditional expression among the possible values of the input variable is true. Specifying the presence or absence of a value to be determined, and specifying the presence or absence of a value that makes the logical product of the negation of the first conditional expression and the second conditional expression out of the possible values of the input variable,
Based on the specific result, it is determined that a path different from the second path in the path group included in the second program is not related to the first path.
The test case generation method according to claim 1, wherein the process is executed. The input variable which becomes a condition for executing the first pass included in the first program out of the possible values of the input variable included in the first program by performing symbolic execution of the first program A first execution result including a first conditional expression representing the value of the first expression and a first mathematical expression representing an output variable included in the first program that is output when the first pass is executed A first acquisition unit for acquiring
Conditions for executing a second pass included in the second program among possible values of the input variable by executing symbolically the second program in which a part of the first program is changed A second conditional expression representing the value of the input variable, and a second mathematical expression representing an output variable included in the second program that is output when the second pass is executed. A second acquisition unit for acquiring a second execution result;
Of the possible values of the input variable, the logical product of the first conditional expression acquired by the first acquisition unit and the second conditional expression acquired by the second acquisition unit is true. A path-related determination unit that determines whether the second path is related to the first path based on the presence or absence of a value;
A formula determination unit that determines whether or not the first formula acquired by the first acquisition unit matches the second formula acquired by the second acquisition unit;
A generation determination unit that determines whether or not to generate a test case for testing the operation of the second path based on a determination result by the path relation determination unit and a determination result by the formula determination unit;
A test case generation device characterized by comprising: On the computer,
The input variable which becomes a condition for executing the first pass included in the first program out of the possible values of the input variable included in the first program by performing symbolic execution of the first program A first execution result including a first conditional expression representing the value of the first expression and a first mathematical expression representing an output variable included in the first program that is output when the first pass is executed Get
Conditions for executing a second pass included in the second program among possible values of the input variable by executing symbolically the second program in which a part of the first program is changed A second conditional expression representing the value of the input variable, and a second mathematical expression representing an output variable included in the second program that is output when the second pass is executed. Get the second execution result,
Of the possible values of the input variable, based on the presence or absence of a value that makes the logical product of the acquired first conditional expression and the acquired second conditional expression true, the second path is Determine if it is related to the first pass,
Determining whether the acquired first mathematical formula and the acquired second mathematical formula match,
Determining whether to generate a test case for testing the operation of the second path based on the determination result and the determination result;
A test case generation program characterized by causing a process to be executed.

Images