Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/2596
Title: | Model-Based Higher-Order Mutation Analysis | Authors: | Belli, Fevzi Güler, Nevin Hollmann, Axel Suna, Gökhan Yıldız, Esra |
Keywords: | Software testing Basic mutation operators Coupling effect Event Sequence graphs |
Publisher: | Springer Verlag | Source: | Belli, F., Güler, N., Hollmann, A., Suna, G., and Yıldız, E. (2010). Model-based higher-order mutation analysis. Communications in Computer and Information Science, 117 CCIS, 164-173. doi:10.1007/978-3-642-17578-7_17 | Abstract: | Mutation analysis is widely used as an implementation-oriented method for software testing and test adequacy assessment. It is based on creating different versions of the software by seeding faults into its source code and constructing test cases to reveal these changes. However, in case that source code of software is not available, mutation analysis is not applicable. In such cases, the approach introduced in this paper suggests the alternative use of a model of the software under test. The objectives of this approach are (i) introduction of a new technique for first-order and higher-order mutation analysis using two basic mutation operators on graph-based models, (ii) comparison of the fault detection ability of first-order and higher-order mutants, and (iii) validity assessment of the coupling effect. © 2010 Springer-Verlag Berlin Heidelberg. | Description: | International Conference on Advanced Software Engineering and Its Applications, ASEA 2010; Jeju Island; South Korea; 13 December 2010 through 15 December 2010 | URI: | http://doi.org/10.1007/978-3-642-17578-7_17 http://hdl.handle.net/11147/2596 |
ISBN: | 9783642175770 | ISSN: | 1865-0929 |
Appears in Collections: | Computer Engineering / Bilgisayar Mühendisliği Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.