티스토리 뷰

이 한 장의 그래프가 pairwise / orthogonal array 테스팅의 진면목을 알려주는 듯 하다.



Abstract—Exhaustive testing of computer software is intractable, but empirical
studies of software failures suggest that testing can in some cases be effectively
exhaustive. Data reported in this study and others show that software failures in a
variety of domains were caused by combinations of relatively few conditions.
These results have important implications for testing. If all faults in a system can
be triggered by a combination of n or fewer parameters, then testing all n-tuples of
parameters is effectively equivalent to exhaustive testing, if software behavior is
not dependent on complex event sequences and variables have a small set of
discrete values.
댓글
댓글쓰기 폼
공지사항
Total
410,766
Today
35
Yesterday
44
«   2019/12   »
1 2 3 4 5 6 7
8 9 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31        
글 보관함