Strategies of structural synthesis of programs and its extensions
2001 (English)In: Computers and artificial intelligence, ISSN 0232-0274, Vol. 20, no 1, 1-25 p.Article in journal (Refereed) Published
Proof search for the structural synthesis of programs (SSP) - a deductive program synthesis method which is suited for compositional programming in large and is in practical use in a number of programming environments is explained. SSP is based on a decidable logical calculus where complexity of the proof search is still PSPACE. This requires paying special attention to the efficiency of search. The practice of application of SSP has given its several modifications and extensions. Besides the general case of SSP and its strategies, we present synthesis with independent subtasks, a number of heuristics used for speeding up the search and partial deduction in the framework of SSP.
Place, publisher, year, edition, pages
2001. Vol. 20, no 1, 1-25 p.
program construction, proof search startegies, structural synthesis of programs
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-20714ISI: 000169307000001OAI: oai:DiVA.org:kth-20714DiVA: diva2:339410
QC 20100525 NR 201408042010-08-102010-08-102012-02-10Bibliographically approved