n-Complete test suites for IOCO

Petra van den Bos; Ramon Janssen; Joshua Moerman

doi:10.1007/s11219-018-9422-x

n-Complete test suites for IOCO

Petra van den Bos
, Ramon Janssen
, Joshua Moerman

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

An n-complete test suite for automata guarantees to detect all faulty implementations with a bounded number of states. We propose a construction of such a test suite for ioco conformance on labeled transition systems, which we derive from construction methods for deterministic FSMs. Our resulting test suite poses no further restrictions on the implementations other than their number of states and fairness in test execution. This elevates restrictions made in existing methods. In particular, we address the problem of compatible states: specification states which can be implemented by a single state. Such states are forbidden by existing methods for ioco, as they complicate test suite construction.

Original language	English
Pages (from-to)	563-588
Number of pages	26
Journal	Software Quality Journal
Volume	27
Issue number	2
DOIs	https://doi.org/10.1007/s11219-018-9422-x
Publication status	Published - 15 Jun 2019
Externally published	Yes

Keywords

Complete test suite
Distinguishing states
IOCO
Model-based testing

Access to Document

10.1007/s11219-018-9422-xLicence: CC BY

n-Complete Test Suites for IOCO
Bos, P. V. D., Janssen, R. & Moerman, J., Sept 2017, Testing Software and Systems: 29th IFIP WG 6.1 International Conference, ICTSS 2017, St. Petersburg, Russia, October 9-11, 2017, Proceedings. Springer, p. 91-107 17 p. (Lecture Notes in Computer Science, Vol. 10533).
Research output: Chapter in Book/Report/Conference proceeding › Conference Article in proceeding › Academic › peer-review

Cite this

@article{17057737402d451cb85f23c89e09b78d,

title = "n-Complete test suites for IOCO",

abstract = "An n-complete test suite for automata guarantees to detect all faulty implementations with a bounded number of states. We propose a construction of such a test suite for ioco conformance on labeled transition systems, which we derive from construction methods for deterministic FSMs. Our resulting test suite poses no further restrictions on the implementations other than their number of states and fairness in test execution. This elevates restrictions made in existing methods. In particular, we address the problem of compatible states: specification states which can be implemented by a single state. Such states are forbidden by existing methods for ioco, as they complicate test suite construction.",

keywords = "Complete test suite, Distinguishing states, IOCO, Model-based testing",

author = "Bos, \{Petra van den\} and Ramon Janssen and Joshua Moerman",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2019",

month = jun,

day = "15",

doi = "10.1007/s11219-018-9422-x",

language = "English",

volume = "27",

pages = "563--588",

journal = "Software Quality Journal",

issn = "0963-9314",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - n-Complete test suites for IOCO

AU - Bos, Petra van den

AU - Janssen, Ramon

AU - Moerman, Joshua

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2019/6/15

Y1 - 2019/6/15

N2 - An n-complete test suite for automata guarantees to detect all faulty implementations with a bounded number of states. We propose a construction of such a test suite for ioco conformance on labeled transition systems, which we derive from construction methods for deterministic FSMs. Our resulting test suite poses no further restrictions on the implementations other than their number of states and fairness in test execution. This elevates restrictions made in existing methods. In particular, we address the problem of compatible states: specification states which can be implemented by a single state. Such states are forbidden by existing methods for ioco, as they complicate test suite construction.

AB - An n-complete test suite for automata guarantees to detect all faulty implementations with a bounded number of states. We propose a construction of such a test suite for ioco conformance on labeled transition systems, which we derive from construction methods for deterministic FSMs. Our resulting test suite poses no further restrictions on the implementations other than their number of states and fairness in test execution. This elevates restrictions made in existing methods. In particular, we address the problem of compatible states: specification states which can be implemented by a single state. Such states are forbidden by existing methods for ioco, as they complicate test suite construction.

KW - Complete test suite

KW - Distinguishing states

KW - IOCO

KW - Model-based testing

U2 - 10.1007/s11219-018-9422-x

DO - 10.1007/s11219-018-9422-x

M3 - Article

SN - 0963-9314

VL - 27

SP - 563

EP - 588

JO - Software Quality Journal

JF - Software Quality Journal

IS - 2

ER -

n-Complete test suites for IOCO

Abstract

Keywords

Access to Document

Fingerprint

Research output

n-Complete Test Suites for IOCO

Cite this