JP2015153323A - Symbolic execution program, symbolic execution method, and symbolic execution device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a symbolic execution device capable of extracting a test case having no duplication.SOLUTION: In a symbolic execution device 50, symbol value setting means 51 sets a symbol value at the value of the item of each record of a DB stub 100; record identification setting means 54 sets the same identification value at a plurality of records satisfying the same search condition for an item among a record group including the symbol value as the value of an item; record retrieval control means 55 extracts one of the plurality of records that satisfy the same search condition among the record group and at which the same identification value is set as an object of symbolic execution processing; and symbolic execution means 52 executes symbolic processing for the symbol value of the item of the extracted record according to the search condition.

Description

  The present invention relates to a symbolic execution program, a symbolic execution method, and a symbolic execution apparatus.

  In program development, a program test operation (hereinafter referred to as “test”) is performed in order to confirm whether the created program operates correctly as expected. It takes time and effort to create test cases and test data capable of comprehensively testing the test target program. Therefore, a technique for generating a test case and test data by performing symbolic execution processing on a test target program has been proposed (see, for example, Non-Patent Document 1).

  In symbolic execution processing, a symbol value (symbol value) is set instead of a definite value (specific value) such as “1” or “A” as an externally input value (argument value) to the program. Is a technology that collects various information during program execution. As a result of analyzing the program by symbolic execution processing, a sequence of command statements that can be executed in the program (hereinafter referred to as “path” or “execution path”), and a condition that a symbol value must satisfy in order to execute the path (Hereinafter referred to as “pass condition”) is extracted.

  FIG. 1 shows an example of the result of symbolic execution processing. FIG. 1 shows an example in which the paths and path conditions in the right table are extracted as a result of analyzing an example of the program shown on the left side by symbolic execution processing. A rectangular box indicated by “example of program” represents a logical constraint (path condition) to be satisfied when a conditional statement is passed in the symbolic execution process for the program. In the symbolic execution process, a process of accumulating such path conditions every time an assignment statement or a conditional statement is passed is performed. In the example of the program in FIG. 1, the condition statement T1 “gender is male?” Is loaded with the path condition “male” and the path condition “non-male”. In the conditional statement T2, a pass condition of “being a woman” and a pass condition of “not a woman” are accumulated.

  As a result, pass 1 with a pass condition where the gender is male and the gender is not female, pass 2 with a pass condition where the gender is not male and the gender is female, and the gender is not male and the gender is not female A path 3 having a path condition is extracted. Since the path conditions in which the sex is male and the sex is female are contradictory and are not satisfied, no path is extracted. The extracted paths 1 to 3 correspond to test cases, and values satisfying the path condition for each path become test data for each test case. By inputting the test data of each test case generated in this way into the argument value of the test target program and executing the operation check of the program, the test target program can be comprehensively tested.

  For example, in a program that constitutes a business system such as order management, a database (Database, hereinafter also referred to as “DB”) may be used to record master data, processing results, history, and the like. When a test target program uses a DB, there are two types of values to be input to the program: an input value set as an argument and a field value acquired from a record in the DB as a result of accessing the DB. is there. The execution path of the test target program changes depending on these two types of input values. Here, changing the execution path of a program means that a series of executed statements, that is, a path is changed by changing a branch selected by a conditional branch instruction depending on an input value. . For this reason, it is necessary to test a program that uses a DB by setting an argument value and a DB field value in the program.

  Thus, as described above, in a test of a program that uses a DB, a method of using a symbolic execution process for generating test data for an argument value and a DB field value can be considered. However, the data type that can be set in the DB field value is a specific value such as a numerical value or a character string, and a symbol value cannot be set. That is, symbolic execution processing using the DB as it is is difficult.

  On the other hand, a technique for stubbing a DB has been proposed so that symbolic execution processing can be performed on a program that uses the DB (see, for example, Patent Document 1). Here, stubbing means substituting a certain process. Thus, stubbing a DB means replacing the DB.

  FIG. 2 shows an example of a result obtained by setting a symbol value in the DB stub 100 obtained by stubbing the DB and performing symbolic execution processing on the symbol value according to the search condition described in SQL. The DB stub 100 in FIG. 2 has three records, and symbol values s1 to s9 are set in the three fields F1, F2, and F3 of each record.

An example in which a program for searching the DB stub 100 in which the symbol value is set is symbolically executed based on the search condition “F1 = c” for the field F1 described by the following SQL (Structured Query Language) search expression will be described. .
SQL search expression: SELECT * FROM Table WHERE (F1 = "c")
In the symbolic execution process at this time, a path condition of “s1 = c” and a path condition of “s1 ≠ c” are first accumulated in a conditional statement “Is F1 of record 1 c?”. Next, a path condition “s4 = c” and a path condition “s4 ≠ c” are stacked in a conditional statement “Is F1 of record 2 c?”. Next, the path condition “s7 = c” and the path condition “s7 ≠ c” are further accumulated in the conditional statement “Is F1 of record 3 c?”. The path condition in which the plurality of symbol values in the field F1 are c does not satisfy the uniqueness constraint on the DB field value and is not satisfied. Here, the value that satisfies the path condition for each path is the test data for each test case. As a result, four test cases are generated, and test data for the four test cases shown in the right table of FIG. 2 is generated. Note that """" and ""! "" And """" all indicate that the value is not c.

The test data specifically generated is as follows.
Test case 1: When no record satisfying the search condition is hit Test case 2: When record 3 is hit, test data is s7 = c
Test case 3: When record 2 is hit, test data is s4 = c
Test case 4: When record 1 is hit, test data is s1 = c

JP 2012-18675 A

Symbolic execution: Tetsuo Tamai, Koichi Fukunaga, "Symbol execution system", Information processing, pp18-28, 1982/01/15

  However, when symbol values are set in a plurality of records of the DB stub, the symbol values of each record are not distinguished. For example, the symbol values of s1, s4, and s7 set in the field F1 of the records 1, 2, and 3 in FIG. 2 are not distinguished. Therefore, test cases 2, 3, and 4 are the same test case because they correspond to the case where one record is hit and the value of c is set in the field F1. Accordingly, two test cases are extracted in duplicate in FIG. As described above, the DB stub symbolic execution process has a problem that duplicate test cases are extracted.

  Accordingly, an object of one aspect is to provide a symbolic execution program, a symbolic execution method, and a symbolic execution device that can extract test cases without duplication.

One idea is that
Among the record group that includes the symbol value as the item value, the same identification value is set for a plurality of records that satisfy the same search condition for the item,
One of a plurality of records that satisfy the same search condition and set the same identification value in the record group is extracted as a symbolic execution process target,
Performing symbolic processing on the symbol value of the item of the extracted record according to the search condition;
A symbolic execution program for causing a computer to execute processing is provided.

  According to one aspect, test cases without duplication can be extracted.

