Formal Verification of Explicitly Parallel Microprocessors

  • Authors:
  • Byron Cook;John Launchbury;John Mathews;Richard B. Kieburtz

  • Affiliations:
  • -;-;-;-

  • Venue:
  • CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

The trend in microprocessor design is to extend instruction-set architectures with features--such as parallelism annotations, predication, speculative memory access, or multimedia instructions--that allow the compiler or programmer to express more instruction-level parallelism than the microarchitecture is willing to derive. In this paper we show how these instruction-set extensions can be put to use when formally verifying the correctness of a microarchitectural model. Inspired by Intel's IA-64, we develop an explicitly parallel instruction-set architecture and a clustered microarchitectural model. We then describe how to formally verify that the model implements the instruction set. The contribution of this paper is a specification and verification method that facilitates the decomposition of microarchitectural correctness proofs using instruction-set extensions.