Model checking and abstraction

  • Authors:
  • Edmund M. Clarke;Orna Grumberg;David E. Long

  • Affiliations:
  • Carnegie Mellon Univ., Pittsburgh, PA;The Technion/ Haifa, Israel;AT&/T Bell Labs., Murray Hill, NJ

  • Venue:
  • ACM Transactions on Programming Languages and Systems (TOPLAS)
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe a method for using abstraction to reduce the complexity of temporal-logic model checking. Using techniques similar to those involved in abstract interpretation, we construct an abstract model of a program without ever examining the corresponding unabstracted model. We show how this abstract model can be used to verify properties of the original program. We have implemented a system based on these techniques, and we demonstrate their practicality using a number of examples, including a program representing a pipelined ALU circuit with over 101300 states.