论文信息 - Certification of microprograms by an algebraic method

Certification of microprograms by an algebraic method

This algebraic method provides a mathematical framework for proving input-output properties (such as partial and total correctness) of iterative programs. Technically it uses a calculus of binary relations extended with fixed-point equations. The method has been tested on several microprograms of a computer's arithmetical unit. One example of such a microprogram and its correctness proof is discussed in the paper.

Andrzej Blikle | Stanislaw Budkowski

[1] George B. Leeman. Some Problems in Certifying Microprograms , 1975, IEEE Transactions on Computers.

[2] Zohar Manna,et al. Introduction to mathematical theory of computation , 1972 .

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

[4] Willem P. de Roever,et al. A Calculus for Recursive Program Schemes , 1972, ICALP.

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

[6] T. Ito. A theory of formal microprograms , 1973, SIGM.

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

[8] David A. Patterson. The design of a system for the synthesis of correct microprograms , 1975, MICRO 8.

[9] Antoni W. Mazurkiewicz,et al. Proving Algorithms by Tail Functions , 1971, Inf. Control..