关于可应用测试数据充分性准则复杂性的注记

THE NOTES ON THE COMPLEXITY OF APPLICABLE FAMILY OF DATA FLOW CRITERIA FOR TEST DATA SELECTION

软件测试充分性准则的复杂性分析对于测试效率的分析和比较具有重要意义，对于测试充分性准则使用具有指导意义．Wepuker于1984年提出了Rapps－Weyuker的all－uses，all－p－uses／some－c－uses，all－c－uses／some－p－uses和all－p－uses准则的复杂性上界，于1988年又提出可应用数据流测试准则．我们发现原有测试复杂度在可应用家族中应用出现问题，本文就此问题给出注记．

The complexity of data flow criterla for test data selection is very important to analysis and comparation of testing efficiency. In 1984, Weyuker proposed the complexity of RappsWeyuker all-uses, all-p-uses/some-c-uses,alluc-uses/someup-uses and all-p-uses criteria, in 1988,proposed an applicable Family of Data Flow Testing Criteria, however its complexity was not changed prospectively, the notes on it is given in this paper.