Skip to Main content Skip to Navigation
Conference papers

Test Generation by Constraint Solving and FSM Mutant Killing

Abstract : The problem of fault model-based test generation from formal models, in this case Finite State Machines, is addressed. We consider a general fault model which is a tuple of a specification, conformance relation and fault domain. The specification is a deterministic FSM which can be partially specified and not reduced. The conformance relation is quasi-equivalence, as all implementations in the fault domain are assumed to be completely specified FSMs. The fault domain is a set of all possible deterministic submachines of a given nondeterministic FSM, called a mutation machine. The mutation machine contains a specification machine and extends it with mutated transitions modelling potential faults. An approach for deriving a test suite which is complete (sound and exhaustive) for the given fault model is elaborated. It is based on our previously proposed method for analyzing the test completeness by logical encoding and SMT-solving. The preliminary experiments performed on an industrial controller indicate that the approach scales sufficiently well.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, November 21, 2017 - 3:53:16 PM
Last modification on : Friday, March 27, 2020 - 3:18:23 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Alexandre Petrenko, Omer Nguena Timo, S. Ramesh. Test Generation by Constraint Solving and FSM Mutant Killing. 28th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2016, Graz, Austria. pp.36-51, ⟨10.1007/978-3-319-47443-4_3⟩. ⟨hal-01643724⟩



Record views


Files downloads