【摘要】：軟件測(cè)試是保證軟件質(zhì)量的重要方法。單元測(cè)試是對(duì)被測(cè)程序最小單元或模塊進(jìn)行的測(cè)試,通常分為測(cè)試用例生成、測(cè)試用例執(zhí)行和測(cè)試結(jié)果統(tǒng)計(jì)三個(gè)階段,其中生成測(cè)試用例通常由測(cè)試人員手動(dòng)完成。由于單元測(cè)試的巨大工作量及其高重復(fù)性,因而需要投入大量的人力和時(shí)間。單元測(cè)試的自動(dòng)化測(cè)試,尤其是測(cè)試用例自動(dòng)生成技術(shù)的發(fā)展在一定程度上解決了手動(dòng)測(cè)試效率低和失誤率高的問(wèn)題,推動(dòng)了軟件測(cè)試的發(fā)展,成為軟件測(cè)試領(lǐng)域的研究熱點(diǎn)。在面向路徑的單元測(cè)試中,目標(biāo)路徑上的約束集合求解問(wèn)題是測(cè)試用例自動(dòng)生成問(wèn)題的一個(gè)難點(diǎn)。由于被測(cè)約束系統(tǒng)的復(fù)雜性以及求解算法的約束性,測(cè)試用例自動(dòng)生成的效率以及生成用例的正確率往往不高。本文圍繞提高單元測(cè)試中的測(cè)試用例自動(dòng)生成效率問(wèn)題,在分支限界測(cè)試用例框架和區(qū)間運(yùn)算的基礎(chǔ)上提出了基于語(yǔ)義分析和區(qū)間運(yùn)算的庫(kù)函數(shù)約束求解策略,用以求解目標(biāo)路徑中庫(kù)函數(shù)約束;基于迭代技術(shù)和區(qū)間運(yùn)算的區(qū)間一致性判定策略,用以消除路徑中約束的處理順序?qū)^(qū)間運(yùn)算結(jié)果的影響,同時(shí)削減變量區(qū)間;基于變量相關(guān)性的跳躍式回溯策略用以避免不必要的回溯和回退過(guò)程,減少區(qū)間運(yùn)算次數(shù);約束變換策略將待測(cè)路徑中的一些非四則運(yùn)算轉(zhuǎn)換成區(qū)間運(yùn)算可以處理的四則運(yùn)算形式,通過(guò)輔助變量賦值加速求解目標(biāo)路徑上的約束集合。作者在代碼測(cè)試系統(tǒng)(CodeTest System,CTS)中編碼實(shí)現(xiàn)了上述四種策略,并通過(guò)相關(guān)實(shí)驗(yàn)來(lái)檢測(cè)這些策略在加速測(cè)試用例自動(dòng)生成方面的有效性。實(shí)驗(yàn)結(jié)果表明本文提出的策略對(duì)于減少測(cè)試用例自動(dòng)生成的時(shí)間,提高測(cè)試用例自動(dòng)生成的效率有明顯的作用。
[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.
【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類(lèi)號(hào)】：TP311.53

【參考文獻(xiàn)】

相關(guān)期刊論文 前9條

1 潘爍;王曙燕;王歡;;基于改進(jìn)粒子群算法的組合測(cè)試數(shù)據(jù)生成[J];西安郵電學(xué)院學(xué)報(bào);2012年03期

2 王林;尤楓;趙瑞蓮;;基于改進(jìn)遺傳算法的面向路徑測(cè)試數(shù)據(jù)生成[J];計(jì)算機(jī)工程;2012年04期

3 曾凡平;袁園;潘能剛;鄧超強(qiáng);;不變量指導(dǎo)的隨機(jī)測(cè)試用例生成[J];小型微型計(jì)算機(jī)系統(tǒng);2011年11期

4 王雅文;宮云戰(zhàn);肖慶;楊朝紅;;基于抽象解釋的變量值范圍分析及應(yīng)用[J];電子學(xué)報(bào);2011年02期

5 王雅文;宮云戰(zhàn);肖慶;楊朝紅;;擴(kuò)展區(qū)間運(yùn)算的變量值范圍分析技術(shù)[J];北京郵電大學(xué)學(xué)報(bào);2009年03期

6 王雅文;宮云戰(zhàn);楊朝紅;;軟件測(cè)試工具綜述[J];北京化工大學(xué)學(xué)報(bào)(自然科學(xué)版);2007年S1期

7 薛云志;陳偉;王永吉;趙琛;王青;;一種基于Messy GA的結(jié)構(gòu)測(cè)試數(shù)據(jù)自動(dòng)生成方法[J];軟件學(xué)報(bào);2006年08期

8 李福川,宋曉秋;軟件測(cè)試中的新方法——區(qū)間代數(shù)方法[J];計(jì)算機(jī)工程與設(shè)計(jì);2005年10期

9 汪西原,汪西莉;啟發(fā)式搜索策略(爬山法)的改進(jìn)與實(shí)現(xiàn)[J];陜西師范大學(xué)學(xué)報(bào)(自然科學(xué)版);1999年01期

相關(guān)會(huì)議論文 前1條

1 曾勇軍;王清賢;奚琪;;基于抽象區(qū)間域的數(shù)組邊界檢查技術(shù)[A];計(jì)算機(jī)研究新進(jìn)展（2010）——河南省計(jì)算機(jī)學(xué)會(huì)2010年學(xué)術(shù)年會(huì)論文集[C];2010年

相關(guān)博士學(xué)位論文 前1條

1 邢穎;測(cè)試用例自動(dòng)生成的分支限界算法及實(shí)驗(yàn)研究[D];北京郵電大學(xué);2014年

相關(guān)碩士學(xué)位論文 前1條

1 郭勁松;約束滿(mǎn)足問(wèn)題（CSP）的求解技術(shù)研究[D];吉林大學(xué);2013年

，

本文編號(hào)：2492746