Automatically repairing a buggy program is essentially a search problem, searching for code
transformations that pass a set of tests. Various search strategies have been explored, but …

First-order mutants (FOMs) have been widely used in mutation-based fault localization
(MBFL) approaches and have achieved promising results in single-fault localization …

Extreme mutation testing (XMT) detects undesirable pseudo-testedness in a program by
deleting the method bodies of covered code and observing whether the test suite can detect …

A common practice in computer science courses is to evaluate student-written test suites
against either a set of manually-seeded faults (handwritten by an instructor) or against all …

Abstract Context: Fault Localization (FL) is an important and tedious phase of software
debugging. Among various FL techniques, Mutation-Based Fault Localization (MBFL) …

Fault localization is one of the most expensive activities in software debugging. Mutation-
based fault localization (MBFL) is a commonly studied technique that applied mutation …

Mutation testing has a worthy responsibility in the software testing process. Mutation testing
concepts are used as a basis for generating test data (inputs) for killing the mutants …

Higher Order Mutation (HOM) has been proposed to avoid equivalent mutants and improve
the scalability of mutation testing, but generating useful HOMs remain an expensive search …

Most fuzzing efforts, very understandably, focus on fuzzing the program in which bugs are to
be found. However, in this paper we propose that fuzzing programs “near” the System Under …

Higher order mutation testing is a type of white-box testing in which the source code is
changed repeatedly using two or more mutation operators to generate mutated programs …