JP2018124654A - Determination program and determination method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a determination program and a determination method which can reduce an amount of work of a user.SOLUTION: A determination program reads a source code as an object of a unit test S1, extracts conditional branching contained in the source code S2, determines a setting value of a variable substituted when the unit test is performed, based on a combination of a value that can be taken by a variable contained in a conditional expression of the conditional branching, and a result of determination of the conditional expression S3, and outputs the determined setting value S4.SELECTED DRAWING: Figure 1

Description

  The present invention relates to a determination program and a determination method.

  Conventionally, as a method for inspecting whether or not a created source code operates correctly, single unit inspection for inspecting each unit of source code is known. In the unit inspection, for example, the source code to be inspected is executed for each test item using the test data to inspect the source code for defects.

  For example, as a method for extracting test items to be performed in source code, a method is known in which a conditional branch of the source code is extracted, and both correct and incorrect conditions of the extracted conditional branch are decomposed into expressions representing only program input variables. .

JP-A-5-210537

  However, in the conventional method, both right and wrong conditions of the conditional branch are represented by program input variables, and therefore the user needs to set a value to be substituted for the program input variable. For example, as the size of the source code increases and the number of variables to be set by the user increases, the amount of work for the user increases.

  The present invention has been made in view of the above, and an object of the present invention is to provide a determination program and a determination method that can reduce the amount of work of a user.

  In order to solve the above-described problems and achieve the object, the determination program according to the present invention causes a computer to execute a procedure for reading a source code that is an object of a unit inspection. Further, the determination program causes the computer to execute a procedure for extracting a conditional branch included in the source code. Further, the determination program uses a computer to determine a setting value of a variable to be substituted when performing a single inspection based on a combination of a possible value of a variable included in the conditional expression of the conditional branch and a determination result of the conditional expression. To run. Further, the determination program causes the computer to execute a procedure for outputting the determined setting value.

  According to the present invention, it is possible to reduce a user's workload.

FIG. 1 is a diagram illustrating a determination method according to the embodiment. FIG. 2 is a block diagram illustrating a configuration of the inspection apparatus according to the embodiment. FIG. 3 is a diagram illustrating an example of source code according to the embodiment. FIG. 4 is a diagram illustrating variable information according to the embodiment. FIG. 5A is a diagram illustrating an example of a combination table generated by the combination generation unit according to the embodiment. FIG. 5B is a diagram illustrating a setting value table generated by the deduplication unit according to the embodiment. FIG. 6 is a diagram illustrating an example of a combination table generated by the combination generation unit according to the embodiment. FIG. 7A is a diagram illustrating an example of a combination table generated by the combination generation unit according to the embodiment. FIG. 7B is a diagram illustrating an example of a setting value table generated by the duplication removal unit according to the embodiment. FIG. 8A is a diagram illustrating an example of source code according to the embodiment. FIG. 8B is a diagram illustrating an example of a combination table generated by the combination generation unit according to the embodiment. FIG. 9 is a diagram illustrating an example of source code according to the embodiment. FIG. 10 is a diagram illustrating an example of source code according to the embodiment. FIG. 11A is a diagram illustrating an example of source code according to the embodiment. FIG. 11B is a diagram illustrating an example of a combination table generated by the combination generation unit according to the embodiment. FIG. 11C is a diagram illustrating an example of a table generated by the deduplication unit according to the embodiment. FIG. 11D is a diagram illustrating an example of a table generated by the deduplication unit according to the embodiment. FIG. 11E is a diagram illustrating an example of a setting value table generated by the duplication removal unit according to the embodiment. FIG. 12 is a flowchart illustrating a processing procedure of determination processing executed by the inspection apparatus according to the embodiment. FIG. 13 is a diagram illustrating an example of a combination table generated by the combination generation unit according to the modification of the embodiment.

  Hereinafter, embodiments of a determination program and a determination method disclosed in the present application will be described in detail with reference to the accompanying drawings. In addition, this invention is not limited by this embodiment.

