Monolithic verification of deep pipelines with collapsed flushing

  • Authors:
  • Roma Kane;Panagiotis Manolios;Sudarshan K. Srinivasan

  • Affiliations:
  • College of Computing, Georgia Tech, Atlanta, GA;College of Computing, Georgia Tech, Atlanta, GA;School of Electrical & Computer Engineering, Georgia Tech, Atlanta, GA

  • Venue:
  • Proceedings of the conference on Design, automation and test in Europe: Proceedings
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce collapsed flushing, a new flushing-based refinement map for automatically verifying safety and liveness properties of term-level pipelined machine models. We also present a new method for handling liveness that is both simpler to define and easier to verify than previous approaches. To empirically validate collapsed flushing, we ran extensive experiments which show more than an order-of-magnitude improvement in verification times over standard flushing. Furthermore, by combining collapsed flushing with commitment refinement maps, we can monolithically verify complex pipelined machine models with deep pipelines---a salient feature of state-of-the-art microprocessor designs---that previous approaches cannot handle.