Soundness and completeness of a synthesis algorithm based on example computations

DOI10.1145/3149.3150MaRDI QIDQ3766813zbMATH OpenOpenAlexFDO

Authors Michael A. Bauer

Publication date 1985

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3149.3150

zbMATH Keywords

proceduresprogram synthesisprogramming by example

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 4020482
• scientific article; zbMATH DE number 408816
• A theory for deductive synthesis of algorithms in the computing milieu
• scientific article; zbMATH DE number 553883
• Soundness and completeness proofs by coinductive methods
• Compositional algorithms for LTL synthesis
• Soundness in verification of algebraic specifications with OBJ
• Using computer algebra techniques for the specification, verification and synthesis of recursive programs
• scientific article; zbMATH DE number 4203709

Cited in

(1)

• scientific article; zbMATH DE number 4020482 (Why is no real title available?)

This page was built for publication: Soundness and completeness of a synthesis algorithm based on example computations

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