机读格式显示(MARC)
- 000 03679cam a2200397 i 4500
- 008 130514s2013 flua b 001 0 eng
- 020 __ |a 9781466552296 (hardback)
- 040 __ |a DLC |b eng |c DLC |e rda |d DLC
- 050 00 |a QA76.76.T48 |b K84 2013
- 082 00 |a 005.3028/7 |2 23
- 084 __ |a COM051010 |a COM051230 |a MAT000000 |2 bisacsh
- 099 __ |a CAL 022014012930
- 100 1_ |a Kuhn, D. Richard.
- 245 10 |a Introduction to combinatorial testing / |c D. Richard Kuhn, Raghu N. Kacker, Yu Lei.
- 260 __ |a Boca Raton : |b CRC Press, |c [2013]
- 300 __ |a xxii, 319 pages : |b illustrations (some color) ; |c 25 cm
- 336 __ |a text |2 rdacontent
- 337 __ |a unmediated |2 rdamedia
- 338 __ |a volume |2 rdacarrier
- 490 0_ |a Chapman & Hall/CRC innovations in software engineering and software development series
- 504 __ |a Includes bibliographical references (pages 293-307) and index.
- 520 __ |a "Combinatorial testing of software analyzes interactions among variables using a very small number of tests. This advanced approach has demonstrated success in providing strong, low-cost testing in real-world situations. Introduction to Combinatorial Testing presents a complete self-contained tutorial on advanced combinatorial testing methods for real-world software.The book introduces key concepts and procedures of combinatorial testing, explains how to use software tools for generating combinatorial tests, and shows how this approach can be integrated with existing practice. Detailed explanations and examples clarify how and why to use various techniques. Sections on cost and practical considerations describe tradeoffs and limitations that may impact resources or funding. While the authors introduce some of the theory and mathematics of combinatorial methods, readers can use the methods without in-depth knowledge of the underlying mathematics.Accessible to undergraduate students and researchers in computer science and engineering, this book illustrates the practical application of combinatorial methods in software testing. Giving pointers to freely available tools and offering resources on a supplementary website, the book encourages readers to apply these methods in their own testing projects"-- |c Provided by publisher.
- 520 __ |a "Software testing has always faced a seemingly intractable problem: for real-world programs, the number of possible input combinations can exceed the number of atoms in the universe, so as a practical matter it is impossible to show through testing that the program works correctly for all inputs. Combinatorial testing offers a (partial) solution. Empirical data show that the number of variables involved in failures is small. Most failures are triggered by only one or two inputs, and the number of variables interacting tails off rapidly, a relationship called the interaction rule. Therefore if we test input combinations for even small numbers of variables, we can provide very strong testing at low cost. As always, there is no "silver bullet" answer to the problem of software assurance, but combinatorial testing has grown rapidly because it works in the real world"-- |c Provided by publisher.
- 650 _0 |a Computer software |x Testing.
- 650 _0 |a Combinatorial analysis.
- 650 _7 |a COMPUTERS / Programming Languages / General. |2 bisacsh
- 650 _7 |a COMPUTERS / Software Development & Engineering / General. |2 bisacsh
- 650 _7 |a MATHEMATICS / General. |2 bisacsh
- 700 1_ |a Kacker, Raghu N.
- 700 1_ |a Lei, Yu |c (Associate professor of computer science)