Package de.rwth.swc.coffee4j.algorithmic.sequential.characterization.mixtgte

Class Mixtgte

java.lang.Object

de.rwth.swc.coffee4j.algorithmic.sequential.characterization.mixtgte.Mixtgte

All Implemented Interfaces:

FaultCharacterizationAlgorithm

Direct Known Subclasses:

GeneratingMixtgte

public class Mixtgte
extends Object
implements FaultCharacterizationAlgorithm

An Implementation of the MixTgTe algorithm described in "Efficient and Guaranteed Detection of t-way Failure-Inducing Combinations" by Arcaini, Gargantini and Radavelli. It is an interleaving Fault Characterization Algorithm that collects tuples that seem to cause failures and isolates them.

It starts from identifying combinations of size t = 1 until the given strength is reached. It guarantees to detect and isolate all minimal FICs with a size up to the given strength.

Constructor Summary

Constructors

Constructor	Description
Mixtgte(TestModel testModel)	Creates a new MixTgTe algorithm for a given testModel.
Mixtgte(FaultCharacterizationConfiguration config)	Creates a new MixTgTe algorithm for a given configuration.

Method Summary

Modifier and Type	Method	Description
List<int[]>	computeFailureInducingCombinations()	Computes a list of most likely failure inducing combinations refined from previous calls to FaultCharacterizationAlgorithm.computeNextTestInputs(Map).
List<int[]>	computeNextTestInputs(Map<int[],TestResult> testResults)	Implements a variant of Algorithm 2 (MixTgTe_t, due to framework restrictions) of the referenced paper.
static FaultCharacterizationAlgorithmFactory	mixtgte()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Mixtgte

public Mixtgte(TestModel testModel)

Creates a new MixTgTe algorithm for a given testModel.

Parameters:

testModel - for the Fault Characterization Algorithm

Mixtgte

public Mixtgte(FaultCharacterizationConfiguration config)

Creates a new MixTgTe algorithm for a given configuration.

Parameters:

config - for the Fault Characterization Algorithm

Method Detail

mixtgte

public static FaultCharacterizationAlgorithmFactory mixtgte()

Returns:

a factory always returning new instances of the MixTgTe algorithm

computeNextTestInputs

public List<int[]> computeNextTestInputs(Map<int[],TestResult> testResults)

Implements a variant of Algorithm 2 (MixTgTe_t, due to framework restrictions) of the referenced paper. Returns a non-empty list (one test case) to further refine the sets of unknown, failing and passing tuples as well as the set of minimal FICs (unknownTuples, failingAndExceptionalPassingTuples, passingTuples, isolatedMinInducingCombinations). As soon as an empty list is returned, the computation of the set of minimal FICs with size less or equal to the strength of testModel is completed and computeFailureInducingCombinations() can be called. Reordering of algorithm lines due to framework restrictions.

Specified by:

computeNextTestInputs in interface FaultCharacterizationAlgorithm

Parameters:

testResults - the results of the initial test suite or previous test inputs generated by this method. Must not be null. Empty for the first iteration of the algorithm.

Returns:

list of further test inputs which need to be executed to refine the list of suspicious combinations. In MixTgTe, this list contains only one element.

computeFailureInducingCombinations

public List<int[]> computeFailureInducingCombinations()

Description copied from interface: FaultCharacterizationAlgorithm

Computes a list of most likely failure inducing combinations refined from previous calls to FaultCharacterizationAlgorithm.computeNextTestInputs(Map). The combinations returned by this method are not guaranteed to be faulty, but it is guaranteed that no test input executed which contained this combination was successful.

Specified by:

computeFailureInducingCombinations in interface FaultCharacterizationAlgorithm

Returns:

list of all minimal FICs of size less or equal to strength of testModel