Synthesis and Optimization of Programs by Means of P-Functions

Authors:
A. Thayse
Affiliations:
Philips Research Laboratory
Venue:
IEEE Transactions on Computers
Year:
1982

Citing 4
Cited 4

Computer Arithmetic: Principles, Architecture and Design

Computer Arithmetic: Principles, Architecture and Design
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
Binary Decision Diagrams

IEEE Transactions on Computers
Synthesis of Minimal Binary Decision Trees

IEEE Transactions on Computers

Algorithmic State Machine Design and Automatic Theorem Proving: Two Dual Approaches to the Same Activity

IEEE Transactions on Computers
A General Model for Memory-Based Finite-State Machines

IEEE Transactions on Computers
A Matrix Formalism for Asynchronous Implementation of Algorithms

IEEE Transactions on Computers
Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

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.