(1. Determination method)
The determination method according to the embodiment will be described with reference to FIG. FIG. 1 is a diagram illustrating a determination method according to the embodiment. The determination method according to the embodiment is a method for determining a setting value to be assigned (set) to a variable included in the source code when performing a single inspection of the source code. And

  Here, the single inspection of the source code is an inspection for checking whether the source code is incomplete by executing the source code for each module using the test data. The single inspection includes, for example, an inspection for confirming whether or not the process branches correctly in the conditional branch. In such a check, it is checked whether or not the conditional branch is correctly performed by setting a possible value for the variable included in the conditional expression of the conditional branch.

  Therefore, the test data includes, for example, set values of variables included in the conditional expression. When a variable can take a plurality of setting values, test data is generated so that a single inspection is performed for all possible setting values.

  At this time, when a plurality of variables are included in the conditional expression, test data is generated by combining possible values of the plurality of variables. Therefore, for example, when the size of the source code increases and the number of variables included in the source code increases, the number of combinations of setting values of a plurality of variables increases. For this reason, when a person (user) who performs inspection generates test data, the amount of work increases and there is a possibility that such a combination may be leaked.

  Therefore, in the determination method according to the embodiment, variables included in the conditional expression of the conditional branch in the source code are extracted, and test data is generated based on combinations of values that can be taken by the extracted variables.

  As a result, the inspection apparatus can automatically generate test data, the amount of work for the user can be reduced, and leakage of a single inspection can be suppressed.

  Hereinafter, a determination method for determining a set value of a variable as test data will be specifically described with reference to FIG.

  As shown in FIG. 1, the inspection apparatus first reads a source code written in C language to be inspected (step S1). In FIG. 1, it is assumed that a source code 31 including “#if” indicating a conditional branch of a preprocessor command is read.

  Next, the inspection device extracts a conditional branch included in the source code 31 (step S2). In the example of FIG. 1, “#if (A == USE) && (B == USE)” is extracted.

  The inspection apparatus determines the set value of the variable included in the conditional expression based on the combination of the possible value of the extracted conditional expression of the conditional branch and the determination result of the conditional expression (step S3).

  The conditional expression “(A == USE) && (B == USE)” of the conditional branch shown in FIG. 1 is expressed by a logical product of two conditional expressions. Here, the conditional expression for conditional branching is referred to as conditional expression c. Also, the conditional expression “A == USE” on the left side of the logical operator “&&” of the conditional expression c is referred to as a conditional expression a, and the conditional expression “B == USE” on the right side is referred to as a conditional expression b. The conditional expression a includes a variable A, and the conditional expression b includes a variable B. Here, description will be made assuming that there are three possible values of the variables A and B: “USE”, “NOT”, and “OTHER”.

  In order to determine the set values of the variables A and B included in the conditional expression c, the inspection apparatus first generates a combination table 33a of values that the variables A and B can take and the determination results of the conditional expressions a to c. For example, when the variable A is “USE” and the variable B is “USE”, the determination result of the conditional expression a (A == USE) is TRUE (described as “T” in FIG. 1), and the conditional expression b ( The determination result of B == USE) is also TRUE. Therefore, the determination result of conditional expression c, which is the logical product of conditional expressions a and b, is TRUE.

  The inspection apparatus determines the conditional expressions a to c while changing combinations of values that the variables A and B can take, and combines the values that the variables A and B can take and the determination results of the conditional expressions a to c. A table 33a is generated. Since both variables A and B can take three set values, the number of combinations is 3 × 3 = 9.

  Based on the generated combination table 33a, the inspection apparatus determines a combination of setting values to be set when performing a single inspection.

  Here, if the unit inspection is performed for all combinations of values that the variables A and B can take, the number of combinations increases, and the inspection may take time. For example, when the number of variables is large or the number of values that the variable can take is large, the number of inspections increases and the time required for the inspections increases.

  Therefore, for example, the inspection apparatus excludes combinations that do not require inspection from the combination table 33a, determines a combination of setting values to be set at the time of inspection, and generates the setting value table 33.

  For example, combinations of values that the variables A and B can take include combinations that cannot be combined in the source code to be inspected. Specifically, for example, it is assumed that a certain variable C represents the type of vehicle and another variable D represents the type of transmission. At this time, it is assumed that the transmission of a certain vehicle type S is only an automatic transmission (AT) and no manual transmission (MT). In this case, the combination of the variable C == S and the variable D == MT is a combination that cannot be combined in the source code executed on the vehicle of the vehicle type S. In this way, depending on the values that the variables can take, they may not actually be combined. If a single inspection is performed on combinations that are not actually combined on the source code, the number of inspections increases unnecessarily, and the inspection time becomes longer.

  Therefore, the inspection apparatus excludes such combinations by assuming that a single inspection is not performed for combinations of set values of variables that cannot be combined. For example, a combination in which the variable A is “NOT” and the variable B is “OTHER” is a combination that is not allowed in the source code. That is, when the combination of the ninth line in the combination table 33a shown in FIG. 1 is not allowed, the inspection apparatus excludes the combination of the ninth line from the set value combinations during the single inspection.

  In addition, the inspection apparatus excludes the combination of variables A and B in which the processing after the determination of conditional expression c is duplicated. This is because the combination table 33a may include combinations that perform the same processing regardless of the set value of the variable.

  For example, when the conditional expression c includes two conditional expressions a and b, the condition determination is performed in order from the left conditional expression a. Therefore, when the conditional expression a is not satisfied (FALSE, described as “F” in FIG. 1), the conditional expression c is not satisfied regardless of the determination result of the conditional expression b, and the process P1 of the source code 31 is not executed. For example, in the combination table 33a of FIG. 1, the conditional expression c is F regardless of the value of the variable B in the combinations of the second, third, fifth, sixth, eighth, and ninth rows.

  Thus, when the conditional expression a is F (not established), whether the conditional expression b is right or wrong, that is, the value of the variable B does not affect the determination result of the conditional expression c. Therefore, for example, if the inspection in which the conditional expression a is F is performed at least once, even if the inspection in which the other conditional expression a is F is omitted, the accuracy of the single inspection is not affected.

  Therefore, the inspection apparatus determines a combination of setting values by excluding the combinations of the fifth, sixth, eighth, and ninth lines from the combination table 33a of FIG. Note that the inspection apparatus determines the setting values so that the values that the variables A and B can take are each set at least once. Therefore, the inspection apparatus does not exclude the combination in the third row of the combination table 33a in FIG. 1 in order to perform a single inspection when the variable A is “OTHER”. As described above, the inspection apparatus determines the five combinations as the combination of the setting values of the variables A and B when performing the single inspection as shown in the setting value table 33 of FIG.

  The inspection apparatus outputs the determined set value combination to, for example, a storage unit (not shown) (step S4).

  As described above, when the inspection apparatus executes the determination method according to the embodiment, the setting value of the variable included in the source code can be automatically determined, and the amount of work of the user can be reduced. Further, setting omission can be suppressed as compared with the case where the user sets the set value.

  Further, the inspection apparatus determines combinations of set values by excluding combinations that cannot be combined in the source code to be inspected and combinations that include the value of the variable B that does not affect the determination result of the conditional expression c.

  Thereby, the inspection apparatus can reduce the number of inspections of the single inspection. For example, in FIG. 1, when inspection is performed with all possible combinations of values of variables A and B, nine inspections must be performed. However, the inspection apparatus excludes predetermined combinations and sets the number of combinations of set values. By reducing the number to five, the number of inspections can be reduced to five.

