JP5900197B2 - Route condition selection apparatus, program, and method - Google Patents

Description

  The present technology relates to a technology for selecting a test case for testing the operation of a program.

  A test is performed to verify that the business system is designed as specified. Such tests include various checks, such as checks related to business specifications (relationships and changes between items that have meaning as business), and rules of thumb that program errors such as boundary value tests are likely to occur at data boundaries. It is done from the viewpoint. Therefore, a plurality of test data is prepared for one business specification according to the check contents.

  As a technology for automatically generating test data from business specifications, it solves the satisfiability determination problem of constraint expressions (logical expressions using screens, database (DB) items and program variables) that express the situation to be tested. Therefore, there is a technique that uses the sufficiency value as test data.

  Incidentally, symbolic execution is one of the techniques for creating test data when testing a program. Symbolic execution refers to a mechanism in which a variable is not specified as a specific value but executed without specifying a single symbol value. In symbolic execution, test data that will flow through a certain series of transitions can be created for each of the series of transitions that the program can take.

JP 2011-13797 A JP 2011-81653 A JP 2011-85967 A JP-A-10-320190 JP 2009-032133 A JP 2003-202985 A

  However, in the test, the test cases are sequentially executed until all the processing paths are executed even if the processing paths need only be confirmed regardless of the processing path in the previous stage. For example, by performing the test case 1 and the test case 2, all the processing paths executed in the test case 3 are passed. Therefore, depending on the test contents, the test case 3 may not be performed. However, even in such a case, not only test case 1 and test case 2 are performed, but also test case 3 is sequentially executed.

  Therefore, a technique for selecting a test case without redundancy from test cases generated by symbolic execution is provided.

  The path condition selection device includes an acquisition unit, a decomposition unit, a decomposition storage unit, a target logical expression storage unit, an extraction unit, and a selection unit. The acquisition unit is a path condition that is information that represents an execution path indicated by a combination of processing paths branched and passed by a condition included in the source code by a logical expression formed by connecting atomic logical expressions with logical products. Get information. The decomposition unit decomposes the path condition information into target logical expressions that are logical expressions including one or more atomic logical expressions. The decomposition storage unit stores path decomposition information that is information relating the decomposed target logical expression for each piece of path condition information. The target logical expression storage unit stores the target logical expression. The extraction unit acquires route decomposition information from the decomposition storage unit. When the acquired path decomposition information includes a differential logical expression that is a target logical expression other than the target logical expression stored in the target logical expression storage unit, the extraction unit extracts the differential logical expression and extracts the target logical expression storage unit To store. The selection unit selects route condition information corresponding to the route decomposition information from which the logical expression of the difference is extracted from the acquired route condition information.

  According to one aspect of the present embodiment, a test case can be selected without redundancy from test cases generated by symbolic execution.

It is an example of source code. It is a figure for demonstrating the test case production | generation by symbolic execution. An example of the route condition selection apparatus in this embodiment is shown. It is a figure for demonstrating 1st Embodiment. 1 shows an example of a configuration of a test case selection device according to a first embodiment. An example of path condition information as input information obtained as a result of performing symbolic execution on the source code of FIG. 1 is shown. An example of the path condition table in 1st Embodiment is shown. An example of an atomic logical expression table in the first embodiment is shown. An example in which the data item “selection” 193 is added to the atomic formula table of FIG. 8 is shown. An example of the target logical expression table in the first embodiment is shown. An example of the selection path | pass condition table in 1st Embodiment is shown. An example of the test case selection flow (the 1) in a 1st embodiment is shown. An example of the test case selection flow (part 2) in the first embodiment is shown. An example of the test case selection flow (the 3) in a 1st embodiment is shown. It is FIG. (1) for demonstrating 2nd Embodiment. It is FIG. (2) for demonstrating 2nd Embodiment. An example of the structure of the test case selection apparatus in 2nd Embodiment is shown. An example of the source code in the second embodiment is shown. An example of path condition information as input information obtained as a result of performing symbolic execution on the source code of FIG. 18 is shown. An example of the path condition table in 2nd Embodiment is shown. The line number table in 2nd Embodiment is shown. An example of the combination table in 2nd Embodiment is shown. An example in which the data item “selection” 323 is added to the combination table of FIG. An example of the target logical expression table in 2nd Embodiment is shown. An example of the selection path condition table in a 2nd embodiment is shown. An example of the test case selection flow (the 1) in a 2nd embodiment is shown. An example of the test case selection flow (the 2) in a 2nd embodiment is shown. An example of the test case selection flow (the 3) in a 2nd embodiment is shown. An example of the test case selection flow (the 4) in a 2nd embodiment is shown. An example of the test case selection flow (the 5) in a 2nd embodiment is shown. An example of the source code of the test target program is shown. FIG. 32 is a flowchart of the test target program in FIG. 31. FIG. (A) A test case obtained by symbolic execution, (B) A test case selected using the first embodiment. An example of the configuration of a test case selection device according to the third mode for embodying the present invention (embodiment 1) will be described. It is a figure for demonstrating the process of the driver change part in 3rd Embodiment (Example 1). An example of a test case (pass condition) obtained by symbolic execution in the third mode (Example 1) is shown. It is a figure for demonstrating the process of the test case adjustment part in 3rd Embodiment (Example 1). An example of the selection path condition table in the 3rd mode (example 1) is shown. An example of a test case selection flow in the third mode for embodying the present invention (embodiment 1) will be described. An example of the configuration of a test case selection device according to the third mode for embodying the present invention (embodiment 2) is shown. An example of an atomic logic formula table in a 3rd embodiment (example 2) is shown. An example of the test case selection flow in the third mode (Example 2) will be described. It is a block diagram of the hardware environment of a computer to which the first to third embodiments are applied.

  FIG. 1 is an example of source code. FIG. 2 is a diagram for explaining test case generation by symbolic execution. Symbolic execution is a technique in which, instead of inputting specific numerical values into variables included in the program, the program is simulated with symbols representing the numerical values, and the results are evaluated. When symbol values are used in a determination condition such as branching in a program, when symbolic execution is performed, the program is executed while taking into account combinations of logically possible symbol values (generation of symbolic execution trees).

  For example, consider a case where the source code shown in FIG. 1 is symbolically executed. In the source code of FIG. 1, two if statements are described. Symbolic execution is performed on the source code of FIG. Then, a symbolic execution tree is generated for the symbol values Sa, Sb, Sc corresponding to the values of the variables a, b, c as shown in FIG. For example, the code “a> = 0 & a <= 5” described in FIG. 1 is represented by “Sa> = 0 ∧ Sa <= 5”. Further, the code “b> 0 & c> 0” described in FIG. 1 is represented by “Sb> 0∧Sc> 0”.

  A path that branches from the determination condition in the symbolic execution tree represents a logical constraint (that is, a path condition) that should be satisfied when an assignment statement or a conditional statement is passed through symbolic execution. In symbolic execution, the path condition is accumulated every time an assignment statement or conditional statement is passed.

  The path from the root (root) to the leaf (leaf) in the symbolic execution tree is called an execution path. The execution path has a condition (path condition) for each symbol. For example, in the symbolic tree of FIG. 2, the path condition of the execution path P (the part surrounded by a broken line) is represented by “Sa> = 0∧Sa <= 5∧Sb> 0∧Sc> 0”.

  After such symbolic execution, whether or not the path condition can be satisfied is determined using, for example, a SAT (satisfiability) or SMT (satisfiability modulo theory) solver. Note that symbolic execution may be used in combination with a model checking engine such as JPF (Java (registered trademark) Path Finder).

  Here, the execution path can be shown as a test case. In addition, the sufficiency value of the symbol value in the path condition can be shown as test data. Thus, by using symbolic execution, test case variations can be generated within a range of combinations of logically possible path conditions.

  Therefore, in symbolic execution, all the execution paths that can be satisfied in the conditional branch are automatically generated to enable comprehensive execution of the program. At this time, the number of test cases is reduced by selecting test cases based on a certain viewpoint and value (code coverage, similarity, etc.) from test cases generated mainly by test case automatic generation technology that tends to be redundant and enormous. It is required to do.

  Examples of code coverage include statement coverage, branch coverage, condition coverage, multi-condition coverage, and path coverage. Test cases generated by symbolic execution are based on path coverage.

  However, since symbolic execution generates all executable path conditions as described above, the number of combinations of path conditions becomes enormous. As a result, the number of test cases based on path coverage also becomes enormous.

  Therefore, it is required to select test cases so that the number of cases is more realistic. In order to select a test case that satisfies a certain code coverage, the test case is actually executed one by one, and a set of test cases at the time when a certain coverage is satisfied using the coverage measurement device is selected. A way to do this is considered.

However, in this method, since coverage cannot be measured unless the test cases are actually executed one by one, it is desirable to narrow down the test cases. In this way, the accuracy of narrowing down test cases greatly depends on the actual execution order. In other words, the narrowed collection of test cases may include many redundant test cases, and it is difficult to sufficiently reduce the number of test cases.
Therefore, a test case selection technique for eliminating a redundant test case and selecting a test case is provided.

FIG. 3 shows an example of a route condition selection device in the present embodiment. The path condition selection device 1 includes an acquisition unit 2, a decomposition unit 3, an extraction unit 4, a selection unit 5, a decomposition storage unit 6, and a target logical expression storage unit 7.
The acquisition unit 2 acquires route condition information (path condition). The path condition information is information representing an execution path indicated by a combination of processing paths branched and passed by a condition included in the source code by a logical expression formed by connecting atomic logical expressions with logical products. An example of the acquisition unit 2 is the acquisition unit 13.

