JP2002312167A - Program for making computer calculate value of variable, compile program, variable value determining method, and program generating method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a program capable of optimizing processing efficiency and allowing a computer to calculate the values of variables, irrespective of the sequence of description or the sequence of execution of calculation expressions. SOLUTION: An assumed value is set for an unknown variable (step S1). Each time an assumptive value is set for the unknown variable, the solutions of the respective calculation expressions are calculated, based on predetermined values of known variables and on the assumptive value set for the unknown variable (step S3). The solution calculated, based on each of the plurality of calculation expressions, is set as a new assumptive value for the unknown variable to be calculated by the calculation expression (step S4). Each time such an assumed value is set as unknown variable, identify is determined between assumptive values for the unknown variable before and after the setting (step S5). When the assumed values for the unknown variable, before and after the setting, are determined as being the same, the assumed value set for the unknown variable is outputted as the result 3 of the calculation (step S6).

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a program for causing a computer to calculate the value of a variable, a compilation program, a method for determining a variable value, and a method for generating a program, and in particular, irrespective of the execution order of a calculation formula for calculating a variable. The present invention relates to a program for causing a computer to calculate the value of a variable, a compilation program, a variable value determination method, and a program generation method.

[0002]

2. Description of the Related Art At present, many companies are working on computerization of business. Since there are a wide variety of industries in the industrial world, it is necessary to develop software for each business in order to computerize the business of each business. The software program can be created using C language, assembler, or the like.

[0003] Such a programming operation is basically performed by manual input by a human. But what humans do often comes with mistakes. For this reason, it is generally considered that there is always a mistake in the program. Such program mistakes are called bugs. If these bugs are not removed, the software will either not achieve its intended purpose or the computer running the software will behave erratically.

There are roughly three types of bugs as follows. 1) A grammatical mistake found during translation. 2) A logical mistake that is found immediately during execution due to an error. 3) A logical error that does not cause an error but causes an error in the execution result.

[0005] Usually, after a program is created, a work (debugging) for finding and correcting a bug is performed. The bugs in 1) are, for example, writing wrong functions,
Or the number of parentheses is wrong. Bugs caused by such grammatical mistakes are translated programs (compiler)
Is found immediately and an error message is output. Therefore, it is easy to find bugs due to grammatical mistakes.

The bug 2) is not grammatically wrong,
The number of data passed between modules is wrong, or the data format is wrong. Such bugs are difficult to find in a translated program, and can be found by partially testing the program or running it entirely.

However, the bug 3) is difficult to find because no error message appears in the translation program. For example, the value of variable a is

[0008]

## EQU1 ## Variable a ₀ = variable b ₀ × variable c ₀ (1)

[0009]

## EQU2 ## Variable b ₀ = variable c ₀ + variable d ₀ (2)

[0010]

## EQU3 ## Variable c ₀ = variable d ₀ × variable e ₀ (3)
Consider the case of asking. Here, when the values of the variable d ₀ and the variable e ₀ are given, it is necessary to create a program so that the computer executes the equations (3), (2), and (1) in this order. If the execution order of such a calculation formula is wrong, an incorrect execution result will be output. In this case, there is no grammatical error and no error message is issued during translation. No error message is output even if executed. For this reason, conventionally, in order to find the bug 3), an error in the execution result was manually detected.

[0011]

However, the bug 3) requires a human to visually confirm and find a mistake in the execution result, and it is very difficult to find the bug. Therefore, creating reliable software required a long period of debugging work to remove bugs from the program. As a result, the completion of the software is delayed by the time required for the debugging work, and the productivity of the software is reduced.

Therefore, it has been considered to prevent the occurrence of the bug 3). Considering the cause of the bug 3), the cause peculiar to the von Neumann computer can be considered.

[0013] The von Neumann computer was created in the age of vacuum tubes in hardware. Since the processing capability of computers in this era is much lower than that of today's computers, it is an essential issue in terms of both performance and memory capacity to complete processing only once.
For this reason, software design logic that inevitably performs processing only once without performing useless repetitive processing is required, and the logic has been followed to date.
To prevent useless repetition, for example, when a plurality of variables are represented by an arithmetic expression such as an arithmetic operator, the arithmetic expression is executed from the expression of the lowest concept.

FIG. 15 is a diagram showing a description example and an execution example of a conventional program. FIG. 15 shows a description example 910 of a conventional program and an execution example 920 according to the description.

In a description example 910 of a conventional program,
The definition of data and the like and the description of the processing procedure are made. According to the description of the processing procedure, the child program “child program AB, child program CD” that executes the calculation formula of the lower concept is called from the program “parent program ABCD” that executes the calculation formula of the higher concept. Similarly, a grandchild program “grandchild program A, grandchild program B” for executing the calculation formula of the lower concept is called from the child program (child program AB). From the child program (child program CD), grandchild programs “grandchild program C, grandchild program D” for executing the calculation formula of the lower concept are called. After the processing of the called program ends, the program returns to the calling parent program.

According to the execution example 920 of the program, data and the like are defined when the program is executed. Thereafter, the program is executed according to the calling relationship of the processing procedure.

As described above, in the conventional program, the logic is assembled on the assumption of the execution order. If such logic becomes complicated, it is likely to cause bugs. In other words, programmers are forced to create and test documents in a logical configuration for computers based on general requirement definitions and external designs. This is one of the causes of the bug.

For this reason, the software construction and development means adapted to the von Neumann type computer is inefficient and has an unstable development period in terms of productivity and maintainability. As a result, construction and development costs tend to be higher than planned. In order to fundamentally improve the software construction / development method from a number of adverse effects, new concepts and theories, which replace the conventional methods, were required.

For example, Lyee (GOVERNMENTAL METHOD
A technology based on the theory named OLOGY for SOFTWARE PROVIDENCE (a collection of letters at the end of each word) is available on the homepage (http://www.lyee.co.jp/jp/index.htm). . According to this technique, a programmer expresses a plurality of words (variables) by an arithmetic expression such as an arithmetic operator, and describes it from the expression of the highest concept. Then, it is precompiled and executed from the expression of the lowest concept. International patent applications related to this technology (WO97 / 16784,
WO98 / 19232) has also been conducted.

In this way, by applying a programming method that does not care about the order of description of the calculation formula in the program, it is possible to prevent the occurrence of a bug due to the mistake in the description order of the arithmetic formula such as the bug 3). Can be. This is very useful in software development, and it is expected that the range of use will be expanded in the future.

However, it is unclear whether the Lyee theory can be applied to all algorithms, and no sufficient optimization means is disclosed in terms of program processing efficiency. Therefore, there is a demand for diversification of programming techniques and optimization of processing efficiency that can be described regardless of description order and execution order.

The present invention has been made in view of the above points, and it is possible to optimize the processing efficiency and to make a computer calculate the value of a variable regardless of the description order or execution order of calculation formulas. It is an object of the present invention to provide a program, a compiled program, a variable value determination method, and a program generation method.

[0023]

In order to solve the above-mentioned problems, the present invention provides a program for causing a computer to calculate the value of a variable and a method for determining a variable value, as shown in FIG. By causing a computer to execute the program of the present invention, processing of the following variable value determination method is realized on the computer.

When a plurality of formulas for calculating at least one unknown variable and a default value of at least one known variable included in the plurality of formulas are input, a hypothetical value is set for the unknown variable. (Step S1). Each time a hypothetical value is set for an unknown variable, a solution of each equation is calculated based on the default value of the known variable and the hypothetical value set for the unknown variable (step S3). The solution calculated based on each of the plurality of formulas is newly set as an assumed value of the unknown variable calculated by each formula (step S4).
Each time a hypothetical value is set for an unknown variable, the identity of the value before and after the setting of the hypothetical value of the unknown variable is determined (step S).
5). If it is determined that the values before and after the setting of the assumed value of the unknown variable are identical, the assumed value set for the unknown variable is output as the calculation result 3 (step S6).

Thus, when the calculation formula and the default value of the default variable are input, the solution of the calculation formula is obtained from the default value of the default variable and the assumed value of the undetermined variable. Based on the obtained solution, an assumed value is newly set for the undetermined variable. Then, if the values before and after the setting of the assumed value are not identical, the calculation of the solution of the calculation formula and the setting of the assumed value are repeated. If the values before and after the setting of the assumed value are identical, the assumed value set in the unknown variable at that time is output as the calculation result.