(2. Inspection device)
Hereinafter, a configuration example of the inspection apparatus 1 will be described with reference to FIGS. FIG. 2 is a block diagram illustrating a configuration of the inspection apparatus 1 according to the embodiment. In FIG. 2, only constituent elements necessary for describing the features of the embodiment are represented by functional blocks, and descriptions of general constituent elements are omitted.

  In other words, each component illustrated in FIG. 2 is functionally conceptual and does not necessarily need to be physically configured as illustrated. For example, the specific form of distribution / integration of each functional block is not limited to the one shown in the figure, and all or a part thereof is functionally or physically distributed in arbitrary units according to various loads or usage conditions.・ It can be integrated and configured.

  The inspection device 1 according to the embodiment includes a determination unit 10, an inspection unit 20, and a storage unit 30. The determination unit 10 includes a reading unit 110, an extraction unit 120, a set value determination unit 130, and an output unit 140. The storage unit 30 stores a source code 31, variable information 32, and a setting value table 33.

  Here, the inspection apparatus 1 includes, for example, a computer having a central processing unit (CPU), a read only memory (ROM), a random access memory (RAM), a hard disk drive (HDD), an input / output port, and various circuits. Including.

  The CPU of the computer functions as the reading unit 110, the extracting unit 120, the setting value determining unit 130, and the output unit 140 of the determining unit 10, for example, by reading and executing the determining program stored in the ROM. The CPU of the computer functions as the inspection unit 20 by reading and executing an inspection program stored in the ROM, for example.

  The storage unit 30 corresponds to, for example, a RAM or an HDD. The RAM and HDD can store source code 31, variable information 32, setting value table 33, information on various programs such as a determination program and an inspection program, and the like. Note that the inspection apparatus 1 may acquire the above-described program and various types of information via another computer or a portable recording medium connected via a wired or wireless network.

(2.1. Deciding part)
The determination unit 10 determines a combination of setting values to be set in variables included in the conditional expression of the conditional branch when performing a single inspection. As described above, the determination unit 10 includes the reading unit 110, the extraction unit 120, the setting value determination unit 130, and the output unit 140.

  Here, the case where the determination unit 10 determines the setting value of the variable of the source code 31 written in the C language will be described, but the programming language used for the source code 31 is not limited to the C language. For example, the source code 31 may be described in another programming language such as FORTRAN.

  Here, it is assumed that the determination unit 10 extracts the conditional branch of the preprocessor command included in the source code 31 when the source code 31 is preprocessed. However, the present invention is not limited to this. For example, the conditional branch extracted by the determination unit 10 may be a conditional branch other than the preprocessor command. Even when the preprocess is not performed, the determination unit 10 may extract a conditional branch in order to determine the set value.

(2.1.1. Reading part)
The reading unit 110 reads the source code 31 and variable information 32 to be inspected from the storage unit 30. The reading unit 110 outputs the read source code 31 to the extraction unit 120. Further, the reading unit 110 outputs the read variable information 32 to the set value determining unit 130.

(2.1.2. Extraction unit)
When the extraction unit 120 receives the source code 31 from the reading unit 110, the extraction unit 120 extracts information necessary for setting the value of the variable by the setting value determination unit 130 in the subsequent stage, such as a conditional expression or a variable of the conditional branch from the source code 31. To do. The extraction unit 120 includes a branch extraction unit 121, a variable extraction unit 122, and a definition extraction unit 123.

(2.1.2.1. Branch extraction unit)
The branch extraction unit 121 extracts a conditional branch from the source code 31. For example, when the reading unit 110 reads the source code 31 shown in FIG. 3, the branch extraction unit 121 extracts a conditional branch “#if (A == USE) || (B == USE)”. In this way, the branch extraction unit 121 detects the conditional branch included in the source code 31 by detecting the commands “#if”, “#else”, “#elif”, etc. relating to the conditional branch included in the source code 31. Extract. FIG. 3 is a diagram illustrating an example of the source code 31 according to the embodiment.

  The branch extraction unit 121 outputs the extracted conditional branch to the variable extraction unit 122.

  Here, an example in which the branch extraction unit 121 extracts one conditional branch has been described, but the number of conditional branches extracted by the branch extraction unit 121 is not limited to one. For example, the branch extraction unit 121 extracts all conditional branches included in the source code 31. When the source code 31 includes a plurality of conditional branches, the branch extraction unit 121 extracts a plurality of conditional branches.

(2.1.2.2. Variable extraction unit)
The variable extraction unit 122 extracts variables included in the conditional expression of the conditional branch extracted by the branch extraction unit 121. The variable extraction unit 122 extracts the left operand of the relational operator included in the conditional expression as a variable. For example, in the case of the source code 31 in FIG. 3, the variable extraction unit 122 extracts variables A and B.

  The variable extraction unit 122 outputs the extracted variables A and B to the definition extraction unit 123.

(2.1.2.3. Definition Extraction Unit)
The definition extraction unit 123 extracts the definitions of the variables A and B extracted by the variable extraction unit 122 from the source code 31. The definition extraction unit 123 extracts possible values of the variables A and B, for example. Here, it is assumed that the definition extraction unit 123 extracts three values “USE”, “NOT”, and “OTHER” as possible values of the variables A and B.

  The definition extraction unit 123 outputs the variables A and B and the possible values of the variables A and B to the set value determination unit 130.

  In addition, although the value which the variable A and B can take here is made into the character string here, it is not limited to this. For example, the variables A and B may be integers such as “0”, “1”, and “2”. Here, the definition extraction unit 123 extracts the possible values of the variables A and B from the source code 31, but the present invention is not limited to this. The definition extraction unit 123 may extract the possible values of the variables A and B based on the definition information in which the possible values for each of the variables A and B are defined in advance. The definition information is stored in the storage unit 30, for example.

  Here, the branch extraction unit 121 and the variable extraction unit 122 extract the conditional branch and the variables A and B, and then extract the possible values of the variables A and B. However, the present invention is not limited to this. For example, the definition extraction unit 123 may extract variable definition information included in the source code 31 before the branch extraction unit 121 extracts a conditional branch. In this case, the definition extraction unit 123 determines possible values of the variables A and B extracted by the variable extraction unit 122 based on the extracted definition information.

