基于區(qū)間運算的測試用例生成加速技術研究
發(fā)布時間：2019-06-04 13:04
【摘要】：軟件測試是保證軟件質量的重要方法。單元測試是對被測程序最小單元或模塊進行的測試,通常分為測試用例生成、測試用例執(zhí)行和測試結果統(tǒng)計三個階段,其中生成測試用例通常由測試人員手動完成。由于單元測試的巨大工作量及其高重復性,因而需要投入大量的人力和時間。單元測試的自動化測試,尤其是測試用例自動生成技術的發(fā)展在一定程度上解決了手動測試效率低和失誤率高的問題,推動了軟件測試的發(fā)展,成為軟件測試領域的研究熱點。在面向路徑的單元測試中,目標路徑上的約束集合求解問題是測試用例自動生成問題的一個難點。由于被測約束系統(tǒng)的復雜性以及求解算法的約束性,測試用例自動生成的效率以及生成用例的正確率往往不高。本文圍繞提高單元測試中的測試用例自動生成效率問題,在分支限界測試用例框架和區(qū)間運算的基礎上提出了基于語義分析和區(qū)間運算的庫函數約束求解策略,用以求解目標路徑中庫函數約束;基于迭代技術和區(qū)間運算的區(qū)間一致性判定策略,用以消除路徑中約束的處理順序對區(qū)間運算結果的影響,同時削減變量區(qū)間;基于變量相關性的跳躍式回溯策略用以避免不必要的回溯和回退過程,減少區(qū)間運算次數;約束變換策略將待測路徑中的一些非四則運算轉換成區(qū)間運算可以處理的四則運算形式,通過輔助變量賦值加速求解目標路徑上的約束集合。作者在代碼測試系統(tǒng)(CodeTest System,CTS)中編碼實現了上述四種策略,并通過相關實驗來檢測這些策略在加速測試用例自動生成方面的有效性。實驗結果表明本文提出的策略對于減少測試用例自動生成的時間,提高測試用例自動生成的效率有明顯的作用。
[Abstract]:Software testing is an important method to ensure software quality. Unit test is the test of the smallest unit or module of the program under test, which is usually divided into three stages: test case generation, test case execution and test result statistics, in which the test case generation is usually done manually by the tester. Due to the huge workload and high repeatability of unit testing, a lot of manpower and time need to be invested. The automatic testing of unit testing, especially the development of automatic test case generation technology, solves the problems of low efficiency and high error rate of manual testing to a certain extent, promotes the development of software testing, and becomes the research focus in the field of software testing. In path-oriented unit testing, the problem of solving constraint sets on the target path is a difficult point in the automatic generation of test cases. Because of the complexity of the constraint system under test and the constraint of the algorithm, the efficiency of automatic generation of test cases and the correct rate of generating use cases are often not high. In this paper, aiming at improving the efficiency of automatic test case generation in unit testing, a library function constraint solving strategy based on semantic analysis and interval operation is proposed on the basis of branch bound test case framework and interval operation. It is used to solve the library function constraint in the target path. The interval consistency decision strategy based on iterative technique and interval operation is used to eliminate the influence of the processing order of constraints in the path on the results of interval operation and to reduce the interval of variables at the same time. The jump backtracking strategy based on variable correlation is used to avoid unnecessary backtracking and backward process and reduce the number of interval operations. The constraint transformation strategy converts some non-four operations in the path to be measured into four forms that can be processed by interval operation, and accelerates the solution of the constraint set on the target path by auxiliary variable assignment. The author encodes the above four strategies in the code test system (CodeTest System,CTS), and tests the effectiveness of these strategies in accelerating the automatic generation of test cases through related experiments. The experimental results show that the strategy proposed in this paper plays an obvious role in reducing the time of automatic test case generation and improving the efficiency of test case automatic generation.
【學位授予單位】：北京郵電大學
【學位級別】：碩士
【學位授予年份】：2016
【分類號】：TP311.53
本文編號：2492746
[Abstract]:Software testing is an important method to ensure software quality. Unit test is the test of the smallest unit or module of the program under test, which is usually divided into three stages: test case generation, test case execution and test result statistics, in which the test case generation is usually done manually by the tester. Due to the huge workload and high repeatability of unit testing, a lot of manpower and time need to be invested. The automatic testing of unit testing, especially the development of automatic test case generation technology, solves the problems of low efficiency and high error rate of manual testing to a certain extent, promotes the development of software testing, and becomes the research focus in the field of software testing. In path-oriented unit testing, the problem of solving constraint sets on the target path is a difficult point in the automatic generation of test cases. Because of the complexity of the constraint system under test and the constraint of the algorithm, the efficiency of automatic generation of test cases and the correct rate of generating use cases are often not high. In this paper, aiming at improving the efficiency of automatic test case generation in unit testing, a library function constraint solving strategy based on semantic analysis and interval operation is proposed on the basis of branch bound test case framework and interval operation. It is used to solve the library function constraint in the target path. The interval consistency decision strategy based on iterative technique and interval operation is used to eliminate the influence of the processing order of constraints in the path on the results of interval operation and to reduce the interval of variables at the same time. The jump backtracking strategy based on variable correlation is used to avoid unnecessary backtracking and backward process and reduce the number of interval operations. The constraint transformation strategy converts some non-four operations in the path to be measured into four forms that can be processed by interval operation, and accelerates the solution of the constraint set on the target path by auxiliary variable assignment. The author encodes the above four strategies in the code test system (CodeTest System,CTS), and tests the effectiveness of these strategies in accelerating the automatic generation of test cases through related experiments. The experimental results show that the strategy proposed in this paper plays an obvious role in reducing the time of automatic test case generation and improving the efficiency of test case automatic generation.
【學位授予單位】：北京郵電大學
【學位級別】：碩士
【學位授予年份】：2016
【分類號】：TP311.53
【參考文獻】
相關期刊論文 前9條
1 潘爍;王曙燕;王歡;;基于改進粒子群算法的組合測試數據生成[J];西安郵電學院學報;2012年03期
2 王林;尤楓;趙瑞蓮;;基于改進遺傳算法的面向路徑測試數據生成[J];計算機工程;2012年04期
3 曾凡平;袁園;潘能剛;鄧超強;;不變量指導的隨機測試用例生成[J];小型微型計算機系統(tǒng);2011年11期
4 王雅文;宮云戰(zhàn);肖慶;楊朝紅;;基于抽象解釋的變量值范圍分析及應用[J];電子學報;2011年02期
5 王雅文;宮云戰(zhàn);肖慶;楊朝紅;;擴展區(qū)間運算的變量值范圍分析技術[J];北京郵電大學學報;2009年03期
6 王雅文;宮云戰(zhàn);楊朝紅;;軟件測試工具綜述[J];北京化工大學學報(自然科學版);2007年S1期
7 薛云志;陳偉;王永吉;趙琛;王青;;一種基于Messy GA的結構測試數據自動生成方法[J];軟件學報;2006年08期
8 李福川,宋曉秋;軟件測試中的新方法——區(qū)間代數方法[J];計算機工程與設計;2005年10期
9 汪西原,汪西莉;啟發(fā)式搜索策略(爬山法)的改進與實現[J];陜西師范大學學報(自然科學版);1999年01期
相關會議論文 前1條
1 曾勇軍;王清賢;奚琪;;基于抽象區(qū)間域的數組邊界檢查技術[A];計算機研究新進展（2010）——河南省計算機學會2010年學術年會論文集[C];2010年
相關博士學位論文 前1條
1 邢穎;測試用例自動生成的分支限界算法及實驗研究[D];北京郵電大學;2014年
相關碩士學位論文 前1條
1 郭勁松;約束滿足問題（CSP）的求解技術研究[D];吉林大學;2013年
，本文編號：2492746
本文鏈接：http://sikaile.net/kejilunwen/ruanjiangongchenglunwen/2492746.html