The figure which shows an example of the result of having performed the symbolic execution process of the program. The figure which shows an example of the result of having performed symbolic execution processing of DB stub. The figure which showed an example of the program using DB. The figure which showed an example of the method of testing the program using DB. The figure for demonstrating the method (1)-(3) which stubs DB. The figure for demonstrating stubbing of the process part of DB by a system (3). The figure which showed an example of the function structure of the symbolic execution apparatus concerning one Embodiment. The flowchart which showed an example of the symbolic execution process concerning one Embodiment. The figure for demonstrating the symbolic execution process (test data generation process) of FIG. The figure for demonstrating an example of utilization of the test data concerning one Embodiment. The figure which showed an example of the program and test driver which utilize DB concerning one Embodiment. The figure which showed an example of API (library) of the JDBC stub concerning one Embodiment. The figure which showed an example of the value set to DB stub concerning one Embodiment. The figure which showed an example of the record identification value concerning one Embodiment. The flowchart which showed an example of the search process of the record which performs the symbolic execution process concerning one Embodiment. The figure which showed an example of the symbolic execution result in the case of the record identification value of Fig.14 (a). The figure which showed an example of the symbolic execution result in the case of the record identification value of FIG.14 (b). The flowchart which showed an example of the record update process concerning one Embodiment. The figure which shows an example of the record update process result concerning one Embodiment. The flowchart which showed an example of the record deletion process concerning one Embodiment. The figure which shows an example of the record deletion process result concerning one Embodiment. The flowchart which showed an example of the record addition process concerning one Embodiment. The figure which shows an example of the record addition process result concerning one Embodiment. The figure which shows an example of the hardware constitutions of the symbolic execution apparatus concerning one Embodiment.

  Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings. In addition, in this specification and drawing, about the component which has the substantially same function structure, the duplicate description is abbreviate | omitted by attaching | subjecting the same code | symbol.

(Introduction)
[Symbolic execution processing]
There is a technique for efficiently generating test cases and test data by analyzing a test target program by symbolic execution processing. Symbolic execution (symbol execution) processing emulates program execution by setting a symbol value (symbol value) to an externally input value (argument value) to the program, and various information during program execution Technology to collect. As a result of analyzing the test target program by the symbolic execution process, a path that can be executed in the program and a path condition that the symbol value must satisfy in order to execute each path are extracted.

  In a program constituting a business system such as order management, a DB may be used to record master data, processing results, history, and the like. For example, FIG. 3 shows an example of a Java (registered trademark) program that uses a DB. When the program 10 constituting the business system uses the DB 30, the program 10 is connected to the DB 30 via the JDBC 20. The JDBC 20 is an API (Application Programming Interface) for connecting a Java program and an RDB (relational database). The DB 30 receives a DB operation language such as SQL, and returns information stored in the DB 30 according to the operation content described in the DB operation language.

  Note that the program 10 constituting the business system may be divided into the test target program 11 and the DB accessor 12. The DB accessor 12 is a dedicated program that performs processing for accessing the DB 30. The test target program 11 is a program that uses the DB 30, and the DB accessor 12 accesses the DB 30 via the JDBC 20. In particular, in a large-scale system program, the DB accessor 12 may be created and used in order to share processing for accessing the DB.

  FIG. 4 shows an example of a method for testing a program that uses the DB 30. First, test data 1 is set to the field value of each record in the DB 30 (D1), and test data 2 is set to the argument value of the test target program 11 (D2).

  Next, the test driver 40 activates the test target program 11. The test operator measures the execution result of the test target program and compares the value of the execution result with the expected value to determine the success or failure of the test (D3).

  Even in the test of the program 10 using the DB 30, it is conceivable to generate test data using a symbolic execution processing technique. However, only specific values (determined values) such as numerical values and character strings can be set as the field values in the DB 30, and symbol values cannot be set. For this reason, it is difficult to analyze a program using DB by symbolic execution processing.

[Stubbing of DB processing]
Therefore, it is necessary to stub the DB processing portion so as to be compatible with symbolic execution processing. That is, it is necessary to stub the DB 30 and the JDBC 20 (DB access library) that do not support symbolic execution processing.

  FIG. 5 shows methods (1) to (3) for stubbing the processing portion of the DB. Stubbing methods (1) to (3) are classified according to which range the DB processing portion is stubbed. FIG. 5 shows ranges to be stubbed in the methods (1) to (3).

  Method (1) is a method of stubbing the DB processing part at the time of calling the DB accessor 12. In method (1), the class or method of the DB accessor 12 is replaced with a stub, and the calling process of the DB accessor 12 is substituted.

  Method (2) is a method of stubbing a DB processing part at the time of calling a DB operation language. SQL is an example of the DB operation language. However, the DB operation language is not limited to SQL. The DB operation language is described in the test target program 11 or the DB accessor 12. The method (2) replaces the processing of the calling portion of the DB operation language described in the test target program 11 or the DB accessor 12.

  In the method (3), instead of the DB 30, a DB (hereinafter also referred to as “DB stub”) and a DB access library (hereinafter also referred to as “JDBC stub”) that stubs the DB 30 so as to be compatible with symbolic execution processing. .) Is used. The test target program 11 or the DB accessor 12 accesses the DB stub via the JDBC stub.

  Among the methods for stubbing the DB processing described above, the methods (1) and (2) have the following first to third problems. First, it is necessary to partially modify the program 10 itself for stubbing. Second, since it is necessary to prepare stubs for each DB accessor 12 or for each description of a DB operation language such as SQL, the number of stubs to be prepared becomes large in a large-scale program. For this reason, a great deal of labor is required to find a stub and to create a stub, which ultimately increases the number of test steps.

  Third, the test data generated by the analysis by the symbolic execution process is generated for the variables at the time of executing the SQL described in the DB accessor 12 and the like, and is generated for the DB field value. is not. For this reason, it is difficult to use the generated test data as it is for the test using the DB.

  Due to the above three problems, the present embodiment does not employ the method (1) and the method (2), but adopts a method of stubbing the DB by the method (3). However, the method (3) also has a problem that test cases and test data are generated in duplicate as described below.

[Duplicate test cases and test data]
Hereinafter, the problem of the method (3) will be described with reference to FIGS. 6 and 2. FIG. 6 is a diagram for explaining stubbing of the DB processing part by the method (3). FIG. 2 shows an example of the result of the DB stub symbolic execution process shown in FIG.

  As shown in FIG. 6, in the stubification of the DB processing part by the method (3), two stubs of the DB stub 100 and the JDBC stub 200 are generated.

