Constructing checking sequences for distributed testing

Authors:
Hasan Ural;Craig Williams
Affiliations:
School of Information Technology and Engineering, University of Ottawa, K1N 6N5, Ottawa, Ontario, Canada;School of Information Technology and Engineering, University of Ottawa, K1N 6N5, Ottawa, Ontario, Canada
Venue:
Formal Aspects of Computing
Year:
2006

Citing 0
Cited 3

Implementation Relations for the Distributed Test Architecture

TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Testing in the distributed test architecture

Formal methods and testing
Conformance relations for distributed testing based on CSP

ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The objective of testing is to determine whether an implementation under test conforms to its specification. In distributed test architectures involving multiple remote testers, this objective can be complicated by the fact that testers may encounter coordination problems relating to controllability (synchronization) and observability during the application of tests. Based on a finite state machine (FSM) specification of the externally observable behaviour of a distributed system and a distinguishing sequence, this paper proposes a method for constructing a checking sequence where there is no potential controllability or observability problems, and where the use of external coordination message exchanges among testers is minimized. The proposed method does not assume a reliable reset feature in the implementations of the given FSM to be tested by the resulting checking sequence.