A hypothetical computer is described, and procedures are indicated for showing the correctness of its microprogram. The underlying method used is that of Birman . However, the computer discussed has some realistic characteristics not shared by the machine treated in , 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. Copyright © 1975 by The Institute of Electrical and Electronics Engineers, Inc.