The DB stub 100 is a stub of the DB 30. The DB stub 100 has the following functions.
A symbol value can be set in the field F of the DB stub 100. Therefore, the DB stub 100 can cope with symbolic execution processing.
-Accepts a DB operation language such as SQL, and returns information stored in the DB stub 100 in accordance with the operation content described in the DB operation language.

The JDBC stub 200 is a stub of the JDBC 20. The JDBC stub 200 is composed of stubs of classes constituting the JDBC, such as a Connection class stub and a Prepared Statement class stub, and has the following functions.
Can process symbol values.
Access the DB stub 100 instead of the DB 30.

  The program shown on the left in FIG. 6 is an example in which the DB access portion of the test target program 11 integrated with the DB accessor 12 is described by a Java program. The JDBC is provided in the Jar format that is a compression format of the Java program. By specifying the JDBC stub 200 by the class path when executing the Java program, the JDBC stub 200 can be used instead of the JDBC 20. The JDBC stub 200 accesses the DB stub 100 instead of the DB 30. Thereby, the processing part of DB can be stubbed without modifying the test target program 11.

  Note that (a) of the Java program in FIG. 6 describes DB connection and preparation statement (SQL search formula in the example of FIG. 6). (B) of the Java program describes setting of input parameters to the prepared statement (c is set to field 1 in the example of FIG. 6), and symbolic execution processing according to the search conditions described in SQL. (C) of the Java program describes the return of the result of the symbolic execution process.

  FIG. 2 shows an example of a result obtained by setting a symbol value in the DB stub 100 obtained by stubbing the DB and performing symbolic execution processing on the symbol value according to the search condition described in SQL. As the search condition of the SQL search expression (SQL: SELECT * FROM Table WHERE (F1 = “c”)) in this example, each record is searched for the field F1 of the DB stub 100 according to the search condition “F1 = c”. Is.

  In the symbolic execution process at this time, a path condition of “s1 = c” and a path condition of “s1 ≠ c” are first accumulated in a conditional statement “Is F1 of record 1 c?”. Next, a path condition “s4 = c” and a path condition “s4 ≠ c” are stacked in a conditional statement “Is F1 of record 2 c?”. Next, the path condition “s7 = c” and the path condition “s7 ≠ c” are further accumulated in the conditional statement “Is F1 of record 3 c?”. The path condition in which a plurality of symbol values in the field F1 are c does not satisfy the search condition and is not satisfied. Here, the value that satisfies the path condition for each path is the test data for each test case. As a result, four test cases are generated, and test data for the four test cases shown in the right table of FIG. 2 is generated. Note that "" "" and ""! "" And "" "" all indicate that the value is not c.

The test data specifically generated is as follows.
Test case 1: When no record satisfying the search condition is hit Test case 2: When record 3 is hit, test data is s7 = c
Test case 3: When record 2 is hit, test data is s4 = c
Test case 4: When record 1 is hit, test data is s1 = c
Here, when a symbol value is set for a plurality of records of the DB stub, the symbol value of each record is not distinguished. For example, the symbol values of s1, s4, and s7 set in the field F1 of the records 1, 2, and 3 in FIG. 2 are not distinguished. Therefore, test cases 2, 3, and 4 are the same test case because they correspond to the case where one record is hit and the value of c is set in the field F1. Accordingly, two test cases are extracted in duplicate in FIG. As described above, the DB stub symbolic execution process has a problem that duplicate test cases are extracted.

  Therefore, in the symbolic execution device according to the present embodiment described below, each record of the DB stub 100 in which a symbol value is set can be distinguished in order to extract a test case having no overlap. Then, the symbolic execution process is controlled by identifying the difference between the records. Thereby, test data without duplication can be generated. Hereinafter, functions and operations of the symbolic execution device according to the present embodiment will be described in detail.

[Functional configuration of symbolic execution unit]
First, a functional configuration of a symbolic execution device according to an embodiment will be described with reference to FIG. FIG. 7 shows an example of a functional configuration of the symbolic execution device according to the embodiment.

  The symbolic execution device 50 according to the present embodiment sets a symbol value to the field value of each record of the DB stub 100, and performs symbolic execution processing on the symbol value according to the search condition. The symbolic execution device 50 includes a symbol value setting unit 51, a symbolic execution unit 52, a DB connection stub unit 53, a record identification setting unit 54, a record search control unit 55, a record update control unit 56, a record deletion control unit 57, and a record addition control. Means 58 are included.

  The DB stub 100 is an alternative to the DB 30 in which the DB 30 can be set as a stub. The DB stub 100 may be generated using a storage area inside the symbolic execution device 50 or may be generated using a storage area outside the symbolic execution device 50.

  The symbol value setting means 51 sets a symbol value to the field value of each record of the DB stub 100.

  The symbolic execution means 52 performs symbolic execution processing for the set symbol value according to the search condition. As a result of the symbolic execution process, a path condition for each symbol value path of the DB stub 100 is obtained.

  The DB connection stub means 53 accesses the DB stub 100 instead of the DB 30 using the JDBC DB stub 200 capable of processing symbol values.

  The record identification setting unit 54 sets a record identification value for each record in order to distinguish the records of the DB stub 100. The record identification setting means 54 may set the same identification value for a plurality of records satisfying the same search condition for the field value in the record group including the symbol value as the field value.

  The record search control means 55 searches for a record to be subjected to symbolic execution processing according to the search condition. At that time, the record search control means 55 extracts one of a plurality of records that satisfy the same search condition and set the same identification value as a target of the symbolic execution process.

  The record update control means 56 controls a record update process of the DB stub 100 based on the set record identification value. When a record satisfying the search condition is specified, the record update control means 56 updates the specified record.

  The record deletion control means 57 controls the record deletion process of the DB stub 100 based on the set record identification value. When a record that satisfies the search condition is specified, the record deletion control unit 57 updates the specified record.

  The record addition control means 58 controls the record addition process of the DB stub 100 based on the set record identification value. When a record satisfying the search condition is identified, the record addition control means 58 adds a record that does not violate the uniqueness constraint to the identified record. A unique constraint is one of the constraints when adding or updating data, and the value of the field F with the primary key set is unique, that is, the field with the primary key does not have the same data Request.

  The symbolic execution device 50 having such a functional configuration performs symbolic execution processing on one record among a plurality of records to which the same record identification value is assigned. As a result, according to the symbolic execution device 50 according to the present embodiment, it is possible to generate DB test cases without duplication.

  That is, as will be described later, the path condition for each path extracted by the symbolic execution process is input to the test data generation unit 61 of the test case generation apparatus 60. The test data generation unit 61 generates test data of field values in the DB 30 based on the input path condition for each path. According to this, since the extracted paths and path conditions do not overlap, it is possible to generate test cases and test data having no overlap.

