Finding the Efficiency of Query by Using Predictive Energy Saving Online Scheduling Algorithm

Authors(2) :-Chhinabala Vinod Kumar, P. Prasad Babu

Web search engines are composed by thousands of query processing nodes, i.e., servers dedicated to process user queries. Metamorphic testing may be a testing technique which will be used to verify the useful correctness of software system within the absence of an ideal oracle. This paper extends metamorphic testing into a user-oriented approach to software system verification, validation, and quality assessment, and conducts large scale empirical studies with four major net search engines: Google, Bing, Chinese Bing, and Baidu. These search engines are very tough to check and assess using conventional approaches owing to the lack of an objective and generally recognized oracle. The results are useful for each search engine developers and users, and demonstrate that our approach will effectively alleviate the oracle drawback and challenges close a lack of specifications when verifying, validating, and evaluating giant and complex software systems.

Authors and Affiliations

Chhinabala Vinod Kumar
Student, Department of MCA, RCR Institutes of Managent & Technology, Tirupathi, Andhra Pradesh, India
P. Prasad Babu
Assistant Professor, Department of MCA, RCR Institutes of Management & Technology, Tirupathi, Andhra Pradesh, India

Metamorphic testing, Google, Bing, Chinese Bing.

  1. Sheeva Afshan, Phil McMinn, and Mark Stevenson. Evolving readable string test inputs using a natural language model to reduce human oracle cost. In International Conference on Software Testing, Verification and Validation (ICST 2013). IEEE, March 2013.
  2. Wasif Afzal, Richard Torkar, and Robert Feldt. A systematic review of search-based testing for nonfunctional system properties. Information and Software Technology, 51(6):957–976, 2009.
  3. Bernhard K. Aichernig. Automated black-box testing with abstract VDM oracles. In SAFECOMP, pages 250–259. Springer-Verlag, 1999.
  4. Shaukat Ali, Lionel C. Briand, Hadi Hemmati, and Rajwinder Kaur Panesar-Walawege. A systematic review of the application and empirical investigation of search-based test-case generation. IEEE Transactions on Software Engineering, pages 742–762, 2010.
  5. Nadia Alshahwan and Mark Harman. Automated session data repair for web application regression testing. In Proceedings of 2008 International Conference on Software Testing, Verification, and Validation, pages 298–307. IEEE Computer Society, 2008.
  6. Nadia Alshahwan and Mark Harman. Automated web application testing using search based software engineering. In ASE, pages 3–12, 2011.
  7. Dana Angluin. Learning regular sets from queries and counterexamples. Inf. Computes., 75(2):87–106, 1987.
  8. W Araujo, L.C. Briand, and Y. Labiche. Enabling the runtime assertion checking of concurrent contracts for the java modeling language. In Software Engineering (ICSE), 2011 33rd International Conference on, pages 786–795, 2011.
  9. W. Araujo, L.C. Briand, and Y. Labiche. On the effectiveness of contracts as test oracles in the detection and diagnosis of race conditions and deadlocks in concurrent object-oriented software. In Empirical Software Engineering and Measurement (ESEM), 2011 International Symposium on, pages 10–19, 2011.
  10. Andrea Arcuri and Xin Yao. Search based software testing of object-oriented containers. Information Sciences, 178(15):3075–3095, 2008.
  11. Shay Artzi, Michael D. Ernst, Adam Kiezun, Carlos ? Pacheco, and Jeff H. Perkins. Finding the needles in the haystack: Generating legal test inputs for object-oriented programs. In 1st Workshop on ModelBased Testing and Object-Oriented Systems (M-TOOS), Portland, OR, October 23, 2006.
  12. Egidio Astesiano, Michel Bidoit, Hel´ ene Kirchner, ` Bernd Krieg-Bruckner, Peter D. Mosses, Donald San- ¨ nella, and Andrzej Tarlecki. CASL: the common algebraic specification language. Theory. Compute. Sci., 286(2):153–196, 2002.
  13. Todd M. Austin, Scott E. Breach, and Gurindar S. Sohi. Efficient detection of all pointer and array access errors. In PLDI, pages 290–301. ACM, 1994.
  14. A. Avizienis. The N-version approach to faulttolerant software. IEEE Transactions on Software Engineering, 11:1491–1501, 1985.
  15. A. Avizienis and L. Chen. On the implementation of N-version programming for software fault-tolerance during execution. In Proceedings of the First International Computer Software and Application Conference (COMPSAC ’77), pages 149–155, 1977.
  16. Arthur Baars, Mark Harman, Youssef Hassoun, Kiran Lakhotia, Phil McMinn, Paolo Tonella, and Tanja Vos. Symbolic search-based testing. In ASE, pages 53–62, 2011.
  17. A. F. Babich. Proving total correctness of parallel programs. IEEE Trans. Softw. Eng., 5(6):558–574, November 1979.
  18. Luciano Baresi and Michal Young. Test oracles. Technical Report CIS-TR-01-02, University of Oregon, Dept. of Computer and Information Science, August 2001. oracles.html.
  19. Sofia Bekrar, Chaouki Bekrar, Roland Groz, and Laurent Mounier. Finding software vulnerabilities by smart fuzzing. In ICST, pages 427–430, 2011.
  20. Gilles Bernot. Testing against formal specifications: a theoretical view. In Proceedings of the International Joint Conference on Theory and Practice of Software Development on Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Development (CCPSD): Vol. 2, TAPSOFT ’91, pages 99–119, New York, NY, USA, 1991. SpringerVerlag New York, Inc.

Publication Details

Published in : Volume 4 | Issue 2 | March-April 2018
Date of Publication : 2018-03-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 501-508
Manuscript Number : CSEIT184188
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Chhinabala Vinod Kumar, P. Prasad Babu, "Finding the Efficiency of Query by Using Predictive Energy Saving Online Scheduling Algorithm", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 2, pp.501-508, March-April-2018.
Journal URL :

Follow Us

Contact Us