组合测试技术的研究与应用
|
摘要
软件测试横跨整个软件开发周期,并占据其工作量的40%以上。它是保证软件质量的重要手段。软件测试是为了发现软件错误而执行待测软件的过程,它精心选择不同的测试用例生成技术生成一些测试用例,然后用这些测试用例运行待测软件,并发现错误。在软件测试中,测试用例集规模和检错能力直接决定着软件测试的效果。因此,如何选取一个小规模高检错能力的测试用例集是软件测试的核心任务和关键课题。
组合测试技术是一种重要的测试用例生成技术,它根据待测软件系统中各种因素以及各种因素之间的相互作用对系统产生的影响,生成测试用例集。该技术能生成小规模和高检测能力的测试用例集。
本文以进一步提高组合测试技术的效果和实用性为目标对组合测试进行研究。首先,对国内外组合测试方法进行深入研究；然后,将各种组合测试方法进行比较权衡后,选取IPOG算法为研究对象进行改进和扩展。
论文的主要贡献如下：
1)针对现有t维组合测试技术在生成测试用例的过程中,一旦以某种策略选定某个参数值后,就不再改变该值的特性,提出改进。改进后的算法利用测试用例生成过程中反馈的实时信息及时处理测试用例集中冗余值,以获得更优的最终测试用例集。实验证明该算法相对其它t维组合测试算法生成的测试用例集更优。
2)针对一些应用软件中,各个输入参数之间往往存在相互依赖关系问题,对改进的组合测试算法进行扩展,并提出一种基于约束的t维组合测试算法。该算法首先计算隐含约束；然后,在每次扩展中,从未被覆盖的参数值组合集中除去约束,并在满足选择标准下,选择不构成约束的参数值填充,直至所有参数扩展完毕。实验证明该算法不仅能够有效处理输入参数之间的相互依赖关系,而且相对其它基于约束的组合测试方法能生成更优的测试用例。
3)一些实际的应用软件系统的输入参数之间的关系是非常复杂的,它们之间可能存在约束关系;可能根本没有相互关系；或者存在相互关系,但并不一定刚好是任意t个输入参数之间都存在相互关系。为了能处理更复杂的输入参数之间的关系,我们对基于约束的组合测试算法进一步扩展,并提出基于约束和输入输出关系的变强度组合测试算法。该算法根据输出参数对输入参数进行分类,并在分类的基础上生成测试用例。
因测试的最终目的是对错误进行修改,但在修改错误之前,必须要对引起错误的
组合进行定位。本文通过将输入输出关系引入基于测试数据补充生成的错误定位方法中对该方法进行改进,并提出一种基于输入输出关系的错误定位方法。基于输入输出关系的错误定位方法并不是生成测试用例所包含的每个模式,而是根据输入参数之间是否存在关系生成错误模式。实验表明,基于输入输出关系的错误定位方法提高了错误定位的准确性。
4)本文最后以C++语言编写的程序为待测对象,对基于约束和输入输出关系的变强度组合测试算法进一步扩展。扩展后的算法在生成测试用例的过程中,会考虑部分程序内部结构。因指针类型是C++语言的特征之一,指针指向信息不明确,会导致保守估计IO关系问题,最终会影响测试用例集的优越性,所以在提出基于约束和输入输出关系的变强度组合测试算法之前,提出了一种基于包含约束的指针分析方法。基于包含约束的指针分析方法通过对包含约束语言进行扩展对传统的基于包含约束的指针分析方法进行改进。改进后的指针分析法不仅降低了时间花费,同时也提高了指向信息的精确性。在指针分析的基础上,给出采用灰盒测试技术的组合测试方法。该方法通过考虑程序的部分内部结构不仅优化了测试用例集还提高了错误定位的准确性。
Software testing run through the entire software development cycle, which takes more than 40% of its workload. It is an important method to guarantee software quality. Software testing is a process that aims to find the error of software and execute software under test(SUT) it chooses different test case generation carefully strategies in order to generate test cases, then uses these test cases to find errors. In software testing process, the scale and the detection error ability of test suite determine the software testing effect directly. Therefore, how to choose a small scale and high error detection ability test suite is the core and key subject to software testing.
Combinatorial testing strategy is an important test case generation technology, which impact to the system according to the the interaction among several input parameters of SUT and tests the SUT effectively with smaller test suite. The stragety can generate small-scale and high detection ability test suite.
The aim of this thesis is to further improve the effect and practical applicatiable of combinatorial testing. Firstly, we make the futher study of the domestic and international combinatorial testing strategies. Then, we compare various strategeties, and select IPOG as our research object.
The main contributions are as follows.
1) In all existing combinatorial tesing strategies, once a parameter value was selected, the strategies just take it as the best choice, and no longer change it in the later extention process. On this occasion, we present a new combinatorial testing strategy. The strategy uses real-time feedback information of test case generation process to handle redundancy value timely, and get more optimal test suite. We also prove the validity of the algorithm by experiments.
2) In some practical software systems, input parameters depends on each other, so we extend the improved algorithm and present a algorithm based on constrained combainatorial testing. The algorithm computes implied constraints firstly; then, removes constraints from uncovered combination set in each extension, and selects parameter values that not consitute a constraint until all the parameters extension ends. Experiment results demonstrate that this algorithm can not only handle the relationships among input parameters effectively but also generate more optimal test cases than other method based on constrained combinatorial testing.
3) In some practical software systems, the interaction of input parameters may be very complicated and the strength of these interactions may be different, it is not always having interactions among any t input parameters; or there may be some interactions among input parameters more than t-way. In order to handle the complicated interactions, we make the further improve of the algorithm based on constrained combinatorial testing and present a variable strength combinatorial testing algorithm based on constraint and input/output (IO) relationship. The algorithm sorts the imput parameters according to the output parameters, and generates the test cases based on the classification.
The ultimate goal of testing is to revise the errors, but the first thing is locating the combinations that induce errors before the revision. We improve a test data supplement generated based error localization method, and propose a new error localization method. This method generates error modes according to IO relationship, rather than generating all error modes for each test case. Experiments show that the method improves the efficiency of error location.
4) In the end of the thesis, we select programs that are written in c++ language as our research object, and make the further extention of the variable strength combinatorial testing based on constraint and input/output (IO) relationship. Because pointer is one of the characteristics of the C++ language, points-to information unclear leads to conservative estimate of IO relationships, further affects the accuracy of them. So we propose a method to get accurate points-to information. The method improves the inclusion-based pointer analysis method by extending the language of inclusion constraints. Experimental results show that this method can analyzes points-to information accurately at any level. On the basis of pointer analysis, we give a combinatorial testing method that is using gray box testing strategy. The method considers part internal structures of SUT when generates test cases, which optimizes the test suite and also improves the error location ability.
组合测试技术是一种重要的测试用例生成技术,它根据待测软件系统中各种因素以及各种因素之间的相互作用对系统产生的影响,生成测试用例集。该技术能生成小规模和高检测能力的测试用例集。
本文以进一步提高组合测试技术的效果和实用性为目标对组合测试进行研究。首先,对国内外组合测试方法进行深入研究；然后,将各种组合测试方法进行比较权衡后,选取IPOG算法为研究对象进行改进和扩展。
论文的主要贡献如下：
1)针对现有t维组合测试技术在生成测试用例的过程中,一旦以某种策略选定某个参数值后,就不再改变该值的特性,提出改进。改进后的算法利用测试用例生成过程中反馈的实时信息及时处理测试用例集中冗余值,以获得更优的最终测试用例集。实验证明该算法相对其它t维组合测试算法生成的测试用例集更优。
2)针对一些应用软件中,各个输入参数之间往往存在相互依赖关系问题,对改进的组合测试算法进行扩展,并提出一种基于约束的t维组合测试算法。该算法首先计算隐含约束；然后,在每次扩展中,从未被覆盖的参数值组合集中除去约束,并在满足选择标准下,选择不构成约束的参数值填充,直至所有参数扩展完毕。实验证明该算法不仅能够有效处理输入参数之间的相互依赖关系,而且相对其它基于约束的组合测试方法能生成更优的测试用例。
3)一些实际的应用软件系统的输入参数之间的关系是非常复杂的,它们之间可能存在约束关系;可能根本没有相互关系；或者存在相互关系,但并不一定刚好是任意t个输入参数之间都存在相互关系。为了能处理更复杂的输入参数之间的关系,我们对基于约束的组合测试算法进一步扩展,并提出基于约束和输入输出关系的变强度组合测试算法。该算法根据输出参数对输入参数进行分类,并在分类的基础上生成测试用例。
因测试的最终目的是对错误进行修改,但在修改错误之前,必须要对引起错误的
组合进行定位。本文通过将输入输出关系引入基于测试数据补充生成的错误定位方法中对该方法进行改进,并提出一种基于输入输出关系的错误定位方法。基于输入输出关系的错误定位方法并不是生成测试用例所包含的每个模式,而是根据输入参数之间是否存在关系生成错误模式。实验表明,基于输入输出关系的错误定位方法提高了错误定位的准确性。
4)本文最后以C++语言编写的程序为待测对象,对基于约束和输入输出关系的变强度组合测试算法进一步扩展。扩展后的算法在生成测试用例的过程中,会考虑部分程序内部结构。因指针类型是C++语言的特征之一,指针指向信息不明确,会导致保守估计IO关系问题,最终会影响测试用例集的优越性,所以在提出基于约束和输入输出关系的变强度组合测试算法之前,提出了一种基于包含约束的指针分析方法。基于包含约束的指针分析方法通过对包含约束语言进行扩展对传统的基于包含约束的指针分析方法进行改进。改进后的指针分析法不仅降低了时间花费,同时也提高了指向信息的精确性。在指针分析的基础上,给出采用灰盒测试技术的组合测试方法。该方法通过考虑程序的部分内部结构不仅优化了测试用例集还提高了错误定位的准确性。
Software testing run through the entire software development cycle, which takes more than 40% of its workload. It is an important method to guarantee software quality. Software testing is a process that aims to find the error of software and execute software under test(SUT) it chooses different test case generation carefully strategies in order to generate test cases, then uses these test cases to find errors. In software testing process, the scale and the detection error ability of test suite determine the software testing effect directly. Therefore, how to choose a small scale and high error detection ability test suite is the core and key subject to software testing.
Combinatorial testing strategy is an important test case generation technology, which impact to the system according to the the interaction among several input parameters of SUT and tests the SUT effectively with smaller test suite. The stragety can generate small-scale and high detection ability test suite.
The aim of this thesis is to further improve the effect and practical applicatiable of combinatorial testing. Firstly, we make the futher study of the domestic and international combinatorial testing strategies. Then, we compare various strategeties, and select IPOG as our research object.
The main contributions are as follows.
1) In all existing combinatorial tesing strategies, once a parameter value was selected, the strategies just take it as the best choice, and no longer change it in the later extention process. On this occasion, we present a new combinatorial testing strategy. The strategy uses real-time feedback information of test case generation process to handle redundancy value timely, and get more optimal test suite. We also prove the validity of the algorithm by experiments.
2) In some practical software systems, input parameters depends on each other, so we extend the improved algorithm and present a algorithm based on constrained combainatorial testing. The algorithm computes implied constraints firstly; then, removes constraints from uncovered combination set in each extension, and selects parameter values that not consitute a constraint until all the parameters extension ends. Experiment results demonstrate that this algorithm can not only handle the relationships among input parameters effectively but also generate more optimal test cases than other method based on constrained combinatorial testing.
3) In some practical software systems, the interaction of input parameters may be very complicated and the strength of these interactions may be different, it is not always having interactions among any t input parameters; or there may be some interactions among input parameters more than t-way. In order to handle the complicated interactions, we make the further improve of the algorithm based on constrained combinatorial testing and present a variable strength combinatorial testing algorithm based on constraint and input/output (IO) relationship. The algorithm sorts the imput parameters according to the output parameters, and generates the test cases based on the classification.
The ultimate goal of testing is to revise the errors, but the first thing is locating the combinations that induce errors before the revision. We improve a test data supplement generated based error localization method, and propose a new error localization method. This method generates error modes according to IO relationship, rather than generating all error modes for each test case. Experiments show that the method improves the efficiency of error location.
4) In the end of the thesis, we select programs that are written in c++ language as our research object, and make the further extention of the variable strength combinatorial testing based on constraint and input/output (IO) relationship. Because pointer is one of the characteristics of the C++ language, points-to information unclear leads to conservative estimate of IO relationships, further affects the accuracy of them. So we propose a method to get accurate points-to information. The method improves the inclusion-based pointer analysis method by extending the language of inclusion constraints. Experimental results show that this method can analyzes points-to information accurately at any level. On the basis of pointer analysis, we give a combinatorial testing method that is using gray box testing strategy. The method considers part internal structures of SUT when generates test cases, which optimizes the test suite and also improves the error location ability.
引文
[1]Myers G.J. The Art of Software Testing[M]. Wiley Interscience, New York.1979:12-15
[2]GoodEnough J.B.,Gerhart S.L.Toward a Theory of Test Data Selection. IEEE Transactions on Software Engineering[J],1975,1(2):156-173
[3]Huang J C. An Approach to Program Testing[J]. ACM Computing Surveys,1975,7(3):113-128
[4]Huang J C. Program Instrumentation and Software Testing[C].IEEE Computer Society,1978,11(4):25-32
[5]Mandl R.Orthogonal Latin Squares:An application of experimental design to compiler testing[J].Communications of the ACM,1985,28 (10):1054-1058.
[6]Cohen D M,Dalal S R,Fredman M L,et al.The AETG System:An Approach to Testing Based on Combinatorial Design[J]. IEEE Transactions on Software Engineering,1997,23(7):437-444
[7]Sherwood G. Effective Testing of Factor Combinations [C]. The Third International Conference on Software Testing,Analysis and Review.1994
[8]Tung Y W,Aldiwan W S.Automating Test Case Generation for the New Generation Mission Software System[C]. IEEE Arospace Conference.2000:431-437
[9]Colbourn C J,Cohen M B,Turban R C.A Deterministic Density Algorithm for Pairwise Interaction Coverage[C]. IASTED International Conference on Software Engineering.2004:345-352
[10]Y. Lei and K.C. Tai. In-Parameter-Order:A Test Generation Strategy for Pairwise Testing[C]. Proc. of the 3rd IEEE International High-Assurance Systems Engineering Symposium.Washington, DC, USA.1998:254-261.
[11]Y. Lei and K. C. Tai. In-Parameter-Order:A Test Generating Strategy for Pairwise Testing[C]. IEEE Transaction on Software Engineering.2002,28 (1):1-3.
[12]Y. Lei, R. Kacker, D.R. Kuhn, V. Okun, and J.Lawrence. IPOG:A General Strategy for t-way Software Testing[C]. Proc. of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems.2007:549-556.
[13]Schroeder P J and Korel B. Black-box Test Reduction Using Input-output Analysis [C]. In:Proceedings of the International Symposium on Software Testing and Analysis (ISSTA'00), Portland, Oregon, Aug,2000:21-22.
[14]Schoeder P J, Black-box Test Reduction Using Input-output Analysis[D]. Ph.D. Thesis, Department of Computer Science, Illinois Institute of Technology, Chicago, IL/USA,2001.
[15]Schroeder P J, Faherty P, Korel B. Generating Expected Results for Automated Black-box Testing[C]. In:Proceedings of 17th IEEE International Conference on Automated Software Engineering (ASE'02).2002:139-148
[16]Cheng C, Dumitrescu A, Schroeder P J. Generating Small Combinatorial Test Suites to Cover Input-output Relationships[C]. In:Proceedings of Third International Conference on Quality Software,2003:76-82.
[17]Nie Changhai, Xu Baowen, Shi Liang, et al. Automatictest Generation for N-way Combinatorial Testing[C].LNCS3712:Proceedings of Second International Workshop onSoftware Quality (SOQUA2005), Erfurt, Germany, September 20-22,2005:203-211.
[18]徐宝文,聂长海,史亮,等.一种基于组合测试的软件故障调试方法[J].计算机学报,2006,29(1)：132-138.
[19]史亮,聂长海,徐宝文.基于解空间树的组合测试数据生成[J].计算机学报,2006,29(6)：849-857.
[20]聂长海,徐宝文,史亮.一种新的二水平多因素系统两两组合覆盖测试数据生成算法[J].计算机学报,2006,29(6)：841-848.
[21]王子元,聂长海,徐宝文,等.相邻因素组合测试用例集的最优生成方法[J].计算机学报,2007,30(2)：200-211.
[22]Wang Ziyuan, Nie Changhai, Xu Baowen.Generating Combinatorial Test Suite for Interaction Relationship[C]. Proceeding of 4th International Workshop on SoftwareQuality Assurance (SOQUA 2007), Dubrovnik, Croatia, September 3-4,2007:55-61.
[23]Jangbok Kim, Kyunghee Choi, Daniel M.Hoffman, Gihyun Jung.White Box Pairwise Test Case Generation[C]. Seventh International Conference on Quality Software (QSIC 2007),11-12 Oct.2007:286-291
[24]Cohen M B, Gibbons P B, Mugridge W B, et al. Constructing Test Suites for Interaction Testing[C]. Proceeding of the 25th International Conference on Software Engineering (ICSE2003), Portland, Oregon, USA, May 3-10,2003: 38-48.
[25]Cohen M B, Gibbons P B, Mugridge W B, et al. Variable Strength Interaction Testing of Components[C]. Proceedings of 27th Annual International Computer Software and Applications Conference (COMPSAC2003), Dallas, TX, USA, 2003:413-418.
[26]Kuhn D.R., Reilly M.J.An Investigation of the Applicability of Design of Experiments to Software Testing[C]. In:Proceedings of the 27th Annual NASA/IEEE Software Engineering Workshop(SEW).Los Alamitos:IEEE Press,2002:91-95.
[27]Kuhn D. R., WallaceD. R., Gallo A. M.. Software Fault Interactions and Implications for Software Testing[J], IEEE Transaction on Software Engineering, 30(6), IEEEComputer Society,2004:418-421.
[28]Lars Ole Andersen. Program Analysis and Specialization for the C programming Language [D]. PhD thesis, DIEM, University of Copenhagen,1994.
[29]Manuel Faehndrich, Jeffrey S. Foster, Zhendong Su, and Alexander Aiken. Partial Online Cycle Elimination in Inclusion Constraint Graphs[C]. In Proceedings of the ACM Conference on Programming Language Design and Implementation,1998:85-96.
[30]Nevin Heintze and Olivier Tardieu. Ultra-fast Aliasing Analysis Using cla:A Million Lines of C Code in a Second[C]. In Proceedings of the ACM Conference on Programming Language Design and Implementation.2001:254-263.
[31]David J. Pearce, Paul H. J. Kelly, and Chris Hankin. Online Cycle Detection and Difference Propagation for Pointer Analysis[C]. In.3rd International IEEE Workshop on Source Code Analysis and Manipulation,2003:3-12.
[32]David J. Pearce, Paul H. J. Kelly, and Chris Hankin. Efficient Field-Sensitive Pointer Analysis for C[C]. In ACM Workshop on Program Analysis for Software Tools and Engineering,2004:37-42.
[33]David J. Pearce, Paul H. J. Kelly. A Dynamic Topological Sort Algorithm for Directed Acyclic Graphs[C]. Journal of Experimental Algorithmics.2006:1-7.
[34]Hardekopf B and Lin C. The Ant and the Grasshopper:Fast and Accurate Pointer Analysis for Millions of Lines of Code[C]. In Proceedings of the ACM Conference on Programming Language Design and Implementation.2007: 290-299.
[35]Seroussi G, Bshouty N H.Vector Sets for Exhaustive Testing of Logic Circuits[J]. IEEE Transactions on Information Theory,1988,34(3):513-522.
[36]Williams A W, Probert R L.Formulation of the Interaction Test Coverage Problem as an Integer Program[C]. Proceedings of 14th International Conference on the Testing of Communicating Systems, Berlin, Germany.2002:283-298.
[37]P. J. Schroeder, Pankaj Bolaki, and Vijayram Gopu. Comparing the Fault Detection Effectiveness of N-way and Random Test Suites[C]. In Proceedings of the IEEE International Symposium on Empirical Software Engineering,2004: 49-59.
[38]Younis, M.I., Zamli, K.Z., Isa, N.A,M. Algebraic Strategy to Generate Pairwise Test Set for Prime Number Parameters and Variables. International Symposium on Information Technology 2008.2008:1-4.
[39]Hedayat A,Sloane N,Stufken J.Orthogonal Arrays:Theory and Applications [M].Springer-Verlag,1999;
[40]Sloane NJA. A Library of Orthogonal Arrays.http://www.research.att.com/-njas/oadir/index.html
[41]Yan J, Zhang J.A Backtracking Search Tool for Constructing Combinatorial Test Suites[J].The Journal of Systems and Software.2008,81(10):1681-1693.
[42]Ma F, Zhang J.Finding Orthogonal Arrays Using Satisfiability Checkers and Symmetry Breaking Constraints[C]. In:Ho TB,Zhou ZH,eds.Proc.of the 10th Pacific Rim Int'l Conf.on Artificial Intelligence (PRICAI 2008). LNAI 5351,Berlin/Heidelberg:Springer-Verlag.2008:247-259.
[43]Kobayashi, N., Tsuchiya, T., Kikuno, T.:Non-specification-based Approaches TologicTesting for Software[J]. Journal of Information and Software Technology 2002,44(2):113-121.
[44]Hartman A, L. Raskin. Problems and Algorithms for Covering Arrays. Discrete Mathematics[J].2004,284(1/3):149-156.
[45]Hartman A. Software and Hardware Testing Using Combinatorial Covering Suites[J]. In Graph Theory, Combinatorics and Algorithms:Interdisciplinary Applications,2005:327-266.
[46]Williams A. W., Probert R. L.. A Measure for Component Interaction Test Coverage[C]. In Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications, Los Alamitos, CA, October 2001:301-311
[47]G. Sherwood. Testcover.com.http://testcover.com/pub/constex.php,2006.
[48]Brownlie R, Prowse J, Phadke M. Robust Testing of AT&TPMX/Star Mail Using OATS[J].AT&T Technical Journal.1992,3 (71):41-47.
[49]Williams A W. Determination of Test Configurations for Pair-wise Interaction Coverage[C]. The 13th International Conference on the Testing of Communicating Systems.2000:59-74
[50]Williams A W.Software Component Interaction Testing:Coverage Measurement and Generation of Configurations[D].Ottawa-Carleton Institute for Computer Science, School of Information Technology and Engineering, University of Ottawa, Canada,2002.
[51]Kobayashi N, Tsuchiya T, Kikuno T.A New Method for Constructing Pair-wise Covering Designs for Software testing[J]. Information Processing Letters,2002, 81 (2):85-91.
[52]Sloane N.Covering Arrays and Intersecting Codes[J]. Journal of combinatorial Designs,1993,1 (1):51-63
[53]Bryce R C, Colbourn C J.The Density Algorithm for Pairwise Interaction Testing[J]. Software Testing,Verification and Reliability,2007.17(3):159-182.
[54]Czerwonka J. Pairwise Testing in Real World:Practical Extensions to Test Case Generator[C]. InProc. Of 24th Pacific Northwest Software Quality Conf, Portland, Oregon, USA,2006:419-430.
[55]Kuhn R, Lei Y, Kacker R. Practical Combinatorial Testing:Beyond Pairwise[J].ITProfessional,2008,10(3):19-23.
[56]Nurmela KH. Upper Bounds for Covering Arrays by Tabu Search[J]. Discrete Applied Mathematics.2004,138(9):143-152
[57]Shiba T, Tsuchiya T, Kikuno T. Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing[C]. Proc of the IEEE Annual Int'l Computer Software and Applications Conf.2004:72-77
[58]Bryce R C, Colbourn C J.One-test-at-a-time Heuristicsearch for Interaction Test Suites[C]. Proceedings of 9thAnnual Conference on Genetic and Evolutionary Computation (GECCO2007), London, England, United Kingdom, July 7-11, 2007:1082-1089.
[59]Wallace, D.R.Kuln. Failure Modes in Medical Device Softwre:An Analysis of 15 years of Recall Data [J]. International Journal of Reliability, Quality and Safety Engineering.2001,8(4):351-371.
[60]TConfig,http://www.site.uottawa.ca/～awilliam/.
[61]Jenny:http://burtleburtle.net/bob/math/jenny.html
[62]Andrea Calvagna, Angelo Gargantini.A Logic-Based Approach to Combinatorial Testing with Constraints[C]. LNCS 4966,2008:66-83
[63]Grindal M, Offutt J, Mellin J.Handling Constraints in theInput Space When Using Combination Strategies for Software Testing, Technical Report HS-I KI-TR-06-01 [R]. School of Humanities and Informatics, University of Skovde, January 27,2006.
[64]Alan W. Williams and Robert L. Probert. A Practical Strategy for Testing Pair-wise Coverage of Network Interfaces[C]. In Proceedings of the 7th International Symposium on Software Reliability Engineering (ISSRE 96), White Plains, New York, USA,1996:246-254.
[65]Bryce R C, Colbourn C J.Prioritized InteractionTesting for Pair-wise Coverage with Seeding and Constraints [J]. Information and Software Technology,2006, 48 (10):960-970.
[66]Cohen M B, Dwyer M B, Shi Jiangfan.Interaction Testing of Highly-configurable Systems in the Presence of Constraints[C]. Proceedings of the International Symposium on Software Testing and Analysis (ISSTA2007) London, England, United Kingdom, July 9-12,2007:129-139.
[67]Renieris M, Reiss S P.Fault Location with Nearest Neighbor Ueries[C]. Proceedings of 18th IEEE International Conference on Automated Software Engineering (ASE 2003), October 6-10,2003:30-39.
[68]Calvagna, A., Gargantini, A., IPO-s:Incremental Generation of Combinatorial Interaction Test Data Based on Symmetries of Covering Arrays[C]. International Conference on Software Testing, Verification and Validation Workshops,2009. 2009:10-18.
[69]王子元,徐宝文,聂长海.组合测试用例生成技术[J].计算机科学与探索.2008,2(6)：571-588.
[70]X. Chen, Q. Gu, A. Li, and D. Chen, Variable Strength InteractionTesting with an Ant Colony System Approach[C]. In Proc. of the AsiaPacific Software Eng. Conf.2009 (APSEC 2009),2009:160-167.
[71]Michael Ellims, Darrel Ince, and Marian Petre. The Effectiveness of T-Way Test Data Generation[C]. In Proc.27th Int. Con. Computer Safety, Reliability, and Security, Sept.22-25,2008:16-29.
[72]Ghazi S A, Ahmed M A.Pair-wise Test Coverage Using Genetic Algorithms[C]. Proceedings of 2003 Congress on Evolutionary Computation (CEC2003) Canberra, Australia, December 8-12,2003:1420-1424.
[73]Xiao Qu, Cohen, M.B., Woolf, K.M. Combinatorial Interaction Regreesion Testing:A Study of Test Case Generation and Prioritization[C]. International Conference on Software Maintenance.2007:255-264.
[74]Barrett, A., Dvorak, D. A Combinatorial Test Suite Generatior for Gray-Box Testing[C]. Third IEEE International Conference on Space Mission Challenges for Information Technology.2009:387-393.
[75]Younis, M.I., Zamli, K.Z., Isa, N.A.M. Generating pairwise Combinatorial Test Set Using Artificial Parameters and Values[C]. International Symposium on Information Technology.2008,3:1-8
[76]Tian Pei, Wang Jiancheng, Xi Xiaojing, Li Yingmei. A Method of Combinatorial Test Cases Generating Based on CMA-PGA Model[C].20102nd International Conference on Industrial and Information.2010,2:249-251.
[77]J. Arshem, Test Vector Generator Tool (TVG), http://sourceforge.net/ projects/tvg.
[78]聂长海,徐宝文,史亮,陈火旺,一种基于组合测试的软件故障调试方法[J],计算机学报,2006,29(1)：124-131
[79]ChanghaiNie, BaowenXu, LinagShi, An Algorihtm of Fualt Diganosis Based on Combinatorial Design Approach for Testing[J], Jounral of Elecrtonics,2003, 20(3):224-226
[80]史亮.测试数据自动生成技术研究[D].东南大学学位论文.2006
[81]Korel B. The Program Dependence Graph in Static Program Testing[J]. Inform. Processing Let.1987,24(2):103-108
[82]Ferguson R., Korel B.. The Chaining Approach for Software Test Data Generation[J].ACM Transactions on Software Engineering and Methodology. 1996,5(1):63-86
[83]David J. Pearce, Paul H. J. Kelly, and Chris Hankin, Efficient Field-Sensitive Pointer Analysis for C[C]. In ACM Workshop on Program Analysis for Software Tools and Engineering,2004:37-42.
[84]Ben Hardekopf, Calvin Lin, The Ant and the Grasshopper:Fast and Accurate Pointer Analysis for Millions of Lines of Code[C].In Proceedings of the ACM Conference on Programming Language Design and Implementation. 2007:290-299.
[85]Aiken, Set constraints:Results, Applications, and Future Directions[C].In Proceedings of the Workshop on Principles and Practice of Constraint Programming (PPCP). Lecture Notes in Computer Science.1994,874:326-335.
[86]Manuel Faehndrich, Jeffrey S. Foster, Zhendong Su, and Alexander Aiken, Partial Online Cycle Elimination in Inclusion Constraint Graphs[C], In Proceedings of the ACM Conference on Programming Language Design and Implementation,1998:85-96.
[87]Wang Ziyuan, Xu Baowen, Nie Changhai. Greedy Heuristic Algorithms to Generate Variable Strength Combinational Test Suite[C]. The Eighth International Conference on Quality Software.2008:155-160
[88]Lars Ole Andersen, Program Analysis and Specialization for The C Programming Language[D], PhD thesis, DIEM, University of Copenhagen,1994.
[89]Rountev and Chandra, Off-line Variable Substitution for Scaling Points-to Analysis[C], In Proceedings of the ACM Conference on Programming Language Design and Implementation,2000:47-56.
[90]R. P. Wilson and M. S. Lam. Efficient Context-sensitive Pointer Analysis for C Programs[C]. In Proceedings of PLDI 1995,1995:1-12..
[91]Robert Tarjan, Depth-first Search and Linear Graph Algorithms[J], SIAM Journal on Computing,1972:146-160.
[92]Aiken and Wimmers, Type Inclusion Constraints and Type Inference[C], In Proceedings of the ACM Conference on Functional Programming Languages and Computer Architecture (FPCA, ACM, New York,1993:31-41.
[93]Ramalingam, The Undecidability of Aliasing[C], ACM Transactions on Programming Languages and Systems,1994:1467-1471.
[94]Nuutila and Soisalon-soininen, On Finding The Strongly Connected Components in A Directed Graph[J], Information Processing Letters,1994:9-14.
[95]Marc Shapiro and Susan Horwitz, The Effects of The Precise of Pointer Analysis[C], Lecture Notesin Computer Science,1997,1302:16-34.
[96]Michael Hind, Pointer Analysis:Haven't We Solved This Problem Yet?[C], In Workshop on Program Analysis for Software Tools and Engineering,2001:54-61.
[97]David J. Pearce, Paul H. J. Kelly, and Chris Hankin, Online Cycle Detection and Difference Propagation for Pointer Analysis[C], In.3rd International IEEE Workshop on Source Code Analysis and Manipulation,2003:3-12.
[98]David J. Pearce, Paul H. J. Kelly, A Aynamic Topological Sort Algorithm for Directed Acyclic Graphs[C] Journal of Experimental Algorithmics,2006:1-7.
[99]黄波,臧斌宇,俞一峻,朱传琪.指针数组的过程内别名分析[J].软件学报[J],1999,10(6)：600-607.
[100]李必信.程序切片技术及其应用[M].科技出版社.2006
[101]严峻,张健.组合测试：原理与方法[J].软件学报.2009,20(6)：1393-1405.
[102]单锦辉.面向路径的测试数据自动生成方法研究[D].国防科技大学学位论文.2002
[103]Hartman, A.:Ibm Intelligent Test Case Handler:Whitch, http://www.alphaworks.ibm.com/tech/whitch
[104]TestCover Tool, http://www.testcover.com/
[105]Pereira,F.M.Q., Berlin,D.. Wave Propagation and Deep Propagation for Pointer Analysis[C]. International Symposium on Code Generation and Optimization,2009.2009:126-135
[106]ZhongXiang Chen, JinYu Zhan, ZongBo Hao. A Ner Static Pointer Dereference Detecting Method Based on Finnite-state Machine[C]. International Conference on Apperceiving Computing and Intelligence Analysis 2010. 2010:392-397
[2]GoodEnough J.B.,Gerhart S.L.Toward a Theory of Test Data Selection. IEEE Transactions on Software Engineering[J],1975,1(2):156-173
[3]Huang J C. An Approach to Program Testing[J]. ACM Computing Surveys,1975,7(3):113-128
[4]Huang J C. Program Instrumentation and Software Testing[C].IEEE Computer Society,1978,11(4):25-32
[5]Mandl R.Orthogonal Latin Squares:An application of experimental design to compiler testing[J].Communications of the ACM,1985,28 (10):1054-1058.
[6]Cohen D M,Dalal S R,Fredman M L,et al.The AETG System:An Approach to Testing Based on Combinatorial Design[J]. IEEE Transactions on Software Engineering,1997,23(7):437-444
[7]Sherwood G. Effective Testing of Factor Combinations [C]. The Third International Conference on Software Testing,Analysis and Review.1994
[8]Tung Y W,Aldiwan W S.Automating Test Case Generation for the New Generation Mission Software System[C]. IEEE Arospace Conference.2000:431-437
[9]Colbourn C J,Cohen M B,Turban R C.A Deterministic Density Algorithm for Pairwise Interaction Coverage[C]. IASTED International Conference on Software Engineering.2004:345-352
[10]Y. Lei and K.C. Tai. In-Parameter-Order:A Test Generation Strategy for Pairwise Testing[C]. Proc. of the 3rd IEEE International High-Assurance Systems Engineering Symposium.Washington, DC, USA.1998:254-261.
[11]Y. Lei and K. C. Tai. In-Parameter-Order:A Test Generating Strategy for Pairwise Testing[C]. IEEE Transaction on Software Engineering.2002,28 (1):1-3.
[12]Y. Lei, R. Kacker, D.R. Kuhn, V. Okun, and J.Lawrence. IPOG:A General Strategy for t-way Software Testing[C]. Proc. of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems.2007:549-556.
[13]Schroeder P J and Korel B. Black-box Test Reduction Using Input-output Analysis [C]. In:Proceedings of the International Symposium on Software Testing and Analysis (ISSTA'00), Portland, Oregon, Aug,2000:21-22.
[14]Schoeder P J, Black-box Test Reduction Using Input-output Analysis[D]. Ph.D. Thesis, Department of Computer Science, Illinois Institute of Technology, Chicago, IL/USA,2001.
[15]Schroeder P J, Faherty P, Korel B. Generating Expected Results for Automated Black-box Testing[C]. In:Proceedings of 17th IEEE International Conference on Automated Software Engineering (ASE'02).2002:139-148
[16]Cheng C, Dumitrescu A, Schroeder P J. Generating Small Combinatorial Test Suites to Cover Input-output Relationships[C]. In:Proceedings of Third International Conference on Quality Software,2003:76-82.
[17]Nie Changhai, Xu Baowen, Shi Liang, et al. Automatictest Generation for N-way Combinatorial Testing[C].LNCS3712:Proceedings of Second International Workshop onSoftware Quality (SOQUA2005), Erfurt, Germany, September 20-22,2005:203-211.
[18]徐宝文,聂长海,史亮,等.一种基于组合测试的软件故障调试方法[J].计算机学报,2006,29(1)：132-138.
[19]史亮,聂长海,徐宝文.基于解空间树的组合测试数据生成[J].计算机学报,2006,29(6)：849-857.
[20]聂长海,徐宝文,史亮.一种新的二水平多因素系统两两组合覆盖测试数据生成算法[J].计算机学报,2006,29(6)：841-848.
[21]王子元,聂长海,徐宝文,等.相邻因素组合测试用例集的最优生成方法[J].计算机学报,2007,30(2)：200-211.
[22]Wang Ziyuan, Nie Changhai, Xu Baowen.Generating Combinatorial Test Suite for Interaction Relationship[C]. Proceeding of 4th International Workshop on SoftwareQuality Assurance (SOQUA 2007), Dubrovnik, Croatia, September 3-4,2007:55-61.
[23]Jangbok Kim, Kyunghee Choi, Daniel M.Hoffman, Gihyun Jung.White Box Pairwise Test Case Generation[C]. Seventh International Conference on Quality Software (QSIC 2007),11-12 Oct.2007:286-291
[24]Cohen M B, Gibbons P B, Mugridge W B, et al. Constructing Test Suites for Interaction Testing[C]. Proceeding of the 25th International Conference on Software Engineering (ICSE2003), Portland, Oregon, USA, May 3-10,2003: 38-48.
[25]Cohen M B, Gibbons P B, Mugridge W B, et al. Variable Strength Interaction Testing of Components[C]. Proceedings of 27th Annual International Computer Software and Applications Conference (COMPSAC2003), Dallas, TX, USA, 2003:413-418.
[26]Kuhn D.R., Reilly M.J.An Investigation of the Applicability of Design of Experiments to Software Testing[C]. In:Proceedings of the 27th Annual NASA/IEEE Software Engineering Workshop(SEW).Los Alamitos:IEEE Press,2002:91-95.
[27]Kuhn D. R., WallaceD. R., Gallo A. M.. Software Fault Interactions and Implications for Software Testing[J], IEEE Transaction on Software Engineering, 30(6), IEEEComputer Society,2004:418-421.
[28]Lars Ole Andersen. Program Analysis and Specialization for the C programming Language [D]. PhD thesis, DIEM, University of Copenhagen,1994.
[29]Manuel Faehndrich, Jeffrey S. Foster, Zhendong Su, and Alexander Aiken. Partial Online Cycle Elimination in Inclusion Constraint Graphs[C]. In Proceedings of the ACM Conference on Programming Language Design and Implementation,1998:85-96.
[30]Nevin Heintze and Olivier Tardieu. Ultra-fast Aliasing Analysis Using cla:A Million Lines of C Code in a Second[C]. In Proceedings of the ACM Conference on Programming Language Design and Implementation.2001:254-263.
[31]David J. Pearce, Paul H. J. Kelly, and Chris Hankin. Online Cycle Detection and Difference Propagation for Pointer Analysis[C]. In.3rd International IEEE Workshop on Source Code Analysis and Manipulation,2003:3-12.
[32]David J. Pearce, Paul H. J. Kelly, and Chris Hankin. Efficient Field-Sensitive Pointer Analysis for C[C]. In ACM Workshop on Program Analysis for Software Tools and Engineering,2004:37-42.
[33]David J. Pearce, Paul H. J. Kelly. A Dynamic Topological Sort Algorithm for Directed Acyclic Graphs[C]. Journal of Experimental Algorithmics.2006:1-7.
[34]Hardekopf B and Lin C. The Ant and the Grasshopper:Fast and Accurate Pointer Analysis for Millions of Lines of Code[C]. In Proceedings of the ACM Conference on Programming Language Design and Implementation.2007: 290-299.
[35]Seroussi G, Bshouty N H.Vector Sets for Exhaustive Testing of Logic Circuits[J]. IEEE Transactions on Information Theory,1988,34(3):513-522.
[36]Williams A W, Probert R L.Formulation of the Interaction Test Coverage Problem as an Integer Program[C]. Proceedings of 14th International Conference on the Testing of Communicating Systems, Berlin, Germany.2002:283-298.
[37]P. J. Schroeder, Pankaj Bolaki, and Vijayram Gopu. Comparing the Fault Detection Effectiveness of N-way and Random Test Suites[C]. In Proceedings of the IEEE International Symposium on Empirical Software Engineering,2004: 49-59.
[38]Younis, M.I., Zamli, K.Z., Isa, N.A,M. Algebraic Strategy to Generate Pairwise Test Set for Prime Number Parameters and Variables. International Symposium on Information Technology 2008.2008:1-4.
[39]Hedayat A,Sloane N,Stufken J.Orthogonal Arrays:Theory and Applications [M].Springer-Verlag,1999;
[40]Sloane NJA. A Library of Orthogonal Arrays.http://www.research.att.com/-njas/oadir/index.html
[41]Yan J, Zhang J.A Backtracking Search Tool for Constructing Combinatorial Test Suites[J].The Journal of Systems and Software.2008,81(10):1681-1693.
[42]Ma F, Zhang J.Finding Orthogonal Arrays Using Satisfiability Checkers and Symmetry Breaking Constraints[C]. In:Ho TB,Zhou ZH,eds.Proc.of the 10th Pacific Rim Int'l Conf.on Artificial Intelligence (PRICAI 2008). LNAI 5351,Berlin/Heidelberg:Springer-Verlag.2008:247-259.
[43]Kobayashi, N., Tsuchiya, T., Kikuno, T.:Non-specification-based Approaches TologicTesting for Software[J]. Journal of Information and Software Technology 2002,44(2):113-121.
[44]Hartman A, L. Raskin. Problems and Algorithms for Covering Arrays. Discrete Mathematics[J].2004,284(1/3):149-156.
[45]Hartman A. Software and Hardware Testing Using Combinatorial Covering Suites[J]. In Graph Theory, Combinatorics and Algorithms:Interdisciplinary Applications,2005:327-266.
[46]Williams A. W., Probert R. L.. A Measure for Component Interaction Test Coverage[C]. In Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications, Los Alamitos, CA, October 2001:301-311
[47]G. Sherwood. Testcover.com.http://testcover.com/pub/constex.php,2006.
[48]Brownlie R, Prowse J, Phadke M. Robust Testing of AT&TPMX/Star Mail Using OATS[J].AT&T Technical Journal.1992,3 (71):41-47.
[49]Williams A W. Determination of Test Configurations for Pair-wise Interaction Coverage[C]. The 13th International Conference on the Testing of Communicating Systems.2000:59-74
[50]Williams A W.Software Component Interaction Testing:Coverage Measurement and Generation of Configurations[D].Ottawa-Carleton Institute for Computer Science, School of Information Technology and Engineering, University of Ottawa, Canada,2002.
[51]Kobayashi N, Tsuchiya T, Kikuno T.A New Method for Constructing Pair-wise Covering Designs for Software testing[J]. Information Processing Letters,2002, 81 (2):85-91.
[52]Sloane N.Covering Arrays and Intersecting Codes[J]. Journal of combinatorial Designs,1993,1 (1):51-63
[53]Bryce R C, Colbourn C J.The Density Algorithm for Pairwise Interaction Testing[J]. Software Testing,Verification and Reliability,2007.17(3):159-182.
[54]Czerwonka J. Pairwise Testing in Real World:Practical Extensions to Test Case Generator[C]. InProc. Of 24th Pacific Northwest Software Quality Conf, Portland, Oregon, USA,2006:419-430.
[55]Kuhn R, Lei Y, Kacker R. Practical Combinatorial Testing:Beyond Pairwise[J].ITProfessional,2008,10(3):19-23.
[56]Nurmela KH. Upper Bounds for Covering Arrays by Tabu Search[J]. Discrete Applied Mathematics.2004,138(9):143-152
[57]Shiba T, Tsuchiya T, Kikuno T. Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing[C]. Proc of the IEEE Annual Int'l Computer Software and Applications Conf.2004:72-77
[58]Bryce R C, Colbourn C J.One-test-at-a-time Heuristicsearch for Interaction Test Suites[C]. Proceedings of 9thAnnual Conference on Genetic and Evolutionary Computation (GECCO2007), London, England, United Kingdom, July 7-11, 2007:1082-1089.
[59]Wallace, D.R.Kuln. Failure Modes in Medical Device Softwre:An Analysis of 15 years of Recall Data [J]. International Journal of Reliability, Quality and Safety Engineering.2001,8(4):351-371.
[60]TConfig,http://www.site.uottawa.ca/～awilliam/.
[61]Jenny:http://burtleburtle.net/bob/math/jenny.html
[62]Andrea Calvagna, Angelo Gargantini.A Logic-Based Approach to Combinatorial Testing with Constraints[C]. LNCS 4966,2008:66-83
[63]Grindal M, Offutt J, Mellin J.Handling Constraints in theInput Space When Using Combination Strategies for Software Testing, Technical Report HS-I KI-TR-06-01 [R]. School of Humanities and Informatics, University of Skovde, January 27,2006.
[64]Alan W. Williams and Robert L. Probert. A Practical Strategy for Testing Pair-wise Coverage of Network Interfaces[C]. In Proceedings of the 7th International Symposium on Software Reliability Engineering (ISSRE 96), White Plains, New York, USA,1996:246-254.
[65]Bryce R C, Colbourn C J.Prioritized InteractionTesting for Pair-wise Coverage with Seeding and Constraints [J]. Information and Software Technology,2006, 48 (10):960-970.
[66]Cohen M B, Dwyer M B, Shi Jiangfan.Interaction Testing of Highly-configurable Systems in the Presence of Constraints[C]. Proceedings of the International Symposium on Software Testing and Analysis (ISSTA2007) London, England, United Kingdom, July 9-12,2007:129-139.
[67]Renieris M, Reiss S P.Fault Location with Nearest Neighbor Ueries[C]. Proceedings of 18th IEEE International Conference on Automated Software Engineering (ASE 2003), October 6-10,2003:30-39.
[68]Calvagna, A., Gargantini, A., IPO-s:Incremental Generation of Combinatorial Interaction Test Data Based on Symmetries of Covering Arrays[C]. International Conference on Software Testing, Verification and Validation Workshops,2009. 2009:10-18.
[69]王子元,徐宝文,聂长海.组合测试用例生成技术[J].计算机科学与探索.2008,2(6)：571-588.
[70]X. Chen, Q. Gu, A. Li, and D. Chen, Variable Strength InteractionTesting with an Ant Colony System Approach[C]. In Proc. of the AsiaPacific Software Eng. Conf.2009 (APSEC 2009),2009:160-167.
[71]Michael Ellims, Darrel Ince, and Marian Petre. The Effectiveness of T-Way Test Data Generation[C]. In Proc.27th Int. Con. Computer Safety, Reliability, and Security, Sept.22-25,2008:16-29.
[72]Ghazi S A, Ahmed M A.Pair-wise Test Coverage Using Genetic Algorithms[C]. Proceedings of 2003 Congress on Evolutionary Computation (CEC2003) Canberra, Australia, December 8-12,2003:1420-1424.
[73]Xiao Qu, Cohen, M.B., Woolf, K.M. Combinatorial Interaction Regreesion Testing:A Study of Test Case Generation and Prioritization[C]. International Conference on Software Maintenance.2007:255-264.
[74]Barrett, A., Dvorak, D. A Combinatorial Test Suite Generatior for Gray-Box Testing[C]. Third IEEE International Conference on Space Mission Challenges for Information Technology.2009:387-393.
[75]Younis, M.I., Zamli, K.Z., Isa, N.A.M. Generating pairwise Combinatorial Test Set Using Artificial Parameters and Values[C]. International Symposium on Information Technology.2008,3:1-8
[76]Tian Pei, Wang Jiancheng, Xi Xiaojing, Li Yingmei. A Method of Combinatorial Test Cases Generating Based on CMA-PGA Model[C].20102nd International Conference on Industrial and Information.2010,2:249-251.
[77]J. Arshem, Test Vector Generator Tool (TVG), http://sourceforge.net/ projects/tvg.
[78]聂长海,徐宝文,史亮,陈火旺,一种基于组合测试的软件故障调试方法[J],计算机学报,2006,29(1)：124-131
[79]ChanghaiNie, BaowenXu, LinagShi, An Algorihtm of Fualt Diganosis Based on Combinatorial Design Approach for Testing[J], Jounral of Elecrtonics,2003, 20(3):224-226
[80]史亮.测试数据自动生成技术研究[D].东南大学学位论文.2006
[81]Korel B. The Program Dependence Graph in Static Program Testing[J]. Inform. Processing Let.1987,24(2):103-108
[82]Ferguson R., Korel B.. The Chaining Approach for Software Test Data Generation[J].ACM Transactions on Software Engineering and Methodology. 1996,5(1):63-86
[83]David J. Pearce, Paul H. J. Kelly, and Chris Hankin, Efficient Field-Sensitive Pointer Analysis for C[C]. In ACM Workshop on Program Analysis for Software Tools and Engineering,2004:37-42.
[84]Ben Hardekopf, Calvin Lin, The Ant and the Grasshopper:Fast and Accurate Pointer Analysis for Millions of Lines of Code[C].In Proceedings of the ACM Conference on Programming Language Design and Implementation. 2007:290-299.
[85]Aiken, Set constraints:Results, Applications, and Future Directions[C].In Proceedings of the Workshop on Principles and Practice of Constraint Programming (PPCP). Lecture Notes in Computer Science.1994,874:326-335.
[86]Manuel Faehndrich, Jeffrey S. Foster, Zhendong Su, and Alexander Aiken, Partial Online Cycle Elimination in Inclusion Constraint Graphs[C], In Proceedings of the ACM Conference on Programming Language Design and Implementation,1998:85-96.
[87]Wang Ziyuan, Xu Baowen, Nie Changhai. Greedy Heuristic Algorithms to Generate Variable Strength Combinational Test Suite[C]. The Eighth International Conference on Quality Software.2008:155-160
[88]Lars Ole Andersen, Program Analysis and Specialization for The C Programming Language[D], PhD thesis, DIEM, University of Copenhagen,1994.
[89]Rountev and Chandra, Off-line Variable Substitution for Scaling Points-to Analysis[C], In Proceedings of the ACM Conference on Programming Language Design and Implementation,2000:47-56.
[90]R. P. Wilson and M. S. Lam. Efficient Context-sensitive Pointer Analysis for C Programs[C]. In Proceedings of PLDI 1995,1995:1-12..
[91]Robert Tarjan, Depth-first Search and Linear Graph Algorithms[J], SIAM Journal on Computing,1972:146-160.
[92]Aiken and Wimmers, Type Inclusion Constraints and Type Inference[C], In Proceedings of the ACM Conference on Functional Programming Languages and Computer Architecture (FPCA, ACM, New York,1993:31-41.
[93]Ramalingam, The Undecidability of Aliasing[C], ACM Transactions on Programming Languages and Systems,1994:1467-1471.
[94]Nuutila and Soisalon-soininen, On Finding The Strongly Connected Components in A Directed Graph[J], Information Processing Letters,1994:9-14.
[95]Marc Shapiro and Susan Horwitz, The Effects of The Precise of Pointer Analysis[C], Lecture Notesin Computer Science,1997,1302:16-34.
[96]Michael Hind, Pointer Analysis:Haven't We Solved This Problem Yet?[C], In Workshop on Program Analysis for Software Tools and Engineering,2001:54-61.
[97]David J. Pearce, Paul H. J. Kelly, and Chris Hankin, Online Cycle Detection and Difference Propagation for Pointer Analysis[C], In.3rd International IEEE Workshop on Source Code Analysis and Manipulation,2003:3-12.
[98]David J. Pearce, Paul H. J. Kelly, A Aynamic Topological Sort Algorithm for Directed Acyclic Graphs[C] Journal of Experimental Algorithmics,2006:1-7.
[99]黄波,臧斌宇,俞一峻,朱传琪.指针数组的过程内别名分析[J].软件学报[J],1999,10(6)：600-607.
[100]李必信.程序切片技术及其应用[M].科技出版社.2006
[101]严峻,张健.组合测试：原理与方法[J].软件学报.2009,20(6)：1393-1405.
[102]单锦辉.面向路径的测试数据自动生成方法研究[D].国防科技大学学位论文.2002
[103]Hartman, A.:Ibm Intelligent Test Case Handler:Whitch, http://www.alphaworks.ibm.com/tech/whitch
[104]TestCover Tool, http://www.testcover.com/
[105]Pereira,F.M.Q., Berlin,D.. Wave Propagation and Deep Propagation for Pointer Analysis[C]. International Symposium on Code Generation and Optimization,2009.2009:126-135
[106]ZhongXiang Chen, JinYu Zhan, ZongBo Hao. A Ner Static Pointer Dereference Detecting Method Based on Finnite-state Machine[C]. International Conference on Apperceiving Computing and Intelligence Analysis 2010. 2010:392-397
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |