Centroidal Voronoi Tessellations- A New Approach to Random Testing

Shahbazi, Ali; Tappenden, Andrew F.; Miller, James

doi:10.1109/tse.2012.18

Cited by 59 publications

(72 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although they are based on different principles to achieve an even spreading of test cases across the input domain, all of these algorithms have been empirically demonstrated to have a smaller F-measure than RT -the effectiveness metric F-measure is defined as the expected number of test cases required to detect the first failure. Furthermore, these ART algorithms also outperform RT with respect to the P-measure for the same number of test cases used [8,33].…”

Section: Adaptive Random Testingmentioning

confidence: 83%

“…Due to the variety of even-spreading principles, various ART algorithms have been developed [6,9,11,13,18,25,28,[33][34][35]. Although they are based on different principles to achieve an even spreading of test cases across the input domain, all of these algorithms have been empirically demonstrated to have a smaller F-measure than RT -the effectiveness metric F-measure is defined as the expected number of test cases required to detect the first failure.…”

Section: Adaptive Random Testingmentioning

confidence: 99%

See 1 more Smart Citation

A revisit of three studies related to random testing

Chen

Kuo

Towey

et al. 2015

Sci. China Inf. Sci.

View full text Add to dashboard Cite

. (2015). A revisit of three studies related to random testing. Science China Information Sciences, 58 (5), 052104:1-052104:9.A revisit of three studies related to random testing Abstract © 2015 Science China Press and Springer-Verlag Berlin Heidelberg Software testing is an approach that ensures the quality of software through execution, with a goal being to reveal failures and other problems as quickly as possible. Test case selection is a fundamental issue in software testing, and has generated a large body of research, especially with regards to the effectiveness of random testing (RT), where test cases are randomly selected from the software's input domain. In this paper, we revisit three of our previous studies. The first study investigated a sufficient condition for partition testing (PT) to outperform RT, and was motivated by various controversial and conflicting results suggesting that sometimes PT performed better than RT, and sometimes the opposite. The second study aimed at enhancing RT itself, and was motivated by the fact that RT continues to be a fundamental and popular testing technique. This second study enhanced RT fault detection effectiveness by making use of the common observation that failure-causing inputs tend to cluster together, and resulted in a new family of RT techniques: adaptive random testing (ART), which is random testing with an even spread of test cases across the input domain. Following the successful use of failurecausing region contiguity insights to develop ART, we conducted a third study on how to make use of other characteristics of failure-causing inputs to develop more effective test case selection strategies. This third study revealed how best to approach testing strategies when certain characteristics of the failure-causing inputs are known, and produced some interesting and important results. In revisiting these three previous studies, we explore their unexpected commonalities, and identify diversity as a key concept underlying their effectiveness. This observation further prompted us to examine whether or not such a concept plays a role in other areas of software testing, and our conclusion is that, yes, diversity appears to be one of the most important concepts in the field of software testing. Received ; acceptedAbstract Software testing is an approach that ensures the quality of software through execution, with a goal being to reveal failures and other problems as quickly as possible. Test case selection is a fundamental issue in software testing, and has generated a large body of research, especially with regards to the effectiveness of random testing (RT), where test cases are randomly selected from the software's input domain. In this paper, we revisit three of our previous studies. The first study investigated a sufficient condition for partition testing (PT) to outperform RT, and was motivated by various controversial and conflicting results suggesting that sometimes PT performed better than RT, and sometimes the opposite. The second study aimed at enhanci...

show abstract

Section: Adaptive Random Testingmentioning

confidence: 83%

Section: Adaptive Random Testingmentioning

confidence: 99%

A revisit of three studies related to random testing

Chen

Kuo

Towey

et al. 2015

Sci. China Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…The maximum number of previously executed test cases to be retained is specified by a memory parameter. On the other hand, empirical studies show that there is a trade-off between computational complexity and effectiveness [16]. Experimental results in the forgetting paper [2], for instance, show that for a given memory parameter, a similar performance in effectiveness cannot be maintained across different failure rates.…”

Section: * Corresponding Authormentioning

confidence: 99%

“…However, in order to provide an "unbiased" cover, the experimental evaluations have been conducted on the three typical failure patterns, namely, block, strip, and point patterns, with wide ranges of failure rates. Various previous studies [3], [7], [16] have demonstrated that simulations of the three classic failure patterns can provide an objective validation of comparative merits.…”

Section: Threats To Validity 1) Internal Validitymentioning

confidence: 99%

See 1 more Smart Citation

The ART of Divide and Conquer: An Innovative Approach to Improving the Efficiency of Adaptive Random Testing

Chow

Chen

Tse

2013

2013 13th International Conference on Quality Software

View full text Add to dashboard Cite

Abstract-Test case selection is a prime process in the engineering of test harnesses. In particular, test case diversity is an important concept. In order to achieve an even spread of test cases across the input domain, Adaptive Random Testing (ART) was proposed such that the history of previously executed test cases are taken into consideration when selecting the next test case. This was achieved through various means such as best candidate selection, exclusion, , and diversity metrics. Empirical studies showed that ART algorithms make good use of the concept of even spreading and achieve 40 to 50% improvement in test effectiveness over random testing in revealing the first failure, which is close to the theoretical limit. However, the computational complexity of ART algorithms may be quadratic or higher, and hence efficiency is an issue when a large number of previously executed test cases are involved. This paper proposes an innovative divide-and-conquer approach to improve the efficiency of ART algorithms while maintaining their performance in effectiveness. Simulation studies have been conducted to gauge its efficiency against two most commonly used ART algorithms, namely, fixed size candidate set and restricted random testing. Initial experimental results show that the divideand-conquer technique can provide much better efficiency while maintaining similar, or even better, effectiveness. *

show abstract

Methods of Synthesis of Controlled Random Tests

Mrozek

Yarmolik

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Part 6: AlgorithmsInternational audienceControlled random tests, methods of their generation, main criteria used for their synthesis, such as the Hamming distance and the Euclidean distance, as well as their application to the testing of both hardware and software systems are discussed. Available evidences suggest that high computational complexity is one of the main drawbacks of these methods. Therefore we propose a technique to overcome this problem. A method for synthesizing multiple controlled random tests based on the use of the initial random test and addition operation has been proposed. The resulting multiple tests can be interpreted as a single controlled random test. The complexity of its construction is significantly lower than the complexity of the construction of classical random tests. Examples of generated tests as well as estimates of their effectiveness compared to other solutions have been presented in experimental studies

show abstract

Centroidal Voronoi Tessellations- A New Approach to Random Testing

Cited by 59 publications

References 54 publications

A revisit of three studies related to random testing

A revisit of three studies related to random testing

The ART of Divide and Conquer: An Innovative Approach to Improving the Efficiency of Adaptive Random Testing

Methods of Synthesis of Controlled Random Tests

Contact Info

Product

Resources

About