The decomposition unit 3 decomposes the path condition information into a target logical expression that is a logical expression including one or more atomic logical expressions. An example of the decomposition unit 3 includes decomposition units 14 and 14a.
The decomposition storage unit 6 stores path decomposition information that is information relating the decomposed target logical expression for each piece of path condition information. As an example of the decomposition storage unit 6, an atomic logical formula table 19 and a combination table 32 are given.

The target logical expression storage unit 7 stores the target logical expression. Examples of the target logical expression storage unit 7 include target logical expression tables 20 and 33.
The extraction unit 4 acquires route decomposition information from the decomposition storage unit 6. When the acquired path decomposition information includes a differential logical expression that is a target logical expression other than the target logical expression stored in the target logical expression storage unit 7, the extraction unit 4 extracts the differential logical expression and extracts the target logical expression Store in the storage unit 7. Examples of the extraction unit 4 include extraction units 15 and 15a.

  The selection unit 5 selects route condition information corresponding to the route decomposition information from which the logical expression of the difference is extracted from the acquired route condition information. An example of the selection unit 5 is a selection unit 16.

  Here, when the target logical expression is an atomic logical expression, the following processing is performed. The decomposition unit 3 decomposes the acquired path condition information for each atomic logical expression. The decomposition storage unit 6 stores path decomposition information, which is information relating the decomposed atomic logical expression for each path condition information. The target logical expression storage unit 7 stores an atomic logical expression as a target logical expression. The extraction unit 4 acquires route decomposition information from the decomposition storage unit. The extraction unit 4 collates the first atomic logical expression included in the acquired path decomposition information with the second atomic logical expression stored in the target logical expression storage unit. When the first atomic formula is an atomic formula other than the second atomic formula stored in the target formula storage unit 7, the extraction unit 4 extracts the first atomic formula and extracts the target formula Store in the storage unit 7. The selection unit 5 selects route condition information corresponding to the route decomposition information from which the first atomic logical expression is extracted from the obtained route condition information.

  By configuring in this way, a test case without redundancy can be selected from the test cases generated by symbolic execution for a test related to condition coverage.

  Further, the processing path may be a processing path determined by a plurality of conditions. In this case, the acquired route condition information includes position information indicating a position where a condition corresponding to the atomic logical expression in the source code is described in the atomic logical expression included in the route condition information. The decomposition unit 3 decomposes the logical expression included in the acquired path condition information for each position information to obtain a combination of atomic logical expressions, and associates the combination of atomic logical expressions with the positional information. The decomposition storage unit 6 stores path decomposition information, which is information related to a combination of atomic logical expressions related to position information for each path condition information. The target logical expression storage unit 7 stores a combination of atomic logical expressions associated with positional information as target logical expressions. The extraction unit 4 acquires route decomposition information from the decomposition storage unit 6. The extraction unit 4 collates the first combination indicating the combination of the atomic logical expressions included in the acquired path decomposition information with the second combination indicating the combination of the atomic logical expressions stored in the target logical expression storage unit. Here, the second combination is a combination of atomic formulas associated with position information that matches the position information of the first combination. When the first combination is a combination of atomic logical formulas other than the second combination stored in the target logical formula storage unit 7, the extraction unit 4 extracts the first combination and stores it in the target logical formula storage unit 7. Store. The selection unit 5 selects route condition information corresponding to the route decomposition information from which the first combination is extracted from the acquired route condition information.

  By configuring in this way, a test case without redundancy can be selected from test cases generated by symbolic execution for a test related to multi-condition coverage.

  The route condition selection device 1 further includes a generation unit 8. The generation unit 8 generates route condition information from the source code. At the same time, the generation unit 8 determines whether the execution path is a specific execution path based on a variable set according to the execution path included in the source code. When it is determined that the execution path is the specific execution path, the generation unit 8 adds specific path determination information indicating whether or not the execution path is the specific execution path to the generated path condition information. As an example of the generation unit 8, there is a test case generation unit 43 that performs symbolic execution on the source code 40 using the symbolic execution driver in which the predetermined code is incorporated by the driver change unit 42.

  In this case, the extraction unit 4 acquires route decomposition information having specific route determination information indicating that the route is a specific execution route from the decomposition storage unit 6. When the acquired path decomposition information includes a differential logical expression that is a target logical expression other than the target logical expression stored in the target logical expression storage unit 7, the extraction unit 4 extracts the differential logical expression and extracts the target logical expression Store in the storage unit 7. Thereafter, the extraction unit 4 acquires route decomposition information having specific route determination information indicating that the route is not a specific execution route from the decomposition storage unit 6. When the acquired path decomposition information includes a differential logical expression that is a target logical expression other than the target logical expression stored in the target logical expression storage unit 7, the extraction unit 4 extracts the differential logical expression and extracts the target logical expression Store in the storage unit 7.

  With this configuration, it is possible to select a test case without redundancy while selecting a specific test case from test cases generated by symbolic execution.

<First Embodiment>
In the first embodiment, path conditions (test cases) generated by symbolic execution are decomposed into atomic logical expressions, and all types of atomic logical expressions included in the path conditions can be executed. Select. At this time, when selecting a test case, a path condition including an atomic logical formula that is not included in any of the already selected path conditions is selected. Here, the atomic logical formula is the minimum unit (single condition) of the logical formula or its negation. A logical expression is an expression that represents a condition (precondition or postcondition). The negation of a logical expression is a logical expression obtained by combining NOT with a logical expression.

  FIG. 4 is a diagram for explaining the first embodiment. The test case selection device searches for a test case satisfying a certain coverage from all test cases without actually executing the test case by analyzing the path condition of each test case. In other words, the test case selection device satisfies the atomic logical expression included in the path condition as a conditional expression on the program and how many atomic logical expressions (or combinations thereof) are satisfied for each path condition. Is analyzed on the path condition. Code coverage is closely related to atomic conditions in conditional expressions in the program. Here, the atomic condition is a condition on the source code corresponding to the atomic logical expression.

  The table of FIG. 4 is a table in which path conditions (test cases) obtained by symbolic execution are decomposed into atomic logical expressions. In the column direction of the table of FIG. 4, atomic logical expressions on the path condition are arranged. For example, the atomic logical expression “Sa ≧ 0” corresponds to the atomic condition “a> = 0” on the source code of FIG. If the test case 1 is “Sa ≧ 0 Sa ≦ 5∧Sb> 0∧Sc> 0”, in the table of FIG. 4, “Sa ≧ 0”, “Sa ≦ 5”, “Sb” corresponding to the test case 1 are obtained. “0” is added to “> 0” and “Sc> 0”.

First, test case 1 is selected. As described above, the test case 1 includes the atomic logical expressions “Sa ≧ 0”, “Sa ≦ 5”, “Sb> 0”, and “Sc> 0”.
Next, focus on test case 2. Since test case 2 includes an atomic logical expression “¬ (Sb> 0)” that is not included in test case 1, test case 2 is selected.

Next, attention is paid to test case 3. Since the test case 3 includes the atomic logical expression “¬ (Sc> 0)” that is not included in any of the test cases 1 and 2, the test case 3 is selected.
Next, attention is paid to test case 4. Since all of the atomic logical expressions included in the test case 4 are included in any of the test cases 1, 2, and 3, the test case 4 is not selected.

Next, attention is paid to test case 5. Since the test case 5 includes the atomic logical expression “¬ (Sa ≧ 0)” that is not included in any of the test cases 1 to 4, the test case 5 is selected.
Similarly, for the test cases 6 and later, when the test case of interest includes an atomic logical formula different from the atomic logical formula included in the test cases selected so far, the test case of interest is selected. Then, in the case of the table of FIG. 4, five test cases 1, 2, 3, 5, and 9 are selected from the 12 test cases. Thereby, if the test cases 1, 2, 3, 5, and 9 are used, a test that can satisfy all the atomic logical expressions of all the path conditions can be executed.

  FIG. 5 shows an example of the configuration of the test case selection device according to the first embodiment. The test case selection device 11 includes a control unit 12 and a storage unit 22. The storage unit 22 includes a path condition table 18, an atomic logic formula table 19, a target logic formula table 20, and a selected path condition table 21.

  The path condition table 18 stores combinations of execution paths obtained by performing symbolic execution on the source code, that is, combinations of path conditions (test cases). The atomic logical formula table 19 stores an atomic logical formula included in the path condition for each path condition. In the target logical expression table 20, the atomic logical expressions constituting the path condition are stored for each type. The selected path condition table 21 stores path conditions selected by the selection unit 16 among the path conditions included in the path condition table 15.

  The control unit 12 includes an acquisition unit 13, a decomposition unit 14, an extraction unit 15, a selection unit 16, and an output unit 17. The acquisition unit 13 acquires path condition information (test case) 10 obtained by performing symbolic execution on the source code with an input device (not shown), and stores it in the path condition table 18.

  The decomposition unit 14 decomposes each path condition stored in the path condition table 18 into an atomic logical expression. The decomposition unit 14 stores the atomic logical formula in the atomic logical formula table 19 for each path condition.

  The extraction unit 15 extracts an atomic logical expression other than the atomic logical expressions previously held in the target logical expression table 20 from the atomic logical expression of the focused path condition in the atomic logical expression table 19. The extraction unit 15 stores the extracted atomic logical expression in the target logical expression table 20. Further, the extraction unit 15 sets a flag for the path condition in the atomic logical expression table 19 in order to specify the path condition that includes the extracted atomic logical expression.

  The selection unit 16 detects the flag condition in which the flag is set from the atomic logic formula table 19. The selection unit 16 selects a path condition corresponding to the detected path condition from the path condition table 18 and stores the selected path condition in the selected path condition table 21.

