Using partial order techniques to improve performance of data flow analysis based verification

  • Authors:

  • Gleb Naumovich;Lori A. Clarke;Jamieson M. Cobleigh

  • Affiliations:

  • Laboratory for Advanced Software Engineering Research, Computer Science Department, University of Massachusetts, Amherst, Massachusetts;Laboratory for Advanced Software Engineering Research, Computer Science Department, University of Massachusetts, Amherst, Massachusetts;Laboratory for Advanced Software Engineering Research, Computer Science Department, University of Massachusetts, Amherst, Massachusetts

  • Venue:
  • Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

Abstract

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 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%.