Abstract: The present invention proposes a method for determining whether or not the legitimacy of an algorithm generated by LCPS during operation is established by generating the super-language context of LCPS from the LCPS to be verified by the generalized method of the present invention without using any verification data, and analyzing it by the generalized method of the present invention. With this method, all bug events that LCPS develops during operation are revealed as bug syntaxes in the generalized method of the present invention. If there is no bug syntax in LCPS, the algorithm generated by LCPS when operating is legitimate. The above-described method may be performed manually or by a computer according to a dedicated program.

Abstract: The present invention proposes a method for determining whether or not the legitimacy of an algorithm generated by LCPS during operation is established by generating the super-language context of LCPS from the LCPS to be verified by the generalized method of the present invention without using any verification data, and analyzing it by the generalized method of the present invention. With this method, all bug events that LCPS develops during operation are revealed as bug syntaxes in the generalized method of the present invention. If there is no bug syntax in LCPS, the algorithm generated by LCPS when operating is legitimate. The above-described method may be performed manually or by a computer according to a dedicated program.

Abstract: Even if a virus invades a program in operation according to the present invention, regardless of the timing and means of invasion and the number of attempts thereof, the present program autonomously and unassistedly detects the virus as contamination of a memory area used by the program and disinfects the contamination for quick recovery in order to continue the normal operation. The present program detects the virus as contamination caused by false information against the intent of the present program. Upon occurrence of contamination, the present program detects the contamination as a predicate inconsistency. However, this scheme is not for detecting an invading virus but is needed as a structural requirement in order for the program to exist as a legitimate program. The present program disinfects the detected contamination using a scheme in accordance with the present invention.

Abstract: Even if a virus invades a program in operation according to the present invention, regardless of the timing and means of invasion and the number of attempts thereof, the present program autonomously and unassistedly detects the virus as contamination of a memory area used by the program and disinfects the contamination for quick recovery in order to continue the normal operation. The present program detects the virus as contamination caused by false information against the intent of the present program. Upon occurrence of contamination, the present program detects the contamination as a predicate inconsistency. However, this scheme is not for detecting an invading virus but is needed as a structural requirement in order for the program to exist as a legitimate program. The present program disinfects the detected contamination using a scheme in accordance with the present invention.

Abstract: An output items to be finally obtained by computer software which is a development object are determinded, these items are prescribed using a data generation equation using interim data items, and all the interim data items are prescribed by separate data generation equations. This is continued until all new data items are prescribed by input data, and prescriptions of the data items, data generation equation, and data generation execution condition and the like obtained as the result constitute requirement definition. Furthermore, the requirement definition obtained in this manner is applied to a method of automatically finding a process order of data items based on the definition, or automatically establishing data in a correct order to automatically develop a program, and accordingly the software to be finally obtained is automatically developed.

Abstract: With software for any fields, to the effect that software is created automatically only by means of mechanical algorithm, but not depending upon personal abilities such as SE's experience, knowledge, application ability, etc., that is, based on the LYEE theory, definitive identifier, word identifier, W04 Autopoiesis vector which is undefined with the inducing data to introduce the process route and the setting value, W04 Duplication element, W04 Autopoiesis vector, W02 Autopoiesis vector, W03 Duplication element and W03 Autopoiesis vector, and Palette Function are memorized in advance, and, per every word, definitive identifiers, word identifiers, process routes and inducing data into are entered and definitive identifiers entered per every word, word identifiers, process routes and inducing data are allocated into the prescribed locations of the undefined W04 Duplication element, W04 Autopoiesis vector, W03 Duplication element, W03 Autopoiesis vector and the Palette Function.

Abstract: A processing method is provided in which development of a program is processed using an information processor by being applied to a synchronous structure including two or more synchronous vectors developed on a memory area of the information processor. First, the synchronous structure acquires a defined input through an external interface, references a content of a word constituting the defined input, and thereafter establishes a signification to a predetermined word to output the word to a defined output.

Abstract: According to the present invention, an establishment is attained which is equivalent to performing endless repetition of such activities as specifying, validating, verifying and testing which are considered inevitable to make S/W a perfect product (as wished by the development requirer) in conventional method as well as a software which perfectly actualizes such development requirement avoiding such endless repetition, only by directly implementing with a programming language a law itself of Scenario Function which embraces semantic-quality determining mechanism by way of endless times of repetition structure.

Abstract: Firstly, definitive identifiers are determined, which are the screen needed for the software to be produced. Next, words existing in the definitive identifier are sorted out, as well as the homogeneity map is created where all pallets needed for the software are placed according to the process flow based on the definitive identifier. Next, the necessary file is determined based on the sorted-out words and the created homogeneity map. Next, the following tense control vectors are created: the first tense control vector that implements screen editing or file editing for all the sorted-out words; the second tense control vector that determines the homogeneity route for all the sorted-out words; and the third tense control vector that implements file updating.

Abstract: First, a defining member identifier constituting a screen required for software to be produced is determined. The words contained in the defining member identifier are then taken out, and a processing path diagram in which all pallets required for the software are arranged on the basis of the defining member identifier and along a flow of a process is prepared. A required file is then determined on the basis of the extracted words and prepared processing path diagram. A first base logic for editing screens or files for all of the extracted words, a second base logic for determining a processing path and a third base logic for updating a file are then prepared. Three kinds of pallets in which the first to third base logics are bound on a screen basis and pallet functions for executing these base logics autonomously and significantly in the pallets are then prepared.

Abstract: A new and useful computer system facilitates simplification of computer programs establishing a dedicated computer system adapted to a specific task, and makes it easy to program and to modify already established programs. The simple and easy method for establishing an application adapted dedicated computer system, operable on a plurality of data items for performing a plurality of functional processes for the data items, comprises the steps of establishing a plurality of program segments, each of to is exclusively assigned for one of the data items and has process content exclusively corresponding to one of the functional processes, and establishing a governing program for establishing systematic interrelationships between the program segments for performing a sequence of processes adapted to the dedicated application.

Abstract: The present invention provides a method for generating specific program systems to perform administrative data processing on specially designated businesses with a superior efficiency and less problems regardless of the skill level of engineers engaged in the program development work. Control program FAL excluding the business data processing logic and a program segment ASL including only the business data processing logic are independently generated, and are synthesized to generate the required program. FAL includes link grammar(s) to start ASL. ASL is generated at the cross point defined between the link grammar and the definition item to be treated by the link grammar. FAL is generated by parting FAL into plural processing units, and selecting a FAL-paradigm from a plurality of FAL-paradigm previously extracted, which are used for a basic form common to these parted processing units of FAL.