Strategies of structural synthesis of programs

Author

Matskin, Mihhail ; Tyugu, Enn

Author_Institution

Dept. of Comput. Sci., Norwegian Univ. of Sci. & Technol., Trondheim, Norway

fYear

1997

Firstpage

305

Lastpage

306

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

Keywords

computational complexity; data structures; decidability; programming environments; search problems; structured programming; theorem proving; PSPACE complexity; compositional programming; decidable logical calculus; deductive program synthesis method; heuristics; independent subtasks; iteration synthesis; programming environments; proof search; regular data structures; search efficiency; structural program synthesis strategies; Calculus; Computer science; Data structures; Logic programming; Merging; Programming environments; Specification languages;

fLanguage

English

Publisher

ieee

Conference_Titel

Automated Software Engineering, 1997. Proceedings., 12th IEEE International Conference

Conference_Location

Incline Village, NV

Print_ISBN

0-8186-7961-1

Type

conf

DOI

10.1109/ASE.1997.632857

Filename

632857