JPH0357034A - Program testing system - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed description of the invention] 3. DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a program testing method, and particularly to a program testing method that can efficiently perform program testing during program development and save labor.

[Conventional technology]

In program development, it is desirable to work efficiently and improve productivity. However, the essential process of program development is often carried out manually by programmers, and it is not possible to sufficiently improve program performance. For example, when testing a created program, a large amount of input data is given, the program under test is executed, and the results of the execution are inspected. If the desired result is not obtained, for example, if the program contains an error (bug), the programmer can detect the error by following the logic of the program's processing steps at desk 1-. I have to.

2. Description of the Related Art Conventionally, as an automatic testing method for saving labor in program testing work, there has been proposed an ``automatic testing method for exchange software'' described in Japanese Patent Application Laid-Open No. 63-8948. The automatic test method described here inputs correct output results in advance into an automatic judgment system (computer system), and then compares the correct output results with the output results obtained by actually running the program under test. By using a computer system, we aim to save labor in determining the acceptability of test results.

[Problem to be solved by the invention]

However, such an automatic test method is still the conventional method of executing a program under test and comparing the results, and requires execution of the program under test. This testing process requires a lot of time and effort, as input data settings and correct output results must be entered manually into a computer.

In the program development process, the final testing process takes a lot of effort, man-hours, and computer time. In this test process, the process of ``setting input data → executing program → checking output results'' must be repeated for the program under test according to the program checklist as many times as there are check items. In this case, in particular, it takes a lot of effort to set the input data, and it also takes a lot of effort to check the output results.

In response to this, there have been attempts to automate this, as in the above-mentioned Japanese Patent Application Laid-Open No. 63-8948, but the conventional automatic testing method is insufficient to save labor in program testing.
In particular, for each test case, input data is set for the program under test and the program is executed. Therefore, there is a problem in that it requires a huge amount of time-consuming man-hours and computer time.

The present invention has been made to solve the above problems.

SUMMARY OF THE INVENTION An object of the present invention is to provide a program testing method that can save labor in program testing during program development.

The above and other objects and novel features of the present invention will become apparent from the description of this specification and the accompanying drawings.

[Means to solve the problem]

In order to achieve the above object, the program testing method of the present invention inputs the source program of the program under test and creates a list of input data, a list of output data, and a list of output data update history. analyzes the logic of the source program, traces the path that relates the input data contents and the output data contents, and outputs a correspondence table showing the input data contents and the output data contents for each bus, The method is characterized in that the validity of the program under test is checked from the correspondence table.

[Effect]

According to the means, a source program of a program under test is input, and a list of input data, a list of output data, and a list of output data update history are created from the source program. Next, we analyze the logic of the source program, trace the buses that relate the input data content and output data content, and create a correspondence table (input/output data list) that shows the input data content and output data content for each path. Output. Then, use this correspondence table to check the validity of the program under test. This program testing method does not test by running the program under test, but instead inputs the source program as data, analyzes the relationship between the input data content and output data content from the logic of the source program, and then tests the input/output during processing. Outputs an input/output data list (input/output correspondence table) of the tested program in the same format as the program checklist created during testing based on data changes. By comparing this input/output data list with a list of test items for the program created in advance, it is determined whether or not the program under test is defective. Generally, a program checklist that defines the test contents of a program under test is expressed as a combination of input data provided from the outside and output data output by the program. For this reason, we track how the output data content changes depending on the input data content according to the logic of the source program of the program under test, and determine the type of data processing pass of the program and the input data for each pass. Outputs a correspondence table of data and output data contents (program input/output data list 1). By comparing this program input/output data list with a program checklist created in advance, it is possible to determine whether or not the program under test is defective without executing the program under test.

〔Example〕

Hereinafter, one embodiment of the present invention will be specifically described using the drawings.

