首页> 外文会议>IEEE International Conference on computer supported cooperative work in design >An Automatic Generation Method for Path Expressions of CPN Model Focus on Tested Behaviors
【24h】

An Automatic Generation Method for Path Expressions of CPN Model Focus on Tested Behaviors

机译:针对测试行为的CPN模型路径表达式的自动生成方法

获取原文

摘要

With the gradually development of distributed software, collaborative work became a trend. At the same time, due to the continuous improvement of software complexity, software testing is highly susceptible to the state space explosion, and it also makes the formation of the path expressions for test behaviors become very difficult. For the above problem, a new algorithm of path expressions automation generation which based on Colored Petri Nets (CPN) is proposed in this paper. First, a new coverage criterion for parallel software testing based on transition coverage is proposed in this paper. Second, searching and optimizing the FullPath according these coverage criteria. FullPath is a set of paths that from initial elements to tested target in here. Third, extract and integrate all the arc expressions on these paths, and the results expressions only about the output arc variable of the initial position. Next, analyzing logical relation between different nodes on these paths and get the final path expressions. These path expressions combine all the information of arc expressions, guard expressions and constraint relationship of the CPN model. 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. According to the path expressions, we could obtain that the token of current place whether to reach the tested place. And, the tester also could get the change of token in tested place. Besides, these expressions could reduce the redundant path maximally and ensure effective coverage, so, it could ensure correctness and sufficiency of the test. It could be used to guide tester analyze the flow of tokens and remove redundancy testing dataset. Finally, the analysis and demonstration of the examples show that this method is reasonable and effective.
机译:随着分布式软件的逐步发展,协同工作成为一种趋势。同时,由于软件复杂性的不断提高,软件测试极易受到状态空间爆炸的影响,这也使得测试行为的路径表达式的形成变得非常困难。针对上述问题,提出了一种基于有色Petri网(CPN)的路径表达式自动化生成新算法。首先,提出了一种新的基于过渡覆盖率的并行软件测试覆盖率准则。其次,根据这些覆盖标准搜索和优化FullPath。 FullPath是从初始元素到此处的测试目标的一组路径。第三,提取并整合这些路径上的所有圆弧表达式,并且结果表达式仅关于初始位置的输出圆弧变量。接下来,分析这些路径上不同节点之间的逻辑关系,并获得最终的路径表达式。这些路径表达式结合了所有弧形表达式,保护表达式和CPN模型的约束关系信息。特别地,我们需要考虑过渡的同步关系,即,我们需要考虑不同输出弧上相同名称变量的等效问题。根据路径表达式,可以得到当前地点的令牌是否到达测试地点。并且,测试人员还可以在测试位置获得令牌的更改。此外,这些表达式可以最大程度地减少冗余路径并确保有效覆盖,因此可以确保测试的正确性和充分性。它可以用来指导测试人员分析令牌流并删除冗余测试数据集。最后,通过实例分析和验证表明该方法是合理有效的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号