基于統(tǒng)計分析的弱變異測試可執(zhí)行路徑生成
發(fā)布時間：2018-10-20 07:33
【摘要】：變異測試是一種面向缺陷的軟件測試技術,然而高昂的測試代價,影響了其在實際程序測試的應用.Papadakis等人將某一程序的弱變異測試問題,轉化為另一程序的變異語句真分支覆蓋問題,以期采用已有的分支覆蓋方法,生成變異測試數據.但是,上述方法使得轉化后程序包含大量的變異分支,增加了分支覆蓋測試數據生成的難度.如果采用合適的方法,約簡轉化后程序中包含的變異分支,并依所屬的路徑,對約簡之后的變異分支分組,那么,將能夠利用已有的路徑覆蓋測試方法,生成高質量的變異測試數據,從而提高弱變異測試的效率.但是,如何基于某一程序和變異體,生成可執(zhí)行路徑,至今缺乏有效的方法.鑒于此,文中通過考察變異語句真分支之間的相關性,提出了一種用于弱變異測試的可執(zhí)行路徑生成方法,使得覆蓋這些路徑的測試數據,能夠殺死所有的變異體.該方法首先考察變異語句真分支之間的占優(yōu)關系,約簡被占優(yōu)的變異分支,從而減少變異分支的數量;然后,將非被占優(yōu)的變異分支插入到該程序,轉化為另一被測程序,并基于轉化之后的程序,考察同一語句形成的多個變異分支的相關性;通過組合相關變異分支,形成新的變異語句真分支;接著,利用被測語句與新變異語句真分支的相關性,生成包含新變異語句真分支和被測語句的可執(zhí)行子路徑;最后,采用統(tǒng)計分析,基于子路徑之間的執(zhí)行關系,構建并約簡相關矩陣,將相關的子路徑組合,生成一條或多條可執(zhí)行路徑.將所提方法應用于9個基準和工業(yè)程序測試中,并與傳統(tǒng)方法進行了比較.實驗結果表明,所提方法生成了為數較少的可執(zhí)行路徑,且運行時間短;更重要的是,這些可執(zhí)行路徑能夠覆蓋所有的變異分支.此外,所提方法涉及的樣本容量,對生成的可執(zhí)行路徑數有一定的影響,但對程序的運行時間影響較小.
[Abstract]:Mutation testing is a defect oriented software testing technology. However, the high cost of testing affects its application in actual program testing. Papadakis et al. The problem of true branch coverage of variant statements transformed into another program is expected to generate variation test data by using existing branch coverage methods. However, the above method makes the transformed program contain a large number of variant branches, which makes it more difficult to generate branch coverage test data. If we use the appropriate method, the variant branches included in the transformed program are grouped according to the path to which they belong, then we will be able to use the existing path to cover the test methods. High quality variation test data are generated to improve the efficiency of weak mutation testing. However, there is no effective method to generate executable paths based on a program and variant. In view of this, an executable path generation method for weak mutation testing is proposed by investigating the correlation between the true branches of mutated statements, so that the test data covering these paths can kill all variants. The method first investigates the dominant relationship between the true branches of a variant statement, reduces the number of the variation branches, and then inserts the non-dominant variation branches into the program and converts them into another program. And based on the transformed program, we investigate the correlation of multiple variant branches formed by the same sentence; form a new true branch of a variant statement by combining the related variation branches; then, using the correlation between the tested statement and the true branch of the new variant statement, The executable subpaths including the true branch of the new variant statement and the sentence under test are generated. Finally, the correlation matrix is constructed and reduced by statistical analysis based on the execution relationship between the subpaths, and the related sub-paths are combined. Generates one or more executable paths. The proposed method is applied to 9 benchmarks and industrial process tests, and compared with the traditional method. The experimental results show that the proposed method generates fewer executable paths and shorter running time, and more importantly, these executable paths can cover all the variation branches. In addition, the sample size of the proposed method has a certain effect on the number of executable paths generated, but has little effect on the running time of the program.
【作者單位】： 中國礦業(yè)大學信息與電氣工程學院;徐州工程學院信電工程學院;蘭州理工大學電氣工程與信息工程學院;中國礦業(yè)大學理學院;
【基金】：國家“九七三”重點基礎研究發(fā)展規(guī)劃項目基金(2014CB046306-2) 國家自然科學基金(61375067,61203304,61573362)資助~~
【分類號】：TP311.53
本文編號：2282478
[Abstract]:Mutation testing is a defect oriented software testing technology. However, the high cost of testing affects its application in actual program testing. Papadakis et al. The problem of true branch coverage of variant statements transformed into another program is expected to generate variation test data by using existing branch coverage methods. However, the above method makes the transformed program contain a large number of variant branches, which makes it more difficult to generate branch coverage test data. If we use the appropriate method, the variant branches included in the transformed program are grouped according to the path to which they belong, then we will be able to use the existing path to cover the test methods. High quality variation test data are generated to improve the efficiency of weak mutation testing. However, there is no effective method to generate executable paths based on a program and variant. In view of this, an executable path generation method for weak mutation testing is proposed by investigating the correlation between the true branches of mutated statements, so that the test data covering these paths can kill all variants. The method first investigates the dominant relationship between the true branches of a variant statement, reduces the number of the variation branches, and then inserts the non-dominant variation branches into the program and converts them into another program. And based on the transformed program, we investigate the correlation of multiple variant branches formed by the same sentence; form a new true branch of a variant statement by combining the related variation branches; then, using the correlation between the tested statement and the true branch of the new variant statement, The executable subpaths including the true branch of the new variant statement and the sentence under test are generated. Finally, the correlation matrix is constructed and reduced by statistical analysis based on the execution relationship between the subpaths, and the related sub-paths are combined. Generates one or more executable paths. The proposed method is applied to 9 benchmarks and industrial process tests, and compared with the traditional method. The experimental results show that the proposed method generates fewer executable paths and shorter running time, and more importantly, these executable paths can cover all the variation branches. In addition, the sample size of the proposed method has a certain effect on the number of executable paths generated, but has little effect on the running time of the program.
【作者單位】： 中國礦業(yè)大學信息與電氣工程學院;徐州工程學院信電工程學院;蘭州理工大學電氣工程與信息工程學院;中國礦業(yè)大學理學院;
【基金】：國家“九七三”重點基礎研究發(fā)展規(guī)劃項目基金(2014CB046306-2) 國家自然科學基金(61375067,61203304,61573362)資助~~
【分類號】：TP311.53
【相似文獻】
相關期刊論文 前9條
1 任剛;吳晶晶;謝志鵬;孫未未;;自組織網絡有效的組合服務執(zhí)行路徑發(fā)現方法[J];計算機工程與應用;2010年01期
2 寇雪芹;;多診斷資源參與下的診斷任務執(zhí)行路徑規(guī)劃[J];計算機測量與控制;2011年11期
3 孫光;劉鐘理;;基于頻繁執(zhí)行路徑擴展的軟件胎記方法[J];計算機工程與應用;2012年36期
4 孟超;孫知信;劉三民;;基于云計算的病毒多執(zhí)行路徑[J];吉林大學學報(工學版);2013年03期
5 任開軍;宋君強;肖儂;張衛(wèi)民;;基于迭代Bargaining策略優(yōu)化服務合成執(zhí)行路徑[J];國防科技大學學報;2009年01期
6 王爽;;遠程協(xié)同故障診斷任務執(zhí)行路徑規(guī)劃[J];計算機測量與控制;2011年08期
7 孫光;樊曉平;劉鐘理;;擴展頻繁執(zhí)行路徑上的n-gram軟件胎記[J];信息網絡安全;2013年02期
8 劉泓漫,郝忠孝;聯(lián)合公式判定非循環(huán)執(zhí)行路徑[J];哈爾濱理工大學學報;2004年01期
9 ;[J];;年期
相關重要報紙文章 前2條
1 劉曉芬 粟偉 黎建軍;桃源 打造世外仙境的執(zhí)行路徑[N];人民法院報;2013年
2 趙高潮 省政協(xié)委員、民進青島市委副主委;限制權力是防腐廉政的基礎[N];聯(lián)合日報;2011年
相關碩士學位論文 前1條
1 姚艷玲;基于執(zhí)行路徑聚類的程序錯誤定位方法研究[D];大連海事大學;2013年
，本文編號：2282478
本文鏈接：http://sikaile.net/kejilunwen/ruanjiangongchenglunwen/2282478.html
