Testing methods for X-machines: a review

  • Authors:
  • K. Bogdanov;M. Holcombe;F. Ipate;L. Seed;S. Vanak

  • Affiliations:
  • Department of Computer Science, The University of Sheffield, Regent Court, 211 Portobello St., S1 4DP, Sheffield, UK;Department of Computer Science, The University of Sheffield, Regent Court, 211 Portobello St., S1 4DP, Sheffield, UK;Department of Computer Science and Mathematics, University of Pitesti, Str Targu din Vale 1, 0300, Pitesti, Romania;Department of Electronic & Electrical Engineering, The University of Sheffield, Mappin St., S1 3JD, Sheffield, UK;Department of Computer Science, The University of Sheffield, Regent Court, 211 Portobello St., S1 4DP, Sheffield, UK

  • Venue:
  • Formal Aspects of Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The X-machine testing method has been developed as an application of the W-method to testing the control structure of an implementation, against a specification. The method was proven to demonstrate the equivalence of the behaviour of the two, subject to a number of conditions both a specification and an implementation are expected to satisfy, such as (1) determinism of the two and (2) that functions labelling arcs on a transition diagram of a specification control structure have been tested in advance. Since the original publication of the testing method, a number of extensions have been published, removing the restrictions mentioned above. This paper surveys the extensions of the X-machine testing method, for (1) testing of functions together with testing of a transition diagram, (2) equivalence testing of a non-deterministic implementation against a non-deterministic specification, (3) conformance testing of a deterministic implementation against a non-deterministic specification and (4) equivalence testing of a system of concurrently executing and communicating X-machines, against a specification.