RepOK‐based reduction of bounded exhaustive testing. (5th October 2014)

• Record Type: Journal Article
• Authors: Bengolea, Valeria; Aguirre, Nazareno; Marinov, Darko; Frias, Marcelo; Brucker, Achim D.; Julliand, Jacques
• Is Part Of: Software testing, verification & reliability. Volume 24:Number 8(2014)
• Page Start: 629
• Page End: 655
• Publication Date: 2014-10-05
• Subjects: Computer software -- Testing -- Periodicals; Computer software -- Verification -- Periodicals; Computer software -- Reliability -- Periodicals; 005.14
• DOI: 10.1002/stvr.1547
• Languages: English
• ISSNs: 0960-0833

Abstract

<abstract abstract-type="main" id="stvr1547-abs-0001"> <title>SUMMARY</title> <p id="stvr1547-para-0001">While the effectiveness of bounded exhaustive test suites increases as one increases the <italic>scope</italic> for the bounded exhaustive generation, both the time for test generation and the time for test execution grow exponentially with respect to the scope. In this article, a set of techniques for reducing the time for bounded exhaustive testing, by either reducing the generation time or reducing the obtained bounded exhaustive suites, is proposed. The representation invariant of the software under test's input, implemented as a <monospace>repOK</monospace> routine, is exploited for these reductions in two ways: (i) to factor out separate representation invariants for disjoint structures of the inputs; and (ii) to partition valid inputs into equivalence classes, according to how these exercise the <monospace>repOK</monospace> code. The first is used in order to split the test input generation process, as disjoint substructures can be independently generated. The second is used in order to reduce the size of a bounded exhaustive test suite, by removing from the suite those tests that are equivalent to some tests already present in the suite. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>