FIG. 1 is a block diagram showing the processing process of a program test method according to an embodiment of the present invention. In FIG. 1, 10 is an input file, 11 is a data processing system, and l2 is an output list. The input file 10 stores the source program of the program under test. The data processing system 11 inputs the source program of the program under test as input data from the input file 10, performs data processing, and outputs the data as an output list 12.
Outputs an input/output correspondence table of a list of input/output data in the program under test. In order to perform a program test, the data processing system 11 includes a source program input process 1, an input data list creation process 2, an output data list creation process 3, a source program logic analysis process 4, and an input/output correspondence table creation process. Each processing process of the output process 5 is provided. The function of each processing process will be explained below with reference to FIG.

Source program input process 1; The source program of the program under test is taken in from the input file 10 and stored in the source program storage area 6 in the memory.

Input data list creation process 2: Create an input data list by referring to the definition statement of the data territory of the source program imported into the source program storage area 6 in the memory. The data is stored in the input data list storage area 7 in the memory.

Output data list creation process 3 An output data list is created by referring to the definition statement of the data area of the source program 6 imported into the source program storage area 6 in the memory, and the output data list is created in the output data list storage area 8 in the memory. Store in.

Source program logic analysis process 4 The source program assignment statements imported into the source program storage area 6 in the memory, the input data list in the input data list storage area 7, and the output data list in the output data list storage area 8 are stored. By referring to it, an output data update history table is created in the output data update history table storage area 9 in the memory while analyzing the logic of the source program.

Input/output correspondence table creation & output process 5 After the analysis of a series of source programs is completed, an input/output correspondence table is created based on the output data update history table in the output data update history table storage area 9 in the memory, Print out as an output list l2.

In this way, the program under test inputs the source program as data without executing it as is, and by analyzing the logic of the program, a data list of the relationship between the input data and output data can be created for input/output. Output as a table and inspect.

Next, we will specifically explain an example of program test processing for a program under test. FIG. 2 is a diagram showing a list of source programs of the program under test to be tested, and FIG. 3 is a diagram showing a flowchart of the program under test in FIG. This program under test is a time input program that converts numerical input data into hour data and minute data and inputs the converted data. An outline of this time input program will be explained with reference to FIGS. 2 and 3. As shown in FIG. 2, the source program list of the program under test starts with the program name, and consists of a plurality of data area definition statements and a series of five executable statements. Each statement in this program is assigned a sequence of statement numbers. A data area definition statement has a level number and an area name. An executable statement is a collection of a series of statements that specify the content of processing.

Next, referring to Fig. 3, the processing contents will be explained. First,
In step 30 (statement number 08; Figure 2), OU
Clear the space (1'-'') in the T P UT area, and in the next step 31 (statement number 09) determine whether the input data is 1440 or less (within 24 hours), 1440 or less If not, then in step 39 (statement number 24), the abnormal termination code 4 is set in the variable RCODE, and the process is terminated. Also, the judgment is 144
If it is less than 0, then step 3゛2 (statement number 11)
, the input data is 60 or less (within 1 hour)
Determine whether or not. If it is 60 or less, then in step 33 (statement number 13), the hour data H O
Set U R to ``0'' and proceed to the next step 34 (statement number 1
4), convert the input data into minute data (MI
NUTE). If the input data is 60 or more, in step 35 (statement number 18), time is calculated from the input data and hour data is set, and in the next step 36 (statement number 19),
Calculate and set the minute data from the remaining data. Next, in step 37 (statement number 37), the hour and minute delimiters (LL:I1) are set. Then, in step 38 (statement number 22), the normal completion code O is set in the variable RC○DE, and the process ends.

A processing example when testing such a time input program as a program under test will be specifically described. Here, we will finally create an input/output correspondence table that shows the relationship between input data and output data for each pass of data processing, as shown in Figure 4, and use this input/output correspondence table to
Tested 1 - Check the program.

[Create input data list] Search for the data area definition statement (in this example, the definition statement for the rDCLJ character string) from the beginning to the end of the source program, and write the level number and area name for the input data. Create a list of input data in memory. In this example, an input data list as shown in FIG. 5 is created.

[Output data list creation] Search for data area definition statements from the beginning to the end of the source program, list the level number 3 and area name for the output data, and save the output data list in memory. Create something. In this example, it is not possible to determine from the data area definition statement whether it is an input data area or an output data area, so the input data list is used as is as the output data list (see Figure 5). ).

