Responsive image
博碩士論文 etd-0723107-164956 詳細資訊
Title page for etd-0723107-164956
論文名稱
Title
利用限制條件法於組合策略產生黑箱測試資料之研究
A New Combinatorial Strategy to Black-box Testing with Constraints
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
87
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2007-06-25
繳交日期
Date of Submission
2007-07-23
關鍵字
Keywords
組合測試、限制滿足問題、軟體測試、黑箱測試
Software testing, combinatorial testing, Black-box testing, CSP
統計
Statistics
本論文已被瀏覽 5961 次,被下載 17
The thesis/dissertation has been browsed 5961 times, has been downloaded 17 times.
中文摘要
近幾年在黑箱測試的領域中,有許多學者嘗試以組合策略的方式自動產生測試資料,但這些以組合策略為基礎的演算法,並沒有將參數輸入值之間的矛盾關係(Conflict)考慮進去,而這些含有參數值矛盾關係的測試案例,對測試工程師來說是沒有用的。另外,這些演算法都是一次產生所有測試資料,換句話說,產生的過程中無法即時利用目前所產生的測試資料回饋修改演算法,因此容易產生重複或具有相同意義的組合。

因此,本研究針對以上的兩點問題,提出一個以條件限制法結合組合策略自動產生黑箱測試資料之演算法,以解決參數輸入值之間含有矛盾關係的問題,並
可在測試資料產生的過程中彈性加入限制式,以避免產生無用或重複的組合。而實驗結果證實,本研究所提出的限制條件法除了能夠直接產生不含有矛盾關係的測試資料之外,在演算法整體的運算時間上也有很好的結果;藉由彈性加入限制條件的機制,更進一步的減少測試組套必須涵蓋的組合,使得產生的測試資料數量比其它方法產生的測試資料數量來的少。
Abstract
In recent year, a lot of scholar try to generate test sets for combinatorial strategy automatically. But these algorithms based on combinatorial strategy don’t consider conflicts of input parameter model. A conflict exists when the result of combining two
or more values of different parameter dose not make sense. Thus, invalid sub-combinations may be included in test cases in the test suite, and these are useless to us. Besides, these algorithms all directly generate all test cases once, in other words,
it is unable to utilize test cases generated at present to feedback and revise the algorithm, so it is easy to generate useless combinations.

So, this paper proposes new test generation algorithm for combinatorial testing based on constraint satisfaction problem(CSP) to solve problem which invalid sub-combinations may be included in test cases, and we can add constraints flexibly during generating test cases to avoid generate useless or repeated combinations. The experimental result indicate that our algorithm perform well, with respect to the amount of time required for test generation, otherwise, we can generate conflict-free
test cases directly.
目次 Table of Contents
第一章 緒論 1
第一節 研究背景 1
第二節 研究動機 2
第三節 研究目標 4
第四節 論文架構 5
第二章 文獻探討 6
第一節 功能測試(FUNCTIONAL TESTING) 6
2.1.1 等類分割(equivalence class partition) 6
2.1.2 邊界值分析(boundary value analysis) 6
2.1.3 隨機測試(random testing) 7
第二節 組合測試(COMBINATORIAL TESTING) 7
2.2.1 組合策略的涵蓋標準(coverage criteria) 8
2.2.2 非固定型(Non-deterministic)之組合策略 9
2.2.3 固定型(deterministic)之組合策略 13
2.2.4 組合策略的評估 20
第三節 限制滿足問題(CSP) 20
2.3.1 限制滿足問題之限制式種類 22
2.3.2 限制滿足問題之求解演算法 23
第三章 研究方法與架構 30
第一節 組合測試的問題 30
3.1.1 Sub-models method 31
3.1.2 Avoid method 32
3.1.3 Replace method 32
第二節 限制滿足法 34
第四章 實驗結果與分析 43
第一節 標竿問題 44
第二節 實驗設計 45
第三節 實驗一 47
4.3.1 實驗數據 47
4.3.2 實驗結果討論 49
第四節 實驗二 50
4.4.1 實驗數據 50
4.4.2 實驗結果討論 53
第五章 結論與未來方向 59
第六章 參考文獻 60
參考文獻 References
1. Myers, G.J., et al., The Art of Software Testing. 2004: John Wiley and Sons.

2. Williams, A.W. and R.L. Probert. A measure for component interaction test coverage. in Proc. ACS/IEEE Intl. Conf. on Computer Systems and Applications. 2001.

3. Fredman, M.L. and G.C. Patton, The AETG System: An Approach to Testing Based on Combinatorial Design. IEEE Transactions on Software Engineering, 1997. 23(7): p. 437.

4. Cohen, D.M., et al., The combinatorial design approach to automatic test generation. Software, IEEE, 1996. 13(5): p. 83-88.

5. Grindal, M., J. Offutt, and S.F. Andler, Combination testing strategies: a survey. Software Testing, Verification & Reliability, 2005. 15(3): p. 167-199.

6. Kobayashi, N., T. Tsuchiya, and T. Kikuno, Non-Specification-Based Approaches to Logic Testing for Software. Journal of Information and Software Technology, 2002. 44: p. 113-121.

