Progress on the State Explosion Problem in Model Checking

  • Authors:
  • Edmund M. Clarke;Orna Grumberg;Somesh Jha;Yuan Lu;Helmut Veith

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • Informatics - 10 Years Back. 10 Years Ahead.
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Model checking is an automatic verification technique for finite state concurrent systems. In this approach to verification, temporal logic specifications are checked by an exhaustive search of the state space of the concurrent system. Since the size of the state space grows exponentially with the number of processes, model checking techniques based on explicit state enumeration can only handle relatively small examples. This phenomenon is commonly called the "State Explosion Problem". Over the past ten years considerable progress has been made on this problem by (1) representing the state space symbolically using BDDs and by (2) using abstraction to reduce the size of the state space that must be searched. As a result model checking has been used successfully to find extremely subtle errors in hardware controllers and communication protocols. In spite of these successes, however, additional research is needed to handle large designs of industrial complexity. This aim of this paper is to give a succinct survey of symbolic model checking and to introduce the reader to recent advances in abstraction.