Paper Details

%T Combining Partial Order Reduction with Bounded Model Checking
%A José Vander Meulen, Charles Pecheur
%E Peter H. Welch, Herman Roebbers, Jan F. Broenink, Frederick R. M. Barnes, Carl G. Ritson, Adam T. Sampson, G. S. Stiles, Brian Vinter
%B Communicating Process Architectures 2009
%X Model checking is an efficient technique for verifying
   properties on reactive systems. Partial\-order reduction
   (POR) and symbolic model checking are two common approaches
   to deal with the state space explosion problem in model
   checking. Traditionally, symbolic model checking uses BDDs
   which can suffer from space blow\-up. More recently bounded
   model checking (BMC) using SAT\-based procedures has been
   used as a very successful alternative to BDDs. However,
   this approach gives poor results when it is applied to
   models with a lot of asynchronism. This paper presents an
   algorithm which combines partial order reduction methods and
   bounded model checking techniques in an original way that
   allows efficient verification of temporal logic properties
   (LTL_X) on models featuring asynchronous processes. The
   encoding to a SAT problem strongly reduces the complexity
   and non\-determinism of each transition step, allowing
   efficient analysis even with longer execution traces. The
   starting\-point of our work is the Two\-Phase algorithm
   (Namalesu and Gopalakrishnan) which performs partial\-order
   reduction on process\-based models. At first, we adapt this
   algorithm to the bounded model checking method. Then, we
   describe our approach formally and demonstrate its validity.
   Finally, we present a prototypal implementation and report
   encouraging experimental results on a small example.

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.