# Intellektik: Technical report 92-05

## The IO-Graph Method: Algorithm Design and Implementation

### Gerd Neugebauer

Logically based methods for algorithm design suffer from the ignorance of
the implementational aspects of program synthesis. An approach to algorithm
implementation is presented. Algorithm implementation is the generation of
an executable program from a formal description of the algorithm. The
approach presented in this paper is called IO-graph method. The IO-graph
method integrates reasoning about modes of variables with reasoning about
properties of the target language. The IO-graph method is used to enhance
the LOPS approach to program synthesis.

Several syntheses of the integer square problem are presented.
These syntheses start from a common specification but differ in the
input-output-behavior.