Corpus ID: 18349018

Synthesis: Dreams → Programs

@article{Manna1979SynthesisD,
  title={Synthesis: Dreams \&\#8594; Programs},
  author={Z. Manna and R. Waldinger},
  journal={IEEE Transactions on Software Engineering},
  year={1979},
  volume={SE-5},
  pages={294-328}
}
Deductive techniques are presented for deriving programs systematically from given specifications. The specifications express the purpose of the desired program without giving any hint of the algorithm to be employed. The basic approach is to transform the specifications repeatedly according to certain rules, until a satisfactory program is produced. The rules are guided by a number of strategic controls. These techniques have been incorporated in a running program-synthesis system, called… Expand
2 Citations
Formal Semantics for the Automated Derivation of Micro-Code
TLDR
A semantics based scheme for use in machine-independent microprogram synthesis is described, which uses validity and transformation rules which are an integral part of the system in an attempt to prove the existence of a microprogram satisfying the requirements. Expand
Bayesian synthesis of probabilistic programs for automatic data modeling
TLDR
Experimental results show that the techniques presented can accurately infer qualitative structure in multiple real-world data sets and outperform standard data analysis methods in forecasting and predicting new data. Expand

References

SHOWING 1-10 OF 57 REFERENCES
Synthesis: Dreams - Programs
TLDR
Deductive techniques are presented for deriving programs systematically from given specifications and have been incorporated in a running program-synthesis system, called DEDALUS. Expand
Generating Conditional Plans and Programs
TLDR
Warplan-C is described, a general purpose system for synthesising plans and programs from precise problem descriptions that combines an adequate solution to the "side effect" problem with the case analysis necessary for generating programs containing conditionals. Expand
Goal-Directed Program Transformation
  • B. Wegbreit
  • Computer Science
  • IEEE Transactions on Software Engineering
  • 1976
TLDR
This paper shows how analysis of program performance, partial evaluation of functions, and abstraction of recursive function definitions from recurring subgoals can be combined to yield many global transformations in a methodical fashion. Expand
Toward automatic program synthesis
TLDR
An elementary outline of the theorem-proving approach to automatic program synthesis is given, without dwelling on technical details, and the relation between the version of the induction rule used and the form of the program constructed is explored. Expand
A Methodology for LISP Program Construction from Examples
TLDR
An automatic programming system, THESYS, for constructing recursive LISP programs from examples of what they do is described and equivalence between certain recurrence relations and various program schemata is proved. Expand
On automating the construction of programs.
TLDR
An experimental system for automatically generating certain simple kinds of programs is described, which has been used to generate programs for symbolic manipulation, robot control, every day planning, and computing arithmetical functions. Expand
Knowledge and Reasoning in Program Synthesis
TLDR
Some of the reasoning and programming capabilities of a projected synthesis system are described and the modification of an already existing program to solve a somewhat different problem has been found to be a powerful approach. Expand
A system which automatically improves programs
TLDR
Methods of mechanically converting programs that are easy to understand into more efficient ones, converting recursion equations using high level operations into lower level flowchart programs are given. Expand
Automatic generation of programs containing conditional statements
TLDR
An experimental system for automatically generating certain simple kinds of programs containing assignments, function calls, conditional statements, while loops, and non-recursive procedure calls is described. Expand
Program synthesis by analogy
TLDR
By extending a given analogy, a known program which solves a given problem is converted to a programWhich solves a different but analogous problem which is related by an initial specified analogy. Expand
...
1
2
3
4
5
...