Model-Based Mutation Testing Using Pushdown Automata

Belli, Fevzi; Beyazit, Mutlu; Takagi, Toshihisa; Furukawa, Zengo

doi:10.1587/transinf.e95.d.2211

Cited by 6 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3 and 4. The prototype was added to the model-based testing tool family MoMuT 9 and goes by the name MoMuT::REQs. The implementation uses the programming language Scala 2.10 and Microsoft's SMT solver Z3 [40].…”

Section: Implementation and Experimental Resultsmentioning

confidence: 99%

“…Amman et al [8] used temporal formulae to check equivalence between models and mutants, and converted counter examples to test cases, in case of nonequivalence. Belli et al [9,10] applied model-based mutation testing to event sequence graphs and pushdown automata. Hierons and Merayo [31] applied mutation-based test-case generation to probabilistic finite-state machines.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Require, test, and trace IT

Aichernig

Hormaier

Lorber

et al. 2016

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

We propose a framework for requirement-driven test generation that combines contract-based interface theories with model-based testing. We design a specification language, requirement interfaces, for formalizing different views (aspects) of synchronous data-flow systems from informal requirements. Various views of a system, modeled as requirement interfaces, are naturally combined by conjunction. We develop an incremental test generation procedure with several advantages. The test generation is driven by a single requirement interface at a time. It follows that each test assesses a specific aspect or feature of the system, specified by its associated requirement interface. Since we do not explicitly compute the conjunction of all requirement interfaces of the system, we avoid state space explosion while The research leading to these results has received funding from the ARTEMIS Joint Undertaking under grant agreements Nos. 269335 and 332830 and from the Austrian Research Promotion Agency (FFG) under grant agreements Nos. 829817 and 838498 for the implementation of the projects MBAT, Combined Model-based Analysis and Testing of Embedded Systems and CRYSTAL, Critical System Engineering Acceleration.

show abstract

Section: Implementation and Experimental Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Require, test, and trace IT

Aichernig

Hormaier

Lorber

et al. 2016

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

show abstract

“…Insertion and omission mutation operators are also applicable to other models in addition to graph-like models. In [73], Belli et al applied these two basic mutation operators to pushdown automata. Belli and Beyazit showed the use of these two basic mutation operators on regular expressions in [74] and also on regular grammars in [75].…”

Section: Model-based Mutation Testingmentioning

confidence: 99%

Model-based mutation testing—Approach and case studies

Belli

Budnik

Hollmann³

et al. 2016

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

This paper rigorously introduces the concept of model-based mutation testing (MBMT) and positions it in the landscape of mutation testing. Two elementary mutation operators, insertion and omission, are exemplarily applied to a hierarchy of graph-based models of increasing expressive power including directed graphs, event sequence graphs, finite-state machines and statecharts. Test cases generated based on the mutated models (mutants) are used to determine not only whether each mutant can be killed but also whether there are any faults in the corresponding system under consideration (SUC) developed based on the original model. Novelties of our approach are: (1) evaluation of the fault detection capability (in terms of revealing faults in the SUC) of test sets generated based on the mutated models, and (2) superseding of the great variety of existing mutation operators by iterations and combinations of the two proposed elementary operators. Three case studies were conducted on industrial and commercial real-life systems to demonstrate the feasibility of using the proposed MBMT approach in detecting faults in SUC, and to analyze its characteristic features. Our experimental data suggest that test sets generated based on the mutated models created by insertion operators are more effective in revealing faults in SUC than those generated by omission operators. Worth noting is that test sets following the MBMT approach were able to detect faults in the systems that were tested by manufacturers and independent testing organizations before they were released.

show abstract

“…Basic mutation operators are defined and coveragebased test generation is performed. The proposed concepts are also refined or extended in different ways [16], [20], [21], [59], [42]. In these works, equivalent mutants are not really excluded and used in coverage-based test generation to populate the test set.…”

Section: Model-based Mutation Testingmentioning

confidence: 99%

Exploiting Model Morphology for Event-Based Testing

Belli

Beyazit

2015

IIEEE Trans. Software Eng.

Self Cite

View full text Add to dashboard Cite

Abstract-Model-based testing employs models for testing. Model-based mutation testing (MBMT) additionally involves fault models, called mutants, by applying mutation operators to the original model. A problem encountered with MBMT is the elimination of equivalent mutants and multiple mutants modeling the same faults. Another problem is the need to compare a mutant to the original model for test generation. This paper proposes an event-based approach to MBMT that is not fixed on single events and a single model but rather operates on sequences of events of length k ! 1 and invokes a sequence of models that are derived from the original one by varying its morphology based on k. The approach employs formal grammars, related mutation operators, and algorithms to generate test cases, enabling the following: (1) the exclusion of equivalent mutants and multiple mutants; (2) the generation of a test case in linear time to kill a selected mutant without comparing it to the original model; (3) the analysis of morphologically different models enabling the systematic generation of mutants, thereby extending the set of fault models studied in related literature. Three case studies validate the approach and analyze its characteristics in comparison to random testing and another MBMT approach.

show abstract

Model-Based Mutation Testing Using Pushdown Automata

Cited by 6 publications

References 14 publications

Require, test, and trace IT

Require, test, and trace IT

Model-based mutation testing—Approach and case studies

Exploiting Model Morphology for Event-Based Testing

Contact Info

Product

Resources

About