The output unit 17 outputs the path condition 10a stored in the selected path condition table 21 to an output device such as a display or a printer.
The functions of the acquisition unit 13, the decomposition unit 14, the extraction unit 15, and the selection unit 16 will be described in detail with reference to FIGS.

  FIG. 6 shows an example of path condition information as input information obtained as a result of performing symbolic execution on the source code of FIG. In FIG. 6, as described with reference to FIG. 2, it is assumed that twelve path condition information 10 indicated by path conditions 1 to 12 (pc1 to pc12) are obtained by symbolic execution. In the path condition information 10, pc1 to pc12 are identification information for identifying path conditions.

  FIG. 7 shows an example of a path condition table in the first embodiment. The path condition table 18 includes data items “No.” 181 and “pass condition” 182. “No.” 181 stores a No. corresponding to information for identifying the path condition. In the “pass condition” 102, path condition information corresponding to the No. stored in the “No.” 181 is stored.

  Here, the operation of the acquisition unit 13 related to the path condition table 18 will be described. The acquisition unit 13 acquires the path condition information 10 input by the input device and stores it in the path condition table 18.

  FIG. 8 shows an example of an atomic logical expression table in the first embodiment. The atomic logical formula table 19 includes data items “No.” 191 and “atomic logical formula” 192. “No.” 191 stores a No. corresponding to the identification information of the path condition. In the “atomic formula” 102, an atomic formula included in the path condition information corresponding to the No. stored in the “No.” 191 is stored.

  Here, the operation of the decomposition unit 14 related to the atomic logic formula table 19 will be described. The decomposition unit 14 reads path condition information from the path condition table 18 and decomposes the read path condition information into an atomic logical expression. The decomposition unit 14 stores the atomic logical formula in the atomic logical formula table 19 for each path condition.

  FIG. 9 shows an example in which the data item “selection” 193 is added to the atomic formula table of FIG. FIG. 10 shows an example of the target logical expression table in the first embodiment. The target logical expression table 20 holds atomic logical expressions other than the atomic logical expressions held so far among the atomic logical expressions included in the focused path condition in the atomic logical expression table 19. As a result, all types of atomic logical expressions included in the atomic logical expression table 19 are finally stored in the target logical expression table 20. That is, in the target logical expression table 20, finally, atomic logical expressions included in all path conditions are stored for each type.

  Here, the operation of the extraction unit 15 relating to the target logical expression table 20 will be described. The extraction unit 15 extracts an atomic logical expression that is not held in the target logical expression table 20 from the atomic logical expression of the focused path condition in the atomic logical expression table 19. The extraction unit 15 stores the extracted atomic logical expression in the target logical expression table 20. Further, the extraction unit 15 sets a flag (selection flag) in the “selection” 193 corresponding to the path condition including the extracted atomic logical formula in the atomic logical formula table 19.

  FIG. 11 shows an example of the selected path condition table in the first embodiment. The selection unit 16 detects the flag condition in which the flag is set from the atomic logic formula table 19. The selection unit 16 selects a path condition corresponding to the detected path condition from the path condition table 18 and stores the selected path condition in the selected path condition table 21.

  12 to 14 show an example of a test case selection flow in the first embodiment. The user inputs the path condition obtained by the symbolic execution to the test case selection device 11 using the input device. The acquisition unit 13 acquires the input path condition and stores it in the path condition table 18 (S1).

  The decomposition unit 14 reads a record from the path condition table 18 (S3). The decomposition unit 14 determines whether or not an atomic logical expression exists in the path condition of the read record (S4). When an atomic logical formula exists in the path condition of the read record (“Yes” in S4), the decomposition unit 14 extracts the atomic logical formula included in the path condition of the record and stores it in the atomic logical formula table 19 (S5). ). The decomposition unit 14 repeats the process of S5 until all the atomic logical expressions are extracted from the path condition of the record.

  If there is no atomic logical expression in the path condition of the read record (“No” in S4), and there is an unprocessed record in the path condition table 18 (“Yes” in S2), the decomposition unit 14 Process. That is, the decomposition unit 14 reads the next record from the path condition table 18 and performs the processes of S3 to S5. If there is no unprocessed record in the path condition table 18 (“No” in S2), the process transitions to the process of S6 in FIG.

  Next, when there is an unprocessed record for the processes of S7 to S10 in the atomic logical formula table 19, the extraction unit 15 reads the record from the atomic logical formula table 19 (S7). The extraction unit 15 determines whether there is an atomic logical expression that does not exist in the target logical expression table 20 among the atomic logical expressions included in the record read in S7 (S8).

  When there is an atomic logical formula (difference) that does not exist in the target logical formula table 20 among the atomic logical formulas included in the record read in S7, the extraction unit 15 sets the differential atomic logical formula in the target logical formula table 20 (S9). At this time, the extraction unit 15 sets a flag in the data item “selection” 193 of the read record in the atomic logical formula table 19.

  On the other hand, in S8, when all the atomic formulas included in the read record exist in the target formula table 20 (“No” in S8), or when the process of S10 is completed, the process returns to S6. While there is an unprocessed record in the atomic formula table 19 (“Yes” in S6), the extraction unit 15 reads the next record from the atomic formula table 19 and performs the processes of S7 to S10. While there is no unprocessed record in the atomic logical formula table 19 (“No” in S6), the process transitions to the process of S11 in FIG.

  Next, when there are unprocessed records for S12 to S14 in the atomic formula table 19, the selection unit 16 reads the records from the atomic formula table 19 (S12). The selection unit 16 determines whether or not the selection flag of the read record is set (S13).

  In S13, when it is determined that the selection flag of the read record is set (“Yes” in S13), the selection unit 16 determines from the path condition table 18 the path of the same number as the record in which the selection flag is set. Get the condition. The selection unit 16 adds the acquired path condition to the selected path condition table 21 (S14).

  In S13, when it is determined that the selection flag of the target record is not set (“No” in S13), or when the process of S14 is completed, the process returns to S11. While there are unprocessed records for S12 to S14 in the atomic formula table 19 (“Yes” in S11), the extraction unit 15 reads the next record from the atomic formula table 19 (S12), and S13 to S13. The process of S14 is performed. If the processing is completed for all the records in the atomic formula table 19 (“No” in S11), this flow ends.

  According to the present embodiment, in selecting a test case, a test case composed of atomic logical expressions (a set of all atomic logical expression types constituting all path conditions) included in the target logical expression table is not selected. Can be. Thereby, redundant test cases can be eliminated. Therefore, the more test cases that are configured from the atomic logical expressions included in the target logical expression table, the more test cases can be reduced than the method of measuring coverage while executing the test cases one by one. That is, as the number of test cases obtained by symbolic execution increases, the reduction rate of the number of test cases improves.

<Second Embodiment>
In the first embodiment, all path conditions are divided into AND logical parts by dividing them into AND parts, and when a path condition is selected, a path condition including an atomic logical expression that is not included in the already selected path condition is selected. did. On the other hand, in the second embodiment, a certain logical expression is handled by a set (partial logical expression) of a plurality of atomic logical expressions, and a portion that is not included in the already selected path condition when selecting a path condition. Select a path condition that includes a logical expression. Here, the partial logical expression is a logical expression that logically combines terms (predicates relating to program variables) obtained by applying a relational operation to program variables. As an example of the partial logical expression, “a> = 0 & a <= 5” in FIG. The partial logical expression “a> = 0 & a <= 5” is a logical expression obtained by logically combining the term “a> = 0” and the term “a ≦ = 5”.

  Rather than determining the branch destination based on the value of one variable, the branch destination is determined by a combination of a plurality of variables. When the branch condition of the program is a multi-condition, the following processing is performed so that the conditions of the elements of the branch condition can be individually determined. In other words, regarding the “series of conditions” that are the judgments of branching, even if there is an AND part, it is not divided. Here, the determination of whether or not the “series of conditions” is satisfied can be determined from, for example, the line numbers because the series of conditions are described in the vicinity of the same line in the source code of the original program. The line number can be obtained by assigning the line number in the source code of the original program to the path condition in symbolic execution and performing output.

  15 and 16 are diagrams for explaining the second embodiment. In the second embodiment, a set of partial logical expressions that is a target to be satisfied by the test case according to the code coverage to be achieved is extracted, and a path condition having the partial logical expression is selected. Path conditions are selected until all types of partial logical expressions are satisfied. However, when selecting a path condition, a path condition including a partial logical expression that is not included in the already selected path condition is selected.

  FIG. 15A shows a set of path conditions (set of test cases) generated by symbolic execution. FIG. 15B is a set of partial logical expressions (target partial logical expression set) that is a target to be satisfied by the test case.

  The table of FIG. 16 is a table in which path conditions for each test case obtained by symbolic execution are decomposed for each target partial logical expression. In the column direction of the table of FIG. 16, target partial logical expression sets on the path condition are arranged.

