本章参考文献

本章参考文献

[1] 马军勇,杨胜建.软件回归测试研究[J].电子测试,2009(6):56-59.

[2] 李香菊.软件工程课程设计教程[M].北京:北京邮电大学出版社,2016.

[3] 冯灵霞,邵开丽,张亚娟,等.软件测试技术[M].西安:西安电子科技大学出版社,2017.

[4] 杨胜利.软件测试技术[M].广东:广东高等教育出版社,2015.

[5] Harrold,Jean M.Reduce,reuse,recycle,recover:techniques for improved regression testing[C]//IEEE International Conference on Software Maintenance.IEEE,2009:5-5.

[6] Lee J G,Chung C G.An optimal representative set selection method[J].Information and Software Technology,2000,42(1):17-25.

[7] Chen T Y,Lau M F.Heuristics towards the optimization of the size of a test suite[C].Proceedings of the 3rd International Conference on Software Quality Managemen,1995,2:415-424.

[8] Johnson D S.Approximation algorithms for combinatorial problems[J].Journal of Computer and System Sciences,1982,9(3):256-278.

[9] Harrold M J,Gupta R,Soffa M L.A methodology for controlling the size of a test suite[C]//International Conference on Software Maintenance(ICSM),1990:302-310.(https://www.daowen.com)

[10] 全君林,陆璐.基于遗传算法测试用例集极小化研究[J].计算机工程与应用,2009,45(19):58-61.

[11] Yang X S.Nature-Inspired Metaheuristic Algorithms[M].Beckington:Luniver Press,2008.

[12] 王元.数论方法在近似分析中的应用[J].数学的实践与认识,1980(3):73-79.

[13] 张铃,张钹.佳点集遗传算法[J].计算机学报,2001(9):22-27.

[14] 周冲波,楼俊钢,程龙.基于矩阵行列变换的测试用例约简算法[J].计算机应用研究,2013(3):145-148.

[15] Chvatal V.A greedy heuristic for the set-covering problem[J].Mathematics of Operations Research,1979,4(3):233-235.

[16] Wang S,Ali S,Gotlieb A.Cost-effective test suite minimization in product lines using search techniques[J].Journal of Systems and Software,2015,103:370-391.

[17] Lin C T,Tang K W,Wang J S,et al.Empirically evaluating greedy-based test suite reduction methods at different levels of test suite complexity[J].Science of Computer Programming,2017:S0167642317301077.

[18] 宫云战,徐健豪,邢颖.萤火虫算法在测试用例集约简中的应用[J].哈尔滨工程大学学报,2020,41(4):577-582.