According to the present invention, in order to solve the above-mentioned problems, in a compilation program and a program generation method for generating a program in which an instruction for calculating a value of a variable is described, at least one unknown variable is calculated. To a computer to which a plurality of calculation formulas for inputting are input, in response to input of a default value of at least one known variable included in the plurality of calculation formulas, An instruction to generate and repeatedly calculate the solution of each of the formulas based on the default value of the known variable and the assumed value set for the unknown variable every time the assumed value is set for the unknown variable. An instruction to newly set the solution calculated based on each of the plurality of formulas as a hypothetical value of the unknown variable calculated by each of the formulas. Every time a hypothetical value is set for the unknown variable, generates an instruction to determine the identity of the value before and after setting the hypothetical value of the unknown variable, and generates a command before and after the setting of the hypothetical value of the unknown variable. When the values are determined to be identical, a compile program and a program generation method are provided, which generate an instruction to output an assumed value set in the unknown variable as an operation result, and execute a process. You.

Thus, when a plurality of formulas are input to the computer that executes the compiling program according to the present invention, a program for causing the computer to calculate the value of the variable according to the present invention is generated.

[0028]

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a diagram illustrating the principle of the present invention. In the present invention, a computer executes the following processing (a computer that performs the following processing is referred to as a “variable value determination device”). The following process is started by inputting a plurality of calculation formulas for calculating at least one unknown variable and a default value of at least one known variable included in the plurality of calculation formulas. In the example of FIG. 1, a calculation formula “α = F (β)” for obtaining the variable α based on the variable β and a calculation formula “β = G (γ)” for obtaining the variable β based on the variable γ are input. ing. In this example, the variables α and β are unknown variables, and the variable γ is a known variable. Then, the value “5” of the variable γ is input.

First, assumed values are set for variables α and β which are unknown variables (step S1). In the example of FIG. 1, “1” is set as the assumed value of the variable α and the variable β. The known variable, the default value, and the assumed value of the unknown variable are held as processing target data 1.

Each time an assumed value is set for an unknown variable, the processing of steps S2 to S5 is performed. That is, first, the processing target data 1 is copied, and copy data 2 is generated (step S2). Next, a solution of each formula is calculated based on the default value of the known variable and the assumed value set for the unknown variable (step S3). The solution calculated based on each of the plurality of formulas is newly set as the assumed value of the unknown variable calculated by each formula (step S4). In the example of FIG. 1, the values of the variables α and β are calculated, and are set in the processing target data 1 as assumed values. Then, the identity of the unknown variable with the value before and after the setting of the assumed value is determined (step S5). The determination of the identity is made by comparing the contents of the processing target data 1 and the copy data 2. For example, when the values of all variables match, it can be determined that there is identity. Further, when the values of the variable α to be finally obtained coincide, the identity may be determined.

In the determination of the identity, the processes of steps S2 to S5 are repeatedly executed unless it is determined that there is the identity. In the determination of the identity, when it is determined that the values before and after the setting of the assumed value are the same, the assumed value set in the unknown variable is determined as the calculation result,
The calculation result 3 is output (step S6).

If a program is created so that the processing is executed according to the above procedure, a correct solution can be calculated irrespective of the order in which the formulas for obtaining the variables are described. That is,
Finding the final solution, such as a mathematical proof formula, means finding the values of variables that satisfy all the formulas. Therefore, when formulas including variables were written from upper concept to lower concept without any excess or shortage (in any order), the formulas were repeatedly executed multiple times, and the values of all variables did not change. Means that the values of all variables that satisfy all the formulas have been determined. Therefore, the value of each variable when the value of the variable stops changing can be determined as a correct solution.

As described above, the theory according to the present invention is simple. Moreover, it does not require a development support system, is applicable at the level of coding techniques, and is easy to use. The program description written without regard to the order is optimized by the precompiler in advance (or by changing the order of the description and the order of execution at the time of execution) so as to reduce the number of iterations of the solution calculation process. It is also possible to do it easily. In addition, it is not necessary to describe an IF instruction, a CALL instruction, a GOTO instruction, or the like, which represents logic, as a description of a program. Thus, development productivity is dramatically improved.

Here, the difference between the solution in the current general-purpose computer (Neumann type) and the solution according to the present invention will be described. When creating a program for calculating the value of a certain variable, a human needs to come up with a calculation formula for calculating the variable mathematically. In mathematics, variables included in an expression of a superordinate concept are defined by a subordinate concept in order to prove an expression of a superordinate concept that defines a final answer. At this time, in general, variables and expressions from the upper concept to the lower concept are gradually described in accordance with human thinking. The proof is completed when the variables and expressions defined in the lower concept reach known variables and expressions.

Neumann, the inventor of the current general-purpose computer (Neumann-type computer), executes, as a basic principle of the Neumann-type computer, formulas including variables of lower concepts in order, and finally includes variables of higher concepts. Completed the architecture to execute the formula. As a result, the execution sequence of the calculation formula in the Neumann computer is deviated from the description order of the calculation formula in human thinking.

In a conventional program for a Neumann-type computer, the order of calculation formulas is described in accordance with human thinking, and expressions of lower concepts are gradually described from higher concepts. And
By frequently using jump instructions, call instructions, and the like, the computer executes the expressions in order from the lower concept. However, because the order in which the formulas are described in the program is different from the order in which the formulas are executed on the computer, a bug has occurred due to an incorrect order in which the formulas are executed. In addition, in the case of software for a large-scale computer system, the amount of programs is enormous, and it is difficult to identify the location where a bug occurs. As a result, they spent a lot of time finding the problem.

On the other hand, the present invention provides a programming method regardless of the execution order of the calculation formula. This allows
It is possible to prevent a bug from occurring due to an incorrect execution order of the calculation formula.

In determining the identity of the solution, basically,
Although it is required that the values of the processing target data 1 and the copy data 2 match, in the case of floating-point arithmetic, they may be regarded as the same because they are approximate values. This is because the result of the floating-point operation will be an approximate value even if the same value is input for each execution.

By the way, if the programming method of the present invention is adopted, the values are basically determined in order from the variables of the lower concept. Here, “determining the value” means that the value does not change even if the solution is calculated by the calculation formula. Therefore, the programming method of the present invention is hereinafter referred to as a “variable sequential determination method”. In addition, a computer that executes processing according to the program method of the present invention is referred to as an “inverse Neumann computer (processing device) of a variable sequential determination method”. Further, among the inverse Neumann processing apparatuses, a computer that operates in parallel by applying the variable sequential determination method is referred to as an “inverse Neumann multidimensional processing apparatus of a variable sequential determination method”.

[First Embodiment] FIG. 2 is a diagram showing an example of a hardware configuration of an inverse Neumann processing apparatus according to a first embodiment. The inverse Neumann type processing apparatus 100
The PU 101 controls the entire apparatus. CPU
A RAM 102, a hard disk device (HDD) 103, a graphic processing device 104, an input interface 105, and a communication interface 106 are connected to the 101 via a bus 107.

The RAM 102 temporarily stores at least a part of an OS (Operating System) program and an application program to be executed by the CPU 101. Further, the RAM 102 stores various data necessary for processing by the CPU 101. HDD 103 is
S and application programs are stored.

The monitor 11 is connected to the graphic processing device 104. Graphic processing device 104
Displays an image on the monitor 1 according to a command from the CPU 101.
1 is displayed on the screen. The keyboard 12 and the mouse 13 are connected to the input interface 105.
The input interface 105 converts a signal sent from the keyboard 12 or the mouse 13 into a CP
Transmit to U101.

The communication interface 106 is connected to the network 14. The network 14 is, for example, a wide area network such as the Internet. The communication interface 106 transmits and receives data to and from another computer via the network 14.

With the above hardware configuration,
The processing functions of the first embodiment can be realized.
FIG. 3 is a functional block diagram of the inverse Neumann processing apparatus according to the embodiment of the present invention. In the first embodiment, a processing target data storage area (X area) 2
1. A copy data storage area (Y area) 22 and a processing non-target data storage area (Z area) 23 are formed.

The X area 21 is an area for storing variables to be processed. In the X range 21, values of a plurality of variables are set as continuous values. The Y area 22 is an area for storing a copy of the data in the X area 21. The storage capacity of the Y area 22 is the same as that of the X area 21.

The Z area 23 is an area for storing data not to be processed. The Z area 23 stores definitions of input / output devices, definitions of timers and the like, and a database. The processing functions of the inverse Neumann processing apparatus according to the first embodiment are roughly classified into a data input control unit 110, a program execution unit 120, and a data output control unit 130.
It consists of.

The data input control section 110 performs data processing of an input system. For example, data responding to an instruction of a screen icon or button by a mouse or the like is set in the memory space 20, or a data value is set from a keyboard. The data input control unit 110 also sets data such as a timer that changes every moment. Further, the data input control unit 110 loads a program into the memory space 20 in response to a request based on an operation input or the like from a user. For example, when an execution request specifying a process file in the HDD 103 is input by an operation input using the keyboard 12, the data input control unit 110 acquires the specified file from the HDD 103, and Stored in area 23.