[Symbolic execution processing (test data generation processing)]
Next, symbolic execution processing according to the present embodiment will be described with reference to FIGS. FIG. 8 is a flowchart showing an example of symbolic execution processing (test data generation processing) according to the present embodiment. FIG. 9 is a diagram for explaining the symbolic execution process shown in FIG.

  In FIG. 8, first, the test target program 11 (or the DB accessor 12) is changed so as to designate the JDBC stub 200 by the class path and connect to the JDBC stub 200 (step S10). As a result, the DB accessor 12 can be connected to the JDBC stub 200 as shown in FIG.

  Next, under the control of the test driver 40, the symbol value setting means 51 sets a symbol value in each field of the record of the DB stub 100 (step S11). As a result, symbol values are set in the fields of the DB stub 100 as shown in (2) of FIG. A symbol value or a specific value can be set as the field value of the DB stub 100.

  Next, the test driver 40 is activated by the symbolic execution unit 52, and the test target program 11, the DB accessor 12, the JDBC stub 200, and the DB stub 100 are accessed in order. The symbolic execution means 52 performs symbolic execution processing on the symbol value according to the search conditions described in the SQL within the test target program 11 or the DB accessor 12 (step S12). In the present embodiment, a symbol value designated by the control of the test driver 40 is set in each field of the DB stub 100. Therefore, symbolic execution processing is performed on the set symbol value according to the search condition. As a result, symbolic execution processing is performed on the symbol values shown in (3) of FIG. 9, and executable paths and path conditions are extracted.

  The extracted path condition for each path is input to the test data generation means 61. The test data generation means 61 analyzes the input path condition for each path, generates test data for each test case (step S13), and ends the symbolic execution process (test data generation process).

[Example of using test data]
An example of use of the test data generated as described above will be described with reference to FIG. FIG. 10 is a diagram for explaining an example of use of test data according to an embodiment.

  In the usage procedure 1 shown in the upper part of FIG. 10, as described with reference to the flowchart of FIG. 8, test data for each test case is generated and output using symbolic execution processing.

  In the usage procedure 2 shown in the lower part of FIG. 10, the generated test data is set in each field value of the DB 30. In this state, the test target program 11 is started by the test driver 40, and a test for confirming the operation of the test target program 11 is performed.

  As will be described later, the symbolic execution device 50 according to the present embodiment can generate test cases and test data without duplication. As a result, the operation check test of the test target program 11 can be efficiently performed.

[Examples of programs and test drivers that use DB]
Next, an example of a program (a part of the test target program 11) and a test driver that use the DB according to the embodiment will be described with reference to FIG. FIG. 11 is a diagram illustrating an example of a program and a test driver that use a DB according to an embodiment.

  The programming language of the program that uses the DB shown in FIG. 11 is Java. In the example of this program, the program is integrated with the test driver and can directly access the DB stub 100 from the test driver. In addition, a method for calling a DB stub that is a target of symbolic execution processing and that is used by the program in the present embodiment is “testJDBCStub”.

In the example of the program (test driver) in FIG. 11, the following processes (1) to (4) are described.
In (1), a declaration of handling s1 to s9 as symbol values to be set in the field F is described.
(2) describes that the symbol values s1 to s9 are set in the field F of each record of the DB stub 100 called from the method (driver) of the testJDBCStub.
In (3), a process for searching the DB is described. After preparing the SQL search expression and input parameter settings, symbolic execution processing using symbol values is performed according to the SQL search conditions.
In (4), a process for using the DB processing result is described. Thereby, the search result by the symbolic execution process using the symbol value is returned.

[JDBC stub and DB stub]
The JDBC stub 200 replaces the JDBC 20 and provides a means for accessing the DB stub 100 instead of the DB 30. FIG. 12 shows an example of main API (library) of the JDBC stub 200. The JDBC stub 200 may provide the same API as the JDBC 20. The test target program 11 (or the DB accessor 12) can access the DB stub 100 using the API of the JDBC stub 200.

  The DB stub 100 replaces the function of the DB 30. As shown in FIG. 13, not only specific values such as ABC and 11 but also symbol values (symbol values) such as s1 to s11 can be set in the field of the DB stub 100. The DB stub 100 is connected to the JDBC stub 200 and can perform symbolic execution processing using symbol values in accordance with SQL search conditions.

  More specifically, symbolic execution processing is performed according to the content instructed by the DB operation language such as SQL and the API call of the JDBC stub 200, and the search for the symbol value set in the record in the DB stub 100 (Select) Processing such as update (Update), deletion (Delete), and addition (Insert) is executed.

Record identification
Next, a record identification value assigned to each record in the DB stub 100 will be described. The record identification setting unit 54 sets a record identification value in order to distinguish the records in the DB stub 100. The record identification setting means 54 may set the same identification value for a plurality of records satisfying the same search condition for the field value in the record group including the symbol value as the field value.

  The record identification setting unit 54 may set a record identification value in accordance with designation by the user. For example, when the number of hits of records satisfying the search condition is desired to be one for a plurality of records in the DB stub 100, the record identification setting unit 54 sets one type of record identification value for the plurality of records. When it is desired to set the number of hits of records satisfying the search condition to N for a plurality of records in the DB stub 100, the record identification setting unit 54 sets N types of record identification values for the plurality of records.

  FIG. 14 shows an example of a record identification value according to an embodiment. Symbol values s1 to s9 are set in the fields F1, F2, and F3 of the plurality of records 101 of the DB stub 100. In this example, the field values of the three records 101 of the DB stub 100 are all symbol values, and the records cannot be distinguished. Therefore, the record identification setting means 54 sets the record identification value 102 for each record so that these records can be distinguished.

  The record identification setting unit 54 sets the same search condition so that when a plurality of records satisfying the SQL search condition are detected, symbolic execution processing is performed on one of the plurality of records. Assign the same record identification value to multiple records that satisfy it. When symbolic execution processing is performed on one of a plurality of records to which the same record identification value is assigned, the other records are excluded from the search target and excluded from the symbolic execution processing.

  For example, FIG. 14A is an example in which the same value “A” is assigned to the record identification values 102 of records 1 to 3. In this case, records 1 to 3 are identified as the same record. Therefore, FIG. 14A is an example of setting the record identification value when it is desired to extract only one test case satisfying the search condition from the records 1 to 3 without distinguishing the records 1 to 3. In this case, the record identification setting unit 54 may set the same value as the record identification value 102 of records 1 to 3.

  FIG. 14B shows an example in which the same value “A” is assigned to the record identification values 102 of records 1 and 2, and the value “B” different from records 1 and 2 is assigned to the record identification value 102 of record 3. It is. In this case, records 1 and 2 are identified as the same record, and record 3 is identified as a record different from records 1 and 2. Therefore, FIG. 14B is an example of setting a record identification value when it is desired to distinguish two records 1 to 2 and extract two test cases from three records. In this case, the record identification setting unit 54 may set two types of values for the record identification value 102.

  In this way, by assigning the same record identification value to a plurality of records in the DB stub satisfying the search condition described in SQL or the like, one test case from a plurality of records in the DB stub satisfying the search condition Can be generated.

