论文信息 - Some Problems in Certifying Microprograms

Some Problems in Certifying Microprograms

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.

George B. Leeman

[1] Herbert Hellerman,et al. Digital Computer System Principles , 1967 .

[2] Robin Milner,et al. An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

[3] Alexander Birman,et al. Some Techniques for Microprogram Validation , 1974, IFIP Congress.

[4] Samir S. Husson,et al. Microprogramming: principles and practices , 1971, SIGM.

[5] William C. Carter,et al. The controls automation system , 1965, SWCT.

[6] Ray Polivka,et al. Microprogram training - an APL application , 1972, APL '72.

[7] Alexander Birman. On Proving Correctness of Microprograms , 1974, IBM J. Res. Dev..

[8] C. William Gear. Computer Organization and Programming , 1969 .

[9] Erich J. Neuhold,et al. The Formal Description of Programming Languages , 1971, IBM Syst. J..

[10] Rod M. Burstall. An algebraic description of programs with assertions, verification and simulation , 1972 .

[11] Peter Wegner,et al. The Vienna Definition Language , 1972, CSUR.

[12] Joseph A. Goguen,et al. On Homomorphisms, Simulations, Correctness and Subroutines for Programs and Program Schemes , 1972, SWAT.