Semantic synthesis of programs by matching compositions

MaRDI QIDQ1111007zbMATH OpenFDO

Authors N. S. Nikitchenko

Publication date 1987

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

matching compositionsprogram algebrasprogram constructionsemantic synthesis of programs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Review text

We identify classes of functions induced by programs with the property of requesting the presence and the values of the input data. Classes of matching compositions are defined, formalizing the main tools of program construction and simplifying the semantic synthesis of programs in the corresponding classes. The relationship between matching compositions and traditional compositions is established.

Recommendations

• scientific article; zbMATH DE number 4078789
• scientific article; zbMATH DE number 4124987
• scientific article; zbMATH DE number 4049027
• scientific article; zbMATH DE number 3934387
• Inductive syntactic synthesis of programs with FOR loops and interpreted functions

Cited in

(3)

• Program composition via unification
• Relational synthesis for pattern matching
• A Mechanically Checked Generation of Correlating Programs Directed by Structured Syntactic Differences

This page was built for publication: Semantic synthesis of programs by matching compositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111007)