[Record search processing]
The record search control means 55 extracts one of a plurality of records that satisfy the same search condition and set the same record identification value from the record group of the DB stub 100 as a symbolic execution process target. At that time, the record search control means 55 uses a flag indicating whether or not a record having the same record identification value has already been extracted as a symbolic execution process target.

  For example, in the present embodiment, the initial value of the flag is “0”, and the flag value for the record identification value of the record that has already been extracted as the target of the symbolic execution process is changed from “0” to “1”. . However, any means other than the flag can be used as long as it can be determined whether or not the record identification value is set in the record already extracted as the target of the symbolic execution process. Based on the flag value, the record search control unit 55 sets the record for which the symbolic execution process is performed for the record having the same record identification value as the record identification value of the record already extracted as the target of the symbolic execution process. Exclude from search. Hereinafter, the record search processing examples 1 and 2 performed by the record search control unit 55 will be described in detail.

[Record search processing example 1]
First, a record search processing example 1 according to the present embodiment will be described with reference to FIGS. 15 and 16. FIG. 15 is a flowchart illustrating an example of a record search process for performing a symbolic execution process according to the present embodiment. FIG. 16 shows an example of the result of the record search process of FIG. 15 when “A” is set in the record identification values of records 1 to 3 of the DB stub 100 shown in the left table.

  When the record search process of FIG. 15 is started, the record search control means 55 analyzes the SQL search formula described in the test target program and acquires the search condition (step S20). In the following processing, a case where the search condition is field F1 = c will be described as an example based on the SQL search formula as shown in FIG.

  Next, the record search control means 55 acquires the record i (i = 1, 2,... N) from the search target DB stub 100 (step S21). For example, in the DB stub 100 shown in FIG. 16, records 1, 2, and 3 (number of records N = 3) are acquired.

  Next, the record search control means 55 sets 1 to the record i (step S22), and determines whether the record identification value of the record i has already appeared (step S23). Here, “whether or not the record identification value of record i has already been issued” means that the record identification value of record i is the same as the record identification value set for the record that has already been extracted as the target of symbolic execution processing. Means.

  At this time, the flag of the record identification value “A” is set to “0”. Therefore, the record search control means 55 determines that the record identification value “A” of the record 1 has not been found, and determines whether the record 1 satisfies the search condition (step S24).

  Here, the record search control means 55 determines whether the value set in the field F1 of the record 1 is c. When it is determined that the value set in the field F1 of the record 1 is not c (here, the symbol value s1 is not c), the process proceeds to step S26. On the other hand, when it is determined that the value set in the field F1 of the record 1 is c (here, the symbol value s1 is c), the record search control means 55 searches the table storing the search results. Record 1 satisfying the condition is stored, 1 is set in the flag of record identification value “A” of record 1, and the record identification value of record 1 is already issued (step S25).

  Next, the record search control means 55 adds 1 to the record i (step S26), and determines whether the record i is larger than the record number N (= 3) (step S27). At this time, since the record 2 is smaller than the number of records 3, the process returns to step S23, and the record search control means 55 determines whether the record identification value “A” of the record 2 has already appeared.

  At this point, since the flag of the record identification value “A” is set to “1”, the record search control unit 55 determines that the record identification value “A” has already been issued, and returns the symbolic execution unit 52 to the symbolic execution unit 52. A track instruction is issued (step S28). In response to this instruction, the symbolic execution means 52 interrupts the tracking of the path condition of the path in the symbolic execution process for the record 2 and returns to the position (command statement) of the record where another path that can be tracked exists (backtrack). ). Thereby, in this embodiment, the record 2 in which the same record identification value as the record 1 already extracted as the target of the symbolic execution process is set is excluded from the search target.

  Next, the record search control means 55 adds 1 to the record i (step S26), and determines whether the record i is larger than the record number N (step S27).

  At this time, since the record 3 is equal to the number of records 3, the process returns to step S23, and the record search control means 55 determines whether the record identification value “A” of the record 3 has already appeared. Since the flag of the record identification value “A” is set to 1, the record search control means 55 determines that the record identification value “A” has already been issued, and issues a backtrack instruction to the symbolic execution means 52 ( Step S28). In response to this instruction, the symbolic execution unit 52 interrupts the backtracking of the path condition of the path in the symbolic execution process for the record 3 and backtracks. Thereby, in this embodiment, the record 3 in which the same record identification value as the record 1 already extracted as the target of the symbolic execution process is set is excluded from the search target.

  Next, the record search control means 55 adds 1 to the record i (step S26), and determines whether the record i is larger than the record number N (step S27).

  At this point, since the record 4 is larger than the number of records 3, the process proceeds to step S29. The symbolic execution means 52 performs symbolic execution processing from the record 1 stored in the search result table according to the search conditions described in SQL, extracts the path conditions for each path, and outputs them (step S29).

  The symbolic execution means 52 performs symbolic execution processing on the symbol value s1 set in the field F1 of the record 1 stored in the search result table in accordance with the search condition “F1 = c”. As a result, two path conditions are extracted when the symbol value s1 is c and when it is not c. Note that the symbol value s4 and the symbol value s7 do not hold when c, and the path condition is extracted when it is not c.

  As a result, a path condition in which the symbol values s1, s4, and s7 are not all c is extracted in the path 1, and a path condition in which the symbol value s1 is c and the symbol values s4 and s7 are not c is extracted in the path 2. . After the path and path condition extracted in this way are output, this record search process ends.

  The record search process when the same record identification value is set for records 1 to 3 has been described above. According to this, based on the same record identification value, records 1 to 3 are all identified as the same record. In the record search process according to the present embodiment, a record is searched so that a symbolic execution process is performed on one record that satisfies the search condition among a plurality of records having the same record identification value. . For example, when the record 1 satisfies the search condition and is extracted as the target of the symbolic execution process, the records 2 and 3 in which the same record identification value is set are excluded from the search target. Thereby, one of a plurality of records satisfying the same search condition and having the same record identification value set can be extracted as a symbolic execution process target. As described above, it is possible to prevent generation of duplicate test cases and test data for a plurality of records having the same record identification value.

  In the record search processing example 1 according to this embodiment, the record 1 is subjected to symbolic execution processing, and the records 2 and 3 in which the same record identification value as that of the record 1 is set are excluded from the search targets. However, the symbolic execution device 50 according to the present embodiment is not limited to this, and the symbolic execution process may be performed on any one of a plurality of records having the same record identification value. For example, the symbolic execution process may be performed on the record 2 having the same record identification value, and the records 1 and 3 may be excluded from the search targets. Further, symbolic execution processing may be performed on the record 3 having the same record identification value, and the records 1 and 2 may be excluded from the search target.

