MAJOR: An efficient and extensible tool for mutation analysis in a Java compiler

Just, René; Schweiggert, Franz; Kapfhammer, Gregory M.

doi:10.1109/ase.2011.6100138

Cited by 114 publications

(85 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The approach of traversing the AST has also been taken in other mutation systems for mainstream languages, like Major for Java [32], whereas Clang has been used in CCMutator [25] for multithreaded C/C++ programs and MILU [33] for the C programming language. The main benefit of analyzing the AST is the consistent search of potential locations, omitting higher-level details.…”

Section: Mutation Operator Implementationmentioning

confidence: 99%

Assessment of class mutation operators for C++ with the MuCPP mutation system

Delgado‐Pérez

Medina‐Bulo

Palomo-Lozano

et al. 2017

Information and Software Technology

View full text Add to dashboard Cite

Context: Mutation testing has been mainly analyzed regarding traditional mutation operators involving structured programming constructs common in mainstream languages, but mutations at the class level have not been assessed to the same extent. This fact is noteworthy in the case of C++, despite being one of the most relevant languages including object-oriented features. Objective: This paper provides a complete evaluation of class operators for the C++ programming language. MuCPP, a new system devoted to the application of mutation testing to this language, was developed to this end. This mutation system implements class mutation operators in a robust way, dealing with the inherent complexity of the language. Method: MuCPP generates the mutants by traversing the abstract syntax tree of each translation unit with the Clang API, and stores mutants as branches in the Git version control system. The tool is able to detect duplicate mutants, avoid system headers, and drive the compilation process. Then, MuCPP is used to conduct experiments with several open-source C++ programs. Results: The improvement rules listed in this paper to reduce unproductive class mutants have a significant impact in the computational cost of the technique. We also calculate the quantity and distribution of mutants generated with class operators, which generate far fewer mutants than their traditional counterparts. Conclusions: We show that the tests accompanying these programs cannot detect faults related to particular object-oriented features of C++. In order to increase the mutation score, we create new test scenarios to kill the surviving class mutants for all the applications. The results confirm that, while traditional mutation operators are still needed, class operators can complement them and help testers further improve the test suite.

show abstract

Section: Mutation Operator Implementationmentioning

confidence: 99%

Assessment of class mutation operators for C++ with the MuCPP mutation system

Delgado‐Pérez

Medina‐Bulo

Palomo-Lozano

et al. 2017

Information and Software Technology

View full text Add to dashboard Cite

show abstract

“…Namely, we applied the non independent samples in a Mannvalue equal to 0.012. Therefore, we can conclude that the mutation score of the two groups are significantly different, where the TDD approach scored higher than the non We next measured the mutation scores using MAJOR [28], [29], [25]. In Figure 3, we the results of all benchmarks.…”

Section: Tdd Vs Traditional Testingmentioning

confidence: 99%

“…line, branch, instruction coverage) from the bytecode. MAJOR [25] is a mutation testing and score tool developed by Rene ́ Just. The Major mutation framework enables fundamental research on mutation testing as well as efficient mutation analysis of large software systems.…”

Section: ) Metricsmentioning

confidence: 99%

Quality Metrics of Test Suites in Testdriven Designed Applications

Alkaoud¹,

Walcott²

2018

IJSEA

View full text Add to dashboard Cite

New techniques for writing and developing software have evolved in recent years. One is Test-Driven Development (TDD) in which tests are written before code. No code should be written without first having a test to execute it. Thus, in terms of code coverage, the quality of test suites written using TDD should be high.In this work, we analyze applications written using TDD and traditional techniques. Specifically, we demonstrate the quality of the associated test suites based on two quality metrics: 1) structure-based criterion, 2) fault-based criterion. We learn that test suites with high branch test coverage will also have high mutation scores, and we especially reveal this in the case of TDD applications. We found that TestDriven Development is an effective approach that improves the quality of the test suite to cover more of the source code and also to reveal more.

show abstract

“…A widely adopted strategy in this category is to execute the test suite on the original program before mutation execution to avoid unnecessary executions. Coveragebased optimisation filters out the test executions when a test case does not cover the mutated statement; this optimisation has been used in existing mutation testing tools, such as JAVALANCHE [6], Major [10] and PIT/PiTest [11]. Also of interest is infection-based optimisation, which only executes a test case on a mutant when the test infects the execution state of the mutant, filtering out weakly live mutants.…”

Section: Related Workmentioning

confidence: 99%

Speeding-Up Mutation Testing via Data Compression and State Infection

Zhu

Panichella

Zaidman

2017

2017 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)

View full text Add to dashboard Cite

Abstract-Mutation testing is widely considered as a high-end test criterion due to the vast number of mutants it generates. Although many efforts have been made to reduce the computational cost of mutation testing, its scalability issue remains in practice. In this paper, we introduce a novel method to speed up mutation testing based on state infection information. In addition to filtering out uninfected test executions, we further select a subset of mutants and a subset of test cases to run leveraging data-compression techniques. In particular, we adopt Formal Concept Analysis (FCA) to group similar mutants together and then select test cases to cover these mutants. To evaluate our method, we conducted an experimental study on six open source Java projects. We used EvoSuite to automatically generate test cases and to collect mutation data. The initial results show that our method can reduce the execution time by 83.93% with only 0.257% loss in precision.

show abstract

MAJOR: An efficient and extensible tool for mutation analysis in a Java compiler

Cited by 114 publications

References 9 publications

Assessment of class mutation operators for C++ with the MuCPP mutation system

Assessment of class mutation operators for C++ with the MuCPP mutation system

Quality Metrics of Test Suites in Testdriven Designed Applications

Speeding-Up Mutation Testing via Data Compression and State Infection

Contact Info

Product

Resources

About