摘要
在Hierons提出的一种基于Z语言软件自动测试方法的基础上进行了拓展.该方法基于软件的Z语言规约;以Hierons提出的推理规则为基础,提出了分裂树的算法,将操作模式的约束条件转换为形如∨iPi∧Qi的析取范式;然后根据析取范式将Z语言描述的操作模式划分为子操作模式;依据子操作模式的前置条件和后置条件,将子操作模式作为状态转换图的转换关系,构建了被测试软件的状态转换图;依据状态转换图,提出了相应的状态覆盖准则、转换关系覆盖准则和转换关系谓词覆盖准则等测试数据选择准则.
This paper extended Hierons′ automatic test case generated from Z specification. Based on Hierons′s rewrite rules and Z specification, a tree split arithmetic was presented to rewrite the restriction predication in Operation Scheme to ∨iP_i∧Q_i disjunctive normal form. With this disjunctive normal form, the Operation Scheme written in Z was divided into Sub-Operation Scheme. According to Sub-Operation Scheme′s pre-condition and post-condition, Sub-Operation Scheme was used as state graph′s transition. Then a finite state automation model (FSM) was derived. According to the FSM, test criterion, such as state coverage adequacy criterion, transition coverage adequacy criterion and transition predication coverage criterion were also presented.
出处
《湖南大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2004年第3期81-85,共5页
Journal of Hunan University:Natural Sciences
基金
国家863基础研究类项目(No.2002AA411510)
中国科学院软件所计算机科学重点实验室课题(No.SYSKF0307)
关键词
自动化测试
软件测试
Z语言
测试用例生成
状态转换
automatic testing
software testing
Z notation
test case generation
state transition