A Search-Based Constraint Elicitation in Test Design

Hiroyuki NAKAGAWA; Tatsuhiro TSUCHIYA

doi:10.1587/transinf.2015KBP0010

A Search-Based Constraint Elicitation in Test Design

Hiroyuki NAKAGAWA, Tatsuhiro TSUCHIYA

Full Text Views

0

Share
Cite this

Summary :

Pair-wise testing is an effective test planning technique for finding interaction faults using a small set of test cases. Constraint elicitation is an important process in the pair-wise testing design since constraints determine the test space; however, the constraint elicitation process has not been well studied. It usually requires manual capturing and precise definition of constraints. In this paper, we propose a constraint elicitation process that helps combinatorial test design. Our elicitation process consists of two steps: parameter combination identification and value pair determination. We conduct experiments on some test models, and demonstrate that some extracted rules match constraints and others helps to define constraints.

Publication: IEICE TRANSACTIONS on Information Vol.E99-D No.9 pp.2229-2238

Publication Date: 2016/09/01

Publicized: 2016/07/06

Online ISSN: 1745-1361

DOI: 10.1587/transinf.2015KBP0010

Type of Manuscript: Special Section PAPER (Special Section on Knowledge-Based Software Engineering)

Category

Cite this

Copy

Hiroyuki NAKAGAWA, Tatsuhiro TSUCHIYA, "A Search-Based Constraint Elicitation in Test Design" in IEICE TRANSACTIONS on Information, vol. E99-D, no. 9, pp. 2229-2238, September 2016, doi: 10.1587/transinf.2015KBP0010.
Abstract: Pair-wise testing is an effective test planning technique for finding interaction faults using a small set of test cases. Constraint elicitation is an important process in the pair-wise testing design since constraints determine the test space; however, the constraint elicitation process has not been well studied. It usually requires manual capturing and precise definition of constraints. In this paper, we propose a constraint elicitation process that helps combinatorial test design. Our elicitation process consists of two steps: parameter combination identification and value pair determination. We conduct experiments on some test models, and demonstrate that some extracted rules match constraints and others helps to define constraints.
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.2015KBP0010/_p

Copy

@ARTICLE{e99-d_9_2229,
author={Hiroyuki NAKAGAWA, Tatsuhiro TSUCHIYA, },
journal={IEICE TRANSACTIONS on Information},
title={A Search-Based Constraint Elicitation in Test Design},
year={2016},
volume={E99-D},
number={9},
pages={2229-2238},
abstract={Pair-wise testing is an effective test planning technique for finding interaction faults using a small set of test cases. Constraint elicitation is an important process in the pair-wise testing design since constraints determine the test space; however, the constraint elicitation process has not been well studied. It usually requires manual capturing and precise definition of constraints. In this paper, we propose a constraint elicitation process that helps combinatorial test design. Our elicitation process consists of two steps: parameter combination identification and value pair determination. We conduct experiments on some test models, and demonstrate that some extracted rules match constraints and others helps to define constraints.},
keywords={},
doi={10.1587/transinf.2015KBP0010},
ISSN={1745-1361},
month={September},}

Copy

TY - JOUR
TI - A Search-Based Constraint Elicitation in Test Design
T2 - IEICE TRANSACTIONS on Information
SP - 2229
EP - 2238
AU - Hiroyuki NAKAGAWA
AU - Tatsuhiro TSUCHIYA
PY - 2016
DO - 10.1587/transinf.2015KBP0010
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E99-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2016
AB - Pair-wise testing is an effective test planning technique for finding interaction faults using a small set of test cases. Constraint elicitation is an important process in the pair-wise testing design since constraints determine the test space; however, the constraint elicitation process has not been well studied. It usually requires manual capturing and precise definition of constraints. In this paper, we propose a constraint elicitation process that helps combinatorial test design. Our elicitation process consists of two steps: parameter combination identification and value pair determination. We conduct experiments on some test models, and demonstrate that some extracted rules match constraints and others helps to define constraints.
ER -