摘要
有限状态机(Finite State Machine,简称FSM)模型是软件测试领域的流行测试模型之一.基于FSM模型生成测试用例的方法假设给定的模型与用户的需求一致,测试的目标就是检查被测实现是否与模型一致.给出了FSM的代数表示及其相关的测试理论,利用正则表达式的结构表示测试路径(抽象测试用例),使测试分析变得更简单并利于形式推导.对任何抽象级的FSM,都可以从中产生满足确定测试准则的测试用例,它们是抽象的,对应不同的抽象级别,适合不同层次上的测试.最后还对FSM中完全路径的条数展开了分析,这便于考察满足完全路径覆盖所需的最多测试用例个数以及满足迁移覆盖所需的最少测试用例个数.
Finite State Machine（FSM for short） is one of the popular models for software testing. The approach to generating test cases based on FSMs assumes that the given model is identical with user requirements and the goal of the testing is to check if the implementation conforms to the given model. It gives the algebraic representation of FSM and its corresponding testing theory,and employs regular expressions to describe test paths（abstract test cases）,which simplifies the test analysis and helps to conduct formal deduction. For an FSM at any abstract level,the test cases satisfying a certain test criterion can be generated; these test cases are abstract,corresponding to a certain abstract level and appropriate for the testing in that abstract level. Finally,it analyzes the number of complete paths in an FSM,as is convenient for considering the maximal number of test cases needed to satisfy complete path coverage criterion and the minimal number of test cases needed to satisfy transition coverage criterion respectively.
出处
《小型微型计算机系统》
CSCD
北大核心
2014年第7期1585-1590,共6页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(61262010
61262034
61163007)资助
中国博士后科学基金面上项目(2014M551855)资助
江西省自然科学基金项目(20132BAB201036
20114BAB211019
20122BAB201034)资助
江西省博士后科研择优项目(赣人社字[2013]227号)资助
江西省教育厅科技计划项目(GJJ12743)资助
江西省教育厅科学技术研究重点项目(GJJ13307)资助
关键词
有限状态机
测试路径
正则表达式
状态迁移图
finite state machine
test path
regular expression
state transition diagram
