State Space Reduction Using Bounded Search Method

Abstract

In a concurrent program, the number of state space is proportional to the amount of interleaving of threads. State space reduction is a very crucial issue during testing of the concurrent program. Many state space reduction techniques such as Delta Debugging, Hierarchical Delta Debugging, Partial Order Reduction are already proposed by researchers to enhance testing. However, the complexity issue is a big research challenge in state space. In this paper, we propose an algorithm that modifies dynamic partial order reduction technique for reduction of state space. In the modified version of the algorithm, it provides a facility of bounded function for searching and bounded value for reducing the searching time in place of backtracking as used in existing algorithms. We have evaluated our algorithm in Java Path Finder tool and observed that the reduction of states is better in our approach compared to an existing approach.