[Record search processing example 2]
Next, a record search processing example 1 according to this embodiment will be described with reference to FIGS. 15 and 17. FIG. 17 shows the record search in FIG. 15 when “A” is set for the record identification values of records 1 and 2 of the DB stub 100 shown in the left table and “B” is set for the record identification value of record 3. An example of the result of a process is shown.

  When the symbolic execution process of FIG. 15 is started, the record search control means 55 analyzes the SQL search expression and acquires the search condition (step S20). In the following processing, a case where the search condition is the field F2 = b based on the SQL search formula as shown in FIG. 17 will be described as an example.

  Next, the record search control means 55 acquires the record i (i = 1, 2,... N) from the search target DB stub 100 (step S21). For example, in the DB stub 100 shown in FIG. 17, records 1, 2, and 3 (number of records N = 3) are acquired.

  Next, the record search control means 55 sets 1 to the record i (step S22), and determines whether the record identification value of the record i has already appeared (step S23). At this time, the flag of the record identification value “A” is set to 0. Therefore, the record search control means 55 determines that the record identification value A of the record 1 has not been issued, and determines whether the record 1 satisfies the search condition (step S24).

  Here, the record search control means 55 determines whether or not the value set in the field F2 of the record 1 is b. If it is determined that the value set in the field F2 of the record 1 is not b (here, the symbol value s2 is not b), the process proceeds to step S26. On the other hand, when it is determined that the value set in the field F2 of the record 1 is b (here, the symbol value s2 is b), the record search control unit 55 records the record in the table storing the search results. 1 is stored, 1 is set to the flag of record identification value “A” of record 1, and the record identification value of record 1 is already issued (step S25).

  Next, the record search control means 55 adds 1 to the record i (step S26), and determines whether the record i is larger than the record number N (step S27). At this time, since the record 2 is smaller than the number of records 3, the process returns to step S23, and the record search control means 55 determines whether the record identification value “A” of the record 2 has already appeared.

  At this point, since the flag of the record identification value “A” is set to “1”, the record search control unit 55 determines that the record identification value “A” has already been issued, and returns the symbolic execution unit 52 to the symbolic execution unit 52. A track instruction is issued (step S28). In response to this instruction, the symbolic execution unit 52 suspends the tracking of the path condition of the path by the symbolic execution process for the record 2 and backtracks. Thereby, the record 2 is excluded from search targets.

  Next, the record search control means 55 adds 1 to the record i (step S26), and determines whether the record i is larger than the record number N (step S27).

  At this time, since the record 3 is equal to the number of records 3, the process returns to step S23, and the record search control means 55 determines whether the record identification value “B” of the record 3 has already appeared. Since the flag of the record identification value “B” is set to 0, the record search control means 55 determines that the record identification value “B” has not been issued, and determines whether the record 3 satisfies the search condition (step S24).

  Here, the record search control means 55 determines whether or not the value set in the field F2 of the record 3 is b. If it is determined that the symbol value s8 is not b, the process proceeds to step S26. On the other hand, if it is determined in step S24 that the symbol value s8 is b, the record search control means 55 adds record 3 to the table for storing the search results, and records the record identification value “B” of record 3 Is set to 1 (step S25).

  Next, the record search control means 55 adds 1 to the record i (step S26), and determines whether the record i is larger than the record number N (step S27).

  At this point, since the record 4 is larger than the number of records 3, the process proceeds to step S29. The symbolic execution means 52 performs symbolic execution processing according to the search conditions described in SQL from the records 1 and 3 stored in the search result table, and extracts and outputs the path conditions for each path (step S29).

  The symbolic execution means 52 performs a symbolic execution process corresponding to the search condition “s2 = b” for the record 1 stored in the search result table, and corresponds to the search condition “s8 = b” for the record 3. Perform symbolic execution processing. As a result, four combinations of paths are extracted when the symbol value s2 is b and not b, and when the symbol value s8 is b and not b. The symbol value s5 is extracted only when it is not b.

  As a result, in pass 1, a path condition in which all of the symbol values s2, s5, and s8 are not b is extracted. In pass 2, a path condition is extracted in which the symbol value s2 is b and the symbol values s5 and s8 are not b. In pass 3, a path condition in which the symbol values s2 and s5 are not b and the symbol value s8 is b is extracted. In pass 4, a path condition in which the symbol values s2 and s8 are b and the symbol value s5 is not b is extracted. After outputting the path and path condition extracted in this way, the record search process ends.

  As described above, the record search processing in the case where the same record identification value is set in two records and different record identification values are set in the remaining one record has been described. According to this, based on the same record identification value, the records 1 and 2 are identified as the same record. Thereby, when the record 1 satisfies the search condition, the record 2 having the same record identification value is excluded from the search target. On the other hand, the record 3 in which the record identification value different from the record 1 is set is not excluded from the search target. In this manner, when a maximum of two records are extracted from a plurality of records and a test case is generated by the symbolic execution process, two types of record identification values may be set for the plurality of records. Thereby, control can be performed so that only two test cases are extracted from a plurality of records. As described above, it is possible to prevent generation of duplicate test cases and test data for a plurality of records having the same record identification value.

  In the record search processing example 1 according to the present embodiment, the record 1 is subjected to symbolic execution processing, and the record 2 in which the same record identification value as the record 1 is set is excluded from the search target. However, the symbolic execution device 50 according to the present embodiment is not limited to this, and the record 2 may be subjected to symbolic execution processing, and the record 1 may be excluded from search targets.

