A Method Focus On Generating The Conditions Of Initial Marking Coverd The Parallel Tested Target

While the development of parallel software brings the efficient solutions to internet industry,it also brings many challenges to software testing.Although there have been many scholars devoted to the work of parallel software testing automatic generation.But the existing work,on the one hand,the method based on state space is always vulnerable to the influence of state space explosion.On the other hand,the model-based approach also faces the problem of multiple model nodes and complex target paths.Then,we require a fast and efficient solution.Therefore,how to obtain the initial marking of the target quickly and efficiently is very meaningful to the testing work when the tesing data is unknown.In view of the above background,this thesis studies the initial marking generation method to cover the parallel target.The research work involved in this thesis could be summarized as follows:(1)This thesis proposes the parallel software coverage criterion based on the transition coverage,and then proposes path searching algorithm and optimization algorithm covering the parallel target based on this criterion.First of all,we detail the rules for the coverage criteria.Then,a path searching and optimization algorithm covering parallel targets is proposed.This method could get all paths which from the initial place to the test target,i.e.the set of FullPath.Next,remove the redundant paths in the FullPath as far as possible based on the coverage criteria while ensuring the effective coverage of the target.The condition of the initial marking would be considered to be high coverage and low redundancy only when the FullPath set meets the coverage criteria.(2)Following the first step,this thesis proposes the initial marking expression generation algorithm which focuses on the target path.First,extract all the arc expressions and guard expressions on the target path,and make the results expressions only about the output arc variable of the initial place.Next,analyzing logical relation between different nodes on these paths and get the final path expressions.In particular,we need to consider the synchronization relationship of the transition,i.e.,we need to consider the equivalent problem of the same name variable on the different output arc.(3)In the end,this thesis proposes the initial marking condition extraction algorithm based on above work.First,locate and extract the minimum processing sub-expression in the information expression,and then obtain the logical condition sub-field according to the implementation of the decision logic.Next,restructuring the expression while guarantee it equivalent to the original expression.Finally,the expression is processed and simplified with the way of recursion,and integrate the sub initial marking condition,then obtain the complete set of the initial marking conditions.