The program execution unit 120 executes the inverse Neumann processing according to the first embodiment based on the data stored in the Z area 23. In the first embodiment, the program execution unit 120 includes the processing target data setting unit 12
1, copy unit 122, solution calculation unit 123, match determination unit 12
4, and a result output unit 125.

In response to a program execution request, the processing target data setting unit 121 extracts a set of variables from the data stored in the Z area 23 and stores it in the X area 21. The copying unit 122 copies the data of each variable to be processed stored in the X area 21 to the Y area 22. Copying unit 1
The data is copied by the processing unit 22 after the data is stored by the processing target data setting unit 121 and after the identity determination unit 124 determines that there is no identity (mismatch).

The solution calculation unit 123 obtains a variable calculation formula from the data stored in the Z range 23, and calculates the value of the variable in the X range 21 based on the calculation formula. Solution calculation unit 1
23 sets the value of the calculated variable to each variable in the X region 21. The calculation processing by the solution calculation unit 123 is performed by the copying unit 122
This is performed after the end of the copying process by.

The coincidence determination unit 124 determines whether the X area 21 and the Y area 22
To determine the data identity. The determination of the identity can be based on the fact that the values of all variables are the same, or at least the values of the variables at the top are the same. Here, the uppermost variable is a variable that is not used in a calculation formula for calculating another variable. The determination process by the match determination unit 124 is performed by the solution calculation unit 1
23 is performed after the end of the solution calculation process.

The result output unit 125 copies the variable data stored in the X area 21 to the Z area 23. Result output unit 1
The data is copied by the matching determination unit 124 after the determination that there is identity (coincidence).

The data output control unit 130 outputs the solution of each variable stored in the Z area 23. For example, the file is stored in the HDD 103 as a file, or a form is output on a screen of a display device.

Next, variable sequential determination processing in the inverse Neumann processing apparatus having the configuration shown in FIG. 3 will be described with reference to a flowchart. FIG. 4 is a flowchart illustrating the processing procedure of the variable sequential determination method according to the first embodiment.
Hereinafter, the processing illustrated in FIG. 4 will be described along with step numbers.

[Step S11] Data input control section 11
0 loads the program into the Z area 23. At this time,
In the X area 21, variables defined in the program are set.

[Step S12] The copying section 122 secures the Y area 22. At this time, the copying unit 122 sets the defined variable to an initial value (for example, “FF...
・ ”) And set in the Y area. The initial value of the variable is different from the variable in the X area 21.

[Step S13] The processing target data setting unit 121 selects one of the programs stored in the Z area
The value of the variable is taken out and set to each variable in the X area 21. Incidentally, for a variable for which a value is not set in the Z region 23,
An arbitrary value (for example, 1) is set.

[Step S14] The match determination section 124
It is determined whether the values of all the variables in the X area 21 are the same as the values of all the variables in the Y area 22. If the values of all the variables are the same, the process proceeds to step S17. If the values of all the variables are not the same, the process proceeds to step S15.

[Step S15] The copying unit 122 copies the data to be processed in the X area 21 to the Y area 22. [Step S16] The solution calculation unit 123 calculates the value of the variable stored in the X area 21 based on the equation defined in the Z area 23. The calculated value of each variable is set to each variable in the X region 21. Thereafter, the process proceeds to step S14.

[Step S17] The result output unit 125
When it is determined that the variable and the value of the X area 21 and the value of the variable of the Y area 22 match, the processing target data of the X area 21 is used as a solution,
Copy to Z area 23.

[Step S18] Data output control section 13
0 outputs the data stored in the Z area 23 to the HDD 103 or the like. As described above, the processing of steps S14 to S16 is repeated until the values of the variables in the X area 21 and the Y area 23 match. The fact that the values of the variables in the X region 21 and the Y region 23 match means that the values of the variables do not change even if calculations are performed by substituting known variables into the defined formula.
That is, the value of the variable that satisfies the defined equation has been obtained. Hereinafter, performing a series of processes in steps S14 to S16 once is referred to as one pass, and the number of repetitions of the series of processes is represented by the number of passes.

Hereinafter, as specific examples, variables a, b, c,
There will be described a case where d and e are present, 2 is substituted for the variable d, and 105 (yen) is substituted for the variable e, and the following formula is executed.

[0063]

## EQU4 ## Variable a = variable b × variable c (4)

[0064]

## EQU5 ## Variable b = variable c + variable d (5)

[0065]

## EQU6 ## Variable c = variable d × variable e (6) Here, a program for calculating the value of the variable a is described in a variable sequential determination method.

FIG. 5 is a schematic diagram showing a first description example and an execution example of a variable sequential determination method program. In the figure, program description 210 and program execution 220
Are shown.

The description 210 of the program is divided into three descriptions 211 to 213. First description 211
Is a description for securing an area defined by data and the like as the Y area 22. In the example of FIG. 5, instructions are given to secure areas for variables a, b, c, d and e and to set initial values for each variable. Note that the initial value of each variable is different from the value of each variable in the X range.

The description 212 is a description relating to the definition of data set in the X area 21. In the example of FIG. 5, the variable a (value is undecided), the variable b (value is undecided), the variable c (value is undecided),
Variable d = 2 and variable e = 105 are defined.

The description 213 defines a calculation formula indicating the relationship between variables. In the example of FIG. 5, three calculation formulas are defined in the order of the above formulas (4), (5), and (6). The execution content 220 of the program shows the execution content of the variable sequential determination method according to the description content 210 of the program. The execution content is the program description content 210
Are divided into three partial processes 221 to 223 corresponding to the three descriptions 211 to 213, respectively.

The partial process 221 is performed according to the description 211 according to
This is a process of securing an area for a definition such as data. In the example of FIG. 5, areas for variables a, b, c, d, and e are secured, and 1 is set to each variable as an initial value.
Here, the initial value to be set is that at least one variable is
Any value different from the variable of the same name in the X area 21 may be used. In the example of FIG. 5, among the variables set in the X area 21, values other than 1 are set to the variables d and e. Therefore, in the partial process 221, the initial values of all variables are set to the maximum value (the value of each byte is FF in hexadecimal).

The partial process 222 is performed according to the description 212
This is a process for defining data for the X area 21. In the example of FIG. 5, a variable a, a variable b, a variable c, a variable d, and a variable e are defined, and a value is set for each variable. The specified value is set for a variable whose value is specified by the description 222. A predetermined initial value (for example, 1) is set for a variable for which a value is not specified by the description 222. In the example of FIG. 5, variable a = 1, variable b
= 1, variable c = 1, variable d = 2, and variable e = 105.

Note that an execution error may occur depending on how “0” is handled in the calculation formula of the computer. This is because if the value of the variable used as the denominator of the division expression is 0, the operation of the expression cannot be performed. For this reason, it is desirable to set “1” instead of “0” as an initial value to a variable whose value has not been determined.

The partial process 223 is performed according to the description 213.
This is the process of performing the calculation of the calculation formula. The processing content complies with steps S14 to S16 in FIG. In brief, it is determined whether or not the values of all variables in the X area = Y area are the same, and if they are the same, the process ends. If they are not the same, the contents of the X area are copied to the Y area. The formulas are calculated in the order described in the description 213. Thereafter, the process proceeds to the first determination process.

In the example of FIG. 5, the description 213 defines a variable calculation expression in the order of Expression (4), Expression (5), and Expression (6). Therefore, the order of the arithmetic processing in the partial processing 223 is also the order of Expression (4), Expression (5), and Expression (6).

FIG. 6 is a diagram showing a transition state of the value of a variable in the case where equations are calculated in the order shown in the first example. FIG.
Include initial values of five variables in the X area 21 and the Y area 22;
The values at the end of the calculation of the calculation formula are shown.

In the first example, the variables a,
The continuous values of b, c, d, and e are “1,1,1,2,10
5 ". The initial values of the Y area 22 are all hexadecimal "F
FFF "(two-byte number). In FIG. 6, values other than the initial value of the Y area 22 are represented by decimal numbers.

In the first calculation processing, it is determined that they do not match in the determination processing (step S14) whether X area = Y area (coincidence). Then, the contents of the X area 21 are copied to the Y area 22 (step S15), and a plurality of equations for solving the variables are executed (step S16). As a result, the variable a becomes the value “1”, the variable b becomes the value “3”, and the variable c becomes the value “210”. At this time, the variables a, b,
The continuous values of c, d, and e are “1, 3, 210, 2, 10
5 ". The continuous values of the variables a, b, c, d, and e in the Y range 22 are changed from hexadecimal “FFFF”,
"1, 1, 1, 2, 105".