(2.1.3. Setting value determination unit)
The set value determination unit 130 sets a variable when performing a unit test based on a combination of the values extracted by the extraction unit 120 (variables A and B in the example of FIG. 3) and the determination result of the conditional expression. Determine the value (setting value). The set value determination unit 130 includes a combination generation unit 131, a prohibition removal unit 132, and a duplication removal unit 133.

(2.1.3.1. Combination generation unit)
The combination generation unit 131 generates a combination table including combinations of possible values of variables extracted by the extraction unit 120 and determination results of conditional expressions for conditional branches. The combination generation unit 131 outputs the generated combination to the prohibition removal unit 132. An example of generating a combination by the combination generation unit 131 will be described later with reference to FIGS. 5A and 6.

(2.1.3.2. Prohibited removal part)
The prohibition removing unit 132 excludes combinations that are not combined when the source code 31 is executed, that is, combinations that are prohibited from being combined, among combinations of values that the variable generated by the combination generation unit 131 can take.

  The prohibition removing unit 132 excludes combinations that are prohibited based on the variable information 32 read by the reading unit 110. As shown in FIG. 4, the variable information 32 is a table indicating whether or not a combination of variables A and B is possible. FIG. 4 is a diagram illustrating the variable information 32 according to the embodiment. In FIG. 4, a combination of variables A and B that are combined when executing the source code 31 is represented by “◯”, and a combination of variables A and B that cannot be combined is represented by “×”.

  For example, in FIG. 4, the combination where the variable A is “OTHER” and the variable B is “OTHER” is “x”. In this case, the prohibition removal unit 132 removes the combination in which the variable A is “OTHER” and the variable B is “OTHER” from the combination table generated by the combination generation unit 131.

  In this example, the prohibition removal unit 132 removes the combination for which the combination is prohibited from the combination table generated by the combination generation unit 131. However, the present invention is not limited to this. For example, the combination generation unit 131 may generate a combination table by excluding combinations that are prohibited by referring to the variable information 32. Thereby, the process which the prohibition removal part 132 performs can be abbreviate | omitted.

  Here, the prohibition removal unit 132 determines the combination to be removed based on the variable information 32 stored in the storage unit 30, but is not limited thereto. For example, if the source code 31 includes a description prohibiting the combination, the prohibition removing unit 132 may remove the combination from the combination table based on the description. For example, when the variable A is “OTHER” and the source code 31 includes a description that causes an error when the variable B is “OTHER”, the prohibition removing unit 132 determines that the variable A is “OTHER”. And combinations where the variable B is “OTHER” may be removed.

(2.1.2.3. Deduplication unit)
The duplicate removal unit 133 removes the combination of variables that are duplicated in the processing after the conditional expression determination from the combination table generated by the combination generation unit 131, and determines the setting value of the variable used for the unit test. The duplicate removal unit 133 outputs the setting value table 33 including the determined setting value to the output unit 140.

  Hereinafter, the combination of the combination table generated by the combination generation unit 131 and the variable removed by the duplication removal unit 133 will be described for each operator of the conditional expression with reference to FIGS. 5A to 11E. In order to simplify the description, it is assumed that the combination removal by the prohibition removal unit 132 is not performed, that is, there is no prohibited combination.