7. McMinn, P., Search-based software test data generation: a survey. Software Testing, Verification & Reliability, 2004. 14(2): p. 105-156.

8. Kuhn, D.R., D.R. Wallace, and A.M. Gallo Jr, Software fault interactions and implications for software testing. IEEE Transactions on Software Engineering, 2004. 30(6): p. 418-421.

9. Shiba, T., T. Tsuchiya, and T. Kikuno. Using artificial life techniques to generate test cases for combinatorial testing. in Computer Software and Applications Conference, 2004. COMPSAC 2004. Proceedings of the 28th Annual International. 2004.

10. Tai, K.C. and Y. Lei, A test generation strategy for pairwise testing. IEEE Transactions on Software Engineering, 2002. 28(1): p. 109-111.

11. Grindal, M., J. Offutt, and J. Mellin, Handling Constraints in the Input Space when Using Combination Strategies for Software Testing. 2006, Technical Report, University of Skovde.

12. Ostrand, T.J. and M.J. Balcer, The category-partition method for specifying and generating fuctional tests. Communications of the ACM, 1988. 31(6): p. 676-686.

13. Ammann, P. and J. Offutt. Using formal methods to derive test frames in category-partitiontesting. in Proceedings of the Ninth Annual Conference on Computer Assurance. 1994.

14. Cohen, M.B., et al. Constructing test suites for interaction testing. in Proceedings of the 25th international conference on Software engineering. 2003.

15. Burroughs, K., A. Jain, and R.L. Erickson, Improved quality of protocol testing through techniques ofexperimental design. ICC 94, SUPERCOMM/ICC'94, Conference Record, Serving Humanity Through Communications. IEEE International Conference on Communications, 1994: p. 745-752.

16. Cohen, D.M., et al. The Automatic Efficient Test Generator (AETG) system. in 1994. Proceedings., 5th International Symposium on Software Reliability Engineering. 1994.

17. Mandl, R., Orthogonal Latin squares: an application of experiment design to compiler testing. Communications of the ACM, 1985. 28(10): p. 1054-1058.

18. Sherwood, G. Effective Testing of Factor Combinations. in Proceedings of the third International Conference on Software Testing, Analysis, and Review (STAR94), Washington DC. 1994.

19. Dalal, S.R. and C.L. Mallows, Factor-Covering Designs for Testing Software. Technometrics, 1998. 40(3): p. 234-243.

20. Kumar, V., Algorithms for Constraint-Satisfaction Problems: A Survey. AI Magazine, 1992. 13(1): p. 32-44.

21. Brailsford, S.C., C.N. Potts, and B.M. Smith, Constraint satisfaction problems: Algorithms and applications. European Journal of Operational Research, 1999. 119(3): p. 557-581.

22. Freuder, E.C. and R.J. Wallace, Partial Constraint Satisfaction. Artificial Intelligence, 1992. 58(1-3): p. 21-70.

23. Tsang, E., Foundations of Constraint Satisfaction. 1993: Academic Press San Diego.

24. Tsang, E. and A. Kwan, Mapping Constraint Satisfaction Problems to Algorithms and Heuristics. 1993, Technical Report CSM254, Department of Computer Science, University of Essex, Colchester.

25. Williams, A.W. and R.L. Probert. A practical strategy for testing pair-wise coverage of networkinterfaces. in Proceedings of the Seventh International Symposium on Software Reliability Engineering. 1996.

26. Grindal, M., et al., An evaluation of combination strategies for test case selection. Empirical Software Engineering, 2006. 11(4): p. 583-611.

27. Sagarna, R. and J.A. Lozano, Scatter Search in software testing, comparison and collaboration with Estimation of Distribution Algorithms. European journal of operational research, 2006. 169(2): p. 392-412.

28. Sagarna, R. and J.A. Lozano, On The Performance of Estimation Of Distribution Algorithms Applied to Software Testing. Applied Artificial Intelligence, 2005. 19(5): p. 457-489.

29. Tracey, N., J. Clark, and K. Mander. Automated Program Flaw Finding using Simulated Annealing. in Proceedings of ACM SIGSOFT international symposium on software testing and analysis. 1998.

30. Wegener, J., A. Baresel, and H. Sthamer, Evolutionary test environment for automatic structural testing. Information & Software Technology, 2001. 43(14): p. 841-854.

31. Sthamer, H.H., The Automatic Generation of Software Test Data Using Genetic Algorithms. 1995, University of Glamorgan.

32. Piwowarski, P., M. Ohba, and J. Caruso. Coverage measurement experience during function test. in Proceedings of the 15th international conference on Software Engineering. 1993.

33. Chen, H.Y., et al., In Black and White: An Integrated Approach to Class-Level Testing of Object-Oriented Programs. ACM Transactions on Software Engineering and Methodology (TOSEM), 1998. 7(3): p. 250-295.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內一年後公開,校外永不公開 campus withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 35.174.62.162
論文開放下載的時間是 校外不公開

Your IP address is 35.174.62.162
This thesis will be available to you on Indicate off-campus access is not available.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code