[Logic analysis of source program] Analyze the executable statements one by one from the beginning to the end of the source program, and use the previously created "input data list J" or "
If a data area name registered in the "Output Data List" is found, the following processing is performed depending on the executable statement.

■If the executable statement being analyzed is a judgment statement, in this example, for example, in the case of an executable statement of the character string rIFJ, as shown in Figure 6, the elements of the executable statement are further added as elements of a tree structure. , add two elements (one for YES and one for No). ■If the executable statement being analyzed is an assignment statement, for example, in this example, rPROcJ, rDcLJ, rIFJ . “D.O.
In the case of an executable statement that does not correspond to any of the character strings Jt rEI, ESJ, or "END", the output data update list of the last element of the created element (the list of the elements pointed to by the last pointer of the element) Output data update - q table). The area name and update contents are registered (see Figure 6).

When a group of elements of tree+1a is created in the memory in this way, an output data update history list as shown in FIG. 7 is obtained. Using this data update history list, the data processing path in the program is then analyzed to create an input/output correspondence table for the list of input/output data.

[Creation of input/output correspondence table] Refer to the previously created output update history list, process as follows, obtain each of the following items, and create an input/output correspondence table. In other words, ■Number of passes: The number of elements that do not have a continuation element.

■Path: A collection of elements that are passed through until reaching an element that does not have a continuation element.

■Input for each bus: Data referenced by the judgment expression registered in the element belonging to the relevant path.

■Output for each path: Data registered in the output data update list of elements belonging to the path. However, if the same data has been updated more than once, the one closest to the last element is used. In this way, when the data of each item in the input/output correspondence table is obtained and the input/output correspondence table is created, the fourth
As shown in the figure, the relationship between each input and output data is
, bus 2, and path 3. Corresponding to this input/output correspondence table, in the program under test, ・Input: INPUT ・Output: HOUR COLON MINUTE RCODE ・It can be seen that the number of passes is 3 (pass 1, pass 2, pass 3). The relationship between input conditions and output contents for each path is listed, making it easy to check. Therefore, by comparing this input/output correspondence table with a program checklist prepared in advance, it is possible to easily determine whether there is a defect or not without executing the program under test.

The present invention has been specifically explained above based on examples, but
It goes without saying that the present invention is not limited to the embodiments described above, and can be modified in various ways without departing from the spirit thereof.

〔Effect of the invention〕

As explained above, according to the present invention, even when testing a created program. There is no need to set input data for the program under test or execute the program. Therefore, it is possible to significantly reduce labor costs and computer time in the testing process, as well as shorten the construction period.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing a processing process of a program test method according to an embodiment of the present invention, FIG. 2 is a diagram showing a list of source programs of a program under test to be tested, and FIG. Figure 2 shows the flowchart of the program under test, Figure 4 shows the input/output correspondence table created from the program under test to be tested, and Figure 5 shows the flowchart of the program under test to be tested. Figure 6 shows the input data list, Figure 6 is a diagram explaining one element of the output data update history list, and Figure 7 shows the output data update history list of a group of elements created as tree-structured data. It is a diagram showing an example. In the figure, 10... input file, 11... data processing system, l2... output list, 1... source program input process, 2... input data list creation process, 3... Output data list creation process, 4.
...Source program logic analysis process, 5...
Input/output correspondence table fj. &L output process.

Claims (1)

[Claims] 1. Input the source program of the program under test,
It creates a list of input data, a list of output data, and a list of output data update history, analyzes the logic of the source program, and traces the path that relates the input data content and output data content. A program testing method characterized by outputting a correspondence table showing the contents of input data and contents of output data for each pass, and checking the validity of the program under test from the correspondence table.