n-Complete test suites for IOCO

Petra van den Bos*, Ramon Janssen, Joshua Moerman

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

Abstract

An n-complete test suite for automata guarantees to detect all faulty implementations with a bounded number of states. This principle is well-known when testing FSMs for equivalence, but the problem becomes harder for ioco conformance on labeled transitions systems. Existing methods restrict the structure of specifications and implementations. We eliminate those restrictions, using only the number of implementation states, and fairness in test execution. We provide a formalization, a construction and a correctness proof for n-complete test suites for ioco.

Original languageEnglish
Title of host publicationTesting Software and Systems - 29th IFIP WG 6.1 International Conference, ICTSS 2017, Proceedings
EditorsNina Yevtushenko, Ana Rosa Cavalli, Husnu Yenigun
Place of PublicationCham
PublisherSpringer
Pages91-107
Number of pages17
ISBN (Electronic)978-3-319-67549-7
ISBN (Print)978-3-319-67548-0
DOIs
Publication statusPublished - 2017
Externally publishedYes
Event29th IFIP WG 6.1 International Conference on Testing Software and Systems, ICTSS 2017 - St. Petersburg, Russian Federation
Duration: 9 Oct 201711 Oct 2017
Conference number: 29

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume10533
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference29th IFIP WG 6.1 International Conference on Testing Software and Systems, ICTSS 2017
Abbreviated titleICTSS 2017
Country/TerritoryRussian Federation
CitySt. Petersburg
Period9/10/1711/10/17

Keywords

  • n/a OA procedure

Fingerprint

Dive into the research topics of 'n-Complete test suites for IOCO'. Together they form a unique fingerprint.

Cite this