Protocol verification using reachability analysis: the state space explosion problem and relief strategies

  • Authors:

  • F. J. Lin;P. M. Chu;M. T. Liu

  • Affiliations:

  • Ohio State Univ., Columbus, OH;Ohio State Univ., Columbus, OH;Ohio State Univ., Columbus, OH

  • Venue:
  • SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

Reachability analysis has proved to be one of the most effective methods in verifying correctness of communication protocols based on the state transition model. Consequently, many protocol verification tools have been built based on the method of reachability analysis. Nevertheless, it is also well known that state space explosion is the most severe limitation to the applicability of this method. Although researchers in the field have proposed various strategies to relieve this intricate problem when building the tools, a survey and evaluation of these strategies has not been done in the literature. In searching for an appropriate approach to tackling such a problem for a grammar-based validation tool, we have collected and evaluated these relief strategies, and have decided to develop our own from yet another but more systematic approach. The results of our research are now reported in this paper. Essentially, the paper is to serve two purposes: first, to give a survey and evaluation of existing relief strategies; second, to propose a new strategy, called PROVAT (PROtocol VAlidation Testing), which is inspired by the heuristic search techniques in Artificial Intelligence. Preliminary results of incorporating the PROVAT strategy into our validation tool are reviewed in the paper. These results show the empirical evidence of the effectiveness of the PROVAT strategy.