(A. #If statement)
First, the case where the preprocessor instruction included in the conditional branch is “#if” will be described with reference to FIGS. 5A to 8B.

(A-1. Comparison operator: equal sign)
A case where the operator included in the conditional expression of the conditional branch (#if) is an equal sign (==) will be described with reference to FIGS. 5A and 5B. FIG. 5A is a diagram illustrating an example of the combination table 33a_1 generated by the combination generation unit 131 according to the embodiment. FIG. 5B is a diagram illustrating a setting value table 33_1 generated by the duplication removal unit 133 according to the embodiment.

  Assume that the conditional branch extracted by the branch extraction unit 121 is “#if A == USE”. Hereinafter, “A == USE” included in the conditional branch is referred to as a conditional expression ce1. In this case, the combination generation unit 131 generates a combination table 33a_1 including combinations of possible values of the variable A and the determination result of the conditional expression ce1, as illustrated in FIG. 5A.

  As shown in FIG. 5A, possible values of the variable A are “USE”, “NOT”, and “OTHER”. In this case, the determination results corresponding to the conditional expression ce1 are “T” (TRUE), “F” (FALSE), and “F”, respectively.

  Here, all possible values of the variable A included in the conditional expression ce1 must be inspected once. Therefore, as shown in FIG. 5A, the determination result is “F” regardless of whether the variable A is “NOT” or “OTHER”, and the processing after the determination does not change. All possible values are set as values to be set at the time of inspection without removing possible values. As a result, the duplication removal unit 133 generates a set value table 33_1 having “USE”, “NOT”, and “OTHER” as set values, for example, as illustrated in FIG. 5B.

(A-2. Comparison operator: negation of equal sign)
Next, a case where the operator of the conditional expression is equal sign negation (! =) Will be described with reference to FIG. FIG. 6 is a diagram illustrating an example of the combination table 33a_2 generated by the combination generation unit 131 according to the embodiment.

  Assume that the conditional branch extracted by the branch extracting unit 121 is “#if A! = USE”. Hereinafter, “A! = USE” included in the conditional branch is referred to as a conditional expression ce2. In this case, the combination generation unit 131 generates a combination table 33a_2 including combinations of possible values of the variable A and the determination result of the conditional expression ce2, as illustrated in FIG.

  As shown in FIG. 6, possible values of the variable A are “USE”, “NOT”, and “OTHER”. In this case, the determination results corresponding to the conditional expression ce2 are “F”, “T”, and “T”, respectively.

  The duplication removal unit 133 does not remove the possible values of the variable A as in the case of the conditional expression ce1, and sets all the possible values as values to be set at the time of inspection. Thereby, the duplication removal part 133 produces | generates the setting value table 33_1 which sets "USE", "NOT", and "OTHER" as a setting value similarly to FIG. 5B, for example.

(A-3. Logical operator: logical sum)
A case where a logical sum (||, OR condition) is included in the conditional expression will be described with reference to FIGS. 7A and 7B. FIG. 7A is a diagram illustrating an example of the combination table 33a_3 generated by the combination generation unit 131 according to the embodiment. FIG. 7B is a diagram illustrating an example of the setting value table 33_3 generated by the duplication removal unit 133 according to the embodiment.

  Assume that the branch extraction unit 121 extracts the conditional branch “#if (A == USE) || (B == USE)” from the source code 31 shown in FIG. Hereinafter, the conditional expression “(A == USE) || (B == USE)” of the conditional branch is referred to as a conditional expression ce3. Also, the conditional expression “A == USE” on the left side of the logical sum included in the conditional expression ce3 is described as a conditional expression ceL, and the conditional expression “B == USE” on the right side is described as a conditional expression ceR.

  In this case, the combination generation unit 131 generates a combination table 33a_3 including combinations of possible values of the variables A and B and the determination results of the conditional expressions ceL, ceR, and ce3 as illustrated in FIG. 7A.

  As shown in the fifth row of the combination table 33a_3 in FIG. 7A, the combination generation unit 131 generates, for example, a combination in which the variable A is “USE” and the variable B is “USE”. In this case, the determination result of the conditional expression ceL is “T”, and the determination result of the conditional expression ceR is “T”. In addition, the determination result of the conditional expression ce3 is “T”.

  The combination generation unit 131 determines the conditional expressions ceL, ceR, and ce3 while changing the possible values of the variables A and B to “USE”, “NOT”, and “OTHER”, and the determination result is stored in the combination table 33a_3. Write.

  The combination generation unit 131 calculates the determination results of the conditional expressions ceL, ceR, and ce3 for all combinations of the values that the variables A and B can take, so that there are nine combinations as shown in the combination table 33a_3 in FIG. 7A. Is generated.

  Next, the duplicate removal unit 133 removes combinations including variable values that do not affect the determination result from the nine combinations generated by the combination generation unit 131.

  For example, in the C language, the logical sum is calculated sequentially from the left side. Therefore, when the conditional expression ceL is satisfied, the determination result of the conditional expression ce3 is “Established (T)” regardless of the determination result of the conditional expression ceR. That is, when the variable A is “USE”, the value of the variable B does not affect the determination result of the conditional expression ce3.

  Therefore, when the combination in which the variable A is “USE”, that is, the combination in the second, fifth, and eighth rows of the combination table 33a_3 illustrated in FIG. 7A is executed at least once, at least one test in which the conditional expression ce3 is “T” Times can be performed. In other words, it can be said that the inspection performed by the combination of the second, fifth, and eighth rows of the combination table 33a_3 is an inspection in which processing is duplicated.

  Therefore, in the present embodiment, the duplication removal unit 133 reduces the number of inspections by removing at least one of the combinations with overlapping processes (the combinations of the second, fifth, and eighth rows in FIG. 7A). . However, at this time, the duplicate removal unit 133 determines a combination to be deleted so that each possible value of the variables A and B is examined at least once.

  In addition, the duplication removal unit 133 determines a combination to be deleted so that a different combination of each possible value of the variables A and B and the determination result of the conditional expression ce3 is examined at least once. For example, when the variable B is “NOT”, the duplicate removal unit 133 is so checked that the combination in which the determination result of the conditional expression ce3 is “T” and the combination in which the determination result is “F” are checked once. Determines the set values of variables A and B.

  When the variable B is “USE”, the conditional expression ce3 is always “T”, so there is no combination of the conditional expression ce3 “F”. Thus, depending on the possible values of the variables A and B, there may be no combination in which the determination result of the conditional expression ce3 is different.

  For example, in the case of the combination table 33a_3 in FIG. 7A, the duplicate removal unit 133 removes the combination in the fifth row, but does not remove the combination in the eighth row. This is because the variable B of the combination on the fifth line is “USE” and the conditional expression ce3 is “T”, and this combination is the same as the combination on the fourth and sixth lines. The combination on the eighth line is because the variable B is “OTHER” and the conditional expression ce3 is “T”, but this combination is not included in other combinations.

  The duplicate removal unit 133 excludes the combination of the fifth row of the combination table 33a_3, determines the combination of variables A and B included in the first to fourth and sixth to ninth rows as a combination of set values, and is illustrated in FIG. 7B. A setting value table 33_3 is generated.

  Note that the logical product (&&, AND condition) has been described above with reference to FIG.

(B. Nest condition)
Next, a case where the branch extraction unit 121 extracts a nested condition in which a #if statement is nested will be described with reference to FIGS. 8A and 8B. FIG. 8A is a diagram illustrating an example of the source code 31b according to the embodiment. FIG. 8B is a diagram illustrating an example of the combination table 33a_4 generated by the combination generation unit 131 according to the embodiment.

  As shown in FIG. 8A, when the nest condition is included in the source code 31b, for example, when the conditional branch “#if A == USE” is established, the process P1 including the conditional branch “#if B == USE” is performed. Executed.

  Thus, when the nesting condition is included in the source code 31b, the branch extraction unit 121 extracts the conditional branch “#if A == USE” as a parent and the conditional branch “#if B == USE” as a child, respectively. To do.

  First, the combination generation unit 131 generates a combination table of the variable A of the conditional expression “A == USE” included in the parent conditional branch “#if A == USE” and the determination result. Such a combination table is the same as the combination table 33a_1 shown in FIG.

  Next, the combination generation unit 131 generates a combination table 33a_4 of a conditional branch “#if B == USE” as a child. In this case, the combination generation unit 131 generates the combination table 33a_4 in consideration of the conditional branch “#if A == USE” as a parent. That is, the combination generation unit 131 generates a combination table 33a_4 of the variables A and B and the determination results of the conditional expressions “A == USE” and “B == USE”.

  The duplicate removal unit 133 deletes a combination in which the process performed in the inspection is duplicated from the combinations included in the combination table 33a_4 generated based on the conditional branch as a child. For example, in the source code 31b shown in FIG. 8A, when the conditional branch serving as a parent is not established (F), the conditional branch serving as a child is not processed. That is, unless the variable A is “USE”, the process P1 is not executed regardless of the value of the variable B.

  Therefore, the duplication removal unit 133 determines the setting values of the variables A and B by excluding the combinations in the third, fifth, eighth, and ninth rows from the combination table 33a_4 illustrated in FIG. 8B. The method of excluding combinations is the same as the case where the operator described with reference to FIG.

(C. # Else statement)
The case where the branch extraction unit 121 extracts an #else sentence as a conditional branch will be described with reference to FIG. FIG. 9 is a diagram illustrating an example of the source code 31c according to the embodiment.

  As illustrated in FIG. 9, it is assumed that the branch extraction unit 121 extracts the conditional branch “#if (A == USE) && (B == USE)” and the conditional branch “#else”.

  In this case, the branch extraction unit 121 extracts a conditional expression that is the negative of the conditional branch “#if (A == USE) && (B == USE)” as the conditional expression of the conditional branch “#else”. In other words, the branch extraction unit 121 replaces the conditional branch “#else” with “#if (A! = USE) || (B! = USE)” as shown in FIG. In FIG. 9, the replaced source code is shown as source code 31c_1.

  The combination generation unit 131 extracts the conditional branches “#if (A == USE) && (B == USE)” and “#if (A! = USE) || (B! = USE) extracted by the branch extraction unit 121. ”For each. In addition, the duplicate removal unit 133 excludes combinations whose processes are duplicated from each combination table, and generates a setting value table for each conditional branch.

(D. # Elif statement)
The case where the branch extraction unit 121 extracts a #elif sentence as a conditional branch will be described with reference to FIG. FIG. 10 is a diagram illustrating an example of the source code 31d according to the embodiment.

  As illustrated in FIG. 10, it is assumed that the branch extraction unit 121 has extracted the conditional branch “#if (A == USE) && (B == USE)” and the conditional branch “#elif (C == USE)”. .

  In this case, the branch extraction unit 121 uses a conditional expression that is a negative of “(A == USE) && (B == USE)” as a conditional expression of the conditional branch “#elif (C == USE)” and “C = AND with “= USE” is extracted. In other words, as shown in FIG. 10, the branch extraction unit 121 converts the conditional branch ““ #elif (C == USE) ”to“ #if ((A! = USE) || (B! = USE)) && (C == USE) ”. In FIG. 10, the replaced source code is shown as source code 31d_1.

  The combination generation unit 131 extracts the conditional branches “#if (A == USE) && (B == USE)” and “#if ((A! = USE)) || (B! = USE) extracted by the branch extraction unit 121. )) && (C == USE) "is generated for each combination table. In addition, the duplicate removal unit 133 excludes combinations whose processes are duplicated from each combination table, and generates a setting value table for each conditional branch. Note that C included in the conditional branch is a variable, and can assume three values “USE”, “NOT”, and “OTHER” in the same manner as the variables A and B.

  Here, a conditional branch “#if ((A! = USE) || (B! = USE)) && (C == USE)” (see FIG. 10) is used as shown in FIG. A combination table generated by the combination generation unit 131 when the formula includes a plurality of logical operators will be described.

  FIG. 11A is a diagram illustrating an example of the source code 31e according to the embodiment. FIG. 11B is a diagram illustrating an example of the combination table 33a_5 generated by the combination generation unit 131 according to the embodiment. 11C and 11D are diagrams illustrating an example of the tables 33a_6 and 33a_8 generated by the duplication removal unit 133 according to the embodiment. FIG. 11E is a diagram illustrating an example of the setting value table 33_9 generated by the duplication removal unit 133 according to the embodiment.

  Hereinafter, as shown in FIG. 11A, as a conditional branch in which a plurality of logical operators are included in a conditional expression, “#if ((A == USE) && (B == USE)) || ((C == USE) || (D == USE)) ". Here, C and D included in the conditional expression are variables, and, like the variables A and B, three values “USE”, “NOT”, and “OTHER” can be taken.

  Here, “(A == USE) && (B == USE)” is described as conditional expression ce5, and “(C == USE) || (D == USE)” is described as conditional expression ce6. To do. Further, the logical sum of the conditional expression ce5 and the conditional expression ce6, that is, the conditional expression “((A == USE) && (B == USE)) || ((C == USE) || (D == USE)) ”is written as conditional expression ce7.

  First, the combination generation unit 131 generates a combination table 33a_5 of determination results of the conditional expressions ce5 to ce7 as illustrated in FIG. 11B.

  Next, the combination generation unit 131 generates a combination table 33a (see FIG. 1) of the determination results of the variables A and B and the conditional expression ce5 for the conditional expression ce5.

  As illustrated in FIG. 11C, the duplicate removal unit 133 generates a table 33a_6 from which the duplicate combination (the combination of the fifth, sixth, eighth, and ninth rows of the combination table 33a in FIG. 1) is removed from the combination table 33a.

  The combination generation unit 131 generates a combination table 33a_7 of the determination results of the variables C and D and the conditional expression ce6 for the conditional expression ce6. Since the combination table 33a_7 is obtained by replacing the variables A and B of the combination table 33a_3 illustrated in FIG. 7A with variables C and D, illustration thereof is omitted.

  In addition, the duplication removal unit 133 generates a table 33a_8 in which the duplicate combination (the combination in the fifth row of the combination table 33a_3 in FIG. 7A) is removed from the combination table 33a_7 generated by the combination generation unit 131.

  The deduplication unit 133 generates the setting value table 33_9 illustrated in FIG. 11E by integrating the generated tables 33a_6 and 33a_8 using the combination table 33a_5.

  For example, in the first row of the combination table 33a_5 illustrated in FIG. 11B, the determination result of the conditional expression ce5 is “F”, and the conditional expression ce6 is “F”. Therefore, the duplication removal unit 133 sets the combination in which the determination result of the table 33a_6 is “F” (the combination of the second to fifth rows of the table 33a_6 in FIG. 11C) and the combination in which the determination result of the table 33a_8 is “F” (FIG. 11D table 33a_8 in the first, third, sixth and eighth rows).

  Note that the first to fourth lines of the setting value table 33_9 illustrated in FIG. 11E correspond to the second line of the combination table 33a_5 illustrated in FIG. 11B. Further, the 5th to 20th lines of the setting value table 33_9 correspond to the 3rd line of the combination table 33a_5 illustrated in FIG. 11B. The 21st to 36th lines of the setting value table 33_9 correspond to the first line of the combination table 33a_5 illustrated in FIG. 11B.

  Note that the combination in the fourth row of the combination table 33a_5 illustrated in FIG. 11B overlaps with the combination in the second row, and therefore the combination is excluded when integrating the tables 33a_6 and 33a_8. This is because if the conditional expression ce5 is “T”, the conditional expression ce7 becomes “T” regardless of the determination result of the conditional expression ce6. For this reason, even if any one of the second and fourth lines of the combination table 33a_5 is excluded, the single inspection is not affected. Therefore, the tables 33a_6 and 33a_8 based on the combination of the fourth line of the combination table 33a_5 illustrated in FIG. Integration can be excluded.

(2.1.4. Output unit)
The output unit 140 stores the setting value table 33 generated by the duplication removal unit 133 in the storage unit 30. Although the output unit 140 stores the setting value table 33 here, the deduplication unit 133 may store the setting value table 33 in the storage unit 30, for example.

  Further, the output unit 140 may output the set value table 33 to the inspection unit 20, or may output the set value table 33 to a display or the like (not shown).

(2.2. Inspection Department)
When the inspection unit 20 reads the source code 31 and the setting value table 33 from the storage unit 30, the inspection unit 20 executes the source code 31 for each module by using the setting value of the variable included in the setting value table 33. Perform single unit inspection.

(3. Decision processing)
Next, with reference to FIG. 12, the procedure of the determination process executed by the inspection apparatus 1 according to the embodiment will be described. FIG. 12 is a flowchart illustrating a processing procedure of determination processing executed by the inspection apparatus 1 according to the embodiment.

  As shown in FIG. 12, first, the inspection apparatus 1 reads the source code 31 (step S101). Next, the inspection apparatus 1 extracts a conditional branch from the source code 31 (step S102).

  The inspection apparatus 1 extracts variables included in the extracted conditional expression of the conditional branch (step S103). The inspection apparatus 1 extracts all possible values of the extracted variable (step S104).

  The inspection apparatus 1 generates a combination of the values that the variable can take and the determination result of the conditional expression (step S105).

  The inspection apparatus 1 excludes combinations including variable setting values that cannot be combined when executing the source code 31 from the combinations generated in step S105 (step S106).

  The inspection apparatus 1 excludes combinations including variable values that do not affect the single inspection from the combinations generated in step S105 (step 107).

  The inspection apparatus 1 determines a combination of variable setting values based on the combinations excluded in Step S106 and Step S107 (Step S108), and outputs the determined combination of setting values (Step S109).

  As described above, the inspection apparatus 1 according to the embodiment can automatically determine the setting value of the variable included in the source code 31, and can reduce the amount of work for the user.

(4. Modifications)
As mentioned above, although embodiment of this invention has been described, this invention is not limited to the said embodiment, A various deformation | transformation is possible. Below, such a modification is demonstrated. All the forms including the above embodiment and the forms described below can be appropriately combined.

  In the above-described embodiment, the inspection apparatus 1 generates a combination table of variables and conditional expression determination results and then excludes duplicate combinations. However, the present invention is not limited to this. For example, when calculating a combination of conditional expressions including a logical product, the inspection apparatus 1 may generate a combination table while excluding duplicate combinations.

  Specifically, when calculating the logical product of a plurality of conditional expressions, the combination generation unit 131 of the inspection apparatus 1 sets each conditional expression to “T” and then sets each conditional expression to “T”. Variables included in a plurality of conditional expressions are set so as to be “F”.

  For example, in the case of the conditional expression c “(A == USE) && (B == USE)” illustrated in FIG. "Is a combination of variables A and B so that both become" T ". In this case, the combination generation unit 131 sets “USE” for both the variables A and B.

  Next, the combination generation unit 131 generates a combination of variables A and B so that each conditional expression a and b becomes “F” one by one. First, the combination generation unit 131 sets a combination of variables A and B in which the conditional expression a is “F” and the conditional expression b is “T”, and the variable A is “NOT” and the variable B is “USE”. , Variable A is “OTHER” and variable B is “USE”. Subsequently, the combination generation unit 131 generates a combination of variables A and B in which the conditional expression a is “T” and the conditional expression b is “F”. Finally, a combination of variables A and B that generate “F” for both conditional expressions a and b is generated.

  Thereby, as shown in FIG. 13, the combination table 33a_10 from which the duplicate combination is removed can be generated, and the process of the duplicate removal unit 133 can be omitted. FIG. 13 is a diagram illustrating an example of a combination table generated by the combination generation unit 131 according to the modification.

  In the above-described embodiment, the inspection apparatus 1 includes the determination unit 10 that determines the setting of the variable and the inspection unit 20 that performs the single unit inspection. However, the present invention is not limited to this. For example, you may make it mount the determination part 10 and the test | inspection part 20 in a respectively different apparatus. That is, a determination device (not shown) that executes the determination method according to the embodiment may be a device different from the inspection device 1 that performs a single inspection.

(5. Effect)
The determination program according to the above-described embodiment causes the computer to execute a procedure for reading the source code 31 that is the target of the single inspection. Further, the determination program causes the computer to execute a procedure for extracting a conditional branch included in the source code 31. Further, the determination program uses a computer to determine a setting value of a variable to be substituted when performing a single inspection based on a combination of a possible value of a variable included in the conditional expression of the conditional branch and a determination result of the conditional expression. To run. Further, the determination program causes the computer to execute a procedure for outputting the determined setting value.

  As a result, the computer can determine the set value of the variable to be substituted when performing a single inspection, and the amount of work for the user can be reduced.

  The determination program according to the above embodiment determines the setting value as a procedure for determining the setting value of the variable so that all the possible values of the variable are substituted at least once.

  Thereby, the leakage of the set value of the variable can be suppressed, and the accuracy of the single inspection can be improved.

  The determination program according to the above-described embodiment determines the setting value as a procedure for determining the setting value of the variable so that the combination of the possible value of the variable and the determination result is examined at least once.

  Thereby, the leakage of the set value of the variable can be suppressed, and the accuracy of the single inspection can be improved.

  The determination program according to the above-described embodiment determines the setting value as a procedure for determining the setting value of the variable by excluding combinations that cannot be combined in the source code 31 from combinations of values that can be taken by a plurality of variables.

  Thereby, the number of inspections for a single inspection can be reduced, and an increase in the inspection scale can be suppressed.

  In the determination program according to the embodiment, as a procedure for determining the setting value of a variable, a setting including a setting value of a variable that does not affect the determination result is excluded from combinations of values that a plurality of variables can take. Determine the value.

  Thereby, the number of inspections for a single inspection can be reduced, and an increase in the inspection scale can be suppressed.

  The determination program according to the embodiment includes, as a procedure for determining a variable setting value, the combination of the combination including the variable setting value that does not affect the determination result according to the calculation order of the operators included in the conditional expression. The set value is determined so that at least one is inspected.

  Thereby, the number of inspections for a single inspection can be reduced, and an increase in the inspection scale can be suppressed.

  In the determination program according to the above-described embodiment, the procedure for extracting the conditional branch is performed when the source code 31 is preprocessed.

  Thereby, it is possible to determine a setting value to be substituted into a variable when performing a single inspection during execution of the preprocess.

  Further effects and modifications can be easily derived by those skilled in the art. Thus, the broader aspects of the present invention are not limited to the specific details and representative embodiments shown and described above. Accordingly, various modifications can be made without departing from the spirit or scope of the general inventive concept as defined by the appended claims and their equivalents.

DESCRIPTION OF SYMBOLS 1 Inspection apparatus 10 Determination part 110 Reading part 120 Extraction part 130 Setting value determination part 140 Output part 20 Inspection part 30 Storage part

Claims (8)

The procedure for reading the source code that is the subject of unit inspection,
A procedure for extracting a conditional branch included in the source code;
A procedure for determining a setting value of the variable to be substituted when performing the unit test based on a combination of a value included in the conditional expression of the conditional branch and a determination result of the conditional expression;
A procedure for outputting the determined setting value;
A determination program characterized by causing a computer to execute. As a procedure for determining the setting value of the variable,
The determination program according to claim 1, wherein the setting value is determined so that all of the possible values of the variable are substituted at least once. As a procedure for determining the setting value of the variable,
The determination program according to claim 1 or 2, wherein the set value is determined so that a combination of a possible value of the variable and the determination result is examined at least once. As a procedure for determining the setting value of the variable,
The determination according to any one of claims 1 to 3, wherein the setting value is determined by excluding combinations that cannot be combined in the source code from among combinations of values that can be taken by the plurality of variables. program. As a procedure for determining the setting value of the variable,
5. The set value is determined by excluding a combination including the set value of the variable that does not affect a determination result from combinations of possible values of the plurality of variables. The decision program according to any one of the above. As a procedure for determining the setting value of the variable,
The setting value is determined so that at least one of the combinations including the setting value of the variable that does not affect a determination result is examined according to an operation order of operators included in the conditional expression. The determination program according to claim 5. The procedure for extracting the conditional branch is as follows:
The determination program according to claim 1, wherein the determination program is executed when the source code is preprocessed. The process of reading the source code that is the subject of the unit inspection;
Extracting a conditional branch included in the source code;
Determining a setting value of the variable to be substituted when performing the unit test based on a combination of a value that can be included in the conditional expression of the conditional branch and a determination result of the conditional expression;
Outputting the determined set value;
A determination method characterized by comprising:

Images