Search‐based testing using constraint‐based mutation. (30th August 2013)

• Record Type: Journal Article
• Authors: Malburg, Jan; Fraser, Gordon
• Is Part Of: Software testing, verification & reliability. Volume 24:Number 6(2014)
• Page Start: 472
• Page End: 495
• Publication Date: 2013-08-30
• Subjects: Computer software -- Testing -- Periodicals; Computer software -- Verification -- Periodicals; Computer software -- Reliability -- Periodicals; 005.14
• DOI: 10.1002/stvr.1508
• Languages: English
• ISSNs: 0960-0833

Abstract

<abstract abstract-type="main" id="stvr1508-abs-0001"> <title>SUMMARY</title> <p id="stvr1508-para-0001">Many modern automated test generators are based on either metaheuristic search techniques or use constraint solvers. Both approaches have their advantages, but they also have specific drawbacks: Search‐based methods may get stuck in local optima and degrade when the search landscape offers no guidance; constraint‐based approaches, on the other hand, can only handle certain domains efficiently. This paper describes a method that <italic>integrates both techniques</italic> and delivers the best of both worlds. On a high‐level view, the proposed method uses a genetic algorithm to generate tests, but the twist is that during evolution, a constraint solver is used to ensure that mutated offspring efficiently explores different control flow. Experiments on 20 case study programmes show that on average the combination improves branch coverage by 28% over search‐based techniques while reducing the number of tests by 55%, and improves coverage by 13% over constraint‐based techniques while reducing the number of tests by 73%. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>