基于栈操作的用例规模的一个计算公式

A Computational Recursive formula Based on the Scale of Use Case for A Stac

软件测试随着测试用例规模的增加变得十分困难,对测试用例进行研究十分必要.本文首先给出了树同构的概念,然后利用图论就栈操作的用例进行了讨论,并得到一系列有关栈操作用例的重要性质,最后对一个给定任意大小的输入序列,讨论了其各种可能的输出序列,在此基础上得到了各种可能输出序列规模的一个递推计算公式.

The software test becomes more difficulty when the number of testing use caseincreases, so it is very important to study testing use case. This paper first gives the definition of tree morphism, and then discusses the scale of use case for operating to a stack using graph theory, and gets some useful properties about operating use case to a stack. Finally, we get a recursive formula about the scale of the output series corresponding a given in some input series for the stack.