First, test case 1 is selected. Test case 1 includes target partial logical expressions “(Sa ≧ 0) ∧ (Sa ≦ 5)” and “(Sb> 0) ∧ (Sc> 0)”.
Next, focus on test case 2. Since test case 2 includes a target partial logical expression “¬ (Sb> 0) ∧ (Sc> 0)” that is not included in test case 1, test case 2 is selected.

  Next, attention is paid to test case 3. Since test case 3 includes a target partial logical expression “(Sb> 0) ∧¬ (Sc> 0)” that is not included in either of test cases 1 and 2, test case 3 is selected.

  Next, attention is paid to test case 4. Since test case 4 includes the target partial logical expression “¬ (Sb> 0)) (Sc> 0)” that is not included in any of test cases 1 to 3, test case 4 is selected.

  Next, attention is paid to test case 5. Since test case 5 includes a target partial logical expression “¬ (Sa ≧ 0) ∧ (Sa ≦ 5)” that is not included in any of test cases 1 to 4, test case 5 is selected.

Next, attention is paid to the test case 6. Since all the target partial logical expressions of the test case 6 are included in any of the test cases 1 to 5, the test case 6 is not selected.
Similarly, for test case 7 and later, if the target partial logical expression of the target test case is different from the target partial logical expression included in the test case selected so far, select the target test case. To do. Then, in the case of the table of FIG. 16, six test cases 1, 2, 3, 4, 5, 9 are selected from the 12 test cases. Thereby, if the test cases 1, 2, 3, 4, 5, and 9 are used, it is possible to execute a test that satisfies all the target partial logical expressions in the path condition.

  FIG. 17 shows an example of the configuration of the test case selection device according to the second embodiment. The test case selection device 11 includes a control unit 12 and a storage unit 22. The storage unit 22 includes a path condition table 31, a combination table 32, a target logical expression table 33, a selected path condition table 34, and a line number table 35.

  The path condition table 31 stores combinations of execution paths obtained by performing symbolic execution on the source code, that is, combinations of path conditions (test cases). In the present embodiment, as will be described later, the atomic logical expression included in the path condition includes information (for example, a line number) indicating a position where a condition corresponding to the atomic logical expression is described in the source code. Number).

  The combination table 32 stores, for each path condition, a combination of atomic logical expressions decomposed for each assigned line number included in the pass condition, that is, a logical expression (partial logical expression) included in the path condition. .

In the target logical expression table 33, combinations (partial logical expressions) of atomic logical expressions decomposed for each line number constituting the path condition are stored according to the line numbers.
In the selected path condition table 34, path conditions selected by the selection unit 16 among the path conditions included in the path condition table 31 are stored.

  The control unit 12 includes an acquisition unit 13, a decomposition unit 14 a, an extraction unit 15 a, a selection unit 16, and an output unit 17. The operation differs from the first embodiment in the disassembling unit 14a and the extracting unit 15a. The acquisition unit 13 acquires path condition information (test case) 30 that is a combination of path conditions obtained by performing symbolic execution on the source code with an input device (not shown), and stores the path condition information 18 in the path condition table 18. Store.

  The decomposing unit 14 a extracts all the line numbers existing in all the path conditions in the path condition table 31 and stores them in the line number table 35. Then, the decomposition unit 14a disassembles each path condition in the path condition table 31 for each row number, and acquires a partial logical expression. The decomposition unit 14a stores combinations of atomic logical expressions obtained by decomposition for each row number in the combination table 32 for each path condition.

  The extraction unit 15a stores the combination of the atomic logical expressions (partial logical expressions) included in the combination table 32 in the target logical expression table 33 corresponding to the row number. However, the extraction unit 15a does not store the combination of atomic formulas (partial formulas) already in the target formula table 33. At this time, the extraction unit 15 a sets a flag (selection flag) for the path condition in the combination table 32 for the path condition having the combination of the atomic logical expressions (partial logical expressions) stored in the target logical expression table 33.

  The selection unit 16 detects a path condition in which a selection flag is set from the combination table 32. The selection unit 16 selects a path condition corresponding to the detected path condition from the path condition table 31 and stores the selected path condition in the selected path condition table 34.

  The output unit 17 outputs the path condition stored in the selected path condition table 21 to an output device such as a display or a printer.

  FIG. 18 shows an example of the source code in the second embodiment. In FIG. 18, it is assumed that the condition “a> = 0 & a <= 5” is described in the first line of the source code. Also. It is assumed that the condition “b> 0 & c> 0” is described in the second line of the source code.

  FIG. 19 shows an example of path condition information as input information obtained as a result of performing symbolic execution on the source code of FIG. Compared with FIG. 6, FIG. 19 uses a function of outputting the line condition in the original program together with the path condition in symbolic execution. Therefore, each atomic logical expression included in the path condition is given a line number on the source code. For example, (l1, (Sa ≧ 0)) indicates that a condition corresponding to “Sa ≧ 0” is described in the first line of the source code.

  FIG. 20 shows an example of a path condition table in the second embodiment. The path condition table 31 includes data items “No.” 311 and “path condition” 312. “No.” 311 stores a No. corresponding to information for identifying the path condition. In the “pass condition” 312, path condition information corresponding to the No. stored in the “No.” 311 is stored.

  Here, the operation of the acquisition unit 13 related to the path condition table 31 will be described. The acquisition unit 13 acquires the path condition information 30 input by the input device and stores it in the path condition table 31.

