Partial order optimization techniques improve feasibility of finite state verification approaches by avoiding redundant exploration of some event sequences corresponding to executions of distributed programs. Previously, such techniques have been applied in the context of model checking approaches. In this paper we propose a partial order optimization of the program model used by FLAVERS, a data flow based finite state verification approach for checking user-specified properties of distributed software. We demonstrate experimentally that this optimization often leads to significant reductions in the run time of the analysis algorithm of FLAVERS. On average, for those cases where this optimization could be applied, we observed a speedup of 21. For one of the cases, the optimization resulted in an analysis speedup of 91.
Recommendations
Using partial order techniques to improve performance of data flow analysis based verification
PASTE '99: Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineeringPartial order optimization techniques for distributed systems improve the performance of finite state verification approaches by avoiding redundant exploration of some portions of the state space. Previously, such techniques have been applied in the ...
Using partial order techniques to improve performance of data flow analysis based verification
Partial order optimization techniques for distributed systems improve the performance of finite state verification approaches by avoiding redundant exploration of some portions of the state space. Previously, such techniques have been applied in the ...
Formal Verification of an Executable LTL Model Checker with Partial Order Reduction
We present a formally verified and executable on-the-fly LTL model checker that uses ample set partial order reduction. The verification is done using the proof assistant Isabelle/HOL and covers everything from the abstract correctness proof down to the ...