Search-based Software Engineering is use number of software engineering models. In domain Search-Based Software Engineering many application is test data generation. We propose many methods for automating results bottleneck finding using search-based input-sensitive application profiling. Our key idea is to use a genetic algorithm as a search heuristic for obtaining combinations of input functions values that maximizes number of function to represents the elapsed execution time of the application. We present TAO tool is a software testing tool result automated test and oracle generation based on a semantic model. TAO is worked grammar-based test generation with automated semantics evaluation using a denotation semantics framework. The quality of web application is a broad review of recent Web testing advances model and discuss their goals, targets, techniques employed, inputs/outputs and stopping criteria. This research paper presents result testing of web application using reactive-based framework for reducing the cost and increasing efficiency of the performance testing. Finally test case can be generated automatically by solving and modify the problem using evolutionary algorithm. This model is attractive because it take a suite of adaptive automated and semi-automated solutions in situations many large complex problem spaces with multiple competing and conflicting objectives.

Search-based Software Engineering, Evolutionary Algorithms, Optimization Problem, Evolutionary Testing, Heuristic Search Techniques. Web applications, World Wide Web, Web testing, Survey, Performance

[1] Wasif Afzal, Richard Torkar, and Robert Feldt. A systematic review of search-based testing for non-functional system properties. Inf. Softw. Technol., 51:957–976, June 2009
[2] Mark Harman, “The Current State and Future of SBSE”, Future of Software Engineering (FOSE'07), IEEE Computer Society, 2007, pp. 1-16.
[3] Elbaum, S. Karre,S., Rothermel,G., Improving web application testing with user session data. In International conference of software Engineering, pages 49-59, 2003.
[4] Fujiwara, S.,Bochmann, G.,Khendek, F.,Amalou, M., Ghedasmi, A. , Test selection based on finite state models, IEEE Transactions on Software Engineering 17(6):591-603, June 1991
[5] J. Clark, J. J. Dolado, M. Harman, R. M. Hierons, B. Jones, M. Lumkin, B. Mitchell, S. Mancoridis, K. Rees, M. Roper,and M. Shepperd, “Reformulating Software Engineering as a Search Problem,” IEE Proceedings - Software, vol. 150,no. 3, 2003, pp. 161–175.
[6] Daniel Malcolm Hoffman, David Ly-Gagnon, Paul Strooper & Hong-Yi Wang (2011): Grammar-based test generation with YouGen. Software Practice and Experience 41(4), pp. 427–447, doi:10.1002/spe.1017.
[7] Ralf Lämmel & Wolfram Schulte (2006): Controllable combinatorial coverage in grammar-based testing. In: International conference on Testing of Communicating Systems, pp. 19–38, doi:10.1007/11754008_2.
[8] A. Baars, M. Harman, Y. Hassoun, K. Lakhotia, P. McMinn, P. Tonella, and T. Vos. Symbolic search-based testing. In ASE ’11, pages 53–62, 2011.
[9] L. C. Briand, Y. Labiche, and M. Shousha. Stress testing real-time systems with genetic algorithms. In GECCO ’05, pages 1021–1028, 2005.
[10] J. Burnim, S. Juvekar, and K. Sen. Wise: Automated test generation for worst-case complexity. In ICSE ’09, pages 463–473, 2009.
[11] Y. Cai, J. Grundy, and J. Hosking. Synthesizing client load models for performance engineering via web crawling. In ASE ’07, pages 353–362, 2007
[12] Yuanyuan Zhang, “Multi-Objective Search - based Requirements Selection and Optimisation”, Ph.D Thesis, King’s College, University of London, February 2010, pp. 1-276.