WO2004025463A1 - 要件定義方法、ソフトウェアの開発方法、及び、要件単語の変更方法並びに新規規定方法 - Google Patents
要件定義方法、ソフトウェアの開発方法、及び、要件単語の変更方法並びに新規規定方法 Download PDFInfo
- Publication number
- WO2004025463A1 WO2004025463A1 PCT/JP2003/011486 JP0311486W WO2004025463A1 WO 2004025463 A1 WO2004025463 A1 WO 2004025463A1 JP 0311486 W JP0311486 W JP 0311486W WO 2004025463 A1 WO2004025463 A1 WO 2004025463A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- requirement
- word
- data
- definition
- words
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/10—Requirements analysis; Specification techniques
Definitions
- the present invention relates to a software development method, and in particular, to changing a requirement word in a requirement definition method by a chained data item definition method, an automatic development method of computer software, and a requirement definition method by a chained data item definition method. It relates to a method and a new definition method of a requirement word.
- all programs are composed of only three types of basic instruction statements: (1) sequential processing, (2) selective branch processing, and (3) iterative processing.
- (1) order processing refers to processing for executing data processing in the order of written program statements
- (2) selective branch processing describes the execution order of data processing by judging conditions. This is the process of branching from the order of the program statement to another program statement.
- (3) Iterative processing is the process of repeatedly executing the described program statement while a certain condition is satisfied.
- a group of data processing functions that include several data processing element functions for example, the function of calculating the sales amount as "unit price X quantity" (for example, the function of calculating individual sales amounts and adding them together) are created in the correct processing order (called “modules”), and the entire program is created by combining those modules in the correct order.
- the various elemental functions of the business system (for example, the function of calculating the sales amount as “unit price X quantity”) are determined, and then these are determined. They determine the order in which they are executed, and instruct them to the computer using a program. As mentioned above, the computer cannot search the processing order by itself, so all must be instructed.
- the elemental functions of the business are determined by the business department that is the user of the software, so they are called Users' Logic, and the execution order of those processes is called Control Logic. Call.
- Conventional programming in short, is to tell the computer the given Users' Logic and the correct Control Logic.
- Control Logic Individual Users' Logic must be determined by the user, but it is relatively easy to determine. The reason why the amount of programming work is enormous is that it is not easy to correctly designate Control Logic. Preparations and ideas for this include detailed business analysis, business design, creation of data flow diagrams, program design, creation of modules, creation of flow charts, setting of intermediate data items, and setting of intermediate files as described above. And so on. These are all preparations for writing a program in the correct order. After them, the control logic of the correct processing order is instructed by programming.
- the order of the statements was Data processing is executed. Therefore, the processing order must or must be indicated by the order in which the people write the statements or by writing where the conditional branch goes. Since the processing order is determined in this way, the value of one data item in one program is determined by the pre-processing and the corresponding processing until it is processed. Therefore, the value of one data item depends on where it is written in one program. Therefore, as long as you understand the preprocessing, one data item may have another data generating expression or another value in one program. In other words, it does not mean that one data item has the same value regardless of what preprocessing was performed in one program. In the end, instead of having to decide the order of processing, there is a degree of freedom in the definition and value of data items. Therefore, it is impossible for anyone other than the person who created the program to know where and what definition is used for one data item in one program. Even the creator has not been aware of it for a long time.
- Changing y may have to change other programs (eg, X and z data generation formulas) as a ripple effect.
- Patent j must indicate the processing sequence (Control logic) of the processing method (Users' logic) of each business element in the form of a program.
- the requirement Users' logic
- the processing order Controll ogic
- the program can be generated, the change of the program by changing the requirement can be made automatically as long as the requirement word is correctly changed. This will change the program Updating becomes extremely easy. In this case, one data item in one program has only one value. Otherwise, automatic programming would not be possible in the first place.
- the chained requirements definition method and the method of changing requirements have exactly the characteristics.
- FIG. 3 illustrates this relationship. The detailed description of FIG. 3 will be changed with a diagram, and is omitted here.
- the present invention is intended to solve such problems of the conventional technology, and an object of the present invention is to provide a requirement definition method capable of mechanically defining requirements. Is what you do.
- an automated development method for example, “Lyee (registered trademark)”
- “Lyee (registered trademark)” refers to the invention and technology related to the soft toy production method and the like invented by Fumio Negoro, one of the inventors of the present invention, and details thereof include, for example, International Publication WO97 / 166784A1 pamphlet (hereinafter also referred to as "Patent Document 1”), International Publication WO98 / 192332A1 pamphlet (hereinafter referred to as “Patent Document 2”) ), International publication W099 / 49387 A1 pamphlet (hereinafter, also referred to as "Patent Document 3”), international publication WO0Z793985A1 pamphlet ( Less than,
- Patent Document 4 j International Publication WO 02/42904 A1 pan fret (hereinafter, also referred to as “Patent Document 5”); No. 83 (hereinafter also referred to as “Patent Document 6”), etc., and are disclosed in international publications and the like.
- the present invention also provides a simple and simple task of constructing the definition of requirements from the beginning only by defining the individual requirement words, instead of first defining all the requirements and then programming as in the conventional method. Requirement method for the requirement definition method by the chained data item definition method, which can efficiently and easily change the definition of the requirement word in response to the change of the requirement method It is intended to provide a new method for defining requirement words.
- the first means for solving the problem of the present invention includes: (a) a step of extracting all the output data items that the computer software to be developed ultimately seeks; (B) defining one of the retrieved output data items by a data generation expression and its data generation expression execution condition; and (c) defining the data generation expression and its data generation expression execution condition. For all the new data items appearing in the above, defining each of the new data items by a different data generation formula and a condition for executing the data generation formula; and (d) Step ( c) is repeated until only the input data items constitute the data generation formula; and (e) steps (a) to (d) are finally determined.
- the data generation formulas obtained as a result of the execution For all the output data items to be executed, the data generation formulas obtained as a result of the execution, the conditions for executing the data generation formulas, and if applicable, the input Z output A step of defining the attribute classification of the put and the specification of the recording medium in which the data item exists, as a requirement definition.
- the second problem solving means of the present invention includes: (a) a step of obtaining a requirement definition using a requirement definition method defined in the first problem solving means; and (b) a requirement obtained as a result. Based on the data items specified in the definition, it is applied to the method of automatically developing a program by automatically finding the processing order of data items or by automatically establishing data in the correct order. And a step of obtaining desired software as a result of the application.
- the operation of the first means for solving the problems is as follows.
- the target data item is determined by the requirement definition method based on the chained data item definition of the present invention
- the requirement can be easily and mechanically defined starting from the definition.
- the requirement definition by this method is useless because it does not indicate the processing order of the data items.
- the operation of the second problem solving means is to mechanically obtain a requirement definition according to the first problem solving means of the present invention, and to change a processing order of data items based on the mechanically made requirement definition.
- Automatically develops programs by automatically creating headings or data in the correct order and using a method to automatically develop programs (for example, “Lyee (registered trademark)”).
- Software development can be automated.
- the first problem solving means of the invention of the present application relates to a method of sequentially extracting individual data items only by defining data items when creating a data item group.
- the second problem solving means of the present invention automatically finds the processing order of the data items based on the data item group specified in the first problem solving means (without a pointer regardless of the list structure).
- it is a method of automatically developing software by automatically creating data in the correct order and using the method of automatically developing programs.
- a third object of the present invention is to provide a data generation expression (by input) for obtaining a name corresponding to a group of requirement words (two data items) defined as software requirements and a value corresponding to the word. Value is obtained), the conditions for the value corresponding to the word to be satisfied (data generation formula execution conditions), the attribute classification of the word as input or art output, and the attribute
- a) Change the rules of the requirement word itself to be changed changes include deletions and additions
- the rules need to be changed due to the effects of the changes in the rules for the words in (a) above.
- first link definition word of a word means all other words included in the definition of the word, that is, all other words necessary to generate the word.
- first link inclusion word of a word refers to all other words that include the word in the rule, that is, all other words generated by the word. .
- a fourth object of the present invention is to provide a data generation formula (input) for obtaining a name corresponding to a group of requirement words (two data items) defined as software requirements and a value corresponding to the word. ), The condition for the value corresponding to the word to be satisfied (the condition for executing the data generation formula), the attribute classification of whether the word is input or output, and the existence of the word.
- new requirements Therefore, when developing a new program, it is assumed that the new requirement is a change from nothing, and (a) the requirement word to be changed (B) As a requirement word that may need to be changed due to the effect of the change in the definition of the word in (a) above, The operation of extracting the first link definition word and the first link inclusion word before and after the change of the requirement word, and (c) whether or not the rules for each of the extracted words need to be changed And (d) repeating the above operations (a) to (c) for words that need to be changed.
- the definition of data items and the definition of data items are changed when the program is changed according to the change in requirements (this includes the case of new development).
- the conventional method which has a degree of freedom in terms of values, where all the statements in the program should be changed in detail, the changes are mechanically extracted and changed. It is possible to change it correctly.
- the present application in its essence, applies only the information related to the requirement words specified above to a method that can perform automatic programming without regard to the order of the specified word (data item) arrangement.
- it can be considered as a method of developing a program that automatically creates a program, a method of modifying a program, or a method of maintaining a program.
- Figure 1 is a conceptual diagram showing the procedure for changing (including adding) the definition of a requirement word while simultaneously making necessary changes that are derived from the effect of one change.
- Figure .2 schematically shows the relationship between data items, and explains the chain-type requirement definition method (Data Chain Re- quirement Definition (DCRD) 'method) in a conceptual outline. It is a conceptual diagram.
- DCRD Data Chain Re- quirement Definition
- FIG. 3 is a conceptual diagram for comparatively explaining the relationship between the requirement definition and the objective program between the prior art and the invention according to the present application. Summary of the Invention
- Word names Data generation formula for obtaining the value of a word (including that the value can be obtained by input),
- the chained requirements definition starts with the data item that expresses the intention, first defines the data item that derives the intention, and further defines the newly appearing data items. The specification is continued until all the input data items become input data. All data items are dragged out and specified by this method. This is defined as the requirement.
- the data items are sequentially defined regardless of the processing order of the data items, and the requirements are defined. Therefore, in the conventional method, all the data items are first grasped. The troublesome preparation work described above for determining the processing order is not required, and requirements can be defined with extremely high efficiency.
- changing requirements means changing the provisions for some of the above requirement words. How do you do that?
- word a D + c Satisfaction condition: d ⁇ 100
- the first link definition word of a certain requirement word a is all other words included in the definition of the requirement word a. All other words needed to generate that word a.
- the first link definition word of requirement word a is the word of b, c, d, e, f described above.
- the first link inclusion word 2 is requirement word a, are all other words with the provisions that contains the requirement word a. All other words generated by that word a. For example, what is the first link inclusion word of requirement word a?
- the reason why the effect of the change is interrupted by the word is that the original chain requirement is the method of dragging the next business element based on the definition of one business element, so the element business to be dragged changes It is obvious that if there is no change, the elemental work drawn by the business element that has not changed since then will be the same as before the change. If the dragged business element requires a change, it is another new change. It is not a ripple effect. On the other hand, if a word a is used in the definition of another word, and the word a is not changed, it is obvious that the other word does not change as a ripple effect of the word a. Thus, the effect of changing one requirement word is cut off by the requirement word that no longer changes.
- the method of changing requirements in the chained requirement definition method of the present invention can limit the scope of the effect of one change, and presents what requirement words may be changed.
- This forms a network of words that are consistent with each other by the fact that all requirement words are generated in a chained fashion, thus ensuring that a word has only one value. Because there is.
- This is fundamentally different from the conventional program change, and is a far superior point.
- the combination of this method and the automatic programming method that does not depend on the order of processing will dramatically change the way software is developed and maintained. Requirement changes and program changes fundamentally solve the troublesome conventional method problems.
- the first invention according to the present application (hereinafter, also referred to as “the first invention of the present application”) will be described using a simple example.
- the data item (word) called “sales amount”, which is the output data item to be calculated is defined by the following formula.
- the new data items (“sales unit price” and “sales quantity”) appearing in the data generation formula are specified respectively. The same is continued until each data item is defined as input data, and the process is completed when all data items become input data.
- Sales amount Sales unit price X Sales quantity
- the requirement definition method according to the first invention of the present application first determines a data item for this purpose, then defines the data item, and then newly defines the data generation expression and the execution condition of the data generation expression. Further stipulate the new data items that have appeared in. This is performed one after another in a chain. Eventually, the procedure will be completed when the new data items become input data items.
- the definition of each data item is performed according to the data generation formula, the execution condition of the data generation formula, the input / output attribute classification, and the recording medium in which the data item exists.
- Figure 2 (Chain requirement definition method) shows an example of the relationship between data items.
- FIG. 2 schematically shows the relationship between data items, and conceptually explains the requirement definition method based on the chained data item definition (also called the “Data Chain Requirement Definition (DCRD) method").
- DCRD Data Chain Requirement Definition
- the target data item A (1 in the figure) is the intermediate data item B (11 in the figure), the intermediate data item C (1 2 in the figure) and the intermediate data item. It indicates that it is specified by data item D (13 in the figure).
- the intermediate data term SB (11 in the figure) shall be specified by the input data item E stored in the E-file 11 and the input data item F stored in the F-file 11. Is shown.
- the intermediate data item C (1 in the figure) is defined by the input data item G on the G screen 122 and the input data item H on the H screen 122.
- the intermediate data item D (13 in the figure) is stored in the input data items H and I file 131, which exist on the H screen 122.
- the force s specified by the input data item I is indicated.
- the relationship between such data items usually changes according to the type, function, computer configuration, and the like of various software developers.
- E-file 1 1 1, F-file 1 1 2, I-file 1 3 1 and G-screen 1 2 1 and H-screen 1 2 2 are optional in nature and may be on other media not shown here.
- An input data item may be registered in the file. In the situation of FIG. 2 as described above, it is specifically assumed that the following conditional branch exists in the relationship between data items. That is,
- DCRD method based on the chained data item specification is as follows. That is,
- A is on the screen. (Provision of existing recording media)
- the new data items here are B, C, D, F, and G, respectively, and are specified below. The following is specified each time a new data item appears.
- A is on the screen.
- E Input data is in E-Finore.
- Table 1 is a chain data item specification that is one of such data item creation tables. This is a data item creation table for Requirement Definition (Data Chain Requirement Definition), and its explanation will be described later.
- the requirement definition in the production of software, the requirement definition first determines a target data item, and then newly appears in the data generation expression and the data generation expression execution condition. With the method of further defining new data items that have come, humans dig out one after another in a chain without considering the processing order of data items, etc.
- the first invention of the present application In software development, it is a method of defining requirements only by specifying data items and extracting data items easily by chained mechanical method.
- the arrangement of the data items has nothing to do with the processing order of the data items.
- the processing order of data items has to be manually instructed by a program in the order in which the data items are arranged, or in a conditional branch or iterative instruction.
- the chained mechanical requirements defined by the data items according to the first invention of the present application are also defined by the conventional method. Analytical search must be directed by the program.
- the second invention of the present application (hereinafter, also referred to as the “second invention of the present application”) is not performed by a person instructing the processing order of data items by a program, but is performed mechanically by the first invention of the present application.
- “Automatic program development method” for example, the method specified in "Lyee (registered trademark)” above
- the end result is that the development of the final product software is automatically performed.
- the processing order of the data items is automatically found based on the requirement definition obtained mechanically, or the data is automatically extracted.
- the automatic development method such as Lyee (registered trademark) is used to ensure that the desired software development is automated until the end of the program. It is what is done. Since the first invention of the present application has been described in detail above, and the Lyee (registered trademark) invention has been disclosed in detail in the above-mentioned document, the same description will not be repeated here, but will be pointed out here.
- a target data item is first determined, and then the data item is newly included in a data generation formula or a data generation formula execution condition.
- the processing order of the data items is automatically found based on the mechanical requirement definition performed by the first invention of the present application and the defined data items, or Automatically set in the correct order
- a method of automatically developing a program for example, a method defined in the above “Lyee (registered trademark)”
- Lidee registered trademark
- the basic principle of tool software is extremely simple. As we will once again check here, the change in requirements is “definition of requirement words, ie, a change in the definition of individual requirement words”, and the change is 'delete' and add.
- the basic principle of the tool software is naturally the same as the basic principle of the present invention, and is as follows.
- the change operation (a) may be performed as a new definition operation, and then (b), (c), (d), (E) may be performed.
- the tool software for change and the one for new development are exactly the same.
- the entire requirement definition is constructed while iteratively changing each requirement definition by trial and error. It is. Therefore, a change on the way is essentially unavoidable. From that point of view, the same tools should be used for new development and for change. And if the frequent changes can be easily made, it is very desirable for software development.
- the tool software of the chained requirement definition method having the capability greatly improves the production efficiency as a software development method.
- the chained requirement definition method of the present invention solves all the above-mentioned problems of the conventional method both in the definition of requirements and in the change of requirements.
- the technical idea of the present invention is to record, for example, an automatic development device, an automatic development program, and an automatic development program of computer software. It can be realized and used as a recording medium, transmission medium, or paper medium, or in a category such as a computer or device with an automatic development program, a client that executes the automatic development program, or a server format. Needless to say.
- the present invention is not limited to a computer system having a single processor, a single hard disk drive, and a single local memory, but may include any plural or combination processor or storage device as an option of the system. Also suitable for equipping. Computer systems include sophisticated calculators, palm-type computers, laptop / notebook computers, minicomputers, mainframe computers, and supercomputers, and combinations of these processing system networks. It can be replaced by any suitable processing system that operates in accordance with the principles of the present invention, and can be used in combination therewith.
- the technical idea according to the present invention can be applied to all kinds of programming languages. Further, the technical idea according to the present invention can be applied to application software of all kinds and functions.
- the object to be combined with the first invention of the present application automatically executes the program based on the mechanical requirement definition obtained by the first invention of the present application. Any method can be used as long as it is a dynamic development method, and its target is not limited to “Lyee (registered trademark)” described above.
- the present invention allows various modifications, additions, substitutions, enlargements, reductions, and the like within the scope of the same and equivalent technical ideas. Further, even if the software produced by using the invention of the present application is registered as a secondary product and commercialized, the value of the present invention is not reduced at all.
- the requirement definition method of the present invention makes it possible to easily extract data items and define requirements in a chained mechanical manner.
- the method for automatically developing computer software according to the present invention eliminates anything other than those that must be instructed by humans from the development process of the computer software, and ultimately makes the software development as mechanical as possible. Make it possible.
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/526,803 US20060130002A1 (en) | 2002-09-09 | 2003-09-09 | Requirement defining method, method for developing software, and method for changing requirement word, and newly defining method |
JP2004535910A JPWO2004025463A1 (ja) | 2002-09-09 | 2003-09-09 | 要件定義方法、ソフトウェアの開発方法、及び、要件単語の変更方法並びに新規規定方法 |
AU2003262015A AU2003262015A1 (en) | 2002-09-09 | 2003-09-09 | Requirement defining method, method for developing software, method for changing requirement word, and newly defining method |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2002262670 | 2002-09-09 | ||
JP2002-262670 | 2002-09-09 | ||
JP2003010454 | 2003-01-17 | ||
JP2003-10454 | 2003-01-17 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2004025463A1 true WO2004025463A1 (ja) | 2004-03-25 |
Family
ID=31996124
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2003/011486 WO2004025463A1 (ja) | 2002-09-09 | 2003-09-09 | 要件定義方法、ソフトウェアの開発方法、及び、要件単語の変更方法並びに新規規定方法 |
Country Status (4)
Country | Link |
---|---|
US (1) | US20060130002A1 (ja) |
JP (1) | JPWO2004025463A1 (ja) |
AU (1) | AU2003262015A1 (ja) |
WO (1) | WO2004025463A1 (ja) |
Families Citing this family (24)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8108429B2 (en) | 2004-05-07 | 2012-01-31 | Quest Software, Inc. | System for moving real-time data events across a plurality of devices in a network for simultaneous data protection, replication, and access services |
US7565661B2 (en) | 2004-05-10 | 2009-07-21 | Siew Yong Sim-Tang | Method and system for real-time event journaling to provide enterprise data services |
US7680834B1 (en) | 2004-06-08 | 2010-03-16 | Bakbone Software, Inc. | Method and system for no downtime resychronization for real-time, continuous data protection |
US7979404B2 (en) | 2004-09-17 | 2011-07-12 | Quest Software, Inc. | Extracting data changes and storing data history to allow for instantaneous access to and reconstruction of any point-in-time data |
US7904913B2 (en) | 2004-11-02 | 2011-03-08 | Bakbone Software, Inc. | Management interface for a system that provides automated, real-time, continuous data protection |
US7689602B1 (en) | 2005-07-20 | 2010-03-30 | Bakbone Software, Inc. | Method of creating hierarchical indices for a distributed object system |
US7788521B1 (en) | 2005-07-20 | 2010-08-31 | Bakbone Software, Inc. | Method and system for virtual on-demand recovery for real-time, continuous data protection |
EP1783604A3 (en) * | 2005-11-07 | 2007-10-03 | Slawomir Adam Janczewski | Object-oriented, parallel language, method of programming and multi-processor computer |
US8073681B2 (en) | 2006-10-16 | 2011-12-06 | Voicebox Technologies, Inc. | System and method for a cooperative conversational voice user interface |
US7818176B2 (en) | 2007-02-06 | 2010-10-19 | Voicebox Technologies, Inc. | System and method for selecting and presenting advertisements based on natural language processing of voice-based input |
US8131723B2 (en) | 2007-03-30 | 2012-03-06 | Quest Software, Inc. | Recovering a file system to any point-in-time in the past with guaranteed structure, content consistency and integrity |
US8364648B1 (en) | 2007-04-09 | 2013-01-29 | Quest Software, Inc. | Recovering a database to any point-in-time in the past with guaranteed data consistency |
US8140335B2 (en) | 2007-12-11 | 2012-03-20 | Voicebox Technologies, Inc. | System and method for providing a natural language voice user interface in an integrated voice navigation services environment |
US9305548B2 (en) | 2008-05-27 | 2016-04-05 | Voicebox Technologies Corporation | System and method for an integrated, multi-modal, multi-device natural language voice services environment |
US8326637B2 (en) | 2009-02-20 | 2012-12-04 | Voicebox Technologies, Inc. | System and method for processing multi-modal device interactions in a natural language voice services environment |
US9171541B2 (en) * | 2009-11-10 | 2015-10-27 | Voicebox Technologies Corporation | System and method for hybrid processing in a natural language voice services environment |
WO2016044290A1 (en) | 2014-09-16 | 2016-03-24 | Kennewick Michael R | Voice commerce |
US9898459B2 (en) | 2014-09-16 | 2018-02-20 | Voicebox Technologies Corporation | Integration of domain information into state transitions of a finite state transducer for natural language processing |
EP3207467A4 (en) | 2014-10-15 | 2018-05-23 | VoiceBox Technologies Corporation | System and method for providing follow-up responses to prior natural language inputs of a user |
US10431214B2 (en) | 2014-11-26 | 2019-10-01 | Voicebox Technologies Corporation | System and method of determining a domain and/or an action related to a natural language input |
US10614799B2 (en) | 2014-11-26 | 2020-04-07 | Voicebox Technologies Corporation | System and method of providing intent predictions for an utterance prior to a system detection of an end of the utterance |
US10331784B2 (en) | 2016-07-29 | 2019-06-25 | Voicebox Technologies Corporation | System and method of disambiguating natural language processing requests |
US20180165180A1 (en) * | 2016-12-14 | 2018-06-14 | Bank Of America Corporation | Batch File Creation Service |
CN116501295A (zh) * | 2023-06-27 | 2023-07-28 | 成都九洲电子信息系统股份有限公司 | 一种软件研发阶段矢量化需求分析系统及方法 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH06139224A (ja) * | 1992-09-08 | 1994-05-20 | Hitachi Ltd | 情報処理装置および監視装置 |
JPH09106343A (ja) * | 1995-10-12 | 1997-04-22 | Hitachi Ltd | ソフトウェア資源の保守管理方法 |
JP2001005651A (ja) * | 1999-06-21 | 2001-01-12 | Institute Of Computer Based Software Methodology & Technology | ソフトウェアの決定方法、ソフトウェアの使用方法、記録媒体、処理装置、ソフトウェアの保守方法、ソフトウェアの移植方法、ソフトウェアの管理方法、処理経路図の作成方法、パレット関数の作成方法、パレットの領域の決定方法、パレット連鎖関数の作成方法、位相要素の作成方法、論理要素の作成方法、作用要素の作成方法、ソフトウェアの実装方法、ソフトウェア開発方法、データ構造の置換方法、データ値の置換方法、従来型プログラムの分析方法、ソフトウェア開発管理方法、ソフトウェアの運用管理方法、並列コンピュータ及び判断補助装置 |
Family Cites Families (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH04137039A (ja) * | 1990-09-28 | 1992-05-12 | Toshiba Corp | プログラム自動生成方式 |
US5995736A (en) * | 1997-07-24 | 1999-11-30 | Ati Technologies, Inc. | Method and system for automatically modelling registers for integrated circuit design |
US6825945B1 (en) * | 1999-05-25 | 2004-11-30 | Silverbrook Research Pty Ltd | Method and system for delivery of a brochure |
US6681383B1 (en) * | 2000-04-04 | 2004-01-20 | Sosy, Inc. | Automatic software production system |
CA2408335C (en) * | 2000-05-16 | 2006-08-22 | Brigham Young University | Method and system for controlling a machine tool with direct transfer of machining data |
US7295958B1 (en) * | 2002-06-04 | 2007-11-13 | Massachusetts Institute Of Technology | Method and system for computer aided design |
US7231631B1 (en) * | 2002-07-17 | 2007-06-12 | The Mathworks, Inc. | Generated code from graphical user interface |
-
2003
- 2003-09-09 JP JP2004535910A patent/JPWO2004025463A1/ja active Pending
- 2003-09-09 WO PCT/JP2003/011486 patent/WO2004025463A1/ja active Application Filing
- 2003-09-09 AU AU2003262015A patent/AU2003262015A1/en not_active Abandoned
- 2003-09-09 US US10/526,803 patent/US20060130002A1/en not_active Abandoned
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH06139224A (ja) * | 1992-09-08 | 1994-05-20 | Hitachi Ltd | 情報処理装置および監視装置 |
JPH09106343A (ja) * | 1995-10-12 | 1997-04-22 | Hitachi Ltd | ソフトウェア資源の保守管理方法 |
JP2001005651A (ja) * | 1999-06-21 | 2001-01-12 | Institute Of Computer Based Software Methodology & Technology | ソフトウェアの決定方法、ソフトウェアの使用方法、記録媒体、処理装置、ソフトウェアの保守方法、ソフトウェアの移植方法、ソフトウェアの管理方法、処理経路図の作成方法、パレット関数の作成方法、パレットの領域の決定方法、パレット連鎖関数の作成方法、位相要素の作成方法、論理要素の作成方法、作用要素の作成方法、ソフトウェアの実装方法、ソフトウェア開発方法、データ構造の置換方法、データ値の置換方法、従来型プログラムの分析方法、ソフトウェア開発管理方法、ソフトウェアの運用管理方法、並列コンピュータ及び判断補助装置 |
Also Published As
Publication number | Publication date |
---|---|
JPWO2004025463A1 (ja) | 2006-01-12 |
US20060130002A1 (en) | 2006-06-15 |
AU2003262015A1 (en) | 2004-04-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2004025463A1 (ja) | 要件定義方法、ソフトウェアの開発方法、及び、要件単語の変更方法並びに新規規定方法 | |
US7665061B2 (en) | Code builders | |
US9405513B2 (en) | Systems and methods for graphically developing rules for transforming models between description notations | |
US8387014B2 (en) | Synchronization of concurrently modified interdependent semi-derived artifacts | |
US7953651B2 (en) | Validating updated business rules | |
US20070220055A1 (en) | Automatic generation of data models and accompanying user interfaces | |
WO2007013418A1 (ja) | 複数自然言語のソフトウェア説明書生成システム | |
US20220236971A1 (en) | Adapting existing source code snippets to new contexts | |
JP3871832B2 (ja) | データ処理プログラム自動生成システム及びその方法並びにコンピュータ可読記録媒体 | |
Khemakhem et al. | Enhancing usability for automatically structuring digitised dictionaries | |
US10970050B1 (en) | User interface engine for miniapp development | |
TWI771832B (zh) | 管理電子文件的電腦實行系統以及方法 | |
JP2018018323A (ja) | 分散処理管理方法、分散処理管理プログラム、および分散処理管理装置 | |
JP2013050868A (ja) | 情報処理装置および情報処理方法およびプログラム | |
JP7073756B2 (ja) | 併合方法、併合装置、および併合プログラム | |
JPWO2009011057A1 (ja) | アプリケーション解析プログラム、アプリケーション解析方法およびアプリケーション解析装置 | |
US20040205707A1 (en) | Logical separation of code and content | |
Steenhuis et al. | Weaving Pathways for Justice with GPT: LLM-driven automated drafting of interactive legal applications | |
JP7474260B2 (ja) | 構造化文書処理装置、構造化文書処理方法及びプログラム | |
US20230409956A1 (en) | Machine learning prediction of additional steps of a computerized workflow | |
Solomencevs et al. | The algorithm for getting a uml class diagram from topological functioning model | |
KR102588597B1 (ko) | Uml 시퀀스 다이어그램의 대체 에디터로서 오퍼레이션 로직 디자이너를 이용하여 프로그램을 설계하는 방법 및 그를 이용한 장치 | |
US20230385026A1 (en) | Automatic flow implementation from text input | |
EP4283546A1 (en) | Machine learning prediction of additional steps of a computerized workflow | |
US11481545B1 (en) | Conditional processing of annotated documents for automated document generation |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2004535910 Country of ref document: JP |
|
ENP | Entry into the national phase |
Ref document number: 2006130002 Country of ref document: US Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10526803 Country of ref document: US |
|
122 | Ep: pct application non-entry in european phase | ||
WWP | Wipo information: published in national office |
Ref document number: 10526803 Country of ref document: US |