A Fortran 77 interpreter for mutation analysis

Offutt, A. Jefferson; King, K. N.

doi:10.1145/960114.29669

Cited by 24 publications

(10 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, there is another strategy based on the execution type. The first mutation tools were interpreted‐based . These tools interpreted the mutated code of each mutant in order to determine killed mutants.…”

Section: State Of the Artmentioning

confidence: 99%

Reducing mutation costs through uncovered mutants

Mateo

Usaola

2014

Software Testing Verif & Rel

View full text Add to dashboard Cite

Summary Mutation testing is a very effective testing technique that creates mutants in order to design test cases that will kill the mutants. One problem of mutation testing is high costs: creating mutants, executing mutants and calculating the mutation score. This paper empirically analyzes the effect of covering mutants through the mutant schema improved with extra code (MUSIC) technique. This technique annotates the statements covered by the tests in the original system in order to filter the mutant executions, because tests are only executed against the mutants whose mutated statement is covered by the tests. Therefore, MUSIC is meant to reduce the number of required executions and identify infinite loops at a reduced cost. Besides, an experiment was performed to evaluate the advantages and disadvantages of analyzing the covered mutants. As a result, we conclude that analyzing the covered mutants reduces the execution cost of mutation testing and its application is therefore recommended. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Section: State Of the Artmentioning

confidence: 99%

Reducing mutation costs through uncovered mutants

Mateo

Usaola

2014

Software Testing Verif & Rel

View full text Add to dashboard Cite

show abstract

“…For simplicity, we will always use the term "program" to refer to the piece of software undergoing testing.) Mothra immediately translates the program to an internal form (described in [33]) that is used throughout the experiment.…”

Section: Casesmentioning

confidence: 99%

“…Another means that has been suggested of shortening the time spent executing mutants of a program is that of combined stream execution [33]. During mutation analysis, the test program is executed many times--once in the original form and once for each mutant.…”

Section: Resource Consumptionmentioning

confidence: 99%

An Incremental Updating Algorithm for Online Mining Association Rules

Jia¹,

Yuntao²,

Wang

2009

2009 International Conference on Web Information Systems and Mining

View full text Add to dashboard Cite

Mothra is a software testing environment that supports mutationbased testing of software systems. Mothra is interactive; it provides a high-bandwidth user interface to make software testing faster and less painful. Mothra currently runs on a variety of systems under 4.3BSD UNIX, UNIX System V, and ULTRIX-32 1.2. This paper begins with a brief introduction to mutation analysis. We then rake the reader on a guided tour of Mothra, emphasizing how it interacts with the tester.Then we present with a short discussion of Mothra's intemal design. Next, we discuss some major problems with using mutation analysis and discuss possible solutions. We conclude by presenting a solution to one of these problem-a new method of automatically generating mutation-adequate test data.

show abstract

“…The bugs were seeded using local mutation operators common in mutation analysis (cf. [23]), such as replacing one arithmetic operation with another. Such mutations have been previously shown to be indicative of developer mistakes [14] and potentially as difficult to locate as natural human bugs [17].…”

Section: Benchmark Selectionmentioning

confidence: 99%

Finding and Fixing Bugs in Liquid Haskell

Tondwalkar

View full text Add to dashboard Cite

Dependent types provide strong guarantees but can be hard to program, admitting mistakes in the implementation as well as the specification. We present algorithms for resolving verification failures by both finding bugs in implementations and also completing annotations in the refinement type framework. We present a fault localization algorithm for finding likely bug locations when verification failure stems from a bug in the implementation. We use the type checker as an oracle to search for a set of minimal unsatisfiable type constraints that map to possible bug locations. Conversely, we present an algorithm based on Craig interpolation to discover predicates that allow the type checker to verify programs that would otherwise be deemed unsafe due to inadequate type annotations. We evaluate our algorithms on an indicative benchmark of Haskell programs with Liquid Haskell type annotations. Our fault localization algorithm localizes more bugs than the vanilla LiquidHaskell type checker while still returning a small number of false positives. Our predicate discovery algorithm infers refinements types for large classes of benchmark programs, including all those that admit bounded constraint unrolling. In addition, the design of our algorithms allows them to be effectively extended to other typing systems.

show abstract

A Fortran 77 interpreter for mutation analysis

Cited by 24 publications

References 4 publications

Reducing mutation costs through uncovered mutants

Reducing mutation costs through uncovered mutants

An Incremental Updating Algorithm for Online Mining Association Rules

Finding and Fixing Bugs in Liquid Haskell

Contact Info

Product

Resources

About