基于Petri网的图形用户界面测试
在不确定上下文相关的环境中,图形用户界面测试主要依靠随机测试以及测试人员的从业经验,其有效性低。提高图形用户界面测试的效率是一个未解难题。因此,通过引入离散并行系统的Petri网理论,定义了图形用户界面的事件、事件序列和事件分解等概念,将可达性、有界性、活性以及强连通性等Petri网的重要性质延伸至此领域,以提高图形用户界面测试的覆盖面和效率。并且试图解决不可达、不强连通、死锁、无界、不符合初始模型和跳转错误等六类图形用户界面缺陷问题。实验证明基于Petri网的图形用户界面测试在事件覆盖数、代码行覆盖数以及缺陷发现数等方面均优于其他方法。...
Saved in:
| Published in | 计算机应用研究 Vol. 33; no. 3; pp. 768 - 772 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
上海师范大学 计算机科学与工程系,上海,200234
2016
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2016.03.029 |
Cover
| Summary: | 在不确定上下文相关的环境中,图形用户界面测试主要依靠随机测试以及测试人员的从业经验,其有效性低。提高图形用户界面测试的效率是一个未解难题。因此,通过引入离散并行系统的Petri网理论,定义了图形用户界面的事件、事件序列和事件分解等概念,将可达性、有界性、活性以及强连通性等Petri网的重要性质延伸至此领域,以提高图形用户界面测试的覆盖面和效率。并且试图解决不可达、不强连通、死锁、无界、不符合初始模型和跳转错误等六类图形用户界面缺陷问题。实验证明基于Petri网的图形用户界面测试在事件覆盖数、代码行覆盖数以及缺陷发现数等方面均优于其他方法。 |
|---|---|
| Bibliography: | 51-1196/TP software bug; test case generation; black-box test; event sequences; discrete parallel system In environment of undetermined and context-sensitive,graphic user interface testing mainly depends on random testing and testers＇ professional experience,the effectiveness being low. It is an unresolved puzzle for graphic user interface testing. Therefore,it is brought in the Petri net theory in the discrete and parallel system,defining concepts of event,events sequence,and events decomposition in graphic user interface. The paper introduced some significant properties of Petri net,such as reachability,roundedness,liveness and strong connectedness to this field,so as to improve the coverage and efficiency of graphic user interface testing. In addition,an attempt to solve six categories bugs in graphic user interface,such as non-reachability,not strong connected,dead-lock,unbounded,not suitable to the original model and error jumping is conducted. The experiment proves that graphic user interface testing base |
| ISSN: | 1001-3695 |
| DOI: | 10.3969/j.issn.1001-3695.2016.03.029 |