Optimal test profile in the context of software cybernetics

被引:6
作者
Cai, KY [1 ]
机构
[1] Beijing Univ Aeronaut & Astronaut, Dept Automat Control, Beijing 100083, Peoples R China
来源
SECOND ASIA-PACIFIC CONFERENCE ON QUALITY SOFTWARE, PROCEEDINGS | 2001年
关键词
D O I
10.1109/APAQS.2001.990014
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Software cybernetics explores the interplay between software theory/engineering and control theory/engineering. Following the idea of software cybernetics, the controlled Markov chains (CMC) approach to software testing treats software testing as a control problem. The software under test serves as a controlled object, and the (optimal) testing strategy determined by the theory of controlled Markov chains serves as a controller The software under test and the corresponding (optimal) testing strategy constitute a closed-loop feedback system, and the software state transitions behave as a Markov chain. This paper analyzes the behavior of the corresponding optimal test profile determined by the CMC approach to software testing. It is shown that in some cases the optimal test profile is Markovian, whereas in some other cases the optimal test profile demonstrates a different scenario, The analyses presented in the paper deepen our understanding of the CMC approach to software testing and are related to software operational profile modeling.
引用
收藏
页码:157 / 166
页数:10
相关论文
共 9 条
[1]  
Beizer B., 2003, Software Testing Techniques
[2]   Towards a conceptual framework of software run reliability modeling [J].
Cai, KY .
INFORMATION SCIENCES, 2000, 126 (1-4) :137-163
[3]  
CAI KY, 1995, UNPUB CONCEPTS TOTAL
[4]  
CAI KY, 1998, SOFTWARE DEFECT OPER
[5]  
CAI KY, 2000, UNPUB CONTROLLED MAR
[6]  
DERMAN C, 1970, FINITE STATE MARKOVI
[7]  
Hernandez-Lerma O., 2012, DISCRETE TIME MARKOV, V30
[8]   A FINITE CHARACTERIZATION OF WEAK LUMPABLE MARKOV-PROCESSES .1. THE DISCRETE-TIME CASE [J].
RUBINO, G ;
SERICOLA, B .
STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 1991, 38 (02) :195-204
[9]   On the Markov property of a finite hidden Markov chain [J].
Spreij, P .
STATISTICS & PROBABILITY LETTERS, 2001, 52 (03) :279-288