A New Parallel Approach for Reachability Analysis of Pushdown Models

Nowadays, Pushdown System is widely used in program verification including malware detection. We model the software systems into pushdown systems and use model-checking to verify them. The reachability analysis is the base of model-checking problems. It is an iterative work on transitions and configuration rules. However, with the rise of the complexity and scalability of those software systems, the size of transitions and configurations rules rises as well. This means the traditional methods are not suitable for such work. Therefore, we propose a new parallel reachability analysis method for such scene. Our methods can handle massive data sets and return the result in acceptable time.