kirancodes.me
To Proof Maintenance & Beyond!
ASE 1997

Strategies of Structural Synthesis of Programs

Mihhail Matskin, Enn Tyugu

DOI 10.1109/ase.1997.632857dblp

Abstract

Strategies of the structural synthesis of programs (SSP) of a deductive program synthesis method which is suited for compositional programming in large and is in practical use in a number of programming environments are outlined. SSP is based on a decidable logical calculus where complexity of the proof search is still PSPACE. This requires paying special attention to efficiency of search. Besides the general case of SSP, the authors present synthesis with independent subtasks, synthesis of iterations on regular data structures in terms of SSP and a number of heuristics used for speeding up the search.

BibTeX
@inproceedings{Matskin-Tyugu:ASE97,
  author    = {Mihhail Matskin and
               Enn Tyugu},
  title     = {Strategies of Structural Synthesis of Programs},
  booktitle = {ASE},
  pages     = {305--306},
  publisher = {{IEEE} Computer Society},
  year      = {1997},
}

Related papers