[Record update processing]
Next, the record update processing of the DB stub 100 will be described with reference to FIGS. FIG. 18 is a flowchart illustrating an example of a record update process according to an embodiment. FIG. 19 shows an example of the result of the record update process according to the embodiment. Note that the symbol values and record identification values shown in the left table of FIG. 19 are set in each record of the DB stub 100.

  The record update control means 56 controls record update processing according to the search conditions described in SQL. At that time, the record update control means 56 controls a record update process based on the record identification value. Steps S21 to S29 of the record update process in FIG. 18 are the same processes as steps S21 to S29 of the record search process described with reference to FIG. 15 and are executed by the record search control means 55.

  When the record update process in FIG. 18 is started, the record update control unit 56 analyzes the SQL search expression and acquires the search condition (step S30). In the following processing, as shown in FIG. 19, a record satisfying the search condition of the field F2 = b is specified based on the SQL search formula, and a process of updating the field F1 of the specified record to “B” is executed. Is done. This update process is an example of a process for changing the specified record when a record satisfying the search condition is specified.

  Next, the record update control unit 56 causes the record search control unit 55 to execute the processes of steps S21 to S29. The record search control means 55 searches each record in the order of steps S21 to S29. As a result, first, record 1 is extracted, and 1 is set to the flag of record identification value “A”. Thereby, the records 2 and 3 are excluded from search targets.

  Next, the record update control means 56 specifies a record that satisfies the search condition based on the path obtained from the result of the symbolic execution processing of the extracted record 1 (step S32).

  FIG. 19 shows the path conditions for paths 1 and 2 obtained as a result of the symbolic execution processing of the extracted record 1. As a result of performing symbolic execution processing on the extracted record 1, there are cases where the symbol values s2, s5, and s8 of pass 1 are not b, and the symbol values s2 of pass 2 are b, and the symbol values s5 and s8 are not b. Extracted. Among these, the path condition of the path 2 satisfies the search condition F2 = b. Therefore, the record 1 satisfying the search condition based on the path 2 is specified.

  Next, the record update control means 56 executes a process for updating the field F1 described in the SQL to “B” for the identified record 1 (step S34), and ends this update process.

  As a result, the field F1 of the record 1 is updated to B as shown in the lower right table of FIG. According to the record update process described above, the record update can be controlled based on the record identification value.

[Record deletion processing]
Next, the record deletion process of the DB stub 100 will be described with reference to FIGS. 20 and 21. FIG. FIG. 20 is a flowchart illustrating an example of a record deletion process according to an embodiment. FIG. 21 shows an example of the result of the record deletion process according to one embodiment. Note that the symbol value and record identification value shown in the left table of FIG. 21 are set in each record of the DB stub 100.

  The record deletion control means 57 controls the record deletion process in accordance with the search conditions described in SQL. At that time, the record deletion control means 57 controls the record deletion processing based on the record identification value. Steps S21 to S29 of the record update process in FIG. 20 are the same processes as steps S21 to S29 of the record search process described with reference to FIG. 15 and are executed by the record search control means 55.

  When the record deletion process of FIG. 20 is started, the record deletion control means 57 analyzes the SQL search expression and acquires the search condition (step S40). In the following process, as shown in FIG. 21, a record that satisfies the search condition of the field F2 = b is specified based on the SQL search formula, and a process of deleting the specified record is executed. This deletion process is an example of a process for changing the specified record when a record satisfying the search condition is specified.

  Next, the record deletion control unit 57 causes the record search control unit 55 to execute the processes of steps S21 to S29. The record search control means 55 searches each record in the order of steps S21 to S29. As a result, first, record 1 is extracted, and 1 is set to the flag of record identification value “A”. Thereby, the records 2 and 3 are excluded from search targets.

  Next, the record deletion control means 57 specifies a record that satisfies the search condition of the field F2 = b based on the extracted path and path condition. (Step S42).

  FIG. 21 shows the path conditions of paths 1 and 2 obtained as a result of performing the symbolic execution process on the extracted record 1. As a result of performing symbolic execution processing on the extracted record 1, there are cases where the symbol values s2, s5, and s8 of pass 1 are not b, and the symbol values s2 of pass 2 are b, and the symbol values s5 and s8 are not b. Extracted. Among these, the path condition of the path 2 satisfies the search condition F2 = b. Therefore, the record 1 satisfying the search condition based on the path 2 is specified.

  Next, the record deletion control means 57 executes a record deletion process described in SQL on the specified record 1 (step S44), and ends this deletion process.

  As a result, record 1 is deleted as shown in the lower right table of FIG. According to the record deletion process described above, deletion of a record can be controlled based on the record identification value.

[Record addition processing]
Next, the record addition process of the DB stub 100 will be described with reference to FIGS. FIG. 22 is a flowchart illustrating an example of a record addition process according to an embodiment. FIG. 23 shows an example of the result of the record addition process according to an embodiment. Note that the symbol value and record identification value shown in the left table of FIG. 23 are set in each record of the DB stub 100.

  The record addition control means 58 controls the record addition process according to the update value described in SQL. At that time, the record addition control means 58 controls record addition processing based on the record identification value. Steps S21 to S29 of the record update process in FIG. 22 are the same processes as steps S21 to S29 of the record search process described with reference to FIG. 15 and are executed by the record search control means 55. However, in this embodiment, a record is searched according to the condition of the equal sign.

  When the record addition process of FIG. 22 is started, the record addition control means 58 analyzes the SQL search expression and acquires the update value of the record to be added (step S50). In the following process, as shown in FIG. 23, a process of adding records with update values a, b, and c in the fields F1, F2, and F3 is executed based on the SQL search expression. This addition process is an example of a process for adding a new record when a record satisfying the search condition is specified. Search conditions according to this embodiment will be described later.

  The record addition control means 58 generates an equal sign condition related to the uniqueness constraint with the update value for the field F1 in which the primary key is set (step S52). Here, the unique constraint is one of constraints when adding or updating data, and the value of the field F in which the primary key is set is unique, that is, the field of each record in which the primary key is set. Require that values do not have the same value.

  In the present embodiment, as an equal sign condition regarding the uniqueness constraint, an equal sign condition F1 = between the value of the field F1 of each record in which the primary key is set and the update value “a” to be added to the field F1 = a is generated.

  Next, the record addition control means 58 causes the record search control means 55 to execute the processes of steps S21 to S29. The record search control means 55 executes steps S21 to S29 to search for a record satisfying the equal sign condition F1 = a. Thereby, the record search control means 55 extracts a record satisfying the equal sign condition F1 = a. As a result, first, record 1 is extracted, and 1 is set to the flag of record identification value “A”. Thereby, the records 2 and 3 are excluded from search targets.

  Next, the record addition control means 58 identifies a record that does not satisfy the equal sign condition based on the extracted path and path condition (step S54). That is, if the condition of the equal sign is satisfied, the uniqueness constraint is violated. Therefore, in the present embodiment, a record that does not satisfy the condition of the equal sign, that is, F1 ≠ a is specified. The search condition according to the present embodiment is that the field value in which the primary key is set among the extracted records does not satisfy the condition of the equal sign. In the present embodiment, the field F1 of the extracted record 1 ≠ a.

  FIG. 23 shows the path conditions of paths 1 and 2 obtained as a result of symbolic execution processing of the extracted record 1. As a result of symbolic execution processing of the extracted record 1, there are cases where the symbol values s1, s4, and s7 of pass 1 are not a, and the symbol values s1 of pass 2 are a, and the symbol values s4 and s7 are not a. Extracted.

  Among these, the path condition of the path 1 satisfies the search condition F1 ≠ a and does not violate the uniqueness constraint. Therefore, the record addition control means 58 determines in step S56 that the record 1 is a record that does not violate the uniqueness constraint, adds a new record with the updated values a, b, and c (step S58). The addition process ends. Thereby, the record 4 is added as shown in the lower right table of FIG.

  If the record addition control unit 58 determines in step S56 that the extracted record is a record that violates the uniqueness constraint, the record addition control unit 58 ends the addition process without adding a new record (step S60). To do.

  According to the record addition process described above, the addition of records can be controlled based on the record identification value.

  Note that the record update control unit 56, the record deletion control unit 57, and the record addition control unit 58, when a record that satisfies the search condition is specified based on the path obtained by the result of performing the symbolic execution processing on the extracted record, It is an example of a record change control means for changing a specified record or adding a new record.

  Heretofore, the symbolic execution device 50 according to the present embodiment has been described. According to this, in the DB stub symbolic execution process, it is possible to extract test cases without duplication based on the record identification value for identifying each record.

