Certification of microprograms by an algebraic method

Authors:
A. Blikle;S. Budkowski
Affiliations:
-;-
Venue:
MICRO 9 Proceedings of the 9th annual workshop on Microprogramming
Year:
1976

Citing 2
Cited 2

Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
The design of a system for the synthesis of correct microprograms

MICRO 8 Proceedings of the 8th annual workshop on Microprogramming

Firmware versus software verification

MICRO 11 Proceedings of the 11th annual workshop on Microprogramming
An introduction to the verification oriented microprogramming language “MIDDLE”

MICRO 11 Proceedings of the 11th annual workshop on Microprogramming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.