WO2023242901A1

WO2023242901A1 - Program development method capable of enabling virus infected-program to exclude virus data from program itself

Info

Publication number: WO2023242901A1
Application number: PCT/JP2022/023618
Authority: WO
Inventors: 文生根来
Original assignee: 文生根来
Priority date: 2022-06-13
Filing date: 2022-06-13
Publication date: 2023-12-21
Also published as: JP7174468B1

Abstract

The present invention provides a technology for a virus-infected program itself to incapacitate the virus during the execution of the program. The present invention provides a governance program for governing a program through a scenario function during the execution of a process according to the program in a computer. The computer, which performs the process according to the governance program according to the present invention, determines whether the entire data in a right-hand side of a command statement set in a second code is authenticated in a third code of a subject vector generated pertaining to each of command statements of the program. In addition, when it is determined to be authenticated in the third code, in a fourth code, left-hand side data in the second code is preserved in each of a fourth preservation area, which is a main preservation area of the fourth code, and a fourth copy area that is a sub-preservation area of the fourth code. In addition, in a first code executed thereafter, when data in the fourth preservation area is matched with that in the fourth copy area, the subject vector is determined to be authenticated.

Description

A program development method that allows a virus-infected program to eliminate virus data by itself

The present invention relates to a method for developing a program that is executed on a computer.

There is the LYEE theory, which is a unified theory regarding the providence of software construction discussed by the inventor of the present application. Documents disclosing the LYEE theory include Patent Documents 1 to 3 and Non-Patent Documents 1 to 10.

Additionally, there is a scenario function (hereinafter also referred to as "SF") developed by the inventor of the present application based on the LYEE theory. Documents disclosing scenario functions include Patent Documents 4 to 9 and Non-Patent Documents 11 to 14.

Patent Document 7 discloses a method of automatically extracting potential bug syntax of a conventional program from the source of the conventional program using a scenario function.

US Patent No. 6,532,586 Patent No. 3133343 European Patent No. 0947916 specification Patent No. 5992079 Patent No. 6086977 US Patent No. 10235522 Patent No. 6917072 Patent No. 6719798 International Publication No. 2021/124411

As countermeasures against virus intrusion and cyber-attacks center on external wall methods such as firewalls, if a virus is allowed to infiltrate a user program, information leakage and system hijacking will inevitably occur.

In view of the above, the present invention provides a technology in which a program itself that has been invaded by a virus neutralizes the virus while the program is being executed.

The present invention
to the computer,
A governing program that governs the program using a scenario function when executing processing according to the program,
In each subject vector generated for each statement of the program,
In the first convention, the legitimacy of the subject vector is judged,
In the second convention, set the command statement whose left side is tentatively established data, and turn on a second flag that is a flag of the second convention;
In the third convention, it is determined whether all data on the right side related to the left side of the second convention is legitimate,
In the fourth regulation, only if all the data is determined to be legitimate in the judgment in the third regulation, the data on the left side of the second regulation is transferred to the fourth storage area, which is the official storage area of the fourth regulation, and Save it in each of the fourth copy areas that are sub-storage areas of the terms,
In the fifth convention, if at least one data is determined to be unorthodox in the determination in the third convention, the total number of subject vectors whose data is stored in the fourth storage area among the subject vectors on palette 4 Based on the number of establishments, select either restart or stop of the subject vector,
In the sixth rule, when recurrence is selected in the fifth rule, the subject vector is instructed to recur, and the sixth flag, which is the flag of the sixth rule, is turned on;
In the seventh convention, when stop is selected in the fifth convention, instructs to stop the subject vector and turns on the seventh flag, which is the flag of the seventh convention,
In the first agreement,
If the second flag is on and the data stored in the fourth storage area and the fourth copy area of the subject vector match, the process is terminated after determining that the subject vector is legitimate;
If the seventh flag is on, terminate the process after initializing the fourth storage area and fourth copy area of the subject vector,
If the sixth flag is on, the process proceeds to the second convention after initializing the fourth storage area, fourth copy area, second flag, and sixth flag of the subject vector,
If the second flag is on and the data stored in the fourth storage area and the fourth copy area of the subject vector do not match, 1 is subtracted from the number of subject realizations, and the fourth storage area of the subject vector is A governing program is provided for advancing processing to the second rule after initializing the area, the fourth copy area, and the second flag.

A diagram showing how the program synchronization algorithm is governed by scenario functions. A diagram showing the structure of a vector.

A scenario function is a definition expression that expresses the structure of command statements used in a program. The definition formula of the scenario function is shown below.

SG=Φ0 [Φ4{L4}, {W4}, T4, E41, E42] + Φ2 [{R2}, {L2}, T2] + Φ3 [{L3}, T31, T32, T33]
however,
SG: Solution of scenario function (subject genealogy)
Φ0: Synchronous function Φ4: Coordinate function 4
Φ2: Coordinate function 2
Φ3: Coordinate function 3
Palette 4 of coordinate function 4: [{L4}, {W4}, T4, E41, E42]
Palette 2 of coordinate function 2: [{R2}, {L2}, T2]
Palette 3 of coordinate function 3: [{L3}, T31, T32, T33]
Subject vector (5 types): L4, W4, L2, R2, L3
Control vector (7 types): E41, E42, T4, T2, T31, T32, T33
It is.

The details of this definition formula are described in Non-Patent Document 12 (``Overview of Scenario Function'') and are well known, so the explanation thereof will be omitted.

FIG. 1 is a diagram showing the mechanism of a synchronization algorithm for a program governed by a scenario function (hereinafter referred to as a "scenario function program"). After activation, the synchronization function executes the coordinate function 4 and the vector on the palette 4. The coordinate function sequentially executes the vectors on the palette. Palette processing ends when the data of all vectors on the palette are established. If the fourth storage area of E41 is on, the synchronization function starts the system termination program, and the processing of the scenario function being executed is terminated.

Note that the time of palette 4 corresponds to the present, the time of palette 2 corresponds to the past, and the time of palette 3 corresponds to the future.

