Show simple item record

dc.contributor.authorFlener, P.en_US
dc.contributor.authorLau, K. K.en_US
dc.contributor.authorOrnaghi, M.en_US
dc.date.accessioned2016-02-08T11:59:44Z
dc.date.available2016-02-08T11:59:44Z
dc.date.issued1997en_US
dc.identifier.urihttp://hdl.handle.net/11693/27695
dc.description.abstractIt can be argued that for (semi-)automated software development, program schemas are indispensable, since they capture not only structured program design principles, but also domain knowledge, both of which are of crucial importance for hierarchical program synthesis. Most researchers represent schemas purely syntactically (as higher-order expressions). This means that the knowledge captured by a schema is not formalized. We take a semantic approach and show that a schema can be formalized as an open (first-order) logical theory that contains an open logic program. By using a special kind of correctness for open programs, called steadfastness, we can define and reason about the correctness of schemas. We also show how to use correct schemas to synthesize steadfast programs.en_US
dc.language.isoEnglishen_US
dc.source.titleProceedings of the IEEE International Automated Software Engineering Conference, ASEen_US
dc.subjectComputational linguisticsen_US
dc.subjectFormal logicen_US
dc.subjectLogic programmingen_US
dc.subjectCorrect schema guided synthesisen_US
dc.subjectHierarchical program synthesisen_US
dc.subjectSteadfast programsen_US
dc.subjectComputer aided software engineeringen_US
dc.titleCorrect-schema-guided synthesis of steadfast programsen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage153en_US
dc.citation.epage160en_US
dc.publisherIEEE Comp Soc, Los Alamitos, CA, United Statesen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record