A theory for deductive synthesis of algorithms in the computing milieu

MaRDI QIDQ1900220zbMATH OpenFDO

Authors Anatoly Petrivich Beltiukov

Publication date 2 November 1995

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

zbMATH Keywords

realizational semantics

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1765659
• scientific article; zbMATH DE number 3960979
• Simulation and synthesis of deduction calculi
• Using computer algebra techniques for the specification, verification and synthesis of recursive programs
• scientific article; zbMATH DE number 4203709
• scientific article; zbMATH DE number 3845028
• Deductive and inductive synthesis of equational programs
• Deductive synthesis of sorting programs
• scientific article; zbMATH DE number 4014042

Cited in

(2)

• Formal synthesis of a unification algorithm by the deductive-tableau method
• Soundness and completeness of a synthesis algorithm based on example computations

This page was built for publication: A theory for deductive synthesis of algorithms in the computing milieu

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