Research On Domain-Oriented Software Requirements Consistency Validation Method

At the background of the national construction of a harmonious society,thelifeline of information systems which control the national economy is receivingincreasing attention.Requirement analysis is the starting point of an informationsystem's development,on which the success or failure of the entire developmenthas a significant impact.When requirements have their own shortcomings,whether the system design and implementation process is perfect or not,thesystem shortage will be there.It has become an important research field inrequirement engineering area that how to validate the consistency between systemrequirements and national laws,and the internal consistency within systemrequirements.This thesis's research work mainly focuses on the requirementconsistency validation,especially on the validation to a natural languagerequirement text.This thesis proposes a requirement tree model,which is a branch-levelstructure with the nodes of Chinese language requirement clause.Whenrequirements exist in form of natural language requirement text,it must beformalized first.Based on a given Chinese language requirement vocabularysegmentation algorithm,the thesis divides requirement clauses into a series ofrequirement keywords.Further more,a method of requirement keywords withseven tuples denotation come up.The thesis proposes to fill the regular words andouter semantic comparability of the seven tuples by constructing the domainregular vocabulary table.The keyword seven tuples denotation transforms therequirement tree nodes from the requirement clauses to requirement-keyword sets,and constitutes a refinement requirement tree model,which completes thepreprocessing operation to natural language requirement text.As the refinement requirement tree cannot characterize the acceptationrelation between the syntax structure and the requirement keywords of arequirement clause,this thesis proposes a requirement-interdependence-parse treemodel(RIPT).Based on a given labeling algorithm based on interdependence parsing tree model,the thesis elaborates a model transformation method which isfrom a refinement requirement tree node to a requirement interdependence parsingtree,and proposes an establishing and updating algorithm of the RIPT.In themodel transforming process,it carries on a word-off operation of the requirementkeywords through the lexical category recycling,and it also discusses therequirement ambiguous discovery and elimination method in the modeltransforming process.The RIPT can accurately describe the dependence relationamong syntax structure and the keywords.Since the RIPT is not a good exPression on words relationship whichsubordinates in different requirement clauses,this thesis proposes a conceptsubordinate forest model(CSFM).The thesis proposes a model establishing andupdating algorithm,and shows a method to distinguish requirement omission inthe updating process.It builds a forest operation extraction algorithm by inducingthe forest operation,which carries on the traversal and the second-order verbsubtree extraction to the requirement interdependence parsing tree set,and theextracted forest operation function may be used in attributing the relationshipbetween different subordination requirement clauses.In order to enhance the confirmation rate of requirement validation result,this thesis put forward the concept of requirement crucial degree.The extractionof the fifth item of keyword seven tuples is performed to construct outer semanticsimilarity vector.First of all,the thesis proposes a local important proportion scalefilling algorithm which was based on the RIPT,and constructs judgment matrixbased on these operations,then shows a method to calculating the weight vectorof requirement keywords.Then,the author statements a global importantproportion scale filling algorithm,which is based on the CSFM,and causes therequirement keywords seven tuples data non-singular,shows a calculating methodof the requirement keywords important scale vector based on these operations.Based on the above three kind of vectors,the thesis proposes a requirementcrucial degree calculating method,and requirement tree,and a requirementinterdependence parsing tree cut-off algorithm based on the requirement crucialdegree.Not only the algorithm can enhance the confirmation rate of the validation result,moreover as a result of state space reduction,also will enhance eachefficiency validation algorithm which have been carried out.As the CSFM cannot characterize the relationship among differentrequirement clauses directly,this thesis proposes the concept of requirementsimilarity degree and requirement pertinence degree.Based on the CSFM,theauthor proposes the calculating method to concept subordinate intensity ofsubordinated nodes and the inner semantic similarity degree of non-subordinatenodes.And based on the calculating of inner semantics similarity and therequirement keywords weight vector,the thesis shows how to calculate therequirement vector similarity degree,which can judge the concept structuresimilarity degree between two requirement clauses.Based on the RIPT's verbskeleton,it shows a calculating method of requirement interdependence similaritydegree,which is used in determining the similarity between two requirementclauses' syntax structure.Based on the forest operation of CSFM,the thesisproposes a calculating method of requirement pertinence degree.Based on thesimilarity degree and the pertinence degree,it proposes a requirement consistencyvalidation algorithm.Through comparing the attribute value,the attribute valuerange,attribute equation among similar attributes,the algorithm not only confirmsthe relationship among different requirement clauses,but also can inspect therequirement inconsistency existences such as the redundancy and thecontradiction.