FIG. 2 is a diagram showing the structure of a vector (subject vector or control vector). A subject vector is generated for each statement included in the program. Each subject vector is composed of seven rules (1st rule to 7th rule), and serves to ensure the legitimacy of data establishment.

The processing executed under each of the seven rules will be explained by taking as an example the case where the following sample program is governed by a scenario function.

(sample program)
001 G=10
002 L1 READ F1(R,F)
003 F=RF
004 IF F<0
005 CLOSE F1
006 B=GF

The imperative statement on line 001 is a fixed value statement (or fixed statement), and a subject vector L2 is generated on palette 2 regarding this imperative statement.
The imperative sentence on line 002 is an input sentence, and a subject vector R2 is generated on palette 2 regarding this imperative sentence.
The imperative statement on line 003 is an assignment statement (or a call statement), and a subject vector L4 is generated on the palette 4 regarding this imperative statement.
The imperative statement on line 004 is a conditional statement, and a subject vector L3 is generated on the palette 3 regarding this imperative statement.
The imperative statement on line 006 is an assignment statement (or a call statement), and a subject vector L4 is generated on the palette 4 regarding this imperative statement.

The processing executed in each of the seven rules is as follows. Note that, as an example, values in the subject vector generated for the imperative statement on line 006 are shown in parentheses.

