Formal derivation of finite state machines for class testing


Autoria(s): Murray, Leesa; Carrington, David; MacColl, Ian; McDonald, Jason; Strooper, Paul
Contribuinte(s)

Jonathan P. Bowen

Michael G. Hinchey

Data(s)

01/01/1998

Resumo

Previous work on generating state machines for the purpose of class testing has not been formally based. There has also been work on deriving state machines from formal specifications for testing non-object-oriented software. We build on this work by presenting a method for deriving a state machine for testing purposes from a formal specification of the class under test. We also show how the resulting state machine can be used as the basis for a test suite developed and executed using an existing framework for class testing. To derive the state machine, we identify the states and possible interactions of the operations of the class under test. The Test Template Framework is used to formally derive the states from the Object-Z specification of the class under test. The transitions of the finite state machine are calculated from the derived states and the class's operations. The formally derived finite state machine is transformed to a ClassBench testgraph, which is used as input to the ClassBench framework to test a C++ implementation of the class. The method is illustrated using a simple bounded queue example.

Identificador

http://espace.library.uq.edu.au/view/UQ:35868

Idioma(s)

eng

Publicador

Springer-Verlag

Palavras-Chave #Computer Science, Theory & Methods #Specification #Framework #Programs #08 Information and Computing Sciences
Tipo

Conference Paper