Um algoritmo distribuído para verificação de modelos com fronteiras

Abstract

This work introduce a distributed algorithm to the bounded model checking problem. The proposed model distribute the problem between a primary solver and several secondary solvers with the objective of execute each one in a different computer. This architecture explore theinherent simmetry of the bounded model cheking problem, due to thefact that each transition in the model is similar to the other ones. Theresults obtained show that this task distribution is efficient. In the courseof the text we present examples where we achieved gains up to one orderof magnitude in time and memory utilization.