This paper introduces a method to cover transitions of a concurrent system under test through a context consisting of infinite‐capacity queues. Concurrent systems have many important applications, but they are very difficult and expensive to test. One of the difficulties in testing concurrent systems is caused by the fact that queues in the test context can distort the behaviour of a concurrent system under test and can cause state explosion in test derivation. The proposed method derives transition covering tests directly from the specification of a concurrent system, not its composition with queues. As transition coverage is an important industrial metric of test quality, the results of the paper have practical applications. A case study is presented to illustrate one of the applications. Copyright © 2008 John Wiley & Sons, Ltd.

Abstract. This paper introduces a method to correctly order events in modelbased testing for concurrent systems, in particular multi-threaded programs, whose events are only partially ordered. For a sequential, centralized tester, we need to merge (local) traces of each component into a (global) trace of a system in such a way that the ordering constraints are observed. To this end, we instrument a multi-threaded program under test so that the order of lock events is visible. This additional information helps a so-called multiplexer to reconstruct a fully serial trace consistent with the partial order. We describe programs and the multiplexer as labeled transition systems and give pseudo-code of the algorithm implementing the latter. The implementation of the algorithm presented is used in an industrial context.

No abstract

No abstract