First convention: Judge the legitimacy of the subject vector (for example, L4#B) (judge at exits 2, 3, and 4)
2nd convention: Set a command statement (for example, B=GF) whose left side (for example, B) is tentatively established data. 3rd convention: Set all the right-hand side related to the left-hand side (for example, B) of the 2nd convention. Determine whether the data (for example, G, F) is legitimate. Fourth rule: Only if all data is determined to be legitimate in the judgment in the third rule, the data on the left side of the second rule (B) is saved in the fourth storage area, which is the storage area of the fourth convention.Fifth convention: If at least one data (for example, at least one of G and F) is determined to be unorthodox in the determination according to the third convention, the palette 4 Based on the number of subject realizations, which is the total number of subject vectors whose data is saved in the fourth storage area among the subject vectors above, select either restart or stop of this subject vector (i.e., the fourth subject vector in the same coordinate period). (Determine the possibility of establishing a storage area)
6th rule: If recurrence is selected in the 5th rule (that is, if it is determined that there is a possibility of the formation of the 4th storage area in the same coordinate period), instruct the recurrence of this subject vector. 7th rule: If stop is selected in the 5th convention (that is, if it is determined that there is no possibility of establishing the fourth storage area in the same coordinate period), instruct the stop of the subject vector.

Note that the imperative statement set in the second convention is L4 (assignment statement, call statement), L2 (fixed value statement, fixed statement), or R2 (input statement). L3 (conditional statement) is defined by the third convention. Further, W4 (output sentence) is defined by the fourth convention.

Flags are provided for the second, sixth, and seventh rules, and when the processing for those rules is executed, the flags are set to on. The flag of the second convention is called a second flag, the flag of the sixth convention is called a sixth flag, and the flag of the seventh convention is called a seventh flag. Vectors ensure the legitimacy of execution based on these flags.

Then, in the first convention, the following processing is performed.
If the second flag is on and it is determined that this subject vector is legitimate, the process ends. (Exit 2 → Exit 1)
If the seventh flag is on, the process ends after initializing the fourth storage area for this subject vector. (Exit 4 → Exit 1)
If the sixth flag is on, the process proceeds to the second convention after initializing the fourth storage area, second flag, and sixth flag of this subject vector. (Exit 3)
If the second flag is on and it is determined that this subject vector is not legitimate, 1 is subtracted from the number of subject realizations, and the process is performed after initializing the fourth storage area of this subject vector and the second flag. Proceed to the second convention. (Exit 2)

Note that if it is confirmed that all subject vectors on the palette 4 end at exit 2 or exit 4, the process moves from coordinate function 4 to coordinate function 2.

In the conventional scenario function, the legitimacy of the subject vector in the first convention is determined by executing a program represented by the model below (hereinafter referred to as "legitimacy determination program").

(Model of VWA (L4, A) logical combination program)
001 START.
002 Second flag contamination observation:
0021 Extract the (2, 3, 4) digits of the second flag.
0022 XOR the (2, 3, 4) digits of the second flag and the corresponding flag constant (0, 0, 0).
00221 If ZERO, the second flag is not contaminated.
GO TO Contamination observation of the 6th flag.
00222 If NOT ZERO, the second flag is contaminated.
GO TO L4, initialize A.
003 Contamination observation of the 6th flag:
0031 Extract the (2, 3, 4) digits of the 6th flag.
0032 XOR the (2, 3, 4) digits of the 6th flag and the corresponding flag constant (0, 0, 0).
00321 If ZERO, the 6th flag is not contaminated.
GO TO Contamination observation of the 7th flag.
00322 If NOT ZERO, the 6th flag is contaminated.
GO TO L4, initialize A.
004 Contamination observation of the 7th flag:
0041 Extract the (2, 3, 4) digits of the 7th flag.
0042 XOR the (2, 3, 4) digits of the 7th flag and the corresponding flag constant (0, 0, 0)
do.
00421 If ZERO, the 7th flag is not contaminated.
RETURN.
00422 If NOT ZERO, the 7th flag is contaminated.
GO TO L4, initialize A.
005 Initialization of L4, A 0051 Initialize the fourth area.
0052 Turn off the second flag.
0053 Turn on the 6th flag.
0054 Turn off the seventh flag.
006 Set the subject establishment number counter to minus 1.
007 RETURN.

On the other hand, in the scenario function according to the present invention, the processing of the fourth rule and the first rule is changed as described below, and the above-mentioned legitimacy determination program is not executed.

(Fourth Terms)
Only when all the data is determined to be legitimate in the judgment in the third rule, the data on the left side of the second rule is saved in the fourth storage area, which is the official storage area of the fourth rule, in the fourth rule. In addition to this, the same data is also stored in a fourth copy area (a storage area different from the fourth storage area) which is a sub-storage area according to the fourth rule.

(First Terms)
Only when the data stored in the fourth storage area and the fourth copy area of this subject vector match, it is determined that this subject vector is legitimate.

Therefore, in the scenario function according to the present invention, the following processing is performed in the first convention.

If the second flag is on and the data stored in the fourth storage area and the fourth copy area of this subject vector match, the process is terminated after determining that this subject vector is legitimate. . (Exit 2 → Exit 1)
If the seventh flag is on, the process ends after initializing the fourth storage area and fourth copy area of this subject vector. (Exit 4 → Exit 1)
If the sixth flag is on, the process proceeds to the second rule after initializing the fourth storage area, fourth copy area, second flag, and sixth flag of this subject vector. (Exit 3)
If the second flag is on and the data stored in the fourth storage area and the fourth copy area of this subject vector do not match, 1 is subtracted from the number of subject realizations, and the data stored in the fourth storage area of this subject vector is After initializing the area, the fourth copy area, and the second flag, the process proceeds to the second rule. (Exit 2)

As described above, in the scenario function according to the present invention, instead of executing the legitimacy determination program (VWA), the data stored in the fourth storage area and the data stored in the fourth copy area are By determining whether they all match, the presence or absence of virus contamination is determined.

Below, some program models of the subject vector of the scenario function according to the present invention are illustrated. However, "XXX" described in the following program model is not a code, but indicates the position where the following two lines that call the legitimacy determination program are written in the conventional scenario function. Furthermore, the code marked with "*" at the beginning of the line is a code that is not present in the conventional scenario function, but is added in the scenario function according to the present invention. Further, as described above, the processing according to the first convention executed in the following program model is different from the processing according to the first convention in the conventional scenario function.

002 NOP.
003 CALL VWA( , ).

(L4, A vector model)
An example command statement for this vector is "A=B+C+512". The imperative sentence governed by L4 and A is placed in the second convention by vector predication. It is assumed that L4,A does not include L3,A. If L4,A has L3,A, the legitimacy determination of L3,A will also be added to this third rule. A program model for this case is shown below.

001 START.
XXX
004 First convention: Use the legitimacy of L4, A to determine whether to proceed to the second convention or RETURN.
005 Second rule.
0051 MOVE 1 TO 2nd flag.
0052 A=B+C+512.
006 Third rule: Determining the legitimacy of A (legitimacy of the fourth conservation area).
0061 Is the fourth conserved region of L4,B legitimate?
00611 If it's orthodox, GOTO 0062.
00612 If it is not orthodox, GOTO 5th rule.
0062 Is the fourth conserved region of L4, C legitimate?
00621 If it is orthodox, GOTO 4th regulation.
00622 If it is not orthodox, GOTO 5th rule.
007 Fourth rule.
0071 MOVE 0 TO L4, 6th flag of A.
0072 MOVE A TO L4, 4th storage area of A.
*0073 MOVE A TO L4, 4th copy area of A.
0074 ADD 1 TO Subject establishment number counter.
008 RETURN.
009 Fifth rule: Determination as soon as A of L4, A is established in the same coordinate period.
0091 MOVE 0 TO 6th flag.
0092 If (NS1=NS5), proceed to the seventh convention.
0093 If (NS1>NS5), proceed to the 6th convention.
010 6th Regulation: L4, A's declaration of request for reinstatement.
0101 Initialize the fourth storage area of L4, A.
0102 MOVE 1 TO 6th flag.
0103 MOVE 0 TO 2nd flag.
0104 RETURN.
011 Seventh rule: L4, A's declaration of suspension of restart.
0111 MOVE 1 TO 7th flag.
0112 MOVE 0 TO 2nd flag.
0113 RETURN.

(L3, D vector model)
An example command sentence for this vector is "IF X<Y (true)". The imperative sentences governed by L3 and D are placed in the third convention by vector predication. A program model for this case is shown below.
001 START.
XXX
004 First convention: Use the legitimacy of L3 and D to determine whether to proceed to the second convention or RETURN.
005 Second rule.
0051 MOVE 1 TO 2nd flag.
0052 NOP.
006 Third rule: Determination of legitimacy of IF X<Y.
0061 Is the fourth conserved region of L4,X legitimate?
00611 If it's orthodox, GOTO 0062.
00612 If it is not orthodox, GOTO 5th rule.
0062 Is the fourth conservation region of L4, Y legitimate?
00621 If it's orthodox, GOTO 0063.
00622 If it is not orthodox, GOTO 5th rule.
0063 IF X<Y?
00631 If it is orthodox, GOTO 4th regulation.
00632 If it is not orthodox, GOTO 5th rule.
007 Fourth rule.
0071 MOVE 0 TO L3, 6th flag of D.
0072 MOVE 1 TO L3, 4th storage area of D.
*0073 MOVE 1 TO L3, 4th copy area of D.
0074 ADD 1 TO Subject establishment number counter.
008 RETURN.
009 Fifth rule: Determination as soon as D of L3 and D is established in the same coordinate period.
0091 MOVE 0 TO 6th flag.
0092 If (NS1=NS5), proceed to the seventh convention.
0093 If (NS1>NS5), proceed to the 6th convention.
010 6th Regulation: Declaration of L3 and D's request for reinstatement.
0101 Initialize the fourth storage area of L3 and D.
0102 MOVE 1 TO 6th flag.
0103 MOVE 0 TO 2nd flag.
0104 RETURN.
011 Seventh rule: L3, D's declaration of suspension of restart.
0111 MOVE 1 TO 7th flag.
0112 MOVE 0 TO 2nd flag.
0113 RETURN.

(L2, C vector model)
Assume that an example command sentence for this vector is "C=11". The imperative sentence governed by "L2, C" is placed in the second convention by the vector predication method. It is assumed that L2,C does not include L3,C. If L2,C has L3,C, the legitimacy determination of L3,C will also be added to this third rule. In that case, the fifth, sixth, and seventh regulations will occur. A program model for this case is shown below.
001 START.
XXX
004 First convention: Use the legitimacy of L2 and C to determine whether to proceed to the second convention or RETURN.
005 Second rule.
0051 MOVE 1 TO 2nd flag.
0052 C=11.
006 Third convention: Determining the legitimacy of C where C=11. NOP.
007 4th convention 0071 MOVE 0 TO L2, 6th flag of C.
0072 MOVE C TO L2, 4th storage area of C.
*0073 MOVE C TO L2, 4th copy area of C.
0074 ADD 1 TO Subject establishment number counter.
008 RETURN.
009 Fifth rule: NOP.
010 6th rule: NOP.
011 Seventh rule: NOP.

(W4, URIAGE vector model)
An example command sentence for this vector is "WRITE URIAGE, DB11". This is a command statement that writes URIAGE to the external storage area "DB11". The subject of this command statement is established in DB11. The legitimacy of DB11 is unknown. The role of this vector is to output the legitimate L4 and URIAGE to the DB11. The imperative statement governed by W4 and URIAGE is placed in the fourth convention by vector predication. In the first and third VWA rules of W4, URIAGE, it is processed by replacing it with L4, URIAGE. It is assumed that this W4, URIAGE does not have L3, URIAGE. If W4, URIAGE includes L3, URIAGE, the legitimacy determination of L3, URIAGE will also be added to this third convention. A program model for this case is shown below.
001 START.
XXX
004 First convention: L4, determines whether to proceed to the second convention or RETURN using the legitimacy of URIAGE.
005 Second rule.
0051 MOVE 1 TO 2nd flag.
0052 NOP.
006 Third rule: Determination of legitimacy of L4, URIAGE.
0061 Is the fourth storage area of L4, URIAGE legitimate?
00611 If it's orthodox, it's GOTO's 4th rule.
00612 If it is not orthodox, GOTO 5th rule.
007 Fourth rule.
0071 MOVE 0 TO W4, 6th flag of URIAGE.
0072 WRITE URIAGE, DB11.
*0073 MOVE 1 TO W4, 4th storage area of URIAGE.
0074 ADD 1 TO Subject establishment number counter.
008 RETURN.
009 Fifth rule: L4, determination as soon as URIAGE of URIAGE is established in the same coordinate period.
0091 MOVE 0 TO 6th flag.
0092 If (NS1=NS5), proceed to the seventh convention.
0093 If (NS1>NS5), proceed to the 6th convention.
010 6th agreement: Declaration of W4, URIAGE's request for reinstatement.
0101 L4, URIAGE. Initialize the fourth storage area of .
0102 MOVE 1 TO 6th flag.
0103 MOVE 0 TO 2nd flag.
0104 RETURN.
011 7th agreement: Declaration of suspension of restart of W4, URIAGE.
0111 MOVE 1 TO 7th flag.
0112 MOVE 0 TO 2nd flag.
0113 RETURN.

(R2 DB11 vector model)
An example command statement for this vector is "READ DB11, total". This is a command statement to move the external storage area "DB11" to the total. The subject of this imperative sentence is aggregation. The role of this vector is to establish a legitimate aggregation. The command statement governed by the R2 DB11 is placed in the second convention using the vector predication method. In the VWA, first and third rules of the R2 DB 11, it is processed by replacing it with L4, aggregation. It is assumed that this R2 DB11 does not have L3 and URIAGE. If L3 and DB11 exist in R2 DB11, the legitimacy determination of L3 and DB11 will also be added to this third rule. A program model for this case is shown below.
001 START.
XXX
004 First rule: L4, determines whether to proceed to the second rule or RETURN using the legitimacy of the aggregation.
005 Second rule.
0051 MOVE 1 TO 2nd flag.
0052 READ DB11, aggregation.
006 Third rule: L4, determination of legitimacy of aggregation.
0061 L4, is the fourth storage area of the tally legitimate?
00611 If it's orthodox, GOTO 007.
00612 If it is not orthodox, GOTO 5th rule.
007 Fourth rule.
0071 MOVE 0 TO 6th flag.
0072 MOVE Total TO READ DB11, 4th storage area for total.
*0073 MOVE Tally TO DB11, 4th copy area of Tally.
0074 ADD 1 TO Subject establishment number counter.
008 RETURN.
009 Fifth rule: L4, determination as soon as the totals of the totals are established in the same coordinate period.
0091 MOVE 0 TO 6th flag.
0092 If (NS1=NS5), proceed to the seventh convention.
0093 If (NS1>NS5), proceed to the 6th convention.
010 6th regulation: READ DB11, declaration of request for restart of aggregation.
0101 READ DB11, initialize the fourth storage area for totals.
0102 MOVE 1 TO 6th flag.
0103 MOVE 0 TO 2nd flag.
0104 RETURN.
011 7th regulation: READ DB11, declaration of suspension of restart of aggregation.
0111 MOVE 1 TO 7th flag.
0112 MOVE 0 TO 2nd flag.
0113 RETURN.

(Logical combination model of E41, P4 program)
E41 and P4 notify that this program is in an end state. To make E41 and P4 easier to understand, they are shown in a logical combination type, but since E41 has its own data area (fourth storage area), it is actually programmed in a vector structure. A program model for this case is shown below.
001 START.
002 Take NS1 from the subject realization number stack.
003 Take NS5 from the subject realization number stack.
004 (NS1) = (NS5) determination.
0041 If YES, GO TO 005.
0042 If NO, GO TO 006.
005 MOVE 1 TO E41 4th storage area.
006 RETURN.

(Logical combination model of E42, P4 program)
E42 and P4 notify the onset of a logical contradiction that occurs in this program due to instruction contamination that does not lead to instruction destruction. To make E42 and P4 easier to understand, they are shown in a logical combination type, but since E42 has its own data area (fourth storage area), it is actually programmed in a vector structure. A program model for this case is shown below.
001 START.
002 Take NS1 from the subject realization number stack.
003 Take NS5 from the subject realization number stack.
004 Determination of (NS1) < (NS5). : The logical contradiction that occurs in this program can be understood from this relationship.
0041 If YES, GO TO 005.
0042 If NO, GO TO 006.
005 MOVE 1 TO E42 4th storage area.
006 RETURN.

(Logical combination model of T4 and P4 programs)
T4 and P4 notify that the conditions for switching coordinate function 4 to coordinate function 2 have been met in the fourth storage area. To make T4 and P4 easier to understand, they are shown in a logical combination type, but since T4 has its own data area (fourth storage area), it is actually programmed in a vector structure. A program model for this case is shown below.
001 START.
002 Criticality determination of P4.
0021 Creation of the 6th flag string of palette 4.
0022 Creation of the 6th flag column constant of palette 4.
003 XOR of the 6th flag string of palette 4 and the 6th flag string constant.
0031 If XOR is ZERO, GOTO 004.
0032 If XOR is NOT ZERO, GOTO 005.
004 MOVE 1 TO T4 4th storage area.
005 RETURN.

(Logical combination model of T2 and P2 programs)
T2 and P2 notify that the conditions for switching coordinate function 2 to coordinate function 3 have been met in the fourth storage area. To make T2 and P2 easier to understand, they are shown in a logical combination type, but since T2 has its own data area (fourth storage area), it is actually programmed in a vector structure. A program model for this case is shown below.
001 START.
002 Criticality determination of P2:
0021 Creation of the 6th flag string of palette 2.
0022 Creation of the 6th flag string constant of palette 2.
003 XOR of the 6th flag string of palette 2 and the 6th flag string constant.
0031 If XOR is ZERO, GOTO 004.
0032 If XOR is NOT ZERO, GOTO 005.
004 MOVE 1 TO T4 4th storage area.
005 RETURN.

(Logical combination model of T31, P3 program)
The "4th storage area of T31" notifies you that the conditions for switching coordinate function 3 to your own coordinate function 4 are in place. To make T31 and P3 easier to understand, they are shown in a logical combination type, but since T31 has its own data area (fourth storage area), it is actually programmed in a vector structure. The initial value of the fourth storage area of T31 is on. A program model for this case is shown below.
001 START.
002 Criticality determination of P3:
0021 Creation of the 6th flag string of palette 3.
0022 Creation of the 6th flag string constant for palette 3.
003 XOR of the 6th flag string of palette 3 and the 6th flag string constant (first condition).
0031 If XOR is ZERO, GOTO 004.
0032 If XOR is NOT ZERO, GOTO 006.
004 Judgment made using a subject distribution table.
0041 Are all subjects of this program inherent in this program (second condition)?
0042 If YES, GOTO 005.
0043 If NO, GOTO 006.
005 MOVE 1 TO T31's 4th storage area.
006 RETURN.

(Logical combination model of T32, P3 program)
The "4th storage area of T32" announces that the conditions for switching coordinate function 3 to coordinate function 4 of this program (2, 1), which is lower than this program (1, 1) in the rank structure, are met. . To make T32 and P3 easier to understand, they are shown as logically connected types, but since T32 has its own data area (fourth storage area), it is actually programmed in a vector structure. A program model for this case is shown below.
001 START.
002 Criticality determination of P3:
0021 Creation of the 6th flag string of palette 3.
0022 Creation of the 6th flag string constant for palette 3.
003 XOR of the 6th flag string of palette 3 and the 6th flag string constant (first condition).
0031 If XOR is ZERO, GOTO 004.
0032 If XOR is NOT ZERO, GOTO 006.
004 Judgment made using a subject distribution table.
0041 Does the subject of this program also exist in the adjacent program (second condition)?
0042 If YES, GOTO 005.
0043 If NO, GOTO 006.
005 MOVE 1 TO T32's 4th storage area.
006 RETURN.

(Logical combination model of T33, P3 program)
The "fourth storage area of T33" notifies that the conditions for switching the coordinate function 3 to the coordinate function 3 of the program at the top of the program (1, 1) in the rank structure are met. To make T33 and P3 easier to understand, they are shown in a logical combination type, but since T33 has its own data area (fourth storage area), it is actually programmed in a vector structure. A program model for this case is shown below.
001 START.
002 Criticality determination of P3:
0021 Creation of the 6th flag string of palette 3.
0022 Creation of the 6th flag string constant for palette 3.
003 XOR of the 6th flag string of palette 3 and the 6th flag string constant (first condition).
0031 If XOR is ZERO, GOTO 004.
0032 If XOR is NOT ZERO, GOTO 006.
004 Judgment made using a subject distribution table.
0041 Does the subject of this program also exist in the adjacent program (second condition)?
0042 If YES, GOTO 005.
0043 If NO, GOTO 006.
005 MOVE 1 TO T32's 4th storage area.
006 RETURN.

(Logical combination model of coordinate function 4 program)
The logogram model of coordinate function 4 is shown below.
001 START.
002 Specify the vector of loading order 1 (i=1) of pallet 4. :Start of coordinate cycle 4 003 Activates the vector of the specified loading order (i).
004 This is the RETURN point of the activated vector.
005 Determination of presence or absence of command destruction signal (OS).
0051 If present, SEP starts. : Stop execution of this program 0052 Without GO TO 006.
006 Specify the next vector to activate (i=i+1).
007 Does (i) exceed the number of loaded vectors (N4) on pallet 4?
If it exceeds 0071, GO TO 008.
If it does not exceed 0072, GO TO 003.
008 Judgment of success or failure of criticality of pallet 4. : Use on/off of the fourth storage area of T4 0081 If it is off, GO TO 002.
0082 If on, GO TO 009. : End of coordinate cycle 4 009 Determine whether logical contradiction has occurred: Use of E42's 4th storage area on/off.
0091 When turned on, SLP starts. : Execution stop processing of this program 0092 OFF, GO TO 010.
: There is no logical contradiction in this program 010 Perform the following processing to return to the synchronization function 0101 Initialize all vectors of the 7th flag on of palette 4.
0102 Stack update program startup.
011 RETURN. to synchronous function.

(Logical combination model of coordinate function 2 program)
The logogram model of coordinate function 2 is shown below.
001 START.
002 Specify the vector of loading order 1 (i=1) of pallet 2. :Start of coordinate cycle 2 003 Activates the vector of the specified loading order (i).
004 This is the RETURN point of the activated vector.
005 Determination of presence or absence of command destruction signal (OS).
0051 If present, SEP starts. : Stop execution of this program 0052 Without GO TO 006.
006 Specify the next vector to activate (i=i+1).
007 Does (i) exceed the number of loaded vectors (N2) on pallet 2?
If it exceeds 0071, GO TO 008.
If it does not exceed 0072, GO TO 003.
008 Judgment of success or failure of criticality of pallet 2. : Use on/off of the fourth storage area of T2 0081 If it is off, GO TO 002.
0082 If on, GO TO 009. : End of coordinate cycle 2 009 Determine whether logical contradiction has occurred: Use E42's fourth storage area on/off.
0091 When turned on, SLP starts. : Execution stop processing of this program 0092 OFF, GO TO 010.
: There is no logical contradiction in this program 010 Perform the following processing to return to the synchronization function 0101 Initialize all vectors of the 7th flag on of palette 2.
011 RETURN. to synchronous function.

(Logical combination model of coordinate function 3 program)
A program model of coordinate function 3 is shown below.
001 START.
002 Specify the vector of loading order 1 (i=1) of pallet 3. :Start of coordinate cycle 3 003 Activates the vector of the specified loading order (i).
004 This is the RETURN point of the activated vector.
005 Determination of presence or absence of command destruction signal (OS).
0051 If present, SEP starts. : Stop execution of this program 0052 Without GO TO 006.
006 Specify the next vector to activate (i=i+1).
007 Does (i) exceed the number of loaded vectors (N3) on pallet 2?
If it exceeds 0071, GO TO 008.
If it does not exceed 0072, GO TO 003.
008 Judgment of success or failure of criticality of pallet 3. : Use on/off of the fourth storage area of T2 0081 If it is off, GO TO 002.
0082 If on, GO TO 009. : End of coordinate cycle 5 009 Determine whether logical contradiction has occurred: Use of 4th storage area ON/OFF of E42.
0091 When turned on, SLP starts. : Execution stop processing of this program 0092 OFF, GO TO 010.
: There is no logical contradiction in this program 010 Perform the following processing to return to the synchronization function 0101 Initialize all vectors of the 7th flag on of palette 3.
011 RETURN to synchronous function

(Logical combination model of synchronous function program)
001 START.
002 Stack initialization program startup.
003 Termination determination of this program. : Use the on/off of the fourth storage area of E41 0031 If it is on, GO TO 004. : This program termination process 0032 If off, GO TO 005. : Start of this program 004 SEP start. :System Ending Program (this program ending program)
005 T31 Fourth storage area on/off determination. : Activation of own coordinate function 4 0051 If on. T31 Turn off the fourth storage area.
0052 Start your own coordinate function 4.
0053 If it is off, GO TO 006.
006 T32 4th storage area on/off determination. :Start nearest neighbor lower coordinate function 40061 If on. T32 Turn off the fourth storage area.
0062 Start nearest neighbor lower coordinate function 4.
0063 If it is off, GO TO 007. :Off if there is no nearest neighbor lower coordinate function 4.
007 T33 On/off determination of the fourth storage area. : Activation of top coordinate function 3 0071 If on. T33 Turn off the fourth storage area.
0072 Start top coordinate function 3.
0073 If it is off, GO TO 008. :Off if there is no top coordinate function 3.
008 On/off determination of T4 fourth storage area. : Activation of own coordinate function 2 0081 If on. Turn off the T4 fourth storage area.
0082 Start your own coordinate function 2.
0083 If it is off, GO TO 009. :Start your own coordinate function 3.
009 On/off determination of T2 fourth storage area. : Activation of own coordinate function 3 0091 If on. Turn off the T2 fourth storage area.
0092 Start your own coordinate function 3.
0093 If it is off, GO TO 010.
010 T32 4th storage area on/off determination. : Activation of coordinate function 4 below the neighbor 0101 If on. T32 Turn off the fourth storage area.
0102 Activate the coordinate function 4 below the neighbor.
0103 If off, GO TO 011.
011 T33 On/off determination of the fourth storage area. : Activation of top coordinate function 3 0111 If on. T33 Turn off the fourth storage area.
0112 Start top coordinate function 3.
0113 If off, GO TO 0052.
012 END.

(Vector model of E41, P4 program)
Replace the logical combination model of control vectors with two example vectors. The method of replacing other control vectors is the same. The prototype for converting the control vector of a logical combination model into a vector model is L4. It is A. The imperative of this vector is to take the stats. Statements that take the stack are placed in the second convention. E41 and P4 do not have L3. Next, a program model is shown.
001 START.
XXX
004 First convention: Use the legitimacy of E41 and P4 to determine whether to proceed to the second convention or RETURN.
005 Second convention 0051 MOVE 1 TO 2nd flag.
0052 Take NS1 from the subject realization number stack.
0053 Take NS5 from the subject realization number stack.
006 Third rule: Determination of (NS1) = (NS5).
0061 If YES, GOTO 4th rule.
0062 If NO, GOTO 5th rule.
007 Fourth rule.
0071 MOVE 0 TO E41, 6th flag of P4.
0072 MOVE A TO E41, 4th storage area of P4.
*0073 MOVE A TO E41, 4th copy area of P4.
0074 ADD 1 TO Subject establishment number counter.
008 RETURN.
009 Fifth rule: Determination as soon as E41 and P4 are established in the same coordinate period.
0091 MOVE 0 TO 6th flag.
0092 If (NS1=NS5), GOTO 7th rule.
0093 If (NS1>NS5), GOTO 6th rule.
010 6th Regulation: E41, P4's declaration of request for reinstatement.
0101 Initialize the fourth storage area of E41 and P4.
0102 MOVE 1 TO 6th flag.
0103 MOVE 0 TO 2nd flag.
0104 RETURN.
011 7th regulation: E41, P4 restart suspension declaration.
0111 MOVE 1 TO 7th flag.
0112 MOVE 0 TO 2nd flag.
0113 RETURN.

(T33, P3 program vector model)
The imperative of this vector is to take the stats. The command statement that takes statistics is placed in the second convention. T33 and P3 do not have L3. Next, a program model is shown.
001 START.
XXX
004 First convention: Use the legitimacy of T33 and P3 to determine whether to proceed to the second convention or RETURN.
005 Second rule Preparation for determining whether T33 and P3 hold true:
0051 MOVE 1 TO 2nd flag.
0052 Creation of the 6th flag string for palette 3.
0053 Creation of the 6th flag string constant for palette 3.
006 Third rule: Determining whether T33 and P3 hold true.
0061 Criticality determination of P3.
00611 XOR of the 6th flag string of palette 3 and the 6th flag string constant (first condition).
00612 If XOR is ZERO, GOTO 0062.
00613 If XOR is NOT ZERO, the fifth rule.
0062 Judgment made using a subject distribution table.
00621 Does the subject also exist in the program above (second condition)?
00622 If YES, GOTO 4th rule.
00623 If NO, GOTO RETURN.
007 Fourth rule.
0071 MOVE 0 TO T33, 6th flag of P3.
0072 MOVE A TO T33, 4th storage area of P3.
*0073 MOVE A TO T33, 4th copy area of P3.
0074 ADD 1 TO Subject establishment number counter.
008 RETURN.
009 Fifth rule: Determination as soon as the criticality of P3 is established in the same coordinate period.
0091 MOVE 0 TO 6th flag.
0092 If (NS1>NS5), GOTO 6th rule.
0093 If (NS1>NS5), GOTO 7th rule.
010 6th Regulation: E41, P4's declaration of request for reinstatement.
0101 Initialize the fourth storage area of T33 and P3.
0102 MOVE 1 TO 6th flag.
0103 MOVE 0 TO 2nd flag.
0104 RETURN.
011 7th regulation: Declaration of suspension of restart of T33 and P3.
0111 MOVE 1 TO 7th flag.
0112 MOVE 0 TO 2nd flag.
0113 RETURN.

(Logical combination model of stack update program)
001 START.
002 If the subject realization counter is zero, initialize the stack: start the stack initialization program 003 RETURN.
004 If the subject realization number counter is not zero and NS1, 2, 3, and 4 are zero, 005 Overwrite the subject realization number counter to NS1.
006 RETURN.
007 If the subject realization number counter is not zero and NS2, 3, and 4 are zero, 008 Overwrite NS1 to NS2.
009 Overwrite the subject formation number counter to NS1.
010 RETURN.
011 If the subject realization number counter is not zero and NS3 and 4 are zero, 012 Overwrite NS1 to NS2.
013 Overwrite NS2 to NS3.
014 Overwrite the subject formation number counter to NS1.
015 RETURN.
016 If the subject formation counter is not zero and NS4 is zero, 017 Overwrite NS1 to NS2.
018 Overwrite NS2 to NS3.
019 Overwrite NS3 to NS4.
020 Overwrite the subject formation number counter to NS1.
021 RETURN.
022 If the subject realization number counter is not zero and all NSs are not zero, 023 Overwrite NS1 to NS2.
024 Overwrite NS2 to NS3.
025 Overwrite NS3 to NS4.
026 Overwrite NS4 to NS5.
027 Overwrite the subject realization number counter to NS1.
028 RETURN.

(Logical combination model of stack initialization program)
This program is started at the start point of the synchronization cycle (CALL) for the fifth rule of subject vectors (NS1>NS5) and control vectors E41 (NS1=NS5) and E42 (NS1<NS5) that use this stack information. do. Next, a program model is shown.
001 START.
002 Set 1 to NS5.
003 Cleared NS4 to zero.
004 Cleared NS3 to zero.
005 Cleared NS2 to zero.
006 Cleared NS1 to zero.
007 Clear the subject formation counter to zero.
008 RETURN.

The above is an example of the program model.

[Reference information]
The following is information that will assist in understanding the scenario function according to the invention described above.

(About the scenario function)
A scenario function is a unique synchronous program definition structure that can capture the largest semantic space as a subject genealogy during execution. This means that the structural formula of this unique scenario function can capture the dynamic algorithm of any computer system. The entire algorithm created by this scenario function at runtime constitutes a complete program.

In other words, a scenario function is a relational expression that autonomously creates the largest semantic space (SG) during execution. This relational expression is the principle mechanism of the world's first synchronous program, in which the LYEE theory establishes a mechanism for autonomously developing a complete algorithm during execution. As a result, the scenario function dynamic algorithm provides an innovative program technology that autonomously solves all unsolved problems of incomplete programs. This dream-like ideal program becomes a means to solve asynchronous (discontinuous) problems that reflect the incomplete person's thinking system (CPS), which cannot be overcome in the fields of science and mathematics. The synchronous program is the proof theory.

The tree structure of nouns that is automatically generated according to the third rule of subject vectors cannot be established unless all of its constituent nouns are valid. Using the principle of establishment of this tree structure, bug syntax problems, virus problems, and cyber program problems can be autonomously grasped and solved autonomously.

Bug syntax problems, virus problems, and cyber program problems cannot be grasped or solved autonomously in any way in an asynchronous program. These problems can only be solved by dynamic algorithms of scenario functions. In addition, dealing with such misdeeds can only be achieved using a scenario function dynamic algorithm.

(LYEE space TBL and scenario function)
The LYEE space TBL is a synchronization table used by people to understand the synchronization relationship of vectors.

LYEE space TBL can be created if (1) the person has the ability to capture all nouns belonging to an asynchronous system, and (2) has also acquired the theoretical knowledge of 12 types of vectors (semantic analysis diagram of vectors). I can do it.

By the way, in the development of a system with 180,000 nouns conducted 20 years ago by a class of about 150 newcomers who participated in the system development under the guidance of the inventor of the present invention, this vector determination work was carried out per person per day. Approximately 20 synchronizations are being performed. At that time, this development method was still called the LYEE theory. Although it has not reached the level of a scenario function, the development period, which was said to be 20 months, was completed in about 10 months and delivered. This system was called 408K and was being developed by large Japanese companies as a national policy at the time.

If we find the LYEE space TBL (synchronization table) and find a dedicated program that automatically edits the scenario function from this synchronization table, the entire algorithm that the obtained scenario function creates at runtime will be autonomous in its completeness. to be established.

(About vector definition rules)
The processing of the seven rules included in the vectors shown in FIG. 2 will be supplementarily explained below regarding the subject vector L4_A.

Note that the vectors leading to exit 1 and exit 2 will not be recursed unless they are reset.

<First Terms>
If the fourth storage area of L4_A is not empty, the value of the fourth storage area of L4_A matches the value of the fourth copy area of L4_A, and the second flag is on, L4_A is determined to be authentic. Then go to Exit 1 (Exit 2 → Exit 1).
If the fourth storage area is empty and the seventh flag is on, go to exit 1 (exit 4→exit 1).
If it is not legitimate, the contents of the vector are reset (virus reset processing).

<Second Terms>
Define a program element (=instruction statement, for example A=B+C), turn on the second flag, and proceed to the third convention.

<Third Terms>
If the success/failure determination of the variable element of the program element is OK (for example, L3_A is established, and L4_B and L4_C are established), the process advances to the fourth rule; otherwise, the process advances to the fifth rule.

<4th Terms>
Save the value of A in the fourth storage area, save the value of A in the fourth copy area, and go to exit 2.

<Fifth Terms>
If pallet displacement is necessary (for example, L3_A does not hold), the process proceeds to the seventh rule, and if pallet displacement is unnecessary (L4_B or L4_C does not hold), the process proceeds to the sixth rule.
Note that the fifth rule is a future prediction method using a stack (=number of established subjects).

<6th Terms>
Perform the continuation process procedure (restart), turn on the 6th flag, and go to exit 3.

<7th Terms>
Perform the pallet displacement procedure (processing of this subject vector is completed), turn on the seventh flag, and proceed to exit 4.

(About synchronous functions)
The synchronization function is a structure that allows the scenario function to autonomously capture and autonomously eliminate the inhibiting factors inherent in the scenario function.

In the synchronous function, the inhibiting factors inherent in the scenario function can be detected by determining whether the harmonic relationship of the scenario function is disturbed. If the harmonic relationship of the scenario function is disturbed, the vector autonomously initializes the hindrance factor captured by its first rule and neutralizes it.

All algorithms that a scenario function generates at runtime are brought about in a relationship in which all vectors belonging to the scenario function are structurally harmonious. This is fundamentally different from the algorithms that conventional programs provide. Therefore, if a scenario function contains an inhibiting factor (ie, a bug syntax, a virus, a cyber problem) in the present application, the harmonic relationship among all vectors belonging to the scenario function at the time of execution will be disrupted. Since all vectors operate as a processing cycle and repeat it, disturbances in the harmonic relationship are captured by the vectors before the scenario function is exposed to the algorithm that causes bad behavior, and the vectors that capture this can reset the disincentives one after another. be done.

In principle, it is impossible for conventional programs to incorporate inhibiting factors into themselves and neutralize them on their own. The reason is that both are asynchronous programs. Similarly, the OS cannot solve the blocker problem.

On the other hand, in the synchronous world of this application, the inhibiting factor is a relation in which any of the vectors belonging to the synchronous program are inharmonious, which is understood by its inevitable structure, and that vector autonomously resets it.

(Synchronization effect of scenario function)
All vectors belonging to the scenario function are super-strictly harmonized elements that provide synchronization to the scenario function at runtime.

If you feel a sense of harmony in the scenario function being executed, it is when the scenario function eliminates bugs, viruses, and cyber problems, for example.

For example, suppose a virus is able to infiltrate after the synchronization cycle of the scenario function has started. In that case, after passing through the sixth or seventh rule, the virus is reset in the first rule due to the effects of all vectors without reaching execution. That is, the virus does not proceed to exit 2 through the fourth rule due to the harmonization effect of all vectors, does not reach execution, and is eventually reset to the first rule.

Note that the number of processing cycles of the scenario function is determined by the synchronization function and three types of coordinate functions at the time of execution, in that all vectors are piled up freely on three types of pallets.

Claims

to the computer,
A governing program that governs the program using a scenario function when executing processing according to the program,
In each subject vector generated for each statement of the program,
In the first convention, the legitimacy of the subject vector is judged,
In the second convention, set the command statement whose left side is tentatively established data, and turn on a second flag that is a flag of the second convention;
In the third convention, it is determined whether all data on the right side related to the left side of the second convention is legitimate,
In the fourth regulation, only if all the data is determined to be legitimate in the judgment in the third regulation, the data on the left side of the second regulation is transferred to the fourth storage area, which is the official storage area of the fourth regulation, and Save it in each of the fourth copy areas that are sub-storage areas of the terms,
In the fifth convention, if at least one data is determined to be unorthodox in the determination in the third convention, the total number of subject vectors whose data is stored in the fourth storage area among the subject vectors on palette 4 Based on the number of establishments, select either restart or stop of the subject vector,
In the sixth rule, when recurrence is selected in the fifth rule, the subject vector is instructed to recur, and the sixth flag, which is the flag of the sixth rule, is turned on;
In the seventh convention, when stop is selected in the fifth convention, instructs to stop the subject vector and turns on the seventh flag, which is the flag of the seventh convention,
In the first agreement,
If the second flag is on and the data stored in the fourth storage area and the fourth copy area of the subject vector match, the process is terminated after determining that the subject vector is legitimate;
If the seventh flag is on, terminate the process after initializing the fourth storage area and fourth copy area of the subject vector,
If the sixth flag is on, the process proceeds to the second convention after initializing the fourth storage area, fourth copy area, second flag, and sixth flag of the subject vector,
If the second flag is on and the data stored in the fourth storage area and the fourth copy area of the subject vector do not match, 1 is subtracted from the number of subject realizations, and the fourth storage area of the subject vector is Governance program to proceed to the second rule after initializing the area, fourth copy area, and second flag