Model-Based Mutation Testing Using Pushdown Automata

Fevzi BELL<sg00046.gif>; Mutlu BEYAZIT; Tomohiko TAKAGI; Zengo FURUKAWA

doi:10.1587/transinf.E95.D.2211

Model-Based Mutation Testing Using Pushdown Automata

Fevzi BELL, Mutlu BEYAZIT, Tomohiko TAKAGI, Zengo FURUKAWA

Full Text Views

0

Cite this

Summary :

A model-based mutation testing (MBMT) approach enables to perform negative testing where test cases are generated using mutant models containing intentional faults. This paper introduces an alternative MBMT framework using pushdown automata (PDA) that relate to context-free (type-2) languages. There are two key ideas in this study. One is to gain stronger representational power to capture the features whose behavior depends on previous states of software under test (SUT). The other is to make use of a relatively small test set and concentrate on suspicious parts of the SUT by using MBMT approach. Thus, the proposed framework includes (1) a novel usage of PDA for modeling SUT, (2) novel mutation operators for generating PDA mutants, (3) a novel coverage criterion, and an algorithm to generate negative test cases from mutant PDA. A case study validates the approach, and discusses its characteristics and limitations.

Publication: IEICE TRANSACTIONS on Information Vol.E95-D No.9 pp.2211-2218

Publication Date: 2012/09/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1587/transinf.E95.D.2211

Type of Manuscript: Special Section PAPER (Special Section on Software Reliability Engineering)

Category

Cite this

Copy

Fevzi BELL, Mutlu BEYAZIT, Tomohiko TAKAGI, Zengo FURUKAWA, "Model-Based Mutation Testing Using Pushdown Automata" in IEICE TRANSACTIONS on Information, vol. E95-D, no. 9, pp. 2211-2218, September 2012, doi: 10.1587/transinf.E95.D.2211.
Abstract: A model-based mutation testing (MBMT) approach enables to perform negative testing where test cases are generated using mutant models containing intentional faults. This paper introduces an alternative MBMT framework using pushdown automata (PDA) that relate to context-free (type-2) languages. There are two key ideas in this study. One is to gain stronger representational power to capture the features whose behavior depends on previous states of software under test (SUT). The other is to make use of a relatively small test set and concentrate on suspicious parts of the SUT by using MBMT approach. Thus, the proposed framework includes (1) a novel usage of PDA for modeling SUT, (2) novel mutation operators for generating PDA mutants, (3) a novel coverage criterion, and an algorithm to generate negative test cases from mutant PDA. A case study validates the approach, and discusses its characteristics and limitations.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E95.D.2211/_p

Copy

@ARTICLE{e95-d_9_2211,
author={Fevzi BELL, Mutlu BEYAZIT, Tomohiko TAKAGI, Zengo FURUKAWA, },
journal={IEICE TRANSACTIONS on Information},
title={Model-Based Mutation Testing Using Pushdown Automata},
year={2012},
volume={E95-D},
number={9},
pages={2211-2218},
abstract={A model-based mutation testing (MBMT) approach enables to perform negative testing where test cases are generated using mutant models containing intentional faults. This paper introduces an alternative MBMT framework using pushdown automata (PDA) that relate to context-free (type-2) languages. There are two key ideas in this study. One is to gain stronger representational power to capture the features whose behavior depends on previous states of software under test (SUT). The other is to make use of a relatively small test set and concentrate on suspicious parts of the SUT by using MBMT approach. Thus, the proposed framework includes (1) a novel usage of PDA for modeling SUT, (2) novel mutation operators for generating PDA mutants, (3) a novel coverage criterion, and an algorithm to generate negative test cases from mutant PDA. A case study validates the approach, and discusses its characteristics and limitations.},
keywords={},
doi={10.1587/transinf.E95.D.2211},
ISSN={1745-1361},
month={September},}

Copy

TY - JOUR
TI - Model-Based Mutation Testing Using Pushdown Automata
T2 - IEICE TRANSACTIONS on Information
SP - 2211
EP - 2218
AU - Fevzi BELL
AU - Mutlu BEYAZIT
AU - Tomohiko TAKAGI
AU - Zengo FURUKAWA
PY - 2012
DO - 10.1587/transinf.E95.D.2211
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E95-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2012
AB - A model-based mutation testing (MBMT) approach enables to perform negative testing where test cases are generated using mutant models containing intentional faults. This paper introduces an alternative MBMT framework using pushdown automata (PDA) that relate to context-free (type-2) languages. There are two key ideas in this study. One is to gain stronger representational power to capture the features whose behavior depends on previous states of software under test (SUT). The other is to make use of a relatively small test set and concentrate on suspicious parts of the SUT by using MBMT approach. Thus, the proposed framework includes (1) a novel usage of PDA for modeling SUT, (2) novel mutation operators for generating PDA mutants, (3) a novel coverage criterion, and an algorithm to generate negative test cases from mutant PDA. A case study validates the approach, and discusses its characteristics and limitations.
ER -