Interleaving coverage criteria oriented testing of multithreaded applications

Official URL: http://192.168.1.20/record=b1416997 (Table of Contents)

Concurrent programs run several to thousands of processes or threads in parallel and the correctness of the outcome is critical. Successful tests for deterministic systems can not be applied to concurrent programs, because of their non-deterministic behavior. Exhaustive testing is not applicable because of the search space and testing costs. We have designed a testing algorithm that produces Sequence Covering Arrays of a concurrent program's execution segments, and tests these interleaving sequences. We provide a coverage metric that works as a measure to de ne the ratio of covered test possibilities. Our approach relies on the sequence covering arrays to cover all interleavings, while requiring least amount of testing. This thesis presents the Interleaving Coverage Criteria-oriented testing of multithreaded programs, it's utility programs to take over the control of applications to run tests and the case studies that we have done to show the efficiency of the system against exhaustive testing and its variants.