FIG. 21 shows a line number table in the second embodiment. The line number table 35 stores the line numbers assigned to the atomic logical expressions included in the path condition.
Here, the operation of the disassembling unit 14a regarding the line number table 35 will be described. The decomposing unit 14 a extracts all the line numbers existing in all the path conditions in the path condition table 31 and stores them in the line number table 35.

  FIG. 22 shows an example of a combination table in the second embodiment. The combination table 32 includes data items “No.” 321 and “combinations of atomic logical expressions for each row number” 322. “No.” 321 stores a No. corresponding to the identification information of the path condition. “Atom logical formula combination” 322 stores a combination of atomic logical formulas for each row number included in the path condition information corresponding to No. stored in “No.” 321. For example, in the record (No. 01) of the combination table 32, the combination of atomic formulas of line number 1 “(l1, (Sa ≧ 0)) (l1, (Sa ≦ 5))” and line number 1 The combination of atomic formulas of “(l2, (Sb> 0)) ∧ (l2, (Sc> 0))” is stored.

  Here, the operation of the disassembling unit 14a regarding the combination table 32 will be described. The decomposition unit 14a acquires a combination of atomic logical formulas obtained by disassembling the path conditions in the path condition table 31 for each row number. The decomposition unit 14a stores combinations of atomic logical expressions obtained by decomposition for each row number in the combination table 32 for each path condition.

  FIG. 23 shows an example in which the data item “selection” 323 is added to the combination table 32 of FIG. In the target logical formula table 33, combinations of atomic logical formulas other than the combinations of atomic logical formulas held so far among the combinations of atomic logical formulas included in the focused path condition in the combination table 32 are stored in the target logical formula table 33. It is held for each number.

  FIG. 24 shows an example of the target logical expression table in the second embodiment. FIG. 24A shows a target logical expression table 331 for a combination of atomic logical expressions of line number 1 (l1). In the target logical expression table 331, the combination of the atomic logical expressions of the line number 1 (l1) indicated by the underline in the combination table 32 of FIG. 23 is stored. FIG. 24B shows a target logical expression table 332 for the combination of atomic logical expressions in line number 2 (l2). The target logical expression table 332 stores a combination of atomic logical expressions of line number 2 (l2) shown in italics in the combination table 32 of FIG. Thereby, the target logical expression table 33 finally stores combinations of all types of atomic logical expressions included in the combination table 32 for each row number.

  Here, the operation of the extraction unit 15a regarding the target logical expression table 33 will be described. The extraction unit 15a stores the combination of atomic logical expressions included in the combination table 32 in the target logical expression table 33 corresponding to the row number. However, the extraction unit 15a does not store a combination of atomic logical expressions already in the target logical expression table 33. At this time, the extracting unit 15a sets a flag (selection flag) for the path condition in the combination table 32 as shown in FIG. 23 for the path condition having the combination of the atomic logical expressions stored in the target logical expression table 33. Stand up.

  FIG. 25 shows an example of the selected path condition table in the second embodiment. The selection unit 16 detects a path condition in which a selection flag is set from the combination table 32. The selection unit 16 selects a path condition corresponding to the detected path condition from the path condition table 31 and stores it in the selected path condition table 24.

  26 to 30 show an example of a test case selection flow in the second embodiment. The user inputs a path condition in which a line number is assigned to each atomic logical expression obtained by symbolic execution to the test case selection device 11 using the input device. The acquisition unit 13 acquires the input path condition and stores it in the path condition table 31 (S21).

  The decomposition unit 14a reads a record from the path condition table 31 (S23). The decomposition unit 14a determines whether an atomic logical expression exists in the path condition of the read record (S24). When an atomic logical formula exists in the path condition of the read record (“Yes” in S24), the decomposition unit 14a determines the first atomic logical formula of the path condition of the record, the line number assigned to the atomic logical formula, Is taken out (S25).

  The decomposition unit 14a determines whether or not the extracted line number exists in the line number table 35 (S26). When the extracted line number does not exist in the line number table 35 (“No” in S26), the disassembling unit 14a stores the line number in the line number table 35 (S27).

  If the line number retrieved in S26 exists in the line number table 35 (“Yes” in S26), or after the process of S27, the process returns to S24. The decomposition unit 14a performs the processing of S25 to S27 for each atomic logical expression in the condition read in S23.

  When the processing of S25 to S27 is completed for all atomic logical expressions in the path condition read in S23 (“No” in S24), the decomposition unit 14a reads the next path condition from the path condition table 31 (“S22” Yes ", S23). The decomposition unit 14a performs the processing of S23 to S27 for all the path conditions in the path condition table 31.

  When the processing of S23 to S27 is completed for all the path conditions in the path condition table 31 (“No” in S22), the disassembling unit 14a reads the path condition from the head of the path condition table 31 again (S29). The decomposition unit 14a extracts the line number from the line number table 35 (S31). The decomposition unit 14a determines whether or not an atomic logical expression having the extracted row number exists in the path condition read in S29 (S32).

  In S32, if the path condition read in S29 includes an atomic logical expression having the extracted row number (“Yes” in S32), the decomposing unit 14a performs the following process. That is, the decomposing unit 14a adds a combination of atomic logical expressions having the row number connected by logical conjunction to the combination table 32 (S33). The decomposing unit 14a performs the process of S33 for all atomic logical expressions having the extracted row numbers in the path condition read out in S29.

  When the processing of S33 is completed for all atomic logical expressions having the extracted row numbers in the path condition read out in S29 (“No” in S32), the processing returns to S30. The disassembling unit 14a performs the processing of S31 to S33 for each row number stored in the row number table 35. When the processes of S31 to S33 are completed for each line number stored in the line number table 35, the process returns to S28.

The disassembling unit 14a performs the processes of S29 to 33 for all the path conditions in the path condition table 31.
When the processing of S29 to 333 is completed for all the path conditions in the path condition table 31 (“No” in S28), the extraction unit 15a uses the target logical expression table corresponding to the line numbers stored in the line number table 35. 33 is created (S34, S35).

  When the target logical expression table corresponding to the line number stored in the line number table 35 is created, the extraction unit 15a reads one record from the combination table 32 (S37).

  The extraction unit 15a extracts a combination of atomic logical expressions from the read record (S39). The extraction unit 15a determines whether or not the same combination of atomic formulas exists in the target logical formula table 33 corresponding to the row number assigned to the extracted combination of atomic formulas (S40).

  If there is no combination of the same atomic logical formulas in the target logical formula table corresponding to the row number assigned to the combination of the extracted atomic logical formulas (“No” in S40), the extracting unit 15a A combination of the atomic logical formulas is added to 33 (S41). At this time, the extraction unit 15a sets a selection flag for the record read in S37 (S42). Thereafter, the process returns to S38.

  If the same combination of atomic logical formulas exists in the target logical formula table corresponding to the line number assigned to the extracted combination of atomic logical formulas (“Yes” in S40), the process returns to S38.

  The extraction unit 15a performs the processing of S39 to S42 for the combination of all atomic logical formulas included in the record read out in S37 (“Yes” in S38). When the processing of S39 to S42 is completed for the combination of all atomic formulas included in the record read in S37 (“No” in S38), the processing returns to S36. The extraction unit 15a performs the processing of S37 to 42 for all the records in the combination table 32 (“Yes” in S36). When the processing of S37 to 42 is completed for all the records in the combination table 32 (“No” in S36), the selection unit 16 reads records from the combination table 32 (S44). The selection unit 16 determines whether or not the record selection flag is set (S45).

  In S45, when it is determined that the selection flag of the record is set (“Yes” in S45), the selection unit 16 reads the path condition of the same No. as the record with the selection flag from the path condition table 31. get. The selection unit 16 adds the acquired path condition to the selected path condition table 34 (S46).

In S45, when it is determined that the selection flag of the record is not set (“No” in S13), or when the process of S46 is completed, the process returns to S43.
The selection unit 16 performs the processes of S44 to S46 for all the records in the combination table 32. When the processes of S44 to 46 are completed for all the records in the combination table 32 (“No” in S43), this flow ends.

  According to this embodiment, it is possible to select a test case corresponding to multi-condition coverage.

<Third Embodiment>
In the first embodiment, when selecting a test case, a test case including an atomic logical formula that is not yet stored in the target logical formula table is selected. However, when a test is selected by this method, a test case including a specific combination of atomic formulas cannot be selected. As a result, there is a possibility that a specific test case such as a pass condition (test case) having a high usage frequency called a normal system (case where no error occurs) is leaked from the selected test case. This will be described with reference to FIGS.

  FIG. 31 shows an example of the source code of the test target program. FIG. 32 shows a flowchart of the test target program of FIG. FIG. 33A shows a test case obtained by symbolic execution. FIG. 33B shows a test case selected using the first embodiment. Note that the test cases shown in FIGS. 33A and 33B include “No.”, “pass condition”, and “input”. “Input” indicates input information as test data.

  When symbolic execution is performed on the test target program of FIG. 31, it is assumed that path conditions No. 1 to No. 4 are obtained as shown in FIG. It is assumed that the first embodiment is applied to the path conditions No. 1 to No. 4 and the test cases indicated by No. 2 and No. 3 are selected (FIG. 33B). In this case, the test cases indicated by No. 2 and No. 3 include all types of atomic logical expressions included in the path conditions No. 1 to No. 4, so that No. 1 and No. 4 The pass condition is not selected. In this case, as shown in FIG. 32, the path condition indicated by No. 4 is not selected as a normal test case (a case where no error occurs).

  Therefore, in the third embodiment, a test case selection technique for selecting a test case without redundancy while preferentially selecting a specific test case from test cases generated by symbolic execution will be described. Note that in the third embodiment, the same components, functions, or processes as those described in the first or second embodiment are denoted by the same reference numerals as those in the first or second embodiment, and the description thereof is omitted. Is omitted.

(Example 1)
FIG. 34 shows an example of the configuration of the test case selection device according to the third mode for embodying the present invention (embodiment 1). In the test case selection device 11, a source code reading unit 41, a driver change unit 42, a test case generation unit 43, and a test case adjustment unit 44 are added to the control unit 12 of the test case selection device 11 of FIG. In the third embodiment, the acquisition unit 13, the decomposition unit 14, the extraction unit 15, the selection unit 16, and the output unit 17 are referred to as a selection control unit 45. The storage unit 22 also stores a path condition table 18, an atomic logical formula table 19, a target logical formula table 20, a selected path condition table 21, a normal path determination formula 51, and a symbolic execution driver 52.

  The source code reading unit 41 reads the source code 40 of the test target program and stores it in a storage device such as a RAM (Random Access Memory). An example of the source code 40 is shown in FIG. In the source code 40, when the test target program is executed normally (when the normal path is executed), for example, a predetermined value is input (or is not input) to a predetermined variable. It is coded.

  The driver changing unit 42 determines whether or not the execution result of the test target program is normal (normal path) based on the value of a predetermined variable in the read source code 40 with respect to the symbolic execution driver 52. The code of the normal system path determination formula 51 for determination is incorporated. Further, the driver changing unit 42 incorporates into the symbolic execution driver 52 a code that reflects the determination result in a path condition obtained by symbolic execution described later. Here, the symbolic execution driver 52 is driver code for causing the test case generation unit 43 to perform symbolic execution according to a predetermined execution pattern for the source code 40 of the test target program.

  The test case generation unit 43 performs symbolic execution on the source code 40 using the symbolic execution driver in which the predetermined code is incorporated by the driver changing unit 42. Thereby, a combination of execution paths for the source code 40, that is, a combination of path conditions (test case) is obtained and stored in the storage unit 22. Each path condition obtained here is given information on whether or not it is a normal path.

  The test case adjustment unit 44 includes test cases generated by symbolic execution as test cases (path conditions) related to normal paths and test cases (path conditions) related to execution paths other than normal paths (abnormal paths). Group into groups. In addition, the test case adjustment unit 44 initializes the contents of the path condition table 18, the atomic logical expression table 19, the target logical expression table 20, and the selected path condition table 21.

  The test case adjustment unit 44 causes the acquisition unit 13, the decomposition unit 14, the extraction unit 15, and the selection unit 16 to execute the processing described in the first embodiment for the path condition group related to the normal path. Next, the test case adjustment unit 44 causes the acquisition unit 13, the decomposition unit 14, the extraction unit 15, and the selection unit 16 to execute the processing described in the first embodiment for the path condition group related to the abnormal path.

  The acquisition unit 13 acquires path condition information (test cases) related to normal paths or abnormal paths classified by the test case adjustment unit 44 and stores the path condition information in the path condition table 18.

  The decomposition unit 14 decomposes each path condition stored in the path condition table 18 into an atomic logical expression. The decomposition unit 14 stores the atomic logical formula in the atomic logical formula table 19 for each path condition.

  The extraction unit 15 extracts an atomic logical expression other than the atomic logical expressions previously held in the target logical expression table 20 from the atomic logical expression of the focused path condition in the atomic logical expression table 19. The extraction unit 15 stores the extracted atomic logical expression in the target logical expression table 20. Further, the extraction unit 15 sets a flag for the path condition in the atomic logical expression table 19 in order to specify the path condition that includes the extracted atomic logical expression.

  The selection unit 16 detects the flag condition in which the flag is set from the atomic logic formula table 19. The selection unit 16 selects a path condition corresponding to the detected path condition from the path condition table 18 and stores the selected path condition in the selected path condition table 21.

  The output unit 17 outputs the path condition 40a stored in the selected path condition table 21 to an output device such as a display or a printer.

  FIG. 35 is a diagram for explaining processing of the driver changing unit according to the third mode for embodying the present invention (embodiment 1). As a premise, in the source code 40 of the test target program, “ERROR” is set in the message variable when the program is not executed normally (when an abnormal path is executed). That is, in the source code 40, when the program is executed normally (when the normal path is executed), “ERROR” is not set in the message variable.

  The normal system path determination formula 51 is an example of a formula that determines whether or not the execution result of the test target program is normal (normal system path) based on the value of a predetermined variable in the read source code 40. In the third embodiment, the normal system path determination formula 51 is used to determine that a predetermined character such as “ERROR” is not included in the message variable as a result of execution of the test target program.

  In this embodiment, the normal system path determination formula 51 is used. However, one or more checkpoints for determining that a specific execution path has been passed are inserted into the source code, and the checkpoint is determined by determining the checkpoint. It may be detected that a specific execution path has been executed.

  The driver change unit 42 reads the normal path determination formula 51 and the symbolic execution driver 52 from the storage unit 22. The driver changing unit 42 generates the driver 52a by incorporating the code of the normal path determination formula 51 and the code reflecting the determination result of the normal path determination formula 51 in the path condition into the driver 52.

  The driver 52a illustrated in FIG. 35 is an example of a symbolic execution driver in which predetermined code is incorporated by the driver changing unit 42. The driver changing unit 42 inserts the code 53 and the code 54 at the end of the main function of the symbolic execution driver 52.

  The code 53 determines that “SisNormal = true” (normal system) if the message variable does not include “ERROR”, and if the message variable includes “ERROR”, “SisNormal = false”. "(Abnormal system). Here, SisNormal is a symbol variable.

  The code 54 is a code that reflects the SisNormal condition in each path condition obtained by symbolic execution. As a result, as described in FIG. 36, “SisNormal = true” or “SisNormal = false” can be added to each path condition obtained by symbolic execution.

  FIG. 36 shows an example of a test case (path condition) obtained by symbolic execution in the third mode for embodying the present invention (embodiment 1). The test case generation unit 43 performs symbolic execution on the source code 40 using the changed driver 52a. Thereby, a test case (pass condition) 55 is obtained. The obtained test case (pass condition) 55 is stored in the storage unit 22. Each path condition 55 includes a conditional expression (“SisNormal = true” or “SisNormal = false”) assigned to the execution path based on the conditions included in the source code 40 of the test target program based on the codes 53 and 54. .

  FIG. 37 is a diagram for explaining processing of the test case adjustment unit in the third mode for embodying the present invention (embodiment 1). First, the test case adjustment unit 44 extracts a test case (path condition) including SisNormal = true from the test case 55 obtained by performing symbolic execution on the source code 40. The test case adjustment unit 44 causes the acquisition unit 13, the decomposition unit 14, the extraction unit 15, and the selection unit 16 to sequentially execute the processing of the first embodiment for the extracted path condition.

  Specifically, the acquiring unit 13 stores the path condition (path condition including SisNormal = true) extracted by the test case adjusting unit 44 in the path condition table 18. The decomposition unit 14 decomposes each path condition stored in the path condition table 18 into an atomic logical expression. The decomposition unit 14 stores the atomic logical formula in the atomic logical formula table 19 for each path condition.

  The extraction unit 15 extracts an atomic logical expression other than the atomic logical expressions previously held in the target logical expression table 20 from the atomic logical expression of the focused path condition in the atomic logical expression table 19. The extraction unit 15 stores the extracted atomic logical expression in the target logical expression table 20. Further, the extraction unit 15 sets a flag for the path condition in the atomic logical expression table 19 in order to specify the path condition that includes the extracted atomic logical expression.

  The selection unit 16 detects the flag condition in which the flag is set from the atomic logic formula table 19. The selection unit 16 selects a path condition corresponding to the detected path condition from the path condition table 18 and stores the selected path condition in the selected path condition table 21.

  In the case of FIG. 36, the test case adjustment unit 44 selects the No. 4 path condition as the path condition including SisNormal = true. Since the path condition of No. 4 includes the atomic logical expressions “¬ (Sa <0)” and “¬ (Sb <0)”, the extraction unit 15 stores the atomic logical expression “¬ (Sa <0 < 0) ”and“ ¬ (Sb <0) ”are stored (FIG. 37A). In this case, the extraction unit 15 sets a flag for the No. 4 path condition in the atomic logic formula table 19. The selection unit 16 detects the No. 4 path condition having the flag from the atomic logic formula table 19 and stores the path condition in the selected path condition table 21.

  Next, the test case adjustment unit 44 extracts a test case (path condition) including SisNormal = false from the test case 55 obtained by performing symbolic execution on the source code 40. The test case adjustment unit 44 causes the acquisition unit 13, the decomposition unit 14, the extraction unit 15, and the selection unit 16 to sequentially execute the processing of the first embodiment for the extracted path condition. The contents of the path condition table 18 and the atomic logical formula table 19 are cleared and initialized by the test case adjustment unit 44. The target logical expression table 20 holds the atomic logical expressions extracted above. The selected path condition table 21 stores the path conditions stored above.

  Specifically, the acquiring unit 13 stores the path condition (path condition including SisNormal = false) extracted by the test case adjusting unit 44 in the path condition table 18. The decomposition unit 14 decomposes each path condition stored in the path condition table 18 into an atomic logical expression. The decomposition unit 14 stores the atomic logical formula in the atomic logical formula table 19 for each path condition.

  The extraction unit 15 extracts an atomic logical expression other than the atomic logical expressions previously held in the target logical expression table 20 from the atomic logical expression of the focused path condition in the atomic logical expression table 19. The extraction unit 15 stores the extracted atomic logical expression in the target logical expression table 20. Further, the extraction unit 15 sets a flag for the path condition in the atomic logical expression table 19 in order to specify the path condition that includes the extracted atomic logical expression.

  The selection unit 16 detects the flag condition in which the flag is set from the atomic logic formula table 19. The selection unit 16 selects a path condition corresponding to the detected path condition from the path condition table 18 and stores the selected path condition in the selected path condition table 21.

  In the case of FIG. 36, the test case adjustment unit 44 extracts the No. 1 to No. 3 path conditions as the path conditions including SisNormal = false. Among the extracted path conditions, the No. 1 path condition includes atomic logical expressions “Sa <0” and “Sb <0” that are not yet stored in the target logical expression table 20. In this case, the extraction unit 15 stores the atomic logical expressions “Sa <0” and “Sb <0” in the target logical expression table 20 (FIG. 37B). The extraction unit 15 sets a flag for the No. 1 path condition in the atomic logical formula table 19. Since the atomic logical expressions included in the No. 2 to No. 3 path conditions are already stored in the target logical expression table 20, no flags are given to the No. 2 to No. 3 path conditions. The selection unit 16 detects the No. 1 path condition having the flag from the atomic logic formula table 19 and stores the No. 1 path condition in the selected path condition table 21.

  FIG. 38 shows an example of the selected path condition table in the third mode for embodying the present invention (embodiment 1). As described with reference to FIGS. 37A and 37B, the selected path condition table 21 stores No. 1 and No. 4 path conditions.

  FIG. 39 shows an example of a test case selection flow in the third mode for embodying the present invention (embodiment 1). The user inputs the source code 40 of the test target program to the test case selection device 11 using the input device. The source code reading unit 41 reads the input source code 40 (S51).

The driver changing unit 42 inserts a code including the normal path determination formula 51 at the end of the main function of the symbolic execution driver 52 (S52).
The test case generation unit 43 performs symbolic execution on the source code 40 using the symbolic execution driver 52a in which the predetermined code is incorporated by the driver changing unit 42. As a result, a combination of execution paths for the source code 40, that is, a combination of path conditions (test case 55) is obtained (S53). Each path condition obtained here is given information (SisNormal = true or SisNormal = false) indicating whether the path is a normal path.

  The test case adjustment unit 44 classifies the generated test case group 55 into a test case group including SisNormal = true in the path condition and a test case group including SisNormal = false in the path condition (S54).

  The test case adjustment unit 44 clears the contents of the path condition table 18, the atomic logical expression table 19, the target logical expression table 20, and the selected path conditional table 21 for initialization (S55).

  First, the test case adjustment unit 44 causes the acquisition unit 13, the decomposition unit 14, the extraction unit 15, and the selection unit 16 to execute the processes of FIGS. 12 to 14 for a test case group including SisNormal = true in the path condition ( S56). Thereafter, the test case adjustment unit 44 clears the contents of the path condition table 18 and the atomic logical expression table 19 for initialization (S57).

  Next, the test case adjustment unit 44 causes the acquisition unit 13, the decomposition unit 14, the extraction unit 15, and the selection unit 16 to execute the processes of FIGS. 12 to 14 for the test case group including SisNormal = false in the path condition. (S58). Thereafter, the selection unit 16 deletes the conditional expression SisNormal from each path condition stored in the selected path condition table 21 (S59).

  Thereby, it is possible to select a test case without redundancy while preferentially selecting a predetermined test case from test cases generated by symbolic execution.

(Example 2)
Next, Example 2 of the third embodiment will be described. In the third embodiment (Example 1), the first embodiment is applied to each of the test case group including SisNormal = true and the test case group including SisNormal = false. On the other hand, in the third embodiment (Example 2), in the first embodiment, the records stored in the atomic logical expression table are sorted in the order of normal path and abnormal path, and processing is performed. Describe what to do.

  FIG. 40 shows an example of the configuration of the test case selection device according to the third mode for embodying the present invention (embodiment 2). In the test case selection device 11 of FIG. 40, the test case adjustment unit 44 is deleted from the control unit 12 of the test case selection device 11 of FIG. 34, and a sorting unit 61 is added to the selection control unit 45. The processing by the source code reading unit 41, the driver changing unit 42, and the test case generation unit 43 is the same as the processing described above.

The acquisition unit 13 acquires the path condition information (test case) 55 generated by the test case generation unit 43 and stores it in the path condition table 18.
The decomposition unit 14 decomposes each path condition stored in the path condition table 18 into an atomic logical expression. The decomposition unit 14 stores the atomic logical formula in the atomic logical formula table 19a for each path condition.

  The sorting unit 61 sorts the path conditions stored in the atomic logical expression table 19a according to whether or not the conditional condition indicating the normal system path is included. Specifically, the sorting unit 61 sorts the path condition related to the normal path in the atomic logical formula table 19a so that the path condition is on the head side of the table.

  The extraction unit 15 extracts an atomic logical expression other than the atomic logical expressions previously held in the target logical expression table 20 from the atomic logical expression of the focused path condition in the atomic logical expression table 19. The extraction unit 15 stores the extracted atomic logical expression in the target logical expression table 20. Further, the extraction unit 15 sets a flag for the path condition in the atomic logical expression table 19a in order to specify the path condition that includes the extracted atomic logical expression.

  The selection unit 16 detects a flag condition with a flag from the atomic logic formula table 19a. The selection unit 16 selects a path condition corresponding to the detected path condition from the path condition table 18 and stores the selected path condition in the selected path condition table 21.

The output unit 17 outputs the path condition 40a stored in the selected path condition table 21 to an output device such as a display or a printer.
FIG. 41 shows an example of an atomic logical expression table in the third mode for embodying the present invention (embodiment 2). FIG. 41A shows the atomic logical expression table 19a before the sorting process. FIG. 41B shows the atomic logical expression table 19a after the sorting process.

  After decomposing each path condition stored in the path condition table 18 into an atomic logical expression, the decomposing unit 14 converts the atomic logical expression into an atomic logical expression table 19a for each path condition as shown in FIG. To store. At this time, the conditional expression SisNormal (SisNormal = true / false) is stored in the item “SisNormal” of the atomic logical expression table 19a.

Then, as shown in FIG. 41 (B), the sorting unit 61 sorts the atomic condition table 19a so that the path condition related to the normal path is on the top side.
Thereafter, processing by the extraction unit 15, the selection unit 16, and the output unit 17 is performed as in the first embodiment.

  FIG. 42 shows an example of a test case selection flow in the third mode for embodying the present invention (embodiment 2). The test case selection flow in the modification of the third embodiment is a flow in which the process of S61 is added to FIG. 13 of the flow (FIGS. 12 to 14) of the first embodiment. In S61, the sorting unit 61 sorts the records stored in the atomic logical formula table 19a in the order of normal path and abnormal path based on the item “SisNormal”. Processes other than S61 are the same as those in FIGS.

  As a result, the test cases generated by the symbolic execution are sorted so that the extraction unit 15 preferentially selects a predetermined test case. As a result, it is possible to select a test case without redundancy by selecting a test case without redundancy while preferentially selecting a specific test case from test cases generated by symbolic execution.

  FIG. 43 is a configuration block diagram of a hardware environment of a computer to which the first to third embodiments are applied. The computer 70 functions as the test case selection device 11 by reading a program for performing the processes of the first to third embodiments (FIGS. 12 to 14 and FIGS. 26 to 30).

  The computer 70 includes an output I / F 71, a CPU 72, a ROM 73, a communication I / F 74, an input I / F 75, a RAM 76, a storage device 77, a reading device 78, and a bus 79. The computer 70 can be connected to an output device 81 and an input device 82.

  Here, CPU indicates a central processing unit. ROM indicates a read-only memory. RAM indicates random access memory. I / F indicates an interface. An output I / F 71, CPU 72, ROM 73, communication I / F 74, input I / F 75, RAM 76, storage device 77, and reading device 78 are connected to the bus 79. The reading device 78 is a device that reads a portable recording medium. The output device 81 is connected to the output I / F 71. The input device 82 is connected to the input I / F 75.

As the storage device 77, various types of storage devices such as a hard disk drive, a flash memory device, and a magnetic disk device can be used.
For example, the storage device 77 or the ROM 73 stores a program that realizes the processing described in the first to third embodiments. Alternatively, the storage device 77 or the RAM 76 stores a path condition table 18, atomic logical formula tables 19 and 19 a, a target logical formula table 20, and a selected path condition table 21. Alternatively, the storage device 77 or the RAM 76 stores a path condition table 31, a combination table 32, a target logical expression table 33, a selected path condition table 34, and a line number table 35. The storage device 77 or the RAM 76 stores the read source code, the normal path determination formula 51 code, and the symbolic execution driver 52.

CPU72 reads the program which implement | achieves the process demonstrated in the 1st-3rd embodiment stored in the memory | storage device 77 etc., and runs the said program.
Specifically, the CPU 72 functions as the control unit 12 (acquisition unit 13, decomposition units 14 and 14a, extraction units 15 and 15a, selection unit 16, and output unit 17) by executing the program. Further, the CPU 72 functions as the control unit 12 (source code reading unit 41, driver changing unit 42, test case generating unit 43, test case adjusting unit 44, sorting unit 61).

  The program that realizes the processing described in the first to third embodiments may be stored, for example, in the storage device 77 via the communication network 80 and the communication I / F 74 from the program provider side. Moreover, the program which implement | achieves the process demonstrated in the 1st-3rd embodiment may be stored in the portable storage medium marketed and distribute | circulated. In this case, the portable storage medium may be set in the reading device 78 and the program read by the CPU 72 and executed. As the portable storage medium, various types of storage media such as a CD-ROM, a flexible disk, an optical disk, a magneto-optical disk, an IC (integrated circuit) card, and a USB (Universal Serial Bus) memory device can be used. The program stored in such a storage medium is read by the reading device 78.

  As the input device 82, a keyboard, mouse, electronic camera, web camera, microphone, scanner, sensor, tablet, touch panel, or the like can be used. The output device 81 can be a display, a printer, a speaker, or the like. The network 80 may be a communication network such as the Internet, a LAN, a WAN, a dedicated line, a wired line, and a wireless line.

  The first to third embodiments are not limited to the above-described embodiments, and can take various configurations or embodiments without departing from the gist of the present embodiments.

DESCRIPTION OF SYMBOLS 1 Path condition selection apparatus 2 Acquisition part 3 Decomposition part 4 Extraction part 5 Selection part 6 Decomposition storage part 7 Target logical expression storage part 8 Generation part 10 Path condition information 11 Test case selection apparatus 12 Control part 13 Acquisition part 14, 14a Decomposition part DESCRIPTION OF SYMBOLS 15,15a Extraction part 16 Selection part 17 Output part 18 Path condition table 19, 19a Atomic logical expression table 20 Target logical expression table 21 Selected path conditional table 22 Storage part 30 Path condition information 31 Path condition table 32 Combination table 33 Target logical expression Table 34 Selection path condition table 35 Line number table 41 Source code reading unit 42 Driver change unit 43 Test case generation unit 44 Test case adjustment unit 45 Selection control unit 61 Sort unit

Claims (12)

Obtain path condition information, which is information expressed by a logical expression formed by concatenating atomic logical expressions with logical products of execution paths indicated by combinations of processing paths branched and passed by conditions included in the source code. An acquisition unit;
A decomposition unit that decomposes the path condition information into a target logical expression that is a logical expression including one or more atomic logical expressions;
A decomposition storage unit that stores route decomposition information that is information relating the decomposed target logical expression for each of the route condition information;
A target logical expression storage unit for storing the target logical expression;
When the route decomposition information is acquired from the decomposition storage unit and the acquired route decomposition information includes a difference logical expression that is a target logical expression other than the target logical expression stored in the target logical expression storage unit, An extraction unit that extracts a logical expression of the difference and stores it in the target logical expression storage unit;
A selection unit for selecting route condition information corresponding to the route decomposition information from which the logical expression of the difference is extracted from the acquired route condition information;
A path condition selection device comprising: The target logical formula is an atomic logical formula,
The decomposition unit decomposes the acquired path condition information for each atomic logical expression,
The decomposition storage unit stores path decomposition information, which is information relating the decomposed atomic logic formula for each of the path condition information,
The target logical formula storage unit stores the atomic logical formula as the target logical formula,
The extraction unit acquires the path decomposition information from the decomposition storage unit, and includes a first atomic logical expression included in the acquired path decomposition information and a second atomic logic stored in the target logical expression storage unit And when the first atomic logical formula is an atomic logical formula other than the second atomic logical formula stored in the target logical formula storage unit, the first atomic logical formula is extracted. Stored in the target logical expression storage unit,
The route condition according to claim 1, wherein the selection unit selects route condition information corresponding to the route decomposition information from which the first atomic logical expression is extracted from the acquired route condition information. Selection device. The processing path is a processing path determined by a plurality of conditions,
The acquired route condition information includes position information indicating a position where the condition corresponding to the atomic logical expression is described in the source code in the atomic logical expression included in the route conditional information,
The decomposition unit decomposes the logical expression included in the acquired path condition information for each position information to obtain a combination of the atomic logical expressions, and relates the combination of the atomic logical expressions and the positional information. With
The decomposition storage unit stores path decomposition information, which is information related to each path condition information with a combination of atomic logical expressions related to the position information,
The target logical expression storage unit stores a combination of atomic logical expressions related to the position information as the target logical expression,
The extraction unit acquires the path decomposition information from the decomposition storage unit, and stores the first combination indicating a combination of atomic logical expressions included in the acquired path decomposition information and the target logical expression storage unit A second combination that represents a combination of atomic logic formulas, the second combination associated with position information that matches the position information of the first combination is collated, and the first combination is the target If the combination is an atomic logical expression other than the second combination stored in the logical expression storage unit, the first combination is extracted and stored in the target logical expression storage unit;
The route condition selection device according to claim 1, wherein the selection unit selects route condition information corresponding to route decomposition information from which the first combination is extracted from the acquired route condition information. The route condition selection device further includes:
Generating the path condition information from the source code, determining whether the execution path is a specific execution path based on a variable set according to the execution path included in the source code, and executing the execution A generation unit that adds specific route determination information indicating whether or not the execution route is the specific execution route to the generated route condition information when it is determined that the route is the specific execution route;
With
The extraction unit acquires the route decomposition information having the specific route determination information indicating the specific execution route from the decomposition storage unit, and stores the acquired route decomposition information in the target logical expression storage unit If a differential logical expression that is a target logical expression other than the target logical expression is included, the differential logical expression is extracted and stored in the target logical expression storage unit, and then the specific execution is performed from the decomposition storage unit. The route decomposition information having the specific route determination information indicating that it is not a route is acquired, and the acquired route decomposition information is a target logical expression other than the target logical expression stored in the target logical expression storage unit. The path condition selection device according to claim 1, wherein when a logical expression is included, the logical expression of the difference is extracted and stored in the target logical expression storage unit. On the computer,
Obtain path condition information, which is information that represents an execution path indicated by a combination of processing paths that are branched and passed by the conditions included in the source code by a logical expression formed by concatenating atomic logical expressions with logical products. ,
Decomposing the path condition information into a target logical expression that is a logical expression including one or more atomic logical expressions;
Path decomposition information, which is information relating the decomposed target logical expression for each of the path condition information, is stored in the decomposition storage unit;
The route decomposition information is acquired from the decomposition storage unit, and the acquired route decomposition information is a target logical expression other than the target logical expression stored in the target logical expression storage unit in which the target logical expression is stored. If a logical expression is included, the logical expression of the difference is extracted and stored in the target logical expression storage unit;
A route condition selection program for executing a process of selecting route condition information corresponding to the route decomposition information from which the logical expression of the difference is extracted from the acquired route condition information. The target logical formula is an atomic logical formula,
When decomposing the path condition information, the acquired path condition information is decomposed for each atomic logical expression, and the path decomposition information, which is information relating the decomposed atomic logical expression for each path condition information, is decomposed. Store in the storage,
When extracting the differential logical expression, the path decomposition information is acquired from the decomposition storage unit, and the first atomic logical expression included in the acquired path decomposition information and the atomic logical expression are stored as the target logical expression The second atomic logical formula stored in the target logical formula storage unit, and the first atomic logical formula is an atom other than the second atomic logical formula stored in the target logical formula storage unit. If it is a logical expression, the first atomic logical expression is extracted and stored in the target logical expression storage unit,
The route condition information corresponding to the route decomposition information from which the first atomic logical expression is extracted is selected from the acquired route condition information when the route condition information is selected. The described route condition selection program. The processing path is a processing path determined by a plurality of conditions,
The acquired route condition information includes position information indicating a position where the condition corresponding to the atomic logical expression is described in the source code in the atomic logical expression included in the route conditional information,
When decomposing the path condition information, the logical expression included in the acquired path condition information is decomposed for each position information to obtain a combination of the atomic logical expressions, and the combination of the atomic logical expressions and the position Information related to each other, and path decomposition information, which is information related to each path condition information, a combination of atomic formulas related to the position information is stored in the decomposition storage unit,
When extracting the differential logical expression, the path decomposition information is acquired from the decomposition storage unit, a first combination indicating a combination of atomic logical expressions included in the acquired path decomposition information, and the target logical expression as the target logical expression A second combination indicating a combination of atomic logical formulas stored in a target logical formula storage unit in which a combination of atomic logical formulas associated with positional information is stored, and a position that matches the positional information of the first combination When the second combination associated with the information is collated, and the first combination is a combination of atomic formulas other than the second combination stored in the target formula storage unit, the first combination 1 combination is extracted and stored in the target logical expression storage unit;
6. The route according to claim 5, wherein when selecting the route condition information, route condition information corresponding to route decomposition information from which the first combination is extracted is selected from the acquired route condition information. Condition selection program. In addition to the computer,
Generating the path condition information from the source code, determining whether the execution path is a specific execution path based on a variable set according to the execution path included in the source code, and executing the execution When it is determined that the path is the specific execution path, a process for adding specific path determination information indicating whether or not the execution path is the specific execution path to the generated path condition information is executed. ,
When extracting the differential logical expression, the path decomposition information having the specific path determination information indicating the specific execution path is acquired from the decomposition storage unit, and the acquired path decomposition information is the target logical expression. When a difference logical expression that is a target logical expression other than the target logical expression stored in the storage unit is included, the logical expression of the difference is extracted and stored in the target logical expression storage unit, and then from the decomposition storage unit The route decomposition information having the specific route determination information indicating that it is not the specific execution route is acquired, and the target logical formula other than the target logical formula stored in the target logical formula storage unit is acquired. 6. The path condition selection program according to claim 5, further comprising: extracting a difference logical expression and storing the difference logical expression in the target logical expression storage unit. A path condition selection method executed by a computer,
The computer
Information expressed by a logical expression formed by concatenating atomic logical expressions with logical products, which is an execution path indicated by a combination of processing paths that are branched by the conditions included in the source code and passed by the input device. Get some route condition information,
Decomposing the path condition information into a target logical expression that is a logical expression including one or more atomic logical expressions;
Path decomposition information, which is information relating the decomposed target logical expression for each of the path condition information, is stored in the decomposition storage unit;
The route decomposition information is acquired from the decomposition storage unit, and the acquired route decomposition information is a target logical expression other than the target logical expression stored in the target logical expression storage unit in which the target logical expression is stored. If a logical expression is included, the logical expression of the difference is extracted and stored in the target logical expression storage unit;
From the acquired route condition information, select the route condition information corresponding to the route decomposition information from which the logical expression of the difference is extracted,
A route condition selection method for executing a process of outputting the selected route condition information to an output device. The target logical formula is an atomic logical formula,
The computer
When decomposing the path condition information, the acquired path condition information is decomposed for each atomic logical expression, and the path decomposition information, which is information relating the decomposed atomic logical expression for each path condition information, is decomposed. Store in the storage,
When extracting the differential logical expression, the path decomposition information is acquired from the decomposition storage unit, and the first atomic logical expression included in the acquired path decomposition information and the atomic logical expression are stored as the target logical expression The second atomic logical formula stored in the target logical formula storage unit, and the first atomic logical formula is an atom other than the second atomic logical formula stored in the target logical formula storage unit. If it is a logical expression, the first atomic logical expression is extracted and stored in the target logical expression storage unit,
The route condition information corresponding to the route decomposition information from which the first atomic logical expression is extracted is selected from the acquired route condition information when the route condition information is selected. The described route condition selection method. The processing path is a processing path determined by a plurality of conditions,
The acquired route condition information includes position information indicating a position where the condition corresponding to the atomic logical expression is described in the source code in the atomic logical expression included in the route conditional information,
The computer
When decomposing the path condition information, the logical expression included in the acquired path condition information is decomposed for each position information to obtain a combination of the atomic logical expressions, and the combination of the atomic logical expressions and the position Information related to each other, and path decomposition information, which is information related to each path condition information, a combination of atomic formulas related to the position information is stored in the decomposition storage unit,
When extracting the differential logical expression, the path decomposition information is acquired from the decomposition storage unit, a first combination indicating a combination of atomic logical expressions included in the acquired path decomposition information, and the target logical expression as the target logical expression A second combination indicating a combination of atomic logical formulas stored in a target logical formula storage unit in which a combination of atomic logical formulas associated with positional information is stored, and a position that matches the positional information of the first combination When the second combination associated with the information is collated, and the first combination is a combination of atomic formulas other than the second combination stored in the target formula storage unit, the first combination 1 combination is extracted and stored in the target logical expression storage unit;
The route according to claim 9, wherein when selecting the route condition information, route condition information corresponding to route decomposition information from which the first combination is extracted is selected from the acquired route condition information. Condition selection method. The computer further includes:
Generating the path condition information from the source code, determining whether the execution path is a specific execution path based on a variable set according to the execution path included in the source code, and executing the execution When it is determined that the route is the specific execution route, a process of adding specific route determination information indicating whether or not the execution route is the specific execution route to the generated route condition information is executed. ,
When extracting the difference logical expression, the computer acquires the route decomposition information having the specific route determination information indicating the specific execution route from the decomposition storage unit, and the acquired route decomposition information is When including a differential logical formula that is a target logical formula other than the target logical formula stored in the target logical formula storage unit, after extracting the differential logical formula and storing it in the target logical formula storage unit, The route decomposition information having the specific route determination information indicating that it is not the specific execution route is acquired from the decomposition storage unit, and the acquired route decomposition information is other than the target logical expression stored in the target logical expression storage unit The path condition selection method according to claim 9, wherein a difference logical expression that is a target logical expression is extracted and stored in the target logical expression storage unit.