Title :
Software Testing with Budget Constraints
Author_Institution :
Dept. of Math., Indian Inst. of Sci. Educ. & Res. (IISER), Pune, India
Abstract :
This article deals with constructions of covering arrays which are extremely useful in software testing in order to guarantee 3-way coverage of parameter values, while trying to minimize the number of test cases. A practical limitation in the realm of testing is budget. In most software development environments, time, computing and human resources needed to perform the testing of a component is strictly limited. In order to deal with such situations, we consider the problem of creating the best possible test suite (covering the maximum number of 3-tuples) within a fixed number of test cases. This paper proposes a method of constructing strength three covering arrays with budget constraints.
Keywords :
budgeting; program testing; software development management; 3-way coverage; budget constraint; computing; covering array; human resource; parameter value; software development environment; software testing; test case; test suite; time; Extraterrestrial measurements; Orbits; Programming; Software; Software testing; Vectors; Covering arrays; Finite fields; Linear Group; Software testing; Test case generation;
Conference_Titel :
Information Technology: New Generations (ITNG), 2012 Ninth International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-4673-0798-7
DOI :
10.1109/ITNG.2012.44