In the second calculation process, it is determined that they do not match in the process of determining whether or not X region = Y region (coincidence) (step S14). Then, the contents of the X area 21 are copied to the Y area 22 (step S15), and a plurality of equations for solving the variables are executed (step S16). As a result, the variable a becomes the value “630”, the variable b becomes the value “212”, and the variable c becomes the value “210”. At this time, the continuous values of the variables a, b, c, d, and e in the X region 21 are “630, 212, 2”.
10, 2, 105 ". Variables a, b,
The continuous values of c, d, and e are “1, 3, 210, 2, 10
5 ".

In the third calculation process, it is determined that they do not match in the determination process (step S14) of whether or not X region = Y region (coincidence). Then, the contents of the X area 21 are copied to the Y area 22 (step S15), and a plurality of equations for solving the variables are executed (step S16). As a result, the variable a
Becomes the value “44520”, the variable b becomes the value “212”, and the variable c becomes the value “210”. At this time, the X region 21
Continuous values of the variables a, b, c, d, and e are “44520,
212, 210, 2, 105 ". The continuous values of the variables a, b, c, d, and e in the Y range 22 are “630, 212, 2”.
10, 2, 105 ".

In the fourth calculation processing, it is determined that they do not match in the processing of determining whether or not X area = Y area (coincidence) (step S14). Then, the contents of the X area 21 are copied to the Y area 22 (step S15), and a plurality of equations for solving the variables are executed (step S16). As a result, the variable a becomes the value “44520”, the variable b becomes the value “212”, and the variable c becomes the value “210”. At this time, the X region 21
Continuous values of the variables a, b, c, d, and e are “44520,
212, 210, 2, 105 ". The continuous values of the variables a, b, c, d, and e in the Y range 22 are “44520, 21
2,210,2,105 ". At this stage, X area 21
And the Y region 22 match.

In the fifth arithmetic processing, it is determined that the X area is equal to the Y area (coincidence) (step S14), and the contents of the X area 21 are copied to the Z area (step S14).
17) The process ends. Therefore, the values at the end of the fourth processing are held as they are in the variables in the X area 21 and the variables in the Y area 22. Then, the value of the variable in the X region 21 is extracted as a solution.

In the examples of FIGS. 5 and 6, the calculation formulas are described in an order in which a solution is intentionally difficult to obtain. for that reason,
It takes five passes to find a solution. Here, for example, if the order of the calculation expressions is changed by the precompiler, the processing efficiency is improved.

Next, a case where the order of the calculation formulas is changed will be described as a second execution example. FIG. 7 is a schematic diagram showing a second description example and an execution example of the variable sequential determination method program. In the figure, a program description content 230 and a program execution content 240 are shown. The description content 230 in FIG. 7 includes three descriptions 231 to 233. The descriptions 231 and 232 correspond to the description 21 shown in FIG.
Same as 1 and 212. In the description 233, calculation formulas are defined in the order of Expression (5), Expression (4), and Expression (6).

The execution content 240 of the program includes three partial processes 241-243. Partial processing 2
41 and 242 are the partial processes 221 and 222 shown in FIG.
This is the same processing as. The partial process 243 is a process for performing an operation of a calculation expression according to the description 233. Partial processing 243
Is substantially the same as the partial processing 223 shown in FIG. 5, but only the order of the arithmetic processing is different. In the partial processing 243, calculations are performed in the order of Expression (5), Expression (4), and Expression (6).

FIG. 8 is a diagram showing a transition state of the value of a variable in the case where the operations of the expressions are performed in the order shown in the second example. FIG.
Include initial values of five variables in the X area 21 and the Y area 22;
The values at the end of the calculation of the calculation formula are shown.

In the second example, the variables a,
The initial values of b, c, d, and e are “1,1,1,2,10
5 ". The initial values of the Y area 22 are all hexadecimal "F
FFF "(two-byte number). In FIG. 8, values other than the initial value of the Y region 22 are indicated by decimal numbers.

In the first calculation process, it is determined that they do not match in the determination process (step S14) whether X region = Y region (coincidence). Then, the contents of the X area 21 are copied to the Y area 22 (step S15), and a plurality of equations for solving the variables are executed (step S16). As a result, the variable a has the value “3”, the variable b has the value “3”, and the variable c has the value “210”. At this time, the variables a, b,
The continuous values of c, d, and e are “3, 3, 210, 2, 10
5 ". The continuous values of the variables a, b, c, d, and e in the Y range 22 are changed from hexadecimal “FFFF”,
"1, 1, 1, 2, 105".

In the second arithmetic processing, it is determined that they do not match in the determination processing (step S14) whether X area = Y area (coincidence). Then, the contents of the X area 21 are copied to the Y area 22 (step S15), and a plurality of equations for solving the variables are executed (step S16). As a result, the variable a becomes the value “44520”, the variable b becomes the value “212”, and the variable c becomes the value “210”. At this time, the X region 21
Continuous values of the variables a, b, c, d, and e are “44520,
212, 210, 2, 105 ". The continuous values of the variables a, b, c, d, and e in the Y region 22 are “3, 3, 210,
2,105 ".

In the third calculation process, it is determined that they do not match in the process of determining whether or not X region = Y region (coincidence) (step S14). Then, the contents of the X area 21 are copied to the Y area 22 (step S15), and a plurality of equations for solving the variables are executed (step S16). As a result, the variable a
Becomes the value “44520”, the variable b becomes the value “212”, and the variable c becomes the value “210”. At this time, the X region 21
Continuous values of the variables a, b, c, d, and e are “44520,
212, 210, 2, 105 ". The continuous values of the variables a, b, c, d, and e in the Y range 22 are “44520, 21
2,210,2,105 ". At this stage, X area 21
And the Y region 22 match.

In the fourth arithmetic processing, it is determined that the X area is equal to the Y area (coincidence) (step S14), and the contents of the X area 21 are copied to the Z area (step S14).
17) The process ends. Therefore, the values at the end of the third processing are held as they are in the variables in the X area 21 and the variables in the Y area 22. Then, the value of the variable in the X region 21 is extracted as a solution.

As described above, a correct solution can be obtained even if the order of the expressions (4) and (5) is changed. Further, since equation (4) is a higher-level concept than equation (5), the number of calculations is reduced by describing equation (5) earlier.

Next, an example in which the expressions of the lower concepts are described in order will be described as a third example. FIG. 9 is a schematic diagram showing a third description example and an execution example of the variable sequential determination method program. In the figure, a program description content 250 and a program execution content 260 are shown. The description content 250 of FIG. 9 is composed of three descriptions 251 to 253. The descriptions 251 and 252 correspond to the description 21 shown in FIG.
Same as 1 and 212. In the description 253, calculation formulas are defined in the order of Formula (6), Formula (5), and Formula (4).

The program execution content 260 includes three partial processes 261 to 263. Partial processing 26
Processes 1 and 262 are the same processes as the partial processes 221 and 222 shown in FIG. The partial process 263 is a process of performing an operation of a calculation expression according to the description 253. The processing content of the partial processing 263 is substantially the same as the processing of the partial processing 223 shown in FIG. 5, but differs only in the order of the arithmetic processing. In the partial processing 263, calculations are performed in the order of Expression (6), Expression (5), and Expression (4).

FIG. 10 is a diagram showing a transition state of the value of a variable in the case where the expressions are calculated in the order shown in the third example. FIG. 10 shows the initial values of the five variables in the X range 21 and the Y range 22, and the values at the end of the calculation of the calculation formula.

In the third example, the variables a,
The initial values of b, c, d, and e are “1,1,1,2,10
5 ". The initial values of the Y area 22 are all hexadecimal "F
FFF "(two-byte number). In FIG. 10, values other than the initial value of the Y area 22 are indicated by decimal numbers.

In the first calculation processing, it is determined that they do not match in the processing (step S14) for determining whether X area = Y area (coincidence). Then, the contents of the X area 21 are copied to the Y area 22 (step S15), and a plurality of equations for solving the variables are executed (step S16). As a result, the variable a becomes the value “44520”, the variable b becomes the value “212”, and the variable c becomes the value “210”. At this time, the X region 21
Continuous values of the variables a, b, c, d, and e are “44520,
212, 210, 2, 105 ". The continuous values of the variables a, b, c, d, and e in the Y range 22 are hexadecimal “FFF
F "and" 1, 1, 1, 2, 105 ".