(Hardware configuration example)
Finally, a hardware configuration example of the symbolic execution device 50 will be briefly described. FIG. 24 is a diagram illustrating a hardware configuration example of the symbolic execution device 50 according to the present embodiment.

  The symbolic execution device 50 includes an input device 101, a display device 102, an external I / F 103, a RAM (Random Access Memory) 104, a ROM (Read Only Memory) 105, a CPU (Central Processing Unit) 106, a communication I / F 107, and an HDD ( Hard Disk Drive) 108 are connected to each other via a bus B.

  The input device 101 includes a keyboard and a mouse and is used to input each operation to the symbolic execution device 50. The display device 102 includes a display or the like, and displays data such as test cases and test data to a test worker who tests a program using the DB using the symbolic execution device 50.

  The external I / F 103 is an interface with an external device. The external device includes a recording medium 103a. The symbolic execution device 50 can read and / or write to the recording medium 103 a via the external I / F 103. The recording medium 103a includes a CD (Compact Disk), a DVD (Digital Versatile Disk), an SD memory card (SD Memory card), a USB memory (Universal Serial Bus memory), and the like.

  The ROM 105 is a nonvolatile semiconductor memory (storage device) and stores various programs and data. The RAM 104 is a volatile semiconductor memory (storage device) that temporarily stores programs and data.

  The HDD 108 is a non-volatile storage device that stores programs and data. The stored programs and data include application software that provides various functions. Further, the HDD 108 may store a Java program or API (library) executed by the CPU 106 in order to perform the symbolic execution process or the record search process of the above embodiment.

  The CPU 106 is an arithmetic device that reads programs and data from the storage device (for example, “HDD”, “ROM”, etc.) onto the RAM, and realizes overall control and mounting functions of the device. Symbolic execution processing, record search processing, and the like are realized by causing the CPU 106 to execute a program installed in the HDD 108 or the like.

  The communication I / F 107 is an interface for connecting to other devices via a network.

  The symbolic execution program, the symbolic execution method, and the symbolic execution device have been described in the above embodiment. However, the present invention is not limited to the above embodiment, and various modifications and improvements can be made within the scope of the present invention. is there.

Regarding the above description, the following items are further disclosed.
(Appendix 1)
Among the record group that includes the symbol value as the item value, the same identification value is set for a plurality of records that satisfy the same search condition for the item,
One of a plurality of records that satisfy the same search condition and set the same identification value in the record group is extracted as a symbolic execution process target,
Performing symbolic processing on the symbol value of the item of the extracted record according to the search condition;
A symbolic execution program that causes a computer to execute processing.
(Appendix 2)
Based on the path obtained from the result of the symbolic execution process, the record that satisfies the search condition is specified, the specified record is changed, or a process of adding a new record is further included.
The symbolic execution program according to attachment 1.
(Appendix 3)
Among the record group that includes the symbol value as the item value, the same identification value is set for a plurality of records that satisfy the same search condition for the item,
One of a plurality of records that satisfy the same search condition and set the same identification value in the record group is extracted as a symbolic execution process target,
Performing symbolic processing on the symbol value of the item of the extracted record according to the search condition;
A symbolic execution method in which processing is executed by a computer.
(Appendix 4)
When a record that satisfies the search condition is specified based on a path obtained as a result of the symbolic execution process, the process further includes a process of changing the specified record or adding a new record.
The symbolic execution method according to attachment 3.
(Appendix 5)
Among record groups including symbol values as item values, record identification setting means for setting the same identification value to a plurality of records that satisfy the same search condition for the item;
A record search control means for searching the record group, extracting one of a plurality of records that satisfy the same search condition and set the same identification value;
Symbolic execution means for executing symbolic processing in accordance with the search condition for the symbol value of the item of the extracted record;
A symbolic execution device.
(Appendix 6)
Based on the path obtained from the result of the symbolic execution process, when a record satisfying the search condition is specified, the record change control means for changing the specified record or adding a new record is further included.
The symbolic execution device according to appendix 5.

50: Symbolic execution device 51: Symbol value setting means 52: Symbolic execution means 53: DB connection stub means 54: Record identification setting means 55: Record search control means 56: Record update control means 57: Record deletion control means 58: Record addition Control means 60: Test data generating device 61: Test data generating means 100: DB stub 101: Record 102: Record identification value 200: JDBC stub F1, F2, F3: Field s1 to s9: Symbol value

Claims (4)

Among the record group that includes the symbol value as the item value, the same identification value is set for a plurality of records that satisfy the same search condition for the item,
One of a plurality of records that satisfy the same search condition and set the same identification value in the record group is extracted as a symbolic execution process target,
Performing symbolic processing on the symbol value of the item of the extracted record according to the search condition;
A symbolic execution program that causes a computer to execute processing. When a record that satisfies the search condition is specified based on a path obtained as a result of the symbolic execution process, the process further includes a process of changing the specified record or adding a new record.
The symbolic execution program according to claim 1. Among the record group that includes the symbol value as the item value, the same identification value is set for a plurality of records that satisfy the same search condition for the item,
One of a plurality of records that satisfy the same search condition and set the same identification value in the record group is extracted as a symbolic execution process target,
Performing symbolic processing on the symbol value of the item of the extracted record according to the search condition;
A symbolic execution method in which processing is executed by a computer. Among record groups including symbol values as item values, record identification setting means for setting the same identification value to a plurality of records that satisfy the same search condition for the item;
A record search control means for searching the record group, extracting one of a plurality of records that satisfy the same search condition and set the same identification value;
Symbolic execution means for executing symbolic processing in accordance with the search condition for the symbol value of the item of the extracted record;
A symbolic execution device.

Images