View in EDS

Guided Mutation Testing for JavaScript Web Applications.

Saved in:
Bibliographic Details
Title: Guided Mutation Testing for JavaScript Web Applications.
Authors: Mirshokraie, Shabnam, Mesbah, Ali, Pattabiraman, Karthik
Source: IEEE Transactions on Software Engineering; May2015, Vol. 41 Issue 5, p429-444, 16p
Subject Terms: JAVASCRIPT programming language, DOMAIN-specific programming languages, OBJECT-oriented programming languages, PROGRAMMING languages, SCRIPTING languages (Computer science)
Abstract: Mutation testing is an effective test adequacy assessment technique. However, there is a high computational cost in executing the test suite against a potentially large pool of generated mutants. Moreover, there is much effort involved in filtering out equivalent mutants. Prior work has mainly focused on detecting equivalent mutants after the mutation generation phase, which is computationally expensive and has limited efficiency. We propose an algorithm to select variables and branches for mutation as well as a metric, called $FunctionRank$ , to rank functions according to their relative importance from the application’s behaviour point of view. We present a technique that leverages static and dynamic analysis to guide the mutation generation process towards parts of the code that are more likely to influence the program’s output. Further, we focus on the JavaScript language, and propose a set of mutation operators that are specific to web applications. We implement our approach in a tool called Mutandis. The results of our empirical evaluation show that (1) more than 93 percent of generated mutants are non-equivalent, and (2) more than 75 percent of the surviving non-equivalent mutants are in the top 30 percent of the ranked functions. [ABSTRACT FROM PUBLISHER]
Copyright of IEEE Transactions on Software Engineering is the property of IEEE Computer Society and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
Abstract:Mutation testing is an effective test adequacy assessment technique. However, there is a high computational cost in executing the test suite against a potentially large pool of generated mutants. Moreover, there is much effort involved in filtering out equivalent mutants. Prior work has mainly focused on detecting equivalent mutants after the mutation generation phase, which is computationally expensive and has limited efficiency. We propose an algorithm to select variables and branches for mutation as well as a metric, called $FunctionRank$<alternatives><inline-graphic xlink:type="simple" xlink:href="mirshokraie-ieq1-2371458.gif"/></alternatives> , to rank functions according to their relative importance from the application’s behaviour point of view. We present a technique that leverages static and dynamic analysis to guide the mutation generation process towards parts of the code that are more likely to influence the program’s output. Further, we focus on the JavaScript language, and propose a set of mutation operators that are specific to web applications. We implement our approach in a tool called <sc>Mutandis</sc>. The results of our empirical evaluation show that (1) more than 93 percent of generated mutants are non-equivalent, and (2) more than 75 percent of the surviving non-equivalent mutants are in the top 30 percent of the ranked functions. [ABSTRACT FROM PUBLISHER]
ISSN:00985589
DOI:10.1109/TSE.2014.2371458