Comparative Assessment of Testing and Model Checking Using Program Mutation

Bradbury, Jeremy S.; Cordy, James R.; Dingel, Juergen

doi:10.1109/taicpart.2007.4344126

Cited by 6 publications

(11 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Just like other fault-based testing techniques, the main purpose of Mutation Testing is to measure the quality of a test set. However, it can also be used to reduce the size of test set [3], to generate effective test data [4] and to compare techniques for verification [5,6].…”

Section: Introductionmentioning

confidence: 99%

Higher Order Mutation Testing

Jia

Harman

2009

Information and Software Technology

237

202

View full text Add to dashboard Cite

a b s t r a c tThis paper introduces a new paradigm for Mutation Testing, which we call Higher Order Mutation Testing (HOM Testing). Traditional Mutation Testing considers only first order mutants, created by the injection of a single fault. Often these first order mutants denote trivial faults that are easily killed. Higher order mutants are created by the insertion of two or more faults. The paper introduces the concept of a subsuming HOM; one that is harder to kill than the first order mutants from which it is constructed. By definition, subsuming HOMs denote subtle fault combinations. The paper reports the results of an empirical study of HOM Testing using 10 programs, including several non-trivial real-world subjects for which test suites are available.

show abstract

Section: Introductionmentioning

confidence: 99%

Higher Order Mutation Testing

Jia

Harman

2009

Information and Software Technology

237

202

View full text Add to dashboard Cite

show abstract

“…For comparing the different testing strategies for testing the concurrent Java programs, a set of concurrent mutation operators was provided by Jeremy s. Bradbury et al . With a motivation for improving the quality assurance techniques, the researchers compared the concurrency testing with ConTest and model checking with JPF. They concluded that the ConTest was comparatively efficient as this can kill a mutant in less average time than JPF.…”

Section: Overview Of Studiesmentioning

confidence: 99%

A systematic review of approaches for testing concurrent programs

Arora

Bhatia

Singh

2015

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYConcurrent programs are replacing the sequential programs as they utilize the true capabilities of multicore architecture. The extensive use of multicore systems and multithreaded paradigms warrants more attention to the testing of the concurrent programs. The testing concurrent program is not a new field as it has been more than 40 years because the first problem related to the testing concurrent program was addressed by the researchers. The field covers various domains, which include concurrency problems, testing approaches, techniques, graphical representations, tools, and subject systems. This paper aims at providing an overview of research in the domain of testing concurrent programs by classifying it into eight categories: (a) reachability testing, (b) structural testing, (c) model-based testing, (d) mutation-based testing, (e) slicing-based testing, (f) formal methods, (g) random testing, and (h) search-based testing. The survey is focused on the techniques applied, methodologies followed, and tools used in these aforementioned approaches. Furthermore, the gaps are also identified in different approaches. The paper concludes with the consolidation of various testing parameters along with the future directions.

show abstract

“…We have proposed several types of abstraction models for enterprise systems, but they have not proposed any guidelines for abstraction, for the sake of avoiding explosion of the number of states in the system. Jianguo [9] and Bradbury [10] aimed to improve the precision of the verification process through model checking and model testing. However, they could not design an accurate model translated from the source code including the defects.…”

Section: G Check the Actual Applicationmentioning

confidence: 99%

Verification of embedded system by a method for detecting defects in source codes using model checking

Aoki

Matsuura

2011

2011 IEEE Symposium on Computers &Amp; Informatics

View full text Add to dashboard Cite

We have proposed a method based on model checking for detecting hard-to-discover defects in enterprise systems. We apply our method to embedded system development to easily discover some defects caused by input/output data of the hardware which are influenced by the external environment before the software is integrated into the hardware. This paper discuss the effectiveness of our method using a case study to develop a line tracing robot.

show abstract

Comparative Assessment of Testing and Model Checking Using Program Mutation

Cited by 6 publications

References 19 publications

Higher Order Mutation Testing

Higher Order Mutation Testing

A systematic review of approaches for testing concurrent programs

Verification of embedded system by a method for detecting defects in source codes using model checking

Contact Info

Product

Resources

About