# Structural synthesis of programs

> Structural synthesis of programs (SSP) is a special form of (automatic) program synthesis that is based on propositional calculus. More precisely, it uses intuitionistic logic for describing the structure of a program in such a detail that the program can be automatically composed from pieces like subroutines or even computer commands. It is assumed that […]

**Structural synthesis of programs** (SSP) is a special form of (automatic) program synthesis that is based on propositional calculus. More precisely, it uses intuitionistic logic for describing the structure of a program in such a detail that the program can be automatically composed from pieces like subroutines or even computer commands. It is assumed that these pieces have been implemented correctly, hence no correctness verification of these pieces is needed. SSP is well suited for automatic composition of services for service-oriented architectures and for synthesis of large simulation programs.

## History

Automatic program synthesis began in the artificial intelligence field, with software intended for automatic problem solving. The first program synthesizer was developed by Cordell Green in 1969. At about the same time, mathematicians including R. Constable, Z. Manna, and R. Waldinger explained the possible use of formal logic for automatic program synthesis. Practically applicable program synthesizers appeared considerably later.

The idea of structural synthesis of programs was introduced at a conference on algorithms in modern

…

*Source: [Wikipedia](https://en.wikipedia.org/wiki/Structural_synthesis_of_programs)*

---

## Metadata

- **URL:** https://wpsearchai.com/structural-synthesis-of-programs/
- **Published:** 2026-01-28T18:51:55+00:00
- **Modified:** 2026-01-28T18:51:55+00:00
- **Author:** admin
- **Categories:** Software engineering