Abstract
This paper attempts to formulate a mathematical theory of microprogramming, along with Glushkov's approach on formal microprogram transformations. In particular, we have attempted to construct an algebraic theory of formal microprograms.
- V. Glushkov, Automata theory and formal microprogram transformations, KIBERNETIKA, vol. 1, no.5 (1965)Google Scholar
- T. Ito, Some formal properties of a class of program schemata, IEEE Symposium on Switching and Automata Theory (1968)Google Scholar
- T. Ito, On proving the correctness of programs, Fourth Princeton Conference on Information Sciences and Systems (1970)Google Scholar
- T. Ito, Mathematical theory of programs, Journal of Information Processing Society of Japan, vol.11, no.10 (1970) (in Japanese)Google Scholar
- T. Ito, On Glushkov's regular microprograms, Fourth Hawaii International Conference on Systems Sciences (1971)Google Scholar
- T. Ito, Super-regular expressions and their applications to theory of programs, Symposium on Mathematical Theory of Languages and Automata (1971) (in Japanese)Google Scholar
- T. Ito, Mathematical theory of programs and its applications, Journal of IEE in Japan (to appear, in Japanese) (1971)Google Scholar
- R. Karp and R. Miller, Parallel Program Schemata, Journal of Computers and Systems Sciences, vol.3(1969)Google Scholar
- D. Scott, private communicationsGoogle Scholar
- D. Scott, Outline of a mathematical theory of computation, Fourth Princeton Conference on Information Sciences and Systems (1970)Google Scholar
Index Terms
(auto-classified)A theory of formal microprograms
Recommendations
Execution time (and memory) optimization in microprograms
MICRO 7: Supplement to the conference record of the 7th annual workshop on MicroprogrammingAvailability of dynamically writable control memories for microprogramming motivates researchers in the design of appropriate languages. Certain processors allow simultaneous activation of several microoperations. Exploitation of parallelism existing in ...
Procedure for testing microprograms
MICRO 7: Conference record of the 7th annual workshop on MicroprogrammingTo produce reliable, i.e. defect-free microprograms a two phase procedure is recommended. The first phase consists of expressing the desired algorithms in a precise formal way employing a suitable specification language so that the 'correctness' of the ...
Evolving machine microprograms
GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computationThe realization of a control unit can be done using a complex circuitry or microprogramming. The latter may be considered as an alternative method of implementation of machine instructions that can reduce the complexity and increase the flexibility of ...






Comments