4.1 Article

Finite complete suites for CSP refinement testing

Journal

SCIENCE OF COMPUTER PROGRAMMING
Volume 179, Issue -, Pages 1-23

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.scico.2019.04.004

Keywords

Model-based testing; CSP; Traces refinement; Failures refinement; Complete test suites

Funding

  1. UK EPSRC [EP/12025134/1]
  2. Royal Academy of Engineering Grant [CiET1718\45]
  3. EPSRC [EP/M025756/1, EP/R025479/1, EP/R025134/1] Funding Source: UKRI

Ask authors/readers for more resources

In this paper, new contributions for model-based testing using Communicating Sequential Processes (CSP) are presented. For a finite non-terminating CSP process representing the reference model, finite test suites for checking the conformance relations traces and failures refinement are presented, and their completeness (that is, capability to uncover conformity violations) is proven. The fault domains for which complete failure detection can be guaranteed are specified by means of normalised transition graphs representing the failures semantics of finite-state CSP processes. While complete test suites for CSP processes have been previously investigated by several authors, a sufficient condition for their finiteness is presented here for the first time. Moreover, it is shown that the test suites are optimal in two aspects: (a) the maximal length of test traces cannot be further reduced, and (b) the nondeterministic behaviour cannot be tested with smaller or fewer sets of events, without losing the test suite's completeness property. (C) 2019 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.1
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available