Complete Testing from a Stream X-Machine Specification

Authors:
Florentin Ipate;Mike Holcombe
Affiliations:
(Correspd.) Department of Computer Science and Mathematics, University of Pitesti, Romania. fipate@ifsoft.ro;Department of Computer Science, University of Sheffield, UK. M.Holcombe@dcs.shef.ac.uk
Venue:
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Year:
2005

Citing 6
Cited 0

The category-partition method for specifying and generating fuctional tests

Communications of the ACM
Automatic functional test generation using the extended finite state machine model

DAC '93 Proceedings of the 30th international Design Automation Conference
Automata, Languages, and Machines

Automata, Languages, and Machines
Contextual grammars as generative models of natural languages

Computational Linguistics
Testing Software Design Modeled by Finite-State Machines

IEEE Transactions on Software Engineering
P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines)

Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the strengths of using a stream X-machine to specify a system is that, under certain well defined conditions, it is possible to produce a test set that is guaranteed to determine the correctness of the implementation. This testing method assumes that the processing functions are correctly implemented, therefore it only tests the integration of the processing functions implementations into the system implementation. This paper uses a case study to illustrate how this method can be extended so that it will no longer require the implementations of the processing functions to be proved correct before the actual system testing can take place. Instead, the testing of the processing functions is performed along with the integration testing.