![]() ; Papadakis, Mike ![]() in Software Testing, Verification and Reliability (2015), 25(5-7), 508-535 The equivalent mutant problem is a major hindrance to mutation testing. Being undecidable in general, it is only susceptible to partial solutions. In this paper, mutant classification is utilised for ... [more ▼] The equivalent mutant problem is a major hindrance to mutation testing. Being undecidable in general, it is only susceptible to partial solutions. In this paper, mutant classification is utilised for isolating likely to be first-order equivalent mutants. A new classification technique, Isolating Equivalent Mutants (I-EQM), is introduced and empirically investigated. The proposed approach employs a dynamic execution scheme that integrates the impact on the program execution of first-order mutants with the impact on the output of second-order mutants. An experimental study, conducted using two independently created sets of manually classified mutants selected from real-world programs revalidates previously published results and provides evidence for the effectiveness of the proposed technique. Overall, the study shows that I-EQM substantially improves previous methods by retrieving a considerably higher number of killable mutants, thus, amplifying the quality of the testing process. [less ▲] Detailed reference viewed: 162 (14 UL)![]() Papadakis, Mike ![]() in 37th International Conference on Software Engineering (ICSE 2015) (2015) Detailed reference viewed: 226 (6 UL)![]() ; ; El Kateb, Donia ![]() in Information and Software Technology (2015), 58 Context: Access control is among the most important security mechanisms, and XACML is the de facto standard for specifying, storing and deploying access control policies. Since it is critical that ... [more ▼] Context: Access control is among the most important security mechanisms, and XACML is the de facto standard for specifying, storing and deploying access control policies. Since it is critical that enforced policies are correct, policy testing must be performed in an effective way to identify potential security flaws and bugs. In practice, exhaustive testing is impossible due to budget constraints. Therefore the tests need to be prioritized so that resources are focused on their most relevant subset. Objective: This paper tackles the issue of access control test prioritization. It proposes a new approach for access control test prioritization that relies on similarity. Method: The approach has been applied to several policies and the results have been compared to random prioritization (as a baseline). To assess the different prioritization criteria, we use mutation analysis and compute the mutation scores reached by each criterion. This helps assessing the rate of fault detection. Results: The empirical results indicate that our proposed approach is effective and its rate of fault detection is higher than that of random prioritization. Conclusion: We conclude that prioritization of access control test cases can be usefully based on similarity criteria. © 2014 Elsevier B.V. All rights reserved. [less ▲] Detailed reference viewed: 196 (6 UL)![]() Papadakis, Mike ![]() ![]() in Software Testing, Verification and Reliability (2015), 25 Detailed reference viewed: 308 (19 UL)![]() Henard, Christopher ![]() ![]() in 37th International Conference on Software Engineering (ICSE 2015) (2015) Detailed reference viewed: 266 (11 UL)![]() ; ; et al in 8th IEEE International Conference on Software Testing, Verification and Validation (ICST'15) (2015) Detailed reference viewed: 252 (6 UL)![]() Papadakis, Mike ![]() ![]() in Science of Computer Programming (2014), 95 Mutation Testing has been shown to be a powerful technique in detecting software faults. Despite this advantage, in practice there is a need to deal with the equivalent mutants’ problem. Automatically ... [more ▼] Mutation Testing has been shown to be a powerful technique in detecting software faults. Despite this advantage, in practice there is a need to deal with the equivalent mutants’ problem. Automatically detecting equivalent mutants is an undecidable problem. Therefore, identifying equivalent mutants is cumbersome since it requires manual analysis, resulting in unbearable testing cost. To overcome this difficulty, researchers suggested the use of mutant classification, an approach that aims at isolating equivalent mutants automatically. From this perspective, the present paper establishes and empirically assesses possible mutant classification strategies. A conducted study reveals that mutant classification isolates equivalent mutants effectively when low quality test suites are used. However, it turns out that as the test suites evolve, the benefit of this practice is reduced. Thus, mutant classification is only fruitful in improving test suites of low quality and only up to a certain limit. To this end, empirical results show that the proposed strategies provide a cost-effective solution when they consider a small number of live mutants, i.e., 10-12. At this point they kill 92% of all the killable mutants. [less ▲] Detailed reference viewed: 224 (12 UL)![]() ; ; El Kateb, Donia ![]() in Information and Software Technology (2014) Detailed reference viewed: 209 (19 UL)![]() ; Henard, Christopher ![]() ![]() in 29th Symposium on Applied Computing (SAC 2014) (2014) Detailed reference viewed: 175 (8 UL)![]() Henard, Christopher ![]() ![]() ![]() in Testing Tools Track, 7th International Conference on Software Testing, Verification and Validation (ICST 2014) (2014) Detailed reference viewed: 179 (8 UL)![]() Papadakis, Mike ![]() ![]() ![]() in 7th International Conference on Software Testing, Verification and Validation (ICST 2014) (2014) Detailed reference viewed: 159 (10 UL)![]() Papadakis, Mike ![]() ![]() in ACM Symposium On Applied Computing (SAC'14) (2014) Detailed reference viewed: 125 (5 UL)![]() ; ; et al in Proceedings of the 22nd ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE 2014) (2014) Detailed reference viewed: 126 (3 UL)![]() Henard, Christopher ![]() ![]() ![]() in IEEE Transactions on Software Engineering (2014), 40(7), 650-670 Detailed reference viewed: 254 (20 UL)![]() ; Papadakis, Mike ![]() in Workshop on Experimental Software Engineering (ESELAW'14) (2014) Detailed reference viewed: 207 (12 UL)![]() Henard, Christopher ![]() ![]() ![]() in Symposium on Search-Based Software Engineering (SSBSE 2014) (2014) Detailed reference viewed: 181 (4 UL)![]() Nguyen, Phu Hong ![]() ![]() ![]() in 7th International Workshop on Mutation Analysis (2013, March) Delegation is an important dimension of security that plays a crucial role in the administration mechanism of access control policies. Delegation may be viewed as an exception made to an access control ... [more ▼] Delegation is an important dimension of security that plays a crucial role in the administration mechanism of access control policies. Delegation may be viewed as an exception made to an access control policy in which a user gets right to act on behalf of other users. This meta-level characteristic together with the complexity of delegation itself make it crucial to ensure the correct enforcement and management of delegation policy in a system via testing. To this end, we adopt mutation analysis for delegation policies. In order to achieve this, a set of mutant operators specially designed for introducing mutants into the key components (features) of delegation is proposed. Our approach consists of analyzing the representation of the key components of delegation, based on which we derive the suggested set of mutant operators. These operators can then be used to introduce mutants into delegation policies and thus, enable mutation testing. A demonstration of the proposed approach on a model-driven adaptive delegation implementation of a library management system is also provided. [less ▲] Detailed reference viewed: 183 (11 UL)![]() Henard, Christopher ![]() ![]() ![]() in Proceedings of the 2013 International Conference on Software Engineering (2013) Detailed reference viewed: 1059 (8 UL)![]() Papadakis, Mike ![]() ![]() in International Working Conference on Source Code Analysis and Manipulation (2013) Detailed reference viewed: 163 (4 UL)![]() Henard, Christopher ![]() ![]() ![]() in 17th International Software Product Line Conference, SPLC 2013, Tokyo, Japan - August 26 - 30, 2013 (2013) Detailed reference viewed: 187 (13 UL) |
||