Some Problems in Certifying Microprograms

  • Authors:
  • G. B. Leeman

  • Affiliations:
  • Department of Computer Science, IBM Thomas J. Watson Research Center

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1975

Quantified Score

Hi-index 14.99

Visualization

Abstract

A hypothetical computer is described, and procedures are indicated for showing the correctness of its microprogram. The underlying method used is that of Birman [1]. However, the computer discussed has some realistic characteristics not shared by the machine treated in [1], and the details of the microcode validation are complicated by this fact. A formal technique for partitioning the proof is presented and illustrated with examples.