In the second calculation process, it is determined that they do not match in the process of determining whether or not the X range is equal to the Y range (match) (step S14). Then, the contents of the X area 21 are copied to the Y area 22 (step S15), and a plurality of equations for solving the variables are executed (step S16). As a result, the variable a
Becomes the value “44520”, the variable b becomes the value “212”, and the variable c becomes the value “210”. At this time, the X region 21
Continuous values of the variables a, b, c, d, and e are “44520,
212, 210, 2, 105 ". The continuous values of the variables a, b, c, d, and e in the Y range 22 are “44520, 21
2,210,2,105 ". At this stage, X area 21
And the Y region 22 match.

In the third arithmetic processing, it is determined that the X area is equal to the Y area (coincidence) (step S14), and the contents of the X area 21 are copied to the Z area (step S14).
17) The process ends. Therefore, the values at the end of the second processing are held as they are in the variables in the X area 21 and the variables in the Y area 22. Then, the value of the variable in the X region 21 is extracted as a solution.

As described above, the number of operations can be reduced by sequentially describing the expressions of the lowest concept.
By the way, in the variable sequential determination method, the description of the operation instruction is out of order. Therefore, the calculation formula can be described in an order that is easy for humans to understand. Moreover, it is also possible to improve the performance by changing the description order of the calculation formulas within the range that humans can think of. That is, since there is no restriction on changing the order of the calculation formulas, the order may be appropriately determined by the best method that can be conceived by the operator.

For example, the performance can be improved by determining the description order of the formulas in ascending order of the number of variables included in the formulas. That is, when a calculation formula having a complicated structure is represented by a hierarchical structure, the lower-level structure often has a simpler formula. Therefore, assuming that the smaller the number of variables is, the simpler the expression is, and if the calculation expressions are described in ascending order of the number of variables, the processing efficiency can be improved in many cases.

As described above, in the inverse Neumann processing apparatus to which the variable sequential determination method is applied, a plurality of variables are represented by arithmetic expressions such as four arithmetic operators as program descriptions.
A correct solution can be obtained regardless of the execution order of the arithmetic expressions. That is, the programmer does not need to define the execution order. In general,
IF to go back and forth between lines (locations) where the program is described to define the execution order of the program
Instructions representing logic such as an instruction, a CALL instruction, and a GOTO instruction are used. However, according to the variable sequential determination method according to the present embodiment, there is no need to describe an instruction that defines an execution order. This eliminates a bug caused by a mistake in the definition of the execution order, and simplifies the debugging work. As a result, productivity is dramatically improved.

Furthermore, the elimination of the need to define the execution order contributes to a reduction in the amount of program description (the number of steps). When the first embodiment is used, the description amount of the program is reduced to one third to one fifth compared with the conventional case. This reduces the work required for software production by a fraction.

Further, since the test is completed by performing a test process (system test) corresponding to a higher-order process (system design) by eliminating complicated logic such as a programming process, the number of test processes is greatly reduced.

Note that the variable sequential determination method according to the first embodiment can be applied to debugging of a conventional program. That is, in a conventional program, it is generally described that a calculation formula for calculating a variable of a lower concept is executed first. Then, the calculation formula for calculating the variable of the superordinate concept is executed last. Therefore, when the conventional program is executed in the process of step S16 shown in FIG. 4, if the order of the calculation formulas is correct, the variables are sequentially determined in the second pass, and the process ends in the third pass. That is, if there is a conventional program that does not end in the third pass and executes the fourth and subsequent passes, it can be seen that the cause of the bug is hidden somewhere.

This is because, in a conventional program that is correctly programmed so as to execute sequentially from the calculation formula of the lower concept, the values required for all the variables are determined in the first pass, and the processing of the X area 21 is performed in the second pass. This is because the target data matches the copy data in the Y area 22, and the match should be determined in the third pass.

The debugging of the conventional program according to the variable sequential determination method according to the first embodiment includes a combination test (a test in which a plurality of programs are integrated and execution confirmation is performed) to a maintenance process (a process that can be performed immediately). It is good to use it in the operation of operating and correcting problems. Furthermore, in a conventional program, if a branch instruction that is difficult for humans to understand, such as a CALL instruction that branches far away, is removed and copied, the program can be changed to an easy-to-understand program.

Further, the real number operation used in the program for scientific and technical calculation is terminated in the “determination process as to whether X region = Y region (coincidence)” (step S14). The variable a and the final target variable a in the Y area 22
Has reached the same value (end value), "X range =
It may be determined that the “Y range” is satisfied. That is, the process until the entire variable group matches is used for an integer or the like. This is processing for the characteristics of the real number type arithmetic processor (accuracy is sacrificed by improving performance). Not only in the real type operation but also in the integer type variable, the fact that the final target variable a in the X range 21 and the final target variable a in the Y range 22 have the same value (final value)
It may be determined that “X region = Y region” is satisfied. In this case, processing efficiency is improved.

[Second Embodiment] Next, a second embodiment of the present invention will be described.
An embodiment will be described. In the second embodiment,
This is an embodiment in the case where processes related to the variable sequential determination method are executed in parallel. In the second embodiment, the processing of the variable sequential conversion method is applied to a multidimensional processing device described in Japanese Patent Application Laid-Open No. 56-97170 to multiplex the processing. Hereinafter, portions of the second embodiment that differ from the first embodiment will be described.

FIG. 11 is a block diagram showing an example of a hardware configuration of the inverse Neumann multi-dimensional processing device according to the second embodiment. 11, the same components as those of the hardware configuration of the first embodiment shown in FIG. 2 are denoted by the same reference numerals, and description thereof will be omitted.

The inverse Neumann multidimensional processing apparatus 100a according to the second embodiment includes a plurality of CPUs 101a to 101a.
01c is provided. These CPUs 101a-1
01c can execute processing related to the variable sequential conversion method in parallel. Reverse Neumann-type multidimensional processing device 100
The components other than the CPUs 101a to 101c of FIG.
Has the same function as the component of the same name shown in FIG.

As described above, the parallel processing of the variable sequential conversion method can be performed using the hardware of the multi CPU.
In the second embodiment, using a decision table,
It is assumed that the processing is distributed to each CPU.

FIG. 12 is a functional block diagram of the second embodiment. 12, the same components as those of the functional block of the first embodiment shown in FIG. 3 are denoted by the same reference numerals, and description thereof will be omitted.

The inverse Neumann multidimensional processing device according to the second embodiment has a data input control unit 110, a program execution unit 120a, and a data output control unit 130. Note that programs loaded by the data input control unit 110 into the memory space 20 include a decision table 14
0,150 are included.

A plurality of decision tables 140 and 150 are stored in the memory space 20. The decision tables 140 and 150 define a conditional instruction (condition entry) and its answer (condition stub), and an execution instruction (action entry) and an execution instruction (action stub) of the instruction. Details of the decision tables 140 and 150 will be described later.

The program execution unit 120a includes a processing target data setting unit 121a, a copying unit 122a, a plurality of solution calculation units 123a to 123c, a coincidence determination unit 124a, and a result output unit 125a. Each of these components
It has the same function as the component having the same name in the first embodiment shown in FIG. However, each component shown in FIG. 12 refers to the decision tables 140 and 150 to determine whether or not to execute processing.

Further, the solution calculation units 123a to 123c
This is a processing function provided for each of the PUs 101a to 101c. That is, each CPU has a function of a solution calculating unit, and the plurality of CPUs 101a to 101c can execute processing in parallel.

FIG. 13 is a diagram showing an example of the decision table. As shown in FIG. 13, the decision table 140 in the second embodiment is a decision table for pre-processing and post-processing, and is a decision table 150.
Is a decision table of a variable sequential determination method.

In the condition entry 141 of the decision table 140, a condition command “processing start?” And a condition command “processing end?” Are registered. Condition of decision table 140
In the stub 142, “YE” is displayed in the left answer column (first column) associated with the conditional command “Processing started?”
S "is set, and no answer is set in the answer column (second column) on the right side. In addition, no answer is set in the left answer column (first column) associated with the conditional instruction of “processing completed?”, And “YES” is set in the right answer column (second column). Is set.

The action of the decision table 140
In the entry 143, execution instructions of “Z area → X area (copy contents of Z area)” and “end processing (X area → Z area copy)” are registered. In the action stub 144 of the decision table 140, “1” is set in the left execution instruction column (first column) associated with the execution instruction “Z area → X area (copy the contents of Z area)”. The execution instruction is not set in the execution instruction on the right side (second column). Further, in the action stub 144, no execution instruction is set in the left execution instruction column (first column) associated with the conditional instruction “end processing (X area → Z area copy)”, and the right instruction is not set. "1" is displayed in the execution instruction column (the second column)
Is set.

