Synthesis and Optimization of Programs by Means of P-Functions
- 1 January 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (1) , 34-40
- https://doi.org/10.1109/TC.1982.1675883
Abstract
A program is defined as an indexed sequence of instructions; each of these instructions is formed by an interconnection of branching (or conditional) instructions (of the form if, then, else) followed by an interconnection of execution instructions (of the form do). A program is an efficient tool, allowing the digital system designer to describe the microprograms of discrete systems and to synthesize their control automaton. This paper deals with a method of transformation and of optimization of programs. The presented algorithm obtains, for any given program, an equivalent one with a minimum number of conditional vertices.Keywords
This publication has 6 references indexed in Scilit:
- Transformations of Graph-Schemes of AlgorithmsPublished by Springer Nature ,1994
- P-functions: A new tool for the analysis and synthesis of binary programsIEEE Transactions on Computers, 1981
- Synthesis of Minimal Binary Decision TreesIEEE Transactions on Computers, 1979
- Binary Decision DiagramsIEEE Transactions on Computers, 1978
- Some problems in the theories of automata and artificial intelligenceCybernetics and Systems Analysis, 1973
- Transformation of microprogramsCybernetics and Systems Analysis, 1971