Page 87 - 《软件学报》2021年第9期

钱忠胜 等:面向关键字流图的相似程序间测试用例的重用 2711

[11] Kwon J, Lee H. BinGragh: Discovering mutant malware using hierarchical semantic signatures. In: Proc. of the 7th Int’l Conf. on
Malicious and Unwanted Software. Fajardo: IEEE, 2012. 104−111.
[12] Wang Z, Piercek, Mcfarling S. Bmat--A matching tool for stale profile propagation. Journal of Instruction Level Parallelism,
2000,2:1−6.
[13] Levenshtein V. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics-Doklady, 1966,10(8):
707−710.
[14] Wang KY, Kong SQ, Fu YS, Pan ZY, Ma WD, Zhao Q. Two longest common substring algorithms based on bi-directional
comparison. Journal of Computer Research and Development, 2013,50(11):2444−2454 (in Chinese with English abstract).
[15] Rong C, Silva YN, Li C. String similarity join with different similarity thresholds based on novel indexing techniques. Frontiers of
Computer Science, 2017,11(2):307−319.
[16] Mc.Cabe TJ. A complexity measure. IEEE Trans. on Software Engineering, 1976,22(4):308−320.
[17] Mayrhauser AV, Mraz R, Walls J, Ocken P. Domain based testing: increasing test case reuse. In: Proc. of the IEEE Int’l Conf. on
Computer Design: VLSI in Computers & Processors. IEEE, 2002.
[18] Vouffo-Feudjio A, Schieferdecker I. Test patterns with TTCN-3. In: Proc. of the Int’l Workshop on Formal Approaches to Software
Testing. 2004. 170−179.
[19] Gong DW, Ren LN. Evolutionary generation of regression test data. Chinese Journal of Computers, 2014,3(11):489−499 (in
Chinese with English abstract).
[20] Jiang SJ, Wang LS, Xue M, Zhang YM, Yu Q, Yao HR. Test case generation based on combination of schema using particle swarm
optimization. Ruan Jian Xue Bao/Journal of Software, 2016,27(4):785−801 (in Chinese with English abstract). http://www.jos.org.
cn/1000-9825/4966.htm [doi: 10.13328/j.cnki.jos.004966]
[21] Bunke H. On a relation between graph edit distance and maximum common sub-graph. Pattern Recognition Letters, 1997,18:
689−694.
[22] Bunke H, Shearer K. A graph distance metric based on maximal common sub-graph. Pattern Recognition Letters, 1998,19:
255−259.
[23] Liu JN, Xing Q, Zhao WD. Program similarity detection algorithm. Computer and Digital Engineering, 2015,43(12):2145−2149 (in
Chinese with English abstract).
[24] Qian ZS, Hong DF, Wang XJ. A plug-in test case generation method based on contact layer proximity and node probability
coverage. Int’l Journal of Performability Engineering, 2017,13(8):1281−1292.
[25] Goldberg DE. Genetic Algorithms in Search, Optimization, and Machine Learning. MA: Addison-Wesley, 1989.
[26] Holland HJ. Adaptation in Natural and Artificial Systems. MIT Press, 1992.
[27] Qian ZS, Wang XJ. An approach to resource scheduling based on user expectation in cloud testing. Int’l Journal of Performability
Engineering, 2017,13(8):1206−1218.
[28] Ding R, Dong HB, Zhang Y, Feng XB. Fast automatic generation method for software testing data based on key-point path. Ruan
Jian Xue Bao/Journal of Software, 2016,27(4):814−827 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/
4971.htm [doi: 10.13328/j.cnki.jos.004971]
[29] Muccini H, Dias M, Richardson D. Towards software architecture-based regression testing. ACM SIGSOFT Software Engineering
Notes, 2005,30(4):1−7.
[30] Ding ZJ, Zhou ZX. Survey on Web service composition testing. Ruan Jian Xue Bao/Journal of Software, 2018,29(2):299−319 (in
Chinese with English abstract). http://www.jos.org.cn/1000-9825/5383.htm [doi: 10.13328/j.cnki. jos.005383]
[31] Mishra DB, Panda N, Mishra R, Acharya AA. Total fault exposing potential based test case prioritization using genetic algorithm.
Int’l Journal of Information Technology, 2018,29(2):299−319.

附中文参考文献:
[2] 吴川,巩敦卫,姚香娟.基于分支覆盖的回归测试路径选择.软件学报,2016,27(4):938−854. http://www.jos.org.cn/1000-9825/
4975.htm [doi: 10.13328/j.cnki.jos.004975]
[3] 李园园,黄松,惠战伟,李留义.面向不同数据模式的测试用例检索方法.计算机科学,2017,44(11):221−225.
[4] 邱晓康,李宣东.一个面向路径的软件测试辅助工具.电子学报,2004,32(S1):235−237.
[7] 陈翔,陈继红,鞠小林,顾庆.回归测试中的测试用例优先排序技术述评.软件学报,2013,24(8):1695−1712. http://www.jos.org.cn/
1000-9825/4420.htm [doi: 10.3724/SP. J.1001.2013.004420]