In the condition entry 151 of the decision table 150, a condition instruction of “X area = Y area (matched?)” Is registered. In the condition stub 152 of the decision table 150, the condition instruction “X area = Y area (matched?)”
One answer column is provided. Answer column on the left (first column)
Is set to "YES". “NO” is set in the answer column on the right side (second column).

The actions of the decision table 150
The entry 153 includes “X area → Y area (copy the contents of X area)”, “variable a = variable b × variable c”, “variable b = variable c + variable d”, and “variable c = variable d × variable”. e ”,“ variable f
= Variable g × variable h ”and an execution instruction of“ EXIT processing ”are registered. In the action stub 154 of the decision table 150, an execution instruction is set in the left execution instruction column (first column) associated with the execution instruction of “X area → Y area (copy the contents of X area)”. The execution instruction on the right side (second column) is set to “1”.
No execution instruction is set in the left execution instruction column (first column) associated with the execution instruction of “variable a = variable b × variable c”, and the right execution instruction (second column) is not set. “2” is set. No execution instruction is set in the left execution instruction column (first column) associated with the execution instruction of “variable b = variable c + variable d”, and “ 3 "is set. “Variable c = Variable d × Variable e”
Execution instruction column (first
No execution instruction is set in column (column), and “4” is set in the execution instruction on the right side (second column). "Variable f =
No execution instruction is set in the left execution instruction column (first column) associated with the execution instruction of “variable g × variable h”.
“2” is set in the execution instruction on the right side (second column). Then, “1” is set in the left execution instruction column (first column) associated with the execution instruction of “EXIT processing”, and the execution instruction is set in the right execution instruction (second column). Not.

In the example of FIG. 13, "YES" or "NO" is set in the condition stub. If the condition stub is "YES", if the processing result of the condition instruction of the corresponding condition entry is true (the condition is satisfied), an action entry in which a numerical value is set in the action stub in the same column Is executed. If the condition stub is “NO”, if the processing result of the condition instruction of the corresponding condition entry is false (the condition is not satisfied), the action stub in the same column where the numerical value is set is set.
The entry is executed.

A numerical value is set in the action stub. Each numerical value represents the order of execution. Numerical values in the same column of the action stub are compared, and the corresponding action entry is executed in ascending numerical order. Here, when the values of the action stubs are the same, there is no difference in the processing of those action entries, so that they can be executed in parallel by different CPUs. FIG.
In the example, the execution instruction of “variable a = variable b × variable c” and the execution instruction of “variable f = variable g × variable h” can be processed in parallel.

The following processing is performed in the inverse Neumann multidimensional processing apparatus having the above configuration. First,
The data input control unit 110 stores the program in the memory space 20
To load. The loaded programs include the decision tables 140 and 150. The program execution unit 120a executes a process based on the program loaded into the memory space 20. That is, the processing target data setting unit 1 that recognizes that the loading of the program has been completed
21a refers to the decision table 140, and satisfies the condition command of “Start processing?”
Stub “YES”) processing is determined. In the decision table 140 shown in FIG. 13, since “YES” is set in the first column of the condition stub 142, the first column of the action stub 144 is referred to. Then, the processing of “Z area → X area (copy the contents of Z area)” in which 1 is set in the first column of the action stub 144,
This is executed by the processing target data setting unit 121a. That is, the processing target data setting unit 121a sets the Z area 23a
Are set to the variables of the X region 21. Then, the copying unit 122a secures the Y area 22.

Next, the judgment processing of the condition instruction "X area = Y area (matched?)" Set in the condition entry 151 of the decision table 150 is executed by the match judgment section 124a.

If the result of the determination of “X area = Y area (matched?)” Is “NO” (the second value of the condition stub 152)
Column), the decision table 150 is referred to,
The processing according to the execution instruction in the action entry 153 in which a number is set in the second column of the action stub 154 is executed. The process is an action stub 154
Are executed in ascending order of the numbers set in. Also,
If the numbers set in the action stub 154 are the same, those instructions are sent to a plurality of solution calculation units 123a to 123a.
23c.

When the determination result of “X area = Y area (matched?)” Is “YES” (the first value of the condition stub 152)
Column), the decision table 150 is referred to,
The EXIT processing in which “1” is set in the first column of the action stub 154 is executed. The EXIT process is a process of notifying that the solution has been determined from the match determination unit 124a to the result output unit 125a.

Then, the result output unit 125a refers to the condition entry 141 of the decision table 140, and determines that the conditional instruction of “processing end?” Is “YES” (the second column of the condition stub 142). Then, the result output unit 125a executes the instruction “end processing (X area → Z area copy)” in which “1” is set in the second column of the action stub 144. This process is a process of copying the value of each variable set in the X area 21 as a solution in the Z area 23a.

Thereafter, data output control section 130 outputs the solution stored in Z area 23a. As described above, by using the decision table, the processing of the variable sequential determination method can be performed in parallel by a plurality of CPUs. That is, the process of calculating the solution of the formula can be entrusted to a parallel processing machine to improve the performance.

Note that the action table of the decision table
The execution instruction described in the entry is not only a calculation formula,
It is also possible to describe the Internet or intranet address. Moreover, current routers and LANs
By burning the cable infrastructure as an LSI, a massively parallel machine can be obtained. If the basic software has a browser and Java (registered trademark) language, etc.,
Performing multidimensional processing is easily realized.

[Third Embodiment] In the above example, the program description by the variable sequential determination method and the execution contents of the computer according to the description have been described. (Compile) can be automatically generated by the computer.
Such a computer is referred to as a program generation device. Hereinafter, a program generation process according to the variable sequential determination method will be described as a third embodiment.

FIG. 14 is a schematic diagram of a process for generating a variable sequential determination program. As shown in the drawing, when the calculation formula group 310 is input, a program generation process (S301) is executed in the program generation device.

In the program generation processing, an instruction to be executed is generated in response to an input of a value (predetermined value) of at least one variable (known variable) included in a plurality of calculation formulas. First, an instruction (processing target data setting instruction) 321 for setting processing target data (values of a plurality of variables) to each variable in the X region is generated. At this time, an instruction for setting a temporary value (assumed value) is generated for a variable for which a value is not set (an unknown variable). The temporary value is, for example, “1”.
Next, an instruction to copy the data in the X area to the Y area (copy instruction)
322 is generated. Next, every time an assumed value is set for an unknown variable, an instruction (solution calculation instruction) 323 for calculating a solution of each formula based on the default value of the known variable and the assumed value set for the unknown variable. Is generated. Next, an instruction (assumed value setting instruction) 324 for newly setting a solution calculated based on each of the plurality of equations as an assumed value of a predetermined variable calculated by each equation is generated. Next, each time a hypothetical value is set for an unknown variable, a command (coincidence determining command) 325 for determining the identity of the hypothetical value of the unknown variable with the value before and after the setting is generated. Finally, when it is determined that the values after the setting of the assumed values are the same, an instruction (result output instruction) 326 for determining the assumed value set in the unknown variable as an operation result is generated.

The generated instructions are arranged in the order of generation, and a variable-sequential determination program 320 is obtained. The variable sequential determination program 320 is executed in response to the input of the variable value 330 (Step S302). The execution contents at this time are shown in FIG.
This is as shown in the flowchart of FIG. By executing the variable sequential determination program 320, a solution 340 corresponding to the input variable value 330 is generated.

In this way, the variable sequential determination program 320 can be generated only by inputting a plurality of calculation expressions. That is, it can be compiled. Note that the variable sequential determination program 320 can be generated in a machine language, or can be generated in a programming language such as C or BASIC. When generating the variable sequential determination program 320 in a programming language such as C or BASIC, a program generation process (step S301)
Will precompile. Thereby, C
It becomes easy to apply the variable sequential determination method to a part of the program described in, for example.

[Effects of the Embodiment] As described above, the variable sequential determination method according to the embodiment of the present invention makes it unnecessary to determine the order of complicated processing, and makes it possible to easily implement software in a short time and without bugs. Can be developed and put into operation. This makes it possible to improve software quality, reduce software development costs, and shorten the development period. In other words, there is no mistake in arranging the execution order of the calculation formulas, and other mistakes such as mistakes in the four arithmetic operators and mistakes in the variable names can be easily found and corrected by the automatic test of the data input method. .

When the processing of the variable sequential determination method is applied in the same manner as the conventional program description method, each variable is sequentially determined in two passes and the third pass is performed as long as the execution order of the calculation formula is correct. Ends the processing. In other words, if there is a program that does not end after executing the fourth pass and thereafter, it can be seen that the cause of the bug is lurking somewhere.

