P-Functions: a new tool for the analysis and synthesis of binary programs

Authors:
André Thayse
Affiliations:
Philips Research Laboratory, Brussels, Belgium
Venue:
IEEE Transactions on Computers
Year:
1981

Citing 5
Cited 0

Optimization of multivalued decision algorithms

MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
ULM Implicants for Minimization of Univers Logic Module Circuits

IEEE Transactions on Computers
Binary Decision Diagrams

IEEE Transactions on Computers
Synthesis of Minimal Binary Decision Trees

IEEE Transactions on Computers
Meet and Join Derivatives and Their Use in Switching Theory

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper considers the realization of switching functions by programs composed of certain conditional transfers (binary programs). Methods exist for optimizing binary trees, i.e., binary programs without reconvergent instructions. This paper studies methods for optimizing binary simple programs (programs with possible reconvergent instructions, but where a variable may be tested only once during a computation) and binary programs. The hardware implementations of these programs involve either multiplexers or demultiplexers and OR-gates.