Change search
ReferencesLink to record
Permanent link

Direct link
Strategies of structural synthesis of programs and its extensions
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.ORCID iD: 0000-0002-4722-0823
2001 (English)In: Computers and artificial intelligence, ISSN 0232-0274, Vol. 20, no 1, 1-25 p.Article in journal (Refereed) Published
Abstract [en]

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.
Keyword [en]
program construction, proof search startegies, structural synthesis of programs
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-21105ISI: 000172236100001OAI: diva2:339802
QC 20100525 NR 20140804Available from: 2010-08-10 Created: 2010-08-10 Last updated: 2012-02-10Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Matskin, Mihhail
By organisation
Software and Computer Systems, SCS
In the same journal
Computers and artificial intelligence
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 21 hits
ReferencesLink to record
Permanent link

Direct link