Testing against a non-controllable stream X-machine using state counting
Theoretical Computer Science
Testing data processing-oriented systems from stream X-machine models
Theoretical Computer Science
Evaluation and Comparison of Inferred Regular Grammars
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Testing Non-deterministic Stream X-machine Models and P systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Nature-inspired techniques for conformance testing of object-oriented software
Applied Soft Computing
Testing from X-machine specifications
Formal methods and testing
Testing timed systems modeled by Stream X-machines
Software and Systems Modeling (SoSyM)
Automated Comparison of State-Based Software Models in Terms of Their Language and Structure
ACM Transactions on Software Engineering and Methodology (TOSEM)
Hi-index | 0.00 |
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.