Testing conformance of a deterministic implementation against a non-deterministic stream X-machine

  • Authors:
  • R. M. Hierons;M. Harman

  • Affiliations:
  • Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex, UB8 3PH, UK;Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex, UB8 3PH, UK

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2004

Quantified Score

Hi-index 5.23

Visualization

Abstract

Stream X-machines are a formalisation of extended finite state machines that have been used to specify systems. One of the great benefits of using stream X-machines, for the purpose of specification, is the associated test generation technique which produces a test that is guaranteed to determine correctness under certain design for test conditions. This test generation algorithm has recently been extended to the case where the specification is non-deterministic. However, the algorithms for testing from a non-deterministic stream X-machine currently have limitations: either they test for equivalence, rather than conformance or they restrict the source of nondeterminism allowed in the specification. This paper introduces a new test generation algorithm that overcomes both of these limitations, for situations where the implementation is known to be deterministic.