Title :
Plummeting the Software Testing Time Complexity
Author :
Baig, Mirza Mahmood ; Khan, Ansar Ahmad
Author_Institution :
Dept. of Comput. Sci. & Inf. Technol., NED Univ. of Eng. & Technol., Karachi, Pakistan
Abstract :
Software testing is a dual purpose process that reveals defects and is used to evaluate quality attributes of the software, such as, reliability, security, usability, and correctness. The critical problem in software testing is time complexity. In this paper we have developed a strategy to reduce the time complexity of database testing by using Fast Searching Algorithm known as ldquoGrover´s Algorithmrdquo for unsorted database. The significance of said algorithm is to minimize time and cost both by using a formal algorithm. Another main benefit of such algorithm is that the complexity is too less than other searching algorithms in use.
Keywords :
computational complexity; program testing; search problems; software quality; Grover algorithm; database testing; fast searching algorithm; searching algorithms; software quality attributes evaluation; software testing time complexity; Computer bugs; Computer science; Costs; Databases; Information technology; Quantum computing; Software algorithms; Software quality; Software testing; System testing;
Conference_Titel :
Software Engineering, 2009. WCSE '09. WRI World Congress on
Conference_Location :
Xiamen
Print_ISBN :
978-0-7695-3570-8
DOI :
10.1109/WCSE.2009.465