#### Filter Results:

- Full text PDF available (70)

#### Publication Year

1995

2017

- This year (1)
- Last 5 years (39)
- Last 10 years (79)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Mike Holcombe, Florentin Ipate
- Applied computing
- 1998

18 7.1 Some state machine theory. 7.2 The theoretical basis for finite state machine testing. 7.3 The theoretical basis for stream X-machine testing.

- Joaquin Aguado, Tudor Balanescu, Anthony J. Cowling, Marian Gheorghe, Mike Holcombe, Florentin Ipate
- Fundam. Inform.
- 2002

The aim of this paper is to show how the P systems with replicated rewriting can be mod-eled by X-machines (also called Eilenberg machines). In the first approach, the parallel behaviour of the regions of a P system is simulated by a sequential process involving a single X-machine. This allows the application of the X-machine testing procedures in order to… (More)

- Florentin Ipate, Mike Holcombe
- Formal Asp. Comput.
- 2000

X-machines were proposed by Holcombe as a possible specification language and since then a number of further investigations have demonstrated that the model is intuitive and easy to use as well as general enough to cater for a wide range of applications. In particular (generalised) stream X-machines have been found to be extremely useful as a specification… (More)

- Florentin Ipate, Mike Holcombe
- Softw. Test., Verif. Reliab.
- 1998

Although testing is a major part of software development, it rarely gets the attention it deserves from researchers, partly because its foundations are weak and ill-understood. The principal purpose of testing is to detect (and then remove) faults in a software system. However, very few of the existing methods allow the tester to make any precise statement… (More)

- Kirill Bogdanov, Mike Holcombe, Florentin Ipate, L. Seed, Salim K. Vanak
- Formal Asp. Comput.
- 2006

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)… (More)

- Florentin Ipate
- Formal Asp. Comput.
- 2004

One of the strengths of using stream X-machines 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 an implementation. However, the existing method assumes that the implementation of each processing function is proved to be correct before the actual… (More)

- Florentin Ipate
- J. Comput. Syst. Sci.
- 2012

a r t i c l e i n f o a b s t r a c t Available online xxxx Keywords: Learning from queries Finite automata Automata inference Deterministic finite cover automata Learning regular languages from queries was introduced by Angluin in a seminal paper that also provides the L * algorithm. This algorithm, as well as other existing inference methods, finds the… (More)

- Florentin Ipate, Mike Holcombe
- Theor. Comput. Sci.
- 2008

One of the great benefits of using a stream X-machine to specify a system is its associated testing method. Under certain design for test conditions, this method produces a test suite that can determine the correctness of the implementation under test (IUT), provided that the processing functions of the stream X-machine specification have been correctly… (More)

- Robert M. Hierons, Florentin Ipate
- Formal Asp. Comput.
- 2008

A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components. One of the great benefits of using stream X-machines for the purpose of specification is the existence of test generation techniques that produce test suites that are guaranteed to… (More)

- Florentin Ipate, Mike Holcombe
- Grammars and Automata for String Processing
- 2003