Introduction into Model Checking An Approach for Parallelization

This paper deals with model checking, a branch of the software verification domain. As of model checking needing a lot of computation and time resources and in view of the big amount of available cores in today’s graphic cards our aim was to analyze possible ways for massive parallelization of model checking. This parallelization could eliminate its main drawback, namely the high time costs.
Because of the complexity of the topic and our nonexistent previous knowledge, in the first part an introduction into model checking is given. Its purpose is to provide a basic overview of what model checking is and how it works. Afterwards, we tried to identify several points for parallelization and analyzed some of them further.
In our opinion there exists a certain potential for parallelization. However, the time to finish this seminar paper was limited and further analysis of the potential would require even more familiarization with model checking and thus more time. On the one hand, the problems to solve belong to the most complex ones, i.e. in computational complexity theory you move in the field of NP-hard problems. On the other hand, if you want to parallelize as much elements of model checking as possible, such a parallelized algorithm would need to be implemented partially or even completely from scratch.