Although a great deal of research has been done in the area of formal methods and their practical use for the specification and verification of software systems, testing issues are very seldom mentioned by those within the formal methods community. Almost all the methods currently used for testing software are experience based rather than theoretically founded methods. In particular, very few methods allow us to make any statement about the type or number of faults that remain undetected after testing is completed. This paper describes a method for using the existence of a formal specification as the basis for the development of a detailed functional testing strategy. By considering testing from a theoretical point of view we demonstrate that this method can provide a more convincing approach to the problem of detecting all faults. The formal method used, X-machines, is a blend of finite state machines, data structures and processing functions and provides a simple and intuitive way for specifying compute...
[1]
Samuel Eilenberg,et al.
Automata, languages, and machines. A
,
1974,
Pure and applied mathematics.
[2]
Mike Holcombe,et al.
Using an X-Machine to Model a Video Cassette Recorder
,
1995
.
[3]
Tsun S. Chow,et al.
Testing Software Design Modeled by Finite-State Machines
,
1978,
IEEE Transactions on Software Engineering.
[4]
Gilbert Thomas Laycock,et al.
The theory and practice of specification based software testing
,
1993
.
[5]
Florentin Ipate.
Theory of X-machines with applications in specification and testing
,
1995
.
[6]
Mike Holcombe.
X-machines as a basis for dynamic system specification
,
1988,
Softw. Eng. J..
[7]
Ferhat Khendek,et al.
Test Selection Based on Finite State Models
,
1991,
IEEE Trans. Software Eng..