本章参考文献
[1] Chipounov V,Georgescu V,Zamfir C,et al.Selective Symbolic Execution[C]//the 5th Workshop on Hot Topics in System Dependability,2009:1-6.
[2] Godefroid P.Compositional dynamic test generation[C]//Acm Sigplan-sigact Symposium on Principles of Programming Languages.ACM,2007:47-54.
[3] Chipounov V,Kuznetsov V,Candea G,et al.The S2E platform:design,implementation,and applications[J].Acm Transactions on Computer Systems,2012,30(1):1-49.
[4] Talbi E-G.Metaheuristics:from deign to implementation[M].Hoboken:John Wiley&Sons,lnc.,2009.
[5] Mcminn P.Search-based software test data generation:a survey[J].Software Testing Verification&Reliability,2004,14(2):105-156.
[6] Boris Beizer.Software testing techniques[M].2nd ed.New York:Van Nostrand Reinhold Co,1990.
[7] Yan J,Jian Z.An efficient method to generate feasible paths for basis path testing[J].Information Processing Letters,2008,107(3-4):87-92.
[8] Hedley D,Hennell M A.The causes and effects of infeasible paths in computer programs[C]//International Conference on Software Engineering,1985:259-266.
[9] Cadar C,Dunbar D,Engler D R.KLEE:unassisted and automatic generation of high-coverage tests for complex systems programs[C]//Usenix Conference on Operating Systems Design&Implementation.USENIX Association,2009.
[10] Peter Dinges,Gul Agha.Targeted test input generation using symbolic-concrete backward execution[D].Illinois:University of Illinois at Urbana-Champaign,2014.
[11] Ngo M N,Tan H B K.Detecting large number of infeasible paths through recognizing their patterns[C]//Joint Meeting of the European Software Engineering Conference&the Acm Sigsoft International Symposium on Foundations of Software Engineering.DBLP,2007:215.
[12] Ding S,Tan H B K.Detection of infeasible paths:approaches and challenges[C]//International Conference on Evaluation of Novel Approaches to Software Engineering,Springer Berlin Heidelberg,2012:64-78.
[13] Ngo M N,Tan H.Heuristics-based infeasible path detection for dynamic test data generation[J].Information & Software Technology,2008,50(7-8):641-655.(https://www.daowen.com)
[14] Bueno P,Jino M.Identification of Potentially Infeasible Program Paths by Monitoring the Search for Test Data[C]//Fifteenth IEEE International Conference on Automated Software Engineering.IEEE,2000.
[15] Song D,McCamant S,Saxena P,et al.A symbolic execution framework for JavaScript[C]//Security&Privacy.IEEE,2010.
[16] Yu F,Alkhalaf M,Bultan T.Generating vulnerability signatures for string manipulating programs using automata-based forward and backward symbolic analyses[C]//IEEE/ACM International Conference on Automated Software Engineering.ACM,2009.
[17] Aydin A,Bang L,Bultan T.Automata-based model counting for string constraints[C]//International Conference on Computer Aided Verification.Springer International Publishing,2015.
[18] Ghosh I,Shafiei N,Li G,et al.JST:an automatic test generation tool for industrial Java applications with strings[C]//International Conference on Software Engineering.IEEE,2013.
[19] Feige U,Reichman D.On the hardness of approximating Max-Satisfy[J].Information Processing Letters,2006,97(1):31-35.
[20] Malevris N.A path generation method for testing LCSAJs that restrains infeasible paths[J].Information&Software Technology,1995,37(8):435-441.
[21] Charreteur F,Gotlieb A.Constraint-Based Test Input Generation for Java Bytecode[C]//2010 IEEE 21st International Symposium on Software Reliability Engineering,2010:131-140.
[22] Satish Chandra,Stephen J Fink,Manu Sridharan.Snugglebug:a powerful approach to weakest preconditions[C]//Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation,PLDI 2009,Dublin,Ireland,June 15-21,2009.ACM,2009.
[23] Godefroid P,Klarlund N,Sen K.DART:directed automated random testing[C]//Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation,Chicago,IL,USA,June 12-15,2005.ACM,2005.
[24] Bjørner N,Tillmann N,Voronkov A.Path feasibility analysis for string-manipulating programs[C]//Tools and Algorithms for the Construction and Analysis of Systems,15th International Conference,TACAS 2009,Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2009,York,UK,March 22-29,2009.DBLP,2009.
[25] Liang T,Reynolds A,Tinelli C,et al.A DPLL(T)Theory Solver for a Theory of Strings and Regular Expressions[C]//CAV'14,2014:646-662.
[26] Nieuwenhuis R,Oliveras A,Tinelli C.Solving SAT and SAT Modulo Theories[J].Journal of the ACM,2006,53(6):937-977.
