Generation of tests from labeled event structures

Abstract

In this thesis, we present an algorithm for generating test cases for both control flow and data flow oriented testing from a given labeled event structure. A labeled event structure represents the behavior of a distributed system given as a system of asynchronously communicating EFSMs. Labeled event structure preserves the independency of events occurring at different EFSMs and reduces the combinatorial explosion in the number of possible event sequences (interleavings). Our system increases the input domain of the specifications of EFSMs by supporting actions of input, output, assignment, set, reset, timeout and procedure call. The set of tests for control flow oriented testing generated by our system satisfies all-nodes test selection criterion and the set of tests for data flow oriented testing generated by our system satisfies all-uses test selection criterion. All tests constructed by our system are feasible because of the absence of path predicates in the labeled event structure. Our system takes in a labeled event structure, converts the information of the labeled event structure into a set of defined internal data structures. Then, by analyzing control and data dependencies of the labeled event structure, two sets of tests (one set for control flow oriented testing and the other set for data flow oriented testing) are obtained. Finally, all the tests are output in textual MSC format. (Abstract shortened by UMI.)