In addition, performance can be improved by executing a variable sequential determination program in a multidimensional processing apparatus in which a decision table is applied to parallel processing. In the above embodiment, the values of the plurality of variables are
The values are set as continuous values in the area and the Y area. This allows
The comparison process can be performed at high speed.

[Provision of Program for Realizing Processing Function]
Note that the above processing functions can be realized by a computer. In this case, a program is provided that describes the processing contents of the functions that the inverse Neumann processing device, the inverse Neumann multidimensional processing device, and the program generation device should have. By executing the program on a computer, the processing functions are realized on the computer.
The program describing the processing content can be recorded on a computer-readable recording medium. Computer-readable recording media include magnetic recording devices, optical disks, magneto-optical recording media, and semiconductor memories. Magnetic recording devices include hard disk devices (HD
D), a flexible disk (FD), a magnetic tape, and the like. Optical discs include DVD (Digital Versatile D)
isc), DVD-RAM (Random Access Memory), CD-
ROM (Compact Disc Read Only Memory), CD-R (Re
cordable) / RW (ReWritable). Examples of the magneto-optical recording medium include an MO (Magneto-Optical disk).

When distributing a program, for example, a DVD or CD-ROM on which the program is recorded
And other portable recording media are sold. Alternatively, the program may be stored in a storage device of a server computer, and the program may be transferred from the server computer to another computer via a network.

The computer that executes the program stores, for example, the program recorded on a portable recording medium or the program transferred from the server computer in its own storage device. Then, the computer reads the program from its own storage device and executes processing according to the program. Note that the computer can also read the program directly from the portable recording medium and execute processing according to the program. Further, each time the program is transferred from the server computer, the computer may sequentially execute processing according to the received program.

(Supplementary Note 1) In a program for causing a computer to calculate the value of a variable, a plurality of formulas for calculating at least one unknown variable, and at least one formula included in the plurality of formulas are calculated. When the default values of the two known variables are input, an assumption value is set for the unknown variable. Each time an assumption value is set for the unknown variable, the default value of the known variable and the unknown variable are set. Based on the assumed value set, the solution of each of the calculation formulas is repeatedly calculated, and the solution calculated based on each of the plurality of calculation formulas is calculated based on each of the calculation formulas. It is newly set as an assumed value, and every time an assumed value is set for the unknown variable, it is determined whether the values of the unknown variable before and after the setting of the assumed value are the same, and before and after the setting of the assumed value of the unknown variable. Is the value of A program for executing, when it is determined that there is identity, a process of outputting an assumed value set in the unknown variable as a calculation result.

(Supplementary Note 2) The program according to Supplementary Note 1, wherein in the determination of the identity, when the values before and after the setting of the assumed values of all the unknown variables match, it is determined that there is the identity.

(Supplementary Note 3) In the determination of the identity, when the values before and after the setting of the assumed values of some unknown variables among the plurality of unknown variables match, it is determined that there is identity. The program according to Supplementary Note 1.

(Supplementary note 4) The program according to Supplementary note 1, wherein in the determination of the identity, when the values before and after the setting of the assumed value of the unknown variable are approximate values, it is determined that there is identity. .

(Supplementary Note 5) Before the assumption value is set for the unknown variable, a copy of the assumption value of the unknown variable before setting is held, and in the determination of the identity, the copy and the unknown By comparing the assumed value set for the variable,
3. The program according to claim 1, wherein the sameness of the values before and after the setting of the assumed value of the unknown variable is determined.

(Supplementary note 6) The program according to Supplementary note 1, wherein the calculation of the solution of each of the calculation formulas includes calculating the solution of the calculation formula in parallel using a plurality of processors. (Supplementary Note 7) In the calculation of the solution of each of the calculation formulas, the calculation of the solution of the plurality of calculation formulas having no priority in the processing order in the decision table in which the order of the processes to be performed is specified is executed in parallel by different processors. The program according to claim 6, wherein the program is executed.

(Supplementary Note 8) In a compile program for generating a program in which an instruction for calculating a value of a variable is described, a computer in which a plurality of calculation formulas for calculating at least one unknown variable are input. Generating an instruction for setting an assumed value for the unknown variable in response to input of a default value of at least one known variable included in the plurality of formulas, wherein the assumed value is set for the unknown variable Each time, based on the default value of the known variable and the assumed value set for the unknown variable, generate an instruction to repeatedly calculate the solution of each of the formulas, based on each of the plurality of formulas Generates an instruction to newly set the calculated solution as an assumed value of the unknown variable calculated by each of the formulas, and each time an assumed value is set for the unknown variable, An instruction for determining the identity of the value before and after the setting of the assumed value of the unknown variable is generated, and when it is determined that the value before and after the setting of the assumed value of the unknown variable is identical, the command is set to the unknown variable. A compile program for executing a process for generating an instruction for outputting an assumed value as an operation result.

(Supplementary note 9) The compile program according to supplementary note 8, wherein each of the generated instructions is described in a source code of a predetermined programming language. (Supplementary Note 10) The compilation program according to Supplementary Note 8, wherein each of the generated instructions is described in a machine language.

(Supplementary Note 11) In the variable value determination method using a computer, a plurality of calculation formulas for calculating at least one unknown variable and a default value of at least one known variable included in the plurality of calculation formulas are input. When done
The assumption value is set for the unknown variable, and each time the assumption value is set for the unknown variable, based on the default value of the known variable and the assumption value set for the unknown variable, The solution of the calculation formula is repeatedly calculated, and the solution calculated based on each of the plurality of calculation formulas is newly set as an assumed value of the unknown variable calculated by each of the calculation formulas,
Every time a hypothetical value is set for the unknown variable, the identity of the value before and after setting the hypothetical value of the unknown variable is determined, and the values before and after the setting of the hypothetical value of the unknown variable are determined to be identical. And outputting a hypothetical value set in the unknown variable as a calculation result.

(Supplementary Note 12) In the program generating method for generating a program for calculating the value of the unknown variable based on a plurality of formulas for calculating at least one unknown variable, In response to input of a default value of at least one known variable included in the equation, generating an instruction to set an assumed value for the unknown variable, each time the assumed value is set for the unknown variable, On the basis of the default value of the known variable and the assumed value set for the unknown variable, an instruction for repeatedly calculating the solution of each of the calculation formulas is generated, and the solution calculated based on each of the plurality of calculation formulas is generated. Is newly generated as an assumed value of the unknown variable calculated by each of the calculation formulas, and every time an assumed value is set for the unknown variable, before setting the assumed value of the unknown variable. A command for determining the identity of the later value is generated, and when it is determined that the values before and after the setting of the assumed value of the unknown variable are identical, the assumed value set in the unknown variable is output as a calculation result. A program generating method for generating an instruction to execute the program.

(Supplementary Note 13) In a variable value determination device that calculates a value of a variable, a plurality of calculation formulas for calculating at least one unknown variable, and a predetermined value of at least one known variable included in the plurality of calculation formulas are defined. Once the value is entered,
First setting means for setting an assumed value for the unknown variable, and a default value of the known variable and an assumed value set for the unknown variable each time the assumed value is set for the unknown variable. Calculating means for repeatedly calculating the solution of each of the formulas, and the solution calculated based on each of the plurality of formulas as an assumed value of the unknown variable calculated by each of the formulas. A second setting means for setting the unknown variable, a determining means for determining the sameness of the values before and after the setting of the assumed value of the unknown variable every time an assumed value is set for the unknown variable, Output means for outputting, as a calculation result, the assumed value set in the unknown variable, when it is determined that the values before and after the setting of the assumed value are identical.

(Supplementary note 14) In the program generating apparatus for generating a program for calculating the value of the unknown variable based on a plurality of calculation formulas for calculating at least one unknown variable, First instruction generation means for generating an instruction for setting an assumed value for the unknown variable in response to input of a default value of at least one known variable included in the expression; Each time is set, based on a default value of the known variable and an assumed value set in the unknown variable, a second command generation unit that generates a command to repeatedly calculate the solution of each of the calculation formulas, Third instruction generating means for generating an instruction for newly setting the solution calculated based on each of the plurality of formulas as an assumed value of the unknown variable calculated by each of the formulas; A fourth instruction generating means for generating an instruction for determining the identity of the values before and after the setting of the assumed value of the unknown variable every time the assumed value is set for the intellectual variable; And a fifth instruction generating means for generating an instruction to output an assumed value set in the unknown variable as an operation result when the values before and after the setting are determined to be identical. Generator.

(Supplementary Note 15) In a computer-readable recording medium on which a program for calculating a value of a variable is recorded, a plurality of formulas for calculating at least one unknown variable are stored in the computer. When a default value of at least one known variable included in the calculation formula is input, an assumed value is set for the unknown variable, and each time the assumed value is set for the unknown variable, the known variable is set. Based on the default value and the assumed value set for the unknown variable, the solution of each of the calculation formulas is repeatedly calculated, and the solution calculated based on each of the plurality of calculation formulas is calculated by the calculation formula. Newly set as the assumed value of the unknown variable to be calculated, every time an assumed value is set for the unknown variable, determine the identity of the value before and after the setting of the assumed value of the unknown variable, A storage medium for executing a process of outputting the assumed value set for the unknown variable as a calculation result when the values before and after the setting of the assumed value of the unknown variable are determined to be identical.

(Supplementary Note 16) In a computer-readable recording medium storing a compile program for generating a program in which an instruction for calculating a value of a variable is described, a plurality of programs for calculating at least one unknown variable is provided. In the computer in which the calculation formula is input, in response to input of a default value of at least one known variable included in the plurality of calculation formulas, generating an instruction to set an assumed value for the unknown variable, Each time a hypothetical value is set for the unknown variable, an instruction is generated to repeatedly calculate the solution of each equation based on the default value of the known variable and the hypothetical value set for the unknown variable. Generating an instruction to newly set the solution calculated based on each of the plurality of formulas as an assumed value of the unknown variable calculated by each of the formulas. Each time an assumed value is set for the unknown variable, generates an instruction to determine the identity of the value before and after the setting of the assumed value of the unknown variable, and the value before and after the setting of the assumed value of the unknown variable is A recording medium for executing a process of generating an instruction to output a hypothetical value set in the unknown variable as a calculation result when it is determined that there is identity.

[0156]

As described above, according to the present invention, the solutions of a plurality of formulas are repeatedly calculated based on the default values of the predetermined variables and the assumed values of the undetermined variables, and the values of the assumed values before and after the calculation are identical. If there is, the assumed value set in the unknown variable at that time is output as the calculation result. Therefore, a correct solution can be obtained regardless of the calculation order of a plurality of calculation formulas. This can prevent a bug due to an incorrect calculation order. In addition, by arranging the calculation order of the calculation formula by an appropriate method, optimization can be easily achieved.

[Brief description of the drawings]

FIG. 1 is a principle configuration diagram of the present invention.

FIG. 2 is a diagram illustrating an example of a hardware configuration of the inverse Neumann processing apparatus according to the first embodiment.

FIG. 3 is a functional block diagram of the inverse Neumann processing apparatus according to the embodiment of the present invention.

FIG. 4 is a flowchart illustrating a processing procedure of a variable sequential determination method according to the first embodiment;

FIG. 5 is a schematic diagram showing a first description example and an execution example of a variable sequential determination method program.

FIG. 6 is a diagram illustrating a transition state of a value of a variable when an operation of an expression is performed in the order shown in the first example.

FIG. 7 is a schematic diagram showing a second description example and an execution example of a variable sequential determination method program.

FIG. 8 is a diagram showing a transition state of a value of a variable when an operation of an expression is performed in the order shown in the second example.

FIG. 9 is a schematic diagram showing a third description example and an execution example of a variable sequential determination method program.

FIG. 10 is a diagram illustrating a transition state of a value of a variable when an operation of an expression is performed in the order shown in the third example.

FIG. 11 is a block diagram illustrating a hardware configuration example of an inverse Neumann multidimensional processing device according to a second embodiment.

FIG. 12 is a functional block diagram according to the second embodiment.

FIG. 13 is a diagram illustrating an example of a decision table.

FIG. 14 is a schematic diagram of a generation process of a variable sequential determination program.

FIG. 15 is a diagram showing a description example and an execution example of a conventional program.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Processing target data 2 Copy data 3 Calculation result 11 Monitor 12 Keyboard 13 Mouse 14 Network 100 Reverse Neumann processing device 101 CPU 102 RAM 103 Hard disk device (HDD) 104 Graphic processing device 105 Input interface 106 Communication interface 107 Bus

 ──────────────────────────────────────────────────続 き Continued on the front page F term (reference) 5B056 EE00 EE05 5B076 DA04 DD04 5B081 BB03

Claims (10)

[Claims] 1. A program for causing a computer to calculate a value of a variable, the computer comprising: a plurality of calculation formulas for calculating at least one unknown variable; and at least one known formula included in the plurality of calculation formulas. When a default value of a variable is input, an assumed value is set for the unknown variable. Each time an assumed value is set for the unknown variable, the default value of the known variable and the unknown variable are set. Based on the assumed values, the solution of each of the calculation formulas is repeatedly calculated, and the solution calculated based on each of the plurality of calculation formulas is the assumed value of the unknown variable calculated by each of the calculation formulas. Each time an assumed value is set for the unknown variable, the identity of the value before and after the setting of the assumed value of the unknown variable is determined, and the value before and after the setting of the assumed value of the unknown variable is determined. Is the same If it is determined that the unknown variable is present, the program outputs a hypothetical value set in the unknown variable as a calculation result. 2. The program according to claim 1, wherein in the determination of the identity, when the values before and after setting the assumed values of all of the unknown variables match, it is determined that there is the identity. 3. The method according to claim 1, wherein the determination of the identity includes determining the identity when the values before and after the setting of the assumed values of some unknown variables among the plurality of unknown variables match. Item 5. The program according to Item 1. 4. The non-transitory computer-readable storage medium according to claim 1, wherein, in the determination of the identity, when the values before and after the setting of the assumed value of the unknown variable are approximate values, it is determined that there is the identity. 5. A copy of the assumed value of the unknown variable before setting is held before the assumed value is set for the unknown variable. In the determination of the identity, the copy and the unknown variable are The program according to claim 1, wherein by comparing the set assumption value, the identity of the value before and after the setting of the assumed value of the unknown variable is determined. 6. The program according to claim 1, wherein in calculating the solution of each of the calculation formulas, the solution of the calculation formula is calculated in parallel using a plurality of processors. 7. The method according to claim 1, wherein in calculating the solution of each of the formulas, the solutions of a plurality of formulas having no processing order in the decision table in which the order of the processes to be executed is specified are processed in parallel by different processors. The program according to claim 6, wherein the program is executed. 8. A compile program for generating a program in which an instruction for calculating a value of a variable is described, wherein: a computer to which a plurality of calculation formulas for calculating at least one unknown variable is input; In response to input of a default value of at least one known variable included in the plurality of formulas, an instruction for setting an assumed value for the unknown variable is generated, and the assumed value is set for the unknown variable. For each, based on the default value of the known variable and the assumed value set for the unknown variable, an instruction to repeatedly calculate the solution of each of the formulas is generated, and the command is calculated based on each of the plurality of formulas. Generating an instruction to newly set the solution as an assumed value of the unknown variable calculated by each of the calculation formulas. Each time an assumed value is set for the unknown variable, Generating an instruction to determine the identity of the values before and after setting the assumed value of the unknown variable; and determining that the values before and after the setting of the assumed value of the unknown variable are identical, the assumption value set for the unknown variable A compiling program for generating an instruction for outputting the result as an operation result, and for executing a process. 9. In a variable value determination method using a computer, a plurality of calculation formulas for calculating at least one unknown variable and a default value of at least one known variable included in the plurality of calculation formulas are input. And setting an assumption value for the unknown variable, each time the assumption value is set for the unknown variable, based on the default value of the known variable and the assumption value set for the unknown variable, The solution of each of the calculation formulas is repeatedly calculated, and the solution calculated based on each of the plurality of calculation formulas is newly set as an assumed value of the unknown variable calculated by each of the calculation formulas. Each time a hypothetical value is set for the unknown variable, it is determined whether the value before and after setting the hypothetical value of the unknown variable is equal. Set to the unknown variable Are outputs the assumed value as the operation result is a variable value determined wherein the. 10. A program generation method for generating a program for calculating a value of the unknown variable based on a plurality of calculation formulas for calculating at least one unknown variable, wherein: Generating an instruction for setting an assumed value for the unknown variable in response to input of a default value of at least one known variable included therein; Based on the default value of the variable and the assumed value set for the unknown variable, generate an instruction to repeatedly calculate the solution of each of the formulas, the solution calculated based on each of the plurality of formulas, Generate an instruction to newly set as an assumed value of the unknown variable calculated by each of the formulas, every time an assumed value is set for the unknown variable, the value before and after the setting of the assumed value of the unknown variable Generates an instruction to determine identity, and generates an instruction to output the assumed value set in the unknown variable as a calculation result when the values before and after setting the assumed value of the unknown